Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r088-smll-177946995200222.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is DES-PT-05b, examination is QuasiLiveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r088-smll-177946995200222
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 7.2K Mar 6 18:25 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Mar 6 18:25 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 6 18:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Mar 6 18:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 08:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 08:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 08:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 08:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K Mar 6 18:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 101K Mar 6 18:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Mar 6 18:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 48K Mar 6 18:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 73K 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

FORMULA_NAME QuasiLiveness

=== Now, execution of the tool begins

BK_START 1779494021045

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=QuasiLiveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=DES-PT-05b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
QuasiLiveness PT
Running Version 202604301425
[2026-05-22 23:53:43] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, QuasiLiveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2026-05-22 23:53:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 23:53:43] [INFO ] Load time of PNML (sax parser for PT used): 135 ms
[2026-05-22 23:53:43] [INFO ] Transformed 300 places.
[2026-05-22 23:53:43] [INFO ] Transformed 251 transitions.
[2026-05-22 23:53:43] [INFO ] Found NUPN structural information;
[2026-05-22 23:53:43] [INFO ] Parsed PT model containing 300 places and 251 transitions and 747 arcs in 297 ms.
Starting structural reductions in LIVENESS mode, iteration 0 : 300/300 places, 251/251 transitions.
Reduce places removed 3 places and 0 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 26 rules applied. Total rules applied 26 place count 297 transition count 228
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 49 place count 274 transition count 228
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 49 place count 274 transition count 219
Deduced a syphon composed of 9 places in 2 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 67 place count 265 transition count 219
Performed 91 Post agglomeration using F-continuation condition.Transition count delta: 91
Deduced a syphon composed of 91 places in 0 ms
Reduce places removed 91 places and 0 transitions.
Iterating global reduction 2 with 182 rules applied. Total rules applied 249 place count 174 transition count 128
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 257 place count 170 transition count 144
Applied a total of 257 rules in 106 ms. Remains 170 /300 variables (removed 130) and now considering 144/251 (removed 107) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7887406901016641179.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6575012236057889426.kers'
[2026-05-22 23:53:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7887406901016641179.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6575012236057889426.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 144 rows 169 cols 721 entries
Finished phase 1 with 38 SingleSign rule and 70 generalized
[2026-05-22 23:53:43] [INFO ] Computed 62 invariants in 1 ms
Computed 62 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6575012236057889426.kers
Total runtime 3 ms.
[2026-05-22 23:53:44] [INFO ] Implicit Places using invariants in 863 ms returned [55]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 920 ms to find 1 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 169/300 places, 144/251 transitions.
Applied a total of 0 rules in 19 ms. Remains 169 /169 variables (removed 0) and now considering 144/144 (removed 0) transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 1082 ms. Remains : 169/300 places, 144/251 transitions.
Discarding 45 transitions out of 144. Remains 99
Initial state reduction rules removed 1 formulas.
[2026-05-22 23:53:45] [INFO ] Flatten gal took : 235 ms
RANDOM walk for 40000 steps (1366 resets) in 2929 ms. (13 steps per ms) remains 9/98 properties
[2026-05-22 23:53:45] [INFO ] Flatten gal took : 82 ms
BEST_FIRST walk for 40004 steps (186 resets) in 342 ms. (116 steps per ms) remains 9/9 properties
[2026-05-22 23:53:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13767178891023400044.gal : 31 ms
BEST_FIRST walk for 40004 steps (224 resets) in 356 ms. (112 steps per ms) remains 9/9 properties
[2026-05-22 23:53:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality18289803389293767031.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality13767178891023400044.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality18289803389293767031.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...330
Loading property file /tmp/ReachabilityCardinality18289803389293767031.prop.
BEST_FIRST walk for 40003 steps (179 resets) in 324 ms. (123 steps per ms) remains 9/9 properties
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 11
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :11 after 75
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :75 after 315
BEST_FIRST walk for 40003 steps (178 resets) in 239 ms. (166 steps per ms) remains 9/9 properties
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :315 after 11709
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :11709 after 13287
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :13287 after 76215
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :76215 after 621385
BEST_FIRST walk for 40004 steps (187 resets) in 220 ms. (181 steps per ms) remains 9/9 properties
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :621385 after 809367
BEST_FIRST walk for 40004 steps (182 resets) in 328 ms. (121 steps per ms) remains 9/9 properties
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :809367 after 1.94064e+07
BEST_FIRST walk for 40004 steps (171 resets) in 327 ms. (121 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (176 resets) in 199 ms. (200 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (184 resets) in 150 ms. (264 steps per ms) remains 9/9 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16372256005048347887.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4750533282760440486.kers'
[2026-05-22 23:53:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16372256005048347887.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4750533282760440486.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 144 rows 169 cols 721 entries
Finished phase 1 with 38 SingleSign rule and 70 generalized
[2026-05-22 23:53:46] [INFO ] Computed 61 invariants in 2 ms
Computed 61 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4750533282760440486.kers
Total runtime 3 ms.
[2026-05-22 23:53:46] [INFO ] State equation strengthened by 6 read => feed constraints.
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :1.94064e+07 after 5.77519e+07
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 20/37 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/37 variables, 20/43 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 65/102 variables, 26/69 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/102 variables, 65/134 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Reachability property qltransition_23 is true.
Reachability property qltransition_14 is true.
SDD proceeding with computation,7 properties remain. new max is 2048
SDD size :5.77519e+07 after 6.15979e+08
At refinement iteration 7 (INCLUDED_ONLY) 0/102 variables, 0/134 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 57/159 variables, 27/161 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 57/218 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 0/218 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 4/163 variables, 2/220 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/163 variables, 4/224 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/163 variables, 0/224 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 144/307 variables, 163/387 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/307 variables, 6/393 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/307 variables, 1/394 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/307 variables, 0/394 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 6/313 variables, 6/400 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/313 variables, 6/406 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/313 variables, 0/406 constraints. Problems are: Problem set: 2 solved, 7 unsolved
SDD proceeding with computation,7 properties remain. new max is 4096
SDD size :7.42683e+08 after 7.07444e+10
At refinement iteration 21 (OVERLAPS) 0/313 variables, 0/406 constraints. Problems are: Problem set: 2 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 313/313 variables, and 406 constraints, problems are : Problem set: 2 solved, 7 unsolved in 1930 ms.
Refiners :[Domain max(s): 169/169 constraints, Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 169/169 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 13/13 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 0/13 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 7/20 variables, 4/17 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 7/24 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/24 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 80/100 variables, 28/52 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/100 variables, 80/132 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/100 variables, 0/132 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 59/159 variables, 27/159 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 59/218 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 1/219 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/159 variables, 0/219 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 4/163 variables, 2/221 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/163 variables, 4/225 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/163 variables, 0/225 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 144/307 variables, 163/388 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/307 variables, 6/394 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/307 variables, 5/399 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/307 variables, 0/399 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 6/313 variables, 6/405 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/313 variables, 6/411 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/313 variables, 2/413 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/313 variables, 1/414 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/313 variables, 1/415 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 313/313 variables, and 415 constraints, problems are : Problem set: 2 solved, 7 unsolved in 5018 ms.
Refiners :[Domain max(s): 169/169 constraints, Positive P Invariants (semi-flows): 32/32 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 169/169 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 7/9 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 7009ms problems are : Problem set: 2 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 13 out of 169 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 169/169 places, 144/144 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 169 transition count 143
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 18 place count 152 transition count 106
Iterating global reduction 1 with 17 rules applied. Total rules applied 35 place count 152 transition count 106
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 45 place count 152 transition count 96
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 45 place count 152 transition count 93
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 51 place count 149 transition count 93
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 55 place count 145 transition count 89
Iterating global reduction 2 with 4 rules applied. Total rules applied 59 place count 145 transition count 89
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 63 place count 145 transition count 85
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 67 place count 143 transition count 87
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 68 place count 143 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 69 place count 142 transition count 86
Applied a total of 69 rules in 155 ms. Remains 142 /169 variables (removed 27) and now considering 86/144 (removed 58) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 142/169 places, 86/144 transitions.
SDD proceeding with computation,7 properties remain. new max is 8192
SDD size :5.18773e+11 after 5.3515e+11
RANDOM walk for 4000000 steps (200540 resets) in 18453 ms. (216 steps per ms) remains 5/7 properties
Reachability property qltransition_98 is true.
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :5.3515e+11 after 5.7428e+11
BEST_FIRST walk for 4000002 steps (39391 resets) in 7012 ms. (570 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000003 steps (39252 resets) in 7096 ms. (563 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000002 steps (39214 resets) in 6612 ms. (604 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000003 steps (39299 resets) in 6593 ms. (606 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000003 steps (39322 resets) in 6393 ms. (625 steps per ms) remains 5/5 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7383087586796192027.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7061890390718323071.kers'
[2026-05-22 23:54:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7383087586796192027.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7061890390718323071.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 86 rows 142 cols 462 entries
Finished phase 1 with 15 SingleSign rule and 65 generalized
[2026-05-22 23:54:08] [INFO ] Computed 62 invariants in 0 ms
Computed 62 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7061890390718323071.kers
Total runtime 1 ms.
[2026-05-22 23:54:08] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 7/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 65/83 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 55/138 variables, 28/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 86/224 variables, 138/200 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 6/206 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 2/208 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 4/228 variables, 4/212 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/228 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/228 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 212 constraints, problems are : Problem set: 0 solved, 5 unsolved in 667 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 142/142 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 7/18 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 65/83 variables, 30/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/83 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 55/138 variables, 28/62 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 86/224 variables, 138/202 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 6/208 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 4/212 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 4/228 variables, 4/216 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/228 variables, 1/217 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/228 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/228 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 217 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1105 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 142/142 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1790ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 2359 ms.
Support contains 11 out of 142 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 86/86 transitions.
Applied a total of 0 rules in 12 ms. Remains 142 /142 variables (removed 0) and now considering 86/86 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 142/142 places, 86/86 transitions.
RANDOM walk for 4000000 steps (199670 resets) in 16816 ms. (237 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000003 steps (39365 resets) in 6599 ms. (606 steps per ms) remains 5/5 properties
SDD proceeding with computation,6 properties remain. new max is 16384
SDD size :8.39632e+11 after 1.69249e+12
BEST_FIRST walk for 4000003 steps (39480 resets) in 8283 ms. (482 steps per ms) remains 5/5 properties
BEST_FIRST walk for 4000003 steps (39285 resets) in 7579 ms. (527 steps per ms) remains 4/5 properties
BEST_FIRST walk for 4000002 steps (39140 resets) in 6231 ms. (641 steps per ms) remains 4/4 properties
[2026-05-22 23:54:25] [INFO ] Invariant cache hit.
[2026-05-22 23:54:25] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 70/82 variables, 32/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 56/138 variables, 28/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 86/224 variables, 138/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/224 variables, 6/206 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 1/208 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/208 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 4/228 variables, 4/212 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/228 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/228 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 228/228 variables, and 212 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1034 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 142/142 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 3/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 70/82 variables, 32/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 56/138 variables, 28/62 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/138 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/138 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 86/224 variables, 138/202 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/224 variables, 6/208 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/224 variables, 4/212 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/224 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 4/228 variables, 4/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/228 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/228 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 228/228 variables, and 216 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1060 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 142/142 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2126ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 592 ms.
Support contains 9 out of 142 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 142/142 places, 86/86 transitions.
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 141 transition count 85
Applied a total of 1 rules in 17 ms. Remains 141 /142 variables (removed 1) and now considering 85/86 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 141/142 places, 85/86 transitions.
RANDOM walk for 4000000 steps (210496 resets) in 15115 ms. (264 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000003 steps (39473 resets) in 7236 ms. (552 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000003 steps (39675 resets) in 5722 ms. (698 steps per ms) remains 4/4 properties
BEST_FIRST walk for 4000004 steps (39375 resets) in 6514 ms. (613 steps per ms) remains 4/4 properties
Reachability property qltransition_97 is true.
Reachability property qltransition_75 is true.
BEST_FIRST walk for 4000003 steps (39523 resets) in 6153 ms. (649 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 76252 steps, run visited all 4 properties in 446 ms. (steps per millisecond=170 )
Probabilistic random walk after 76252 steps, saw 20104 distinct states, run finished after 455 ms. (steps per millisecond=167 ) properties seen :4
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
Able to resolve query QuasiLiveness after proving 99 properties.
FORMULA QuasiLiveness TRUE TECHNIQUES RANDOM_WALK PROBABILISTIC_WALK DECISION_DIAGRAMS COLLATERAL_PROCESSING BESTFIRST_WALK TOPOLOGICAL INITIAL_STATE
Total runtime 56959 ms.

BK_STOP 1779494080242

--------------------
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
+ [[ QuasiLiveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ 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 QuasiLiveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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="DES-PT-05b"
export BK_EXAMINATION="QuasiLiveness"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 DES-PT-05b, examination is QuasiLiveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r088-smll-177946995200222"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-05b.tgz
mv DES-PT-05b execution
cd execution
if [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "UpperBounds" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] || [ "QuasiLiveness" = "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 [ "QuasiLiveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "QuasiLiveness" != "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 "QuasiLiveness.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 '' QuasiLiveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "QuasiLiveness" = "ReachabilityDeadlock" ] || [ "QuasiLiveness" = "QuasiLiveness" ] || [ "QuasiLiveness" = "StableMarking" ] || [ "QuasiLiveness" = "Liveness" ] || [ "QuasiLiveness" = "OneSafe" ] ; then
echo "FORMULA_NAME QuasiLiveness"
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 ;