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-177969019900125.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 UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r178-oct2-177969019900125
=====================================================================

--------------------
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 positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME MedleyA-PT-04-UpperBounds-00
FORMULA_NAME MedleyA-PT-04-UpperBounds-01
FORMULA_NAME MedleyA-PT-04-UpperBounds-02
FORMULA_NAME MedleyA-PT-04-UpperBounds-03
FORMULA_NAME MedleyA-PT-04-UpperBounds-04
FORMULA_NAME MedleyA-PT-04-UpperBounds-05
FORMULA_NAME MedleyA-PT-04-UpperBounds-06
FORMULA_NAME MedleyA-PT-04-UpperBounds-07
FORMULA_NAME MedleyA-PT-04-UpperBounds-08
FORMULA_NAME MedleyA-PT-04-UpperBounds-09
FORMULA_NAME MedleyA-PT-04-UpperBounds-10
FORMULA_NAME MedleyA-PT-04-UpperBounds-11
FORMULA_NAME MedleyA-PT-04-UpperBounds-12
FORMULA_NAME MedleyA-PT-04-UpperBounds-13
FORMULA_NAME MedleyA-PT-04-UpperBounds-14
FORMULA_NAME MedleyA-PT-04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1779699100001

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
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
UpperBounds PT
Running Version 202604301425
[2026-05-25 08:51:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 08:51:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 08:51:41] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2026-05-25 08:51:41] [INFO ] Transformed 115 places.
[2026-05-25 08:51:41] [INFO ] Transformed 107 transitions.
[2026-05-25 08:51:41] [INFO ] Found NUPN structural information;
[2026-05-25 08:51:41] [INFO ] Parsed PT model containing 115 places and 107 transitions and 300 arcs in 179 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4854660677790728337.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-648217998120993420.kers'
[2026-05-25 08:51:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4854660677790728337.kers, --Pflows, --basisKERS=/tmp/petrispot-output-648217998120993420.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 107 rows 115 cols 300 entries
Finished phase 1 with 106 SingleSign rule and 0 generalized
[2026-05-25 08:51:41] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-648217998120993420.kers
Total runtime 3 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (288 resets) in 23 ms. (416 steps per ms)
FORMULA MedleyA-PT-04-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-04-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-04-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-04-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-04-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-04-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-04-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-04-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-04-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-04-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 50004 steps (377 resets) in 73 ms. (675 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
[2026-05-25 08:51:41] [INFO ] Invariant cache hit.
[2026-05-25 08:51:41] [INFO ] [Real]Absence check using 9 positive place invariants in 32 ms returned sat
[2026-05-25 08:51:42] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2026-05-25 08:51:42] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 08:51:42] [INFO ] [Nat]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 08:51:42] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2026-05-25 08:51:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2026-05-25 08:51:42] [INFO ] Computed and/alt/rep : 104/183/104 causal constraints (skipped 2 transitions) in 18 ms.
[2026-05-25 08:51:42] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 117 ms
[2026-05-25 08:51:42] [INFO ] Added : 84 causal constraints over 18 iterations in 333 ms. Result :sat
Minimization took 38 ms.
[2026-05-25 08:51:42] [INFO ] [Real]Absence check using 9 positive place invariants in 27 ms returned sat
[2026-05-25 08:51:42] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2026-05-25 08:51:42] [INFO ] Computed and/alt/rep : 104/183/104 causal constraints (skipped 2 transitions) in 6 ms.
[2026-05-25 08:51:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 08:51:43] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2026-05-25 08:51:43] [INFO ] [Nat]Absence check using state equation in 35 ms returned sat
[2026-05-25 08:51:43] [INFO ] Computed and/alt/rep : 104/183/104 causal constraints (skipped 2 transitions) in 6 ms.
[2026-05-25 08:51:43] [INFO ] Added : 94 causal constraints over 19 iterations in 185 ms. Result :sat
Minimization took 52 ms.
[2026-05-25 08:51:43] [INFO ] [Real]Absence check using 9 positive place invariants in 4 ms returned sat
[2026-05-25 08:51:43] [INFO ] [Real]Absence check using state equation in 37 ms returned sat
[2026-05-25 08:51:43] [INFO ] Computed and/alt/rep : 104/183/104 causal constraints (skipped 2 transitions) in 19 ms.
[2026-05-25 08:51:43] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 08:51:43] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2026-05-25 08:51:43] [INFO ] [Nat]Absence check using state equation in 30 ms returned sat
[2026-05-25 08:51:43] [INFO ] Computed and/alt/rep : 104/183/104 causal constraints (skipped 2 transitions) in 4 ms.
[2026-05-25 08:51:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 129 ms
[2026-05-25 08:51:44] [INFO ] Added : 96 causal constraints over 20 iterations in 304 ms. Result :sat
Minimization took 46 ms.
[2026-05-25 08:51:44] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2026-05-25 08:51:44] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2026-05-25 08:51:44] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 08:51:44] [INFO ] [Nat]Absence check using 9 positive place invariants in 19 ms returned sat
[2026-05-25 08:51:44] [INFO ] [Nat]Absence check using state equation in 38 ms returned sat
[2026-05-25 08:51:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 123 ms
[2026-05-25 08:51:44] [INFO ] Computed and/alt/rep : 104/183/104 causal constraints (skipped 2 transitions) in 7 ms.
[2026-05-25 08:51:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 132 ms
[2026-05-25 08:51:44] [INFO ] Added : 81 causal constraints over 18 iterations in 279 ms. Result :sat
Minimization took 34 ms.
[2026-05-25 08:51:44] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2026-05-25 08:51:44] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2026-05-25 08:51:44] [INFO ] Computed and/alt/rep : 104/183/104 causal constraints (skipped 2 transitions) in 10 ms.
[2026-05-25 08:51:45] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 08:51:45] [INFO ] [Nat]Absence check using 9 positive place invariants in 5 ms returned sat
[2026-05-25 08:51:45] [INFO ] [Nat]Absence check using state equation in 45 ms returned sat
[2026-05-25 08:51:45] [INFO ] Computed and/alt/rep : 104/183/104 causal constraints (skipped 2 transitions) in 11 ms.
[2026-05-25 08:51:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 265 ms
[2026-05-25 08:51:46] [INFO ] Added : 104 causal constraints over 22 iterations in 670 ms. Result :sat
Minimization took 54 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
Support contains 5 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 107/107 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 115 transition count 83
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 91 transition count 83
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 48 place count 91 transition count 77
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 60 place count 85 transition count 77
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 67 place count 78 transition count 70
Iterating global reduction 2 with 7 rules applied. Total rules applied 74 place count 78 transition count 70
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 74 place count 78 transition count 69
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 77 transition count 69
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 114 place count 58 transition count 50
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 115 place count 58 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 116 place count 57 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 117 place count 56 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 118 place count 55 transition count 48
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 119 place count 55 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 120 place count 54 transition count 47
Applied a total of 120 rules in 50 ms. Remains 54 /115 variables (removed 61) and now considering 47/107 (removed 60) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 54/115 places, 47/107 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17529291313456587932.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4609493744606964479.kers'
[2026-05-25 08:51:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17529291313456587932.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4609493744606964479.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 47 rows 53 cols 178 entries
Finished phase 1 with 46 SingleSign rule and 0 generalized
[2026-05-25 08:51:46] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-4609493744606964479.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (109043 resets) in 701 ms. (1424 steps per ms)
FORMULA MedleyA-PT-04-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4000004 steps (208072 resets) in 1591 ms. (2512 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2026-05-25 08:51:48] [INFO ] Invariant cache hit.
[2026-05-25 08:51:48] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2026-05-25 08:51:48] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2026-05-25 08:51:48] [INFO ] Computed and/alt/rep : 44/61/44 causal constraints (skipped 2 transitions) in 3 ms.
[2026-05-25 08:51:48] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 08:51:48] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-25 08:51:48] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2026-05-25 08:51:48] [INFO ] Computed and/alt/rep : 44/61/44 causal constraints (skipped 2 transitions) in 3 ms.
[2026-05-25 08:51:49] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2026-05-25 08:51:49] [INFO ] Added : 22 causal constraints over 6 iterations in 77 ms. Result :sat
Minimization took 14 ms.
[2026-05-25 08:51:49] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-25 08:51:49] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2026-05-25 08:51:49] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 08:51:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2026-05-25 08:51:49] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2026-05-25 08:51:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 61 ms
[2026-05-25 08:51:49] [INFO ] Computed and/alt/rep : 44/61/44 causal constraints (skipped 2 transitions) in 10 ms.
[2026-05-25 08:51:49] [INFO ] Added : 34 causal constraints over 7 iterations in 41 ms. Result :sat
Minimization took 26 ms.
[2026-05-25 08:51:49] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-25 08:51:49] [INFO ] [Real]Absence check using state equation in 28 ms returned sat
[2026-05-25 08:51:49] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 08:51:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-25 08:51:49] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2026-05-25 08:51:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 54 ms
[2026-05-25 08:51:49] [INFO ] Computed and/alt/rep : 44/61/44 causal constraints (skipped 2 transitions) in 3 ms.
[2026-05-25 08:51:49] [INFO ] Added : 36 causal constraints over 8 iterations in 51 ms. Result :sat
Minimization took 15 ms.
[2026-05-25 08:51:49] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2026-05-25 08:51:49] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2026-05-25 08:51:49] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 08:51:49] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-25 08:51:49] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2026-05-25 08:51:49] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 57 ms
[2026-05-25 08:51:49] [INFO ] Computed and/alt/rep : 44/61/44 causal constraints (skipped 2 transitions) in 5 ms.
[2026-05-25 08:51:49] [INFO ] Added : 44 causal constraints over 9 iterations in 107 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 47/47 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 53 transition count 46
Applied a total of 2 rules in 4 ms. Remains 53 /54 variables (removed 1) and now considering 46/47 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 53/54 places, 46/47 transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9655763760535472409.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-525996069702611749.kers'
[2026-05-25 08:51:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9655763760535472409.kers, --Pflows, --basisKERS=/tmp/petrispot-output-525996069702611749.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 46 rows 52 cols 176 entries
Finished phase 1 with 45 SingleSign rule and 0 generalized
[2026-05-25 08:51:50] [INFO ] Computed 8 invariants in 0 ms
Computed 8 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-525996069702611749.kers
Total runtime 0 ms.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
RANDOM walk for 1000000 steps (109258 resets) in 600 ms. (1663 steps per ms)
BEST_FIRST walk for 4000001 steps (207728 resets) in 1434 ms. (2787 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
[2026-05-25 08:51:52] [INFO ] Invariant cache hit.
[2026-05-25 08:51:52] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2026-05-25 08:51:52] [INFO ] [Real]Absence check using state equation in 25 ms returned sat
[2026-05-25 08:51:52] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 08:51:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-25 08:51:52] [INFO ] [Nat]Absence check using state equation in 26 ms returned sat
[2026-05-25 08:51:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2026-05-25 08:51:52] [INFO ] Computed and/alt/rep : 43/60/43 causal constraints (skipped 2 transitions) in 6 ms.
[2026-05-25 08:51:52] [INFO ] Added : 43 causal constraints over 9 iterations in 53 ms. Result :sat
Minimization took 15 ms.
[2026-05-25 08:51:52] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-25 08:51:52] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2026-05-25 08:51:52] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 08:51:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2026-05-25 08:51:52] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2026-05-25 08:51:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 78 ms
[2026-05-25 08:51:52] [INFO ] Computed and/alt/rep : 43/60/43 causal constraints (skipped 2 transitions) in 4 ms.
[2026-05-25 08:51:52] [INFO ] Added : 33 causal constraints over 7 iterations in 30 ms. Result :sat
Minimization took 12 ms.
[2026-05-25 08:51:52] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-25 08:51:52] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2026-05-25 08:51:52] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 08:51:52] [INFO ] [Nat]Absence check using 8 positive place invariants in 1 ms returned sat
[2026-05-25 08:51:52] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2026-05-25 08:51:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 80 ms
[2026-05-25 08:51:52] [INFO ] Computed and/alt/rep : 43/60/43 causal constraints (skipped 2 transitions) in 2 ms.
[2026-05-25 08:51:52] [INFO ] Added : 35 causal constraints over 7 iterations in 26 ms. Result :sat
Minimization took 12 ms.
[2026-05-25 08:51:52] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-25 08:51:53] [INFO ] [Real]Absence check using state equation in 35 ms returned sat
[2026-05-25 08:51:53] [INFO ] Solution in real domain found non-integer solution.
[2026-05-25 08:51:53] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2026-05-25 08:51:53] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2026-05-25 08:51:53] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 67 ms
[2026-05-25 08:51:53] [INFO ] Computed and/alt/rep : 43/60/43 causal constraints (skipped 2 transitions) in 2 ms.
[2026-05-25 08:51:53] [INFO ] Added : 43 causal constraints over 9 iterations in 52 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0] Max Struct:[1, 1, 1, 1]
Support contains 4 out of 53 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 46/46 transitions.
Applied a total of 0 rules in 3 ms. Remains 53 /53 variables (removed 0) and now considering 46/46 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 53/53 places, 46/46 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 53/53 places, 46/46 transitions.
Applied a total of 0 rules in 2 ms. Remains 53 /53 variables (removed 0) and now considering 46/46 (removed 0) transitions.
[2026-05-25 08:51:53] [INFO ] Invariant cache hit.
[2026-05-25 08:51:53] [INFO ] Implicit Places using invariants in 97 ms returned []
[2026-05-25 08:51:53] [INFO ] Invariant cache hit.
[2026-05-25 08:51:53] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2026-05-25 08:51:53] [INFO ] Redundant transitions in 1 ms returned []
Running 45 sub problems to find dead transitions.
[2026-05-25 08:51:53] [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) 2/53 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 46/99 variables, 53/67 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 0/99 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 67 constraints, problems are : Problem set: 0 solved, 45 unsolved in 2089 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 53/53 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) 2/53 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (OVERLAPS) 46/99 variables, 53/67 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/99 variables, 45/112 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (OVERLAPS) 0/99 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/99 variables, and 113 constraints, problems are : Problem set: 0 solved, 45 unsolved in 4583 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 53/53 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6716ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 6724ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6932 ms. Remains : 53/53 places, 46/46 transitions.
RANDOM walk for 40000 steps (4359 resets) in 774 ms. (51 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (2071 resets) in 201 ms. (198 steps per ms) remains 8/8 properties
[2026-05-25 08:52:00] [INFO ] Flatten gal took : 48 ms
[2026-05-25 08:52:00] [INFO ] Flatten gal took : 9 ms
BEST_FIRST walk for 40000 steps (2060 resets) in 198 ms. (201 steps per ms) remains 8/8 properties
[2026-05-25 08:52:00] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8980571447588931591.gal : 6 ms
[2026-05-25 08:52:00] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1029222053462657412.prop : 0 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/ReachabilityCardinality8980571447588931591.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1029222053462657412.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 ...328
Loading property file /tmp/ReachabilityCardinality1029222053462657412.prop.
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :7 after 15
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :15 after 102
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :164 after 419
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :601 after 1984
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
SDD proceeding with computation,6 properties remain. new max is 64
SDD size :1984 after 5265
Invariant property MIN2 does not hold.
Reachability property MAX2 is true.
BEST_FIRST walk for 40001 steps (2102 resets) in 166 ms. (239 steps per ms) remains 8/8 properties
Invariant property MIN1 does not hold.
Reachability property MAX1 is true.
SDD proceeding with computation,2 properties remain. new max is 64
SDD size :5265 after 31266
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,38070,0.033859,4664,2,563,17,3114,8,0,260,1962,0
Total reachable state count : 38070

Verifying 8 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,1,0.034447,4760,2,54,17,3114,9,0,263,1962,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.034769,4928,2,54,17,3114,10,0,264,1962,0
Reachability property MAX1 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX1,729,0.034944,4928,2,88,17,3114,11,0,266,1962,0
Invariant property MIN1 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN1,729,0.035106,4928,2,88,17,3114,12,0,267,1962,0
Reachability property MAX2 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX2,729,0.035281,4928,2,88,17,3114,13,0,269,1962,0
Invariant property MIN2 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN2,729,0.035403,4928,2,88,17,3114,14,0,270,1962,0
Reachability property MAX3 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX3,729,0.035531,4928,2,88,17,3114,14,0,271,1962,0
Invariant property MIN3 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN3,729,0.035643,4928,2,88,17,3114,14,0,271,1962,0
BEST_FIRST walk for 40002 steps (2108 resets) in 142 ms. (279 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (2077 resets) in 162 ms. (245 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (2051 resets) in 123 ms. (322 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (2089 resets) in 118 ms. (336 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (2092 resets) in 123 ms. (322 steps per ms) remains 8/8 properties
Finished probabilistic random walk after 2242 steps, run visited all 8 properties in 28 ms. (steps per millisecond=80 )
Probabilistic random walk after 2242 steps, saw 1089 distinct states, run finished after 31 ms. (steps per millisecond=72 ) properties seen :8
FORMULA MedleyA-PT-04-UpperBounds-00 1 TECHNIQUES REACHABILITY_MAX
FORMULA MedleyA-PT-04-UpperBounds-04 1 TECHNIQUES REACHABILITY_MAX
FORMULA MedleyA-PT-04-UpperBounds-11 1 TECHNIQUES REACHABILITY_MAX
FORMULA MedleyA-PT-04-UpperBounds-14 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (after reachability check) : Max Seen:[] Max Struct:[]
[2026-05-25 08:52:01] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[] Max Struct:[]
RANDOM walk for 1000000 steps (108996 resets) in 595 ms. (1677 steps per ms)
BEST_FIRST walk for 0 steps (0 resets) in 0 ms. (0 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 20288 ms.

BK_STOP 1779699121692

--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 UpperBounds -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="UpperBounds"
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 UpperBounds"
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-177969019900125"
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 [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;