Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r139-smll-174876533100016.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool gold2024
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 r139-smll-174876533100016
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 28K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of 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 1748895629141

Invoking MCC driver with
BK_TOOL=gold2024
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 202405141337
[2025-06-02 20:20:31] [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]
[2025-06-02 20:20:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 20:20:31] [INFO ] Load time of PNML (sax parser for PT used): 82 ms
[2025-06-02 20:20:31] [INFO ] Transformed 115 places.
[2025-06-02 20:20:31] [INFO ] Transformed 107 transitions.
[2025-06-02 20:20:31] [INFO ] Found NUPN structural information;
[2025-06-02 20:20:31] [INFO ] Parsed PT model containing 115 places and 107 transitions and 300 arcs in 243 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 11 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]
// Phase 1: matrix 107 rows 115 cols
[2025-06-02 20:20:31] [INFO ] Computed 9 invariants in 23 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 (285 resets) in 51 ms. (192 steps per ms)
FORMULA MedleyA-PT-04-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-04-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-04-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-04-UpperBounds-11 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-04 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
FORMULA MedleyA-PT-04-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 20002 steps (144 resets) in 42 ms. (465 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-06-02 20:20:31] [INFO ] Invariant cache hit.
[2025-06-02 20:20:32] [INFO ] [Real]Absence check using 9 positive place invariants in 12 ms returned sat
[2025-06-02 20:20:32] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2025-06-02 20:20:32] [INFO ] Deduced a trap composed of 20 places in 194 ms of which 24 ms to minimize.
[2025-06-02 20:20:32] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:20:32] [INFO ] [Nat]Absence check using 9 positive place invariants in 10 ms returned sat
[2025-06-02 20:20:32] [INFO ] [Nat]Absence check using state equation in 103 ms returned sat
[2025-06-02 20:20:32] [INFO ] Deduced a trap composed of 20 places in 125 ms of which 4 ms to minimize.
[2025-06-02 20:20:33] [INFO ] Deduced a trap composed of 17 places in 133 ms of which 3 ms to minimize.
[2025-06-02 20:20:33] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 2 ms to minimize.
[2025-06-02 20:20:33] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 401 ms
[2025-06-02 20:20:33] [INFO ] Computed and/alt/rep : 104/183/104 causal constraints (skipped 2 transitions) in 28 ms.
[2025-06-02 20:20:33] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
[2025-06-02 20:20:33] [INFO ] Deduced a trap composed of 24 places in 42 ms of which 1 ms to minimize.
[2025-06-02 20:20:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 136 ms
[2025-06-02 20:20:33] [INFO ] Added : 99 causal constraints over 20 iterations in 537 ms. Result :sat
Minimization took 54 ms.
[2025-06-02 20:20:33] [INFO ] [Real]Absence check using 9 positive place invariants in 6 ms returned sat
[2025-06-02 20:20:33] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2025-06-02 20:20:33] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 2 ms to minimize.
[2025-06-02 20:20:34] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:20:34] [INFO ] [Nat]Absence check using 9 positive place invariants in 10 ms returned sat
[2025-06-02 20:20:34] [INFO ] [Nat]Absence check using state equation in 89 ms returned sat
[2025-06-02 20:20:34] [INFO ] Deduced a trap composed of 20 places in 91 ms of which 2 ms to minimize.
[2025-06-02 20:20:34] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2025-06-02 20:20:34] [INFO ] Deduced a trap composed of 11 places in 42 ms of which 1 ms to minimize.
[2025-06-02 20:20:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 244 ms
[2025-06-02 20:20:34] [INFO ] Computed and/alt/rep : 104/183/104 causal constraints (skipped 2 transitions) in 17 ms.
[2025-06-02 20:20:34] [INFO ] Deduced a trap composed of 28 places in 86 ms of which 2 ms to minimize.
[2025-06-02 20:20:34] [INFO ] Deduced a trap composed of 31 places in 74 ms of which 2 ms to minimize.
[2025-06-02 20:20:35] [INFO ] Deduced a trap composed of 21 places in 102 ms of which 3 ms to minimize.
[2025-06-02 20:20:35] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 3 ms to minimize.
[2025-06-02 20:20:35] [INFO ] Deduced a trap composed of 34 places in 112 ms of which 3 ms to minimize.
[2025-06-02 20:20:35] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 2 ms to minimize.
[2025-06-02 20:20:35] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 628 ms
[2025-06-02 20:20:35] [INFO ] Added : 95 causal constraints over 19 iterations in 941 ms. Result :sat
Minimization took 51 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 107/107 transitions.
Graph (complete) has 207 edges and 115 vertex of which 114 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output 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 25 place count 114 transition count 83
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 49 place count 90 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 49 place count 90 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 61 place count 84 transition count 77
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 68 place count 77 transition count 70
Iterating global reduction 2 with 7 rules applied. Total rules applied 75 place count 77 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 75 place count 77 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 77 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 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 119 place count 55 transition count 48
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 120 place count 55 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 121 place count 54 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 122 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 123 place count 52 transition count 46
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 124 place count 52 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 125 place count 51 transition count 45
Applied a total of 125 rules in 128 ms. Remains 51 /115 variables (removed 64) and now considering 45/107 (removed 62) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 154 ms. Remains : 51/115 places, 45/107 transitions.
// Phase 1: matrix 45 rows 51 cols
[2025-06-02 20:20:35] [INFO ] Computed 7 invariants in 7 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (109397 resets) in 1040 ms. (960 steps per ms)
BEST_FIRST walk for 2000001 steps (103995 resets) in 908 ms. (2200 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2025-06-02 20:20:37] [INFO ] Invariant cache hit.
[2025-06-02 20:20:37] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-06-02 20:20:37] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-02 20:20:37] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2025-06-02 20:20:37] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:20:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-06-02 20:20:38] [INFO ] [Nat]Absence check using state equation in 33 ms returned sat
[2025-06-02 20:20:38] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2025-06-02 20:20:38] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2025-06-02 20:20:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 70 ms
[2025-06-02 20:20:38] [INFO ] Computed and/alt/rep : 42/59/42 causal constraints (skipped 2 transitions) in 8 ms.
[2025-06-02 20:20:38] [INFO ] Added : 37 causal constraints over 8 iterations in 88 ms. Result :sat
Minimization took 30 ms.
[2025-06-02 20:20:38] [INFO ] [Real]Absence check using 7 positive place invariants in 4 ms returned sat
[2025-06-02 20:20:38] [INFO ] [Real]Absence check using state equation in 33 ms returned sat
[2025-06-02 20:20:38] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 0 ms to minimize.
[2025-06-02 20:20:38] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 20:20:38] [INFO ] [Nat]Absence check using 7 positive place invariants in 5 ms returned sat
[2025-06-02 20:20:38] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2025-06-02 20:20:38] [INFO ] Deduced a trap composed of 4 places in 32 ms of which 1 ms to minimize.
[2025-06-02 20:20:38] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2025-06-02 20:20:38] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 75 ms
[2025-06-02 20:20:38] [INFO ] Computed and/alt/rep : 42/59/42 causal constraints (skipped 2 transitions) in 6 ms.
[2025-06-02 20:20:38] [INFO ] Added : 33 causal constraints over 7 iterations in 47 ms. Result :sat
Minimization took 17 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 45/45 transitions.
Applied a total of 0 rules in 4 ms. Remains 51 /51 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 51/51 places, 45/45 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 45/45 transitions.
Applied a total of 0 rules in 4 ms. Remains 51 /51 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2025-06-02 20:20:38] [INFO ] Invariant cache hit.
[2025-06-02 20:20:38] [INFO ] Implicit Places using invariants in 77 ms returned []
[2025-06-02 20:20:38] [INFO ] Invariant cache hit.
[2025-06-02 20:20:38] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2025-06-02 20:20:38] [INFO ] Redundant transitions in 0 ms returned []
Running 44 sub problems to find dead transitions.
[2025-06-02 20:20:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2025-06-02 20:20:39] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2025-06-02 20:20:39] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 0 ms to minimize.
[2025-06-02 20:20:39] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2025-06-02 20:20:39] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2025-06-02 20:20:39] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 45/95 variables, 50/62 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2025-06-02 20:20:39] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 1/96 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 64 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1526 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 45/95 variables, 50/63 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 44/107 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (OVERLAPS) 1/96 variables, 1/108 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 108 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1943 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 6/6 constraints]
After SMT, in 3561ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 3572ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3756 ms. Remains : 51/51 places, 45/45 transitions.
[2025-06-02 20:20:43] [INFO ] Flatten gal took : 52 ms
RANDOM walk for 40000 steps (4384 resets) in 2085 ms. (19 steps per ms) remains 4/4 properties
[2025-06-02 20:20:43] [INFO ] Flatten gal took : 55 ms
[2025-06-02 20:20:43] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9530107998660157607.gal : 8 ms
[2025-06-02 20:20:43] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7440111914497944118.prop : 1 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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9530107998660157607.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7440111914497944118.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality7440111914497944118.prop.
SDD proceeding with computation,4 properties remain. new max is 4
SDD size :1 after 7
SDD proceeding with computation,4 properties remain. new max is 8
SDD size :7 after 15
SDD proceeding with computation,4 properties remain. new max is 16
SDD size :15 after 102
SDD proceeding with computation,4 properties remain. new max is 32
SDD size :164 after 419
SDD proceeding with computation,4 properties remain. new max is 64
SDD size :601 after 1984
SDD proceeding with computation,4 properties remain. new max is 128
SDD size :1984 after 5588
BEST_FIRST walk for 40003 steps (2114 resets) in 511 ms. (78 steps per ms) remains 4/4 properties
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,38050,0.041371,4140,2,542,13,2920,10,0,255,1916,0
Total reachable state count : 38050

Verifying 4 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,728,0.042487,4140,2,82,13,2920,10,0,257,1916,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,728,0.042805,4448,2,82,13,2920,10,0,257,1916,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,728,0.043019,4448,2,82,13,2920,10,0,258,1916,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,728,0.043216,4448,2,82,13,2920,10,0,258,1916,0
BEST_FIRST walk for 40004 steps (2073 resets) in 300 ms. (132 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (2043 resets) in 257 ms. (155 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (2110 resets) in 270 ms. (147 steps per ms) remains 4/4 properties
Finished probabilistic random walk after 2039 steps, run visited all 4 properties in 46 ms. (steps per millisecond=44 )
Probabilistic random walk after 2039 steps, saw 970 distinct states, run finished after 51 ms. (steps per millisecond=39 ) properties seen :4
FORMULA MedleyA-PT-04-UpperBounds-05 1 TECHNIQUES REACHABILITY_MAX
FORMULA MedleyA-PT-04-UpperBounds-03 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 12454 ms.

BK_STOP 1748895643683

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="gold2024"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool gold2024"
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 r139-smll-174876533100016"
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 ;