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.r167-tall-174881266200100.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 QuasiCertifProtocol-PT-10, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r167-tall-174881266200100
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 27K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 216K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 87K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 39K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 298K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 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 149K 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 QuasiCertifProtocol-PT-10-UpperBounds-00
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-01
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-02
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-03
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-04
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-05
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-06
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-07
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-08
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-09
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-PT-10-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1748900341228

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-02 21:39:02] [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 21:39:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 21:39:03] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2025-06-02 21:39:03] [INFO ] Transformed 550 places.
[2025-06-02 21:39:03] [INFO ] Transformed 176 transitions.
[2025-06-02 21:39:03] [INFO ] Parsed PT model containing 550 places and 176 transitions and 1287 arcs in 311 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
Reduction of identical properties reduced properties to check from 16 to 13
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 0, 0, 1, 0, 0, 0, 6, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 1, 0, 0, 0, 6, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
// Phase 1: matrix 176 rows 550 cols
[2025-06-02 21:39:03] [INFO ] Computed 375 invariants in 45 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 1, 0, 0, 0, 6, 0, 0, 0, 0] Max Struct:[121, 6, 121, +inf, 1, 1, +inf, 1, 6, 11, 11, 11, +inf]
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-08 6 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (691 resets) in 108 ms. (91 steps per ms)
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-15 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-01 6 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 90009 steps (723 resets) in 173 ms. (517 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[121, 121, +inf, 1, +inf, 11, 11, 11, +inf]
[2025-06-02 21:39:03] [INFO ] Invariant cache hit.
[2025-06-02 21:39:04] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2025-06-02 21:39:04] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 107 ms returned sat
[2025-06-02 21:39:04] [INFO ] [Real]Absence check using state equation in 391 ms returned sat
[2025-06-02 21:39:04] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 34 ms.
[2025-06-02 21:39:05] [INFO ] Added : 33 causal constraints over 7 iterations in 319 ms. Result :sat
Minimization took 502 ms.
[2025-06-02 21:39:05] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-02 21:39:05] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 211 ms returned sat
[2025-06-02 21:39:06] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2025-06-02 21:39:06] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:39:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2025-06-02 21:39:06] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 50 ms returned sat
[2025-06-02 21:39:06] [INFO ] [Nat]Absence check using state equation in 121 ms returned sat
[2025-06-02 21:39:06] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 35 ms.
[2025-06-02 21:39:06] [INFO ] Added : 23 causal constraints over 5 iterations in 216 ms. Result :sat
Minimization took 517 ms.
[2025-06-02 21:39:07] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-02 21:39:07] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 62 ms returned sat
[2025-06-02 21:39:07] [INFO ] [Real]Absence check using state equation in 193 ms returned sat
[2025-06-02 21:39:07] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:39:07] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-02 21:39:07] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 64 ms returned sat
[2025-06-02 21:39:08] [INFO ] [Nat]Absence check using state equation in 338 ms returned sat
[2025-06-02 21:39:08] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 12 ms.
[2025-06-02 21:39:08] [INFO ] Added : 45 causal constraints over 9 iterations in 248 ms. Result :sat
Minimization took 520 ms.
[2025-06-02 21:39:09] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2025-06-02 21:39:09] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 48 ms returned sat
[2025-06-02 21:39:09] [INFO ] [Real]Absence check using state equation in 129 ms returned sat
[2025-06-02 21:39:09] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 22 ms.
[2025-06-02 21:39:09] [INFO ] Added : 14 causal constraints over 3 iterations in 105 ms. Result :sat
Minimization took 449 ms.
[2025-06-02 21:39:09] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2025-06-02 21:39:10] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 100 ms returned sat
[2025-06-02 21:39:10] [INFO ] [Real]Absence check using state equation in 125 ms returned sat
[2025-06-02 21:39:10] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:39:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 12 ms returned sat
[2025-06-02 21:39:10] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 48 ms returned sat
[2025-06-02 21:39:10] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2025-06-02 21:39:10] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 22 ms.
[2025-06-02 21:39:10] [INFO ] Added : 36 causal constraints over 8 iterations in 190 ms. Result :sat
Minimization took 507 ms.
[2025-06-02 21:39:11] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-02 21:39:11] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 46 ms returned sat
[2025-06-02 21:39:11] [INFO ] [Real]Absence check using state equation in 111 ms returned sat
[2025-06-02 21:39:11] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 18 ms.
[2025-06-02 21:39:11] [INFO ] Added : 51 causal constraints over 11 iterations in 267 ms. Result :sat
Minimization took 416 ms.
[2025-06-02 21:39:12] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:39:12] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2025-06-02 21:39:12] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 67 ms returned sat
[2025-06-02 21:39:12] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2025-06-02 21:39:12] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 19 ms.
[2025-06-02 21:39:12] [INFO ] Added : 51 causal constraints over 11 iterations in 228 ms. Result :sat
Minimization took 510 ms.
[2025-06-02 21:39:13] [INFO ] [Real]Absence check using 3 positive place invariants in 5 ms returned sat
[2025-06-02 21:39:13] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 50 ms returned sat
[2025-06-02 21:39:13] [INFO ] [Real]Absence check using state equation in 178 ms returned sat
[2025-06-02 21:39:13] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 12 ms.
[2025-06-02 21:39:13] [INFO ] Added : 16 causal constraints over 4 iterations in 114 ms. Result :sat
Minimization took 423 ms.
[2025-06-02 21:39:14] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-02 21:39:14] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 58 ms returned sat
[2025-06-02 21:39:14] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2025-06-02 21:39:14] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 11 ms.
[2025-06-02 21:39:14] [INFO ] Added : 51 causal constraints over 11 iterations in 260 ms. Result :sat
Minimization took 428 ms.
[2025-06-02 21:39:15] [INFO ] Solution in real domain found non-integer solution.
[2025-06-02 21:39:15] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-02 21:39:15] [INFO ] [Nat]Absence check using 3 positive and 372 generalized place invariants in 47 ms returned sat
[2025-06-02 21:39:15] [INFO ] [Nat]Absence check using state equation in 113 ms returned sat
[2025-06-02 21:39:15] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 19 ms.
[2025-06-02 21:39:15] [INFO ] Added : 51 causal constraints over 11 iterations in 217 ms. Result :sat
Minimization took 512 ms.
[2025-06-02 21:39:16] [INFO ] [Real]Absence check using 3 positive place invariants in 4 ms returned sat
[2025-06-02 21:39:16] [INFO ] [Real]Absence check using 3 positive and 372 generalized place invariants in 47 ms returned sat
[2025-06-02 21:39:16] [INFO ] [Real]Absence check using state equation in 189 ms returned sat
[2025-06-02 21:39:16] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 11 ms.
[2025-06-02 21:39:16] [INFO ] Added : 27 causal constraints over 6 iterations in 157 ms. Result :sat
Minimization took 418 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[121, 121, +inf, 1, +inf, 11, 11, 11, +inf]
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[9, 11, 121, 11, 1, 1, 1, 1] Max Struct:[121, 121, +inf, +inf, 11, 11, 11, +inf]
Support contains 156 out of 550 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 550/550 places, 176/176 transitions.
Graph (complete) has 2400 edges and 550 vertex of which 404 are kept as prefixes of interest. Removing 146 places using SCC suffix rule.3 ms
Discarding 146 places :
Also discarding 10 output transitions
Drop transitions (Output transitions of discarded places.) removed 10 transitions
Drop transitions (Empty/Sink Transition effects.) removed 59 transitions
Reduce isomorphic transitions removed 59 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 81 rules applied. Total rules applied 82 place count 393 transition count 96
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 94 place count 382 transition count 95
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 95 place count 381 transition count 95
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 95 place count 381 transition count 74
Deduced a syphon composed of 21 places in 1 ms
Ensure Unique test removed 110 places
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 247 place count 250 transition count 74
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 247 place count 250 transition count 73
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 250 place count 248 transition count 73
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 251 place count 247 transition count 72
Applied a total of 251 rules in 123 ms. Remains 247 /550 variables (removed 303) and now considering 72/176 (removed 104) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 137 ms. Remains : 247/550 places, 72/176 transitions.
When looking for a positive semi flow solution, solver replied unsat
// Phase 1: matrix 72 rows 247 cols
[2025-06-02 21:39:17] [INFO ] Computed 175 invariants in 5 ms
Current structural bounds on expressions (after invariants) : Max Seen:[9, 11, 121, 11, 1, 1, 1, 1] Max Struct:[121, 121, +inf, +inf, 11, 11, 11, +inf]
RANDOM walk for 1000000 steps (34476 resets) in 4618 ms. (216 steps per ms)
BEST_FIRST walk for 8000006 steps (36901 resets) in 10328 ms. (774 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[9, 11, 121, 11, 1, 1, 1, 1] Max Struct:[121, 121, +inf, +inf, 11, 11, 11, +inf]
[2025-06-02 21:39:32] [INFO ] Invariant cache hit.
[2025-06-02 21:39:32] [INFO ] [Real]Absence check using 0 positive and 175 generalized place invariants in 34 ms returned sat
[2025-06-02 21:39:32] [INFO ] [Real]Absence check using state equation in 41 ms returned sat
[2025-06-02 21:39:32] [INFO ] Computed and/alt/rep : 45/56/45 causal constraints (skipped 16 transitions) in 15 ms.
[2025-06-02 21:39:32] [INFO ] Added : 12 causal constraints over 3 iterations in 49 ms. Result :sat
Minimization took 61 ms.
[2025-06-02 21:39:32] [INFO ] [Real]Absence check using 0 positive and 175 generalized place invariants in 30 ms returned sat
[2025-06-02 21:39:32] [INFO ] [Real]Absence check using state equation in 29 ms returned unsat
[2025-06-02 21:39:32] [INFO ] [Real]Absence check using 0 positive and 175 generalized place invariants in 21 ms returned sat
[2025-06-02 21:39:32] [INFO ] [Real]Absence check using state equation in 86 ms returned unsat
[2025-06-02 21:39:33] [INFO ] [Real]Absence check using 0 positive and 175 generalized place invariants in 21 ms returned sat
[2025-06-02 21:39:33] [INFO ] [Real]Absence check using state equation in 25 ms returned unsat
[2025-06-02 21:39:33] [INFO ] [Real]Absence check using 0 positive and 175 generalized place invariants in 23 ms returned sat
[2025-06-02 21:39:33] [INFO ] [Real]Absence check using state equation in 29 ms returned unsat
[2025-06-02 21:39:33] [INFO ] [Real]Absence check using 0 positive and 175 generalized place invariants in 22 ms returned sat
[2025-06-02 21:39:33] [INFO ] [Real]Absence check using state equation in 41 ms returned unsat
[2025-06-02 21:39:33] [INFO ] [Real]Absence check using 0 positive and 175 generalized place invariants in 35 ms returned sat
[2025-06-02 21:39:33] [INFO ] [Real]Absence check using state equation in 36 ms returned unsat
[2025-06-02 21:39:33] [INFO ] [Real]Absence check using 0 positive and 175 generalized place invariants in 33 ms returned sat
[2025-06-02 21:39:33] [INFO ] [Real]Absence check using state equation in 11 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[9, 11, 121, 11, 1, 1, 1, 1] Max Struct:[121, 11, 121, 11, 1, 1, 1, 1]
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-06 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-03 121 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-02 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[11] Max Struct:[121]
Support contains 11 out of 247 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 247/247 places, 72/72 transitions.
Graph (complete) has 762 edges and 247 vertex of which 57 are kept as prefixes of interest. Removing 190 places using SCC suffix rule.0 ms
Discarding 190 places :
Also discarding 15 output transitions
Drop transitions (Output transitions of discarded places.) removed 15 transitions
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Discarding 11 places :
Implicit places reduction removed 11 places
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 46 transition count 45
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 24 place count 46 transition count 34
Deduced a syphon composed of 11 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 1 with 33 rules applied. Total rules applied 57 place count 24 transition count 34
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 58 place count 23 transition count 33
Applied a total of 58 rules in 4 ms. Remains 23 /247 variables (removed 224) and now considering 33/72 (removed 39) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 23/247 places, 33/72 transitions.
// Phase 1: matrix 33 rows 23 cols
[2025-06-02 21:39:33] [INFO ] Computed 0 invariants in 1 ms
Current structural bounds on expressions (after invariants) : Max Seen:[11] Max Struct:[121]
RANDOM walk for 1000000 steps (43478 resets) in 1044 ms. (956 steps per ms)
BEST_FIRST walk for 1000001 steps (3040 resets) in 417 ms. (2392 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[11] Max Struct:[121]
[2025-06-02 21:39:35] [INFO ] Invariant cache hit.
[2025-06-02 21:39:35] [INFO ] [Real]Absence check using state equation in 8 ms returned unsat
Current structural bounds on expressions (after SMT) : Max Seen:[11] Max Struct:[11]
FORMULA QuasiCertifProtocol-PT-10-UpperBounds-00 11 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2025-06-02 21:39:35] [INFO ] Flatten gal took : 21 ms
[2025-06-02 21:39:35] [INFO ] Flatten gal took : 23 ms
[2025-06-02 21:39:35] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9988409652855922382.gal : 4 ms
[2025-06-02 21:39:35] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3006957622806867570.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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9988409652855922382.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3006957622806867570.prop' '--nowitness' '--gen-order' 'FOLLOW'

ITS runner timed out or was interrupted.
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
ITS tools runner thread asked to quit. Dying gracefully.
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 32510 ms.

BK_STOP 1748900375407

--------------------
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:
++ 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.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="QuasiCertifProtocol-PT-10"
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 QuasiCertifProtocol-PT-10, 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 r167-tall-174881266200100"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-10.tgz
mv QuasiCertifProtocol-PT-10 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 ;