Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r329-tall-171662361400051.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool gold2023
Input is QuasiCertifProtocol-PT-18, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r329-tall-171662361400051
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 46K Apr 13 04:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 318K Apr 13 04:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 20K Apr 13 04:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 135K Apr 13 04:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 16K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 29K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 13 04:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Apr 13 04:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 13 04:10 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Apr 13 04:10 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.3K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 360K May 18 16:43 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

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

=== Now, execution of the tool begins

BK_START 1716769654864

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-18
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-27 00:27:36] [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]
[2024-05-27 00:27:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-27 00:27:36] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2024-05-27 00:27:36] [INFO ] Transformed 1398 places.
[2024-05-27 00:27:36] [INFO ] Transformed 296 transitions.
[2024-05-27 00:27:36] [INFO ] Parsed PT model containing 1398 places and 296 transitions and 3119 arcs in 141 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 296 rows 1398 cols
[2024-05-27 00:27:36] [INFO ] Computed 1103 invariants in 58 ms
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-13 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 441 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 14) seen :19
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 25 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :20
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :14
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 12) seen :12
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :13
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :14
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :14
Incomplete Best-First random walk after 10000 steps, including 31 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :17
Incomplete Best-First random walk after 10001 steps, including 33 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :13
Incomplete Best-First random walk after 10001 steps, including 31 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :15
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :15
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :14
Incomplete Best-First random walk after 10000 steps, including 33 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :13
[2024-05-27 00:27:36] [INFO ] Invariant cache hit.
[2024-05-27 00:27:37] [INFO ] [Real]Absence check using 3 positive place invariants in 23 ms returned sat
[2024-05-27 00:27:37] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 194 ms returned sat
[2024-05-27 00:27:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:27:37] [INFO ] [Real]Absence check using state equation in 331 ms returned unsat
[2024-05-27 00:27:37] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2024-05-27 00:27:38] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 158 ms returned sat
[2024-05-27 00:27:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:27:38] [INFO ] [Real]Absence check using state equation in 309 ms returned sat
[2024-05-27 00:27:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 00:27:38] [INFO ] [Nat]Absence check using 3 positive place invariants in 17 ms returned sat
[2024-05-27 00:27:38] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 186 ms returned sat
[2024-05-27 00:27:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 00:27:39] [INFO ] [Nat]Absence check using state equation in 357 ms returned sat
[2024-05-27 00:27:39] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 26 ms.
[2024-05-27 00:27:40] [INFO ] Added : 82 causal constraints over 17 iterations in 819 ms. Result :sat
Minimization took 224 ms.
[2024-05-27 00:27:40] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2024-05-27 00:27:40] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 174 ms returned sat
[2024-05-27 00:27:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:27:41] [INFO ] [Real]Absence check using state equation in 330 ms returned sat
[2024-05-27 00:27:41] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 00:27:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2024-05-27 00:27:41] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 187 ms returned sat
[2024-05-27 00:27:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 00:27:41] [INFO ] [Nat]Absence check using state equation in 342 ms returned sat
[2024-05-27 00:27:41] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 25 ms.
[2024-05-27 00:27:42] [INFO ] Added : 80 causal constraints over 16 iterations in 688 ms. Result :sat
Minimization took 145 ms.
[2024-05-27 00:27:42] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2024-05-27 00:27:42] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 189 ms returned sat
[2024-05-27 00:27:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:27:43] [INFO ] [Real]Absence check using state equation in 358 ms returned sat
[2024-05-27 00:27:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 00:27:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2024-05-27 00:27:43] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 170 ms returned sat
[2024-05-27 00:27:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 00:27:44] [INFO ] [Nat]Absence check using state equation in 346 ms returned sat
[2024-05-27 00:27:44] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 20 ms.
[2024-05-27 00:27:44] [INFO ] Added : 59 causal constraints over 12 iterations in 517 ms. Result :sat
Minimization took 120 ms.
[2024-05-27 00:27:44] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2024-05-27 00:27:45] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 202 ms returned sat
[2024-05-27 00:27:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:27:45] [INFO ] [Real]Absence check using state equation in 358 ms returned sat
[2024-05-27 00:27:45] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 00:27:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2024-05-27 00:27:45] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 185 ms returned sat
[2024-05-27 00:27:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 00:27:46] [INFO ] [Nat]Absence check using state equation in 367 ms returned sat
[2024-05-27 00:27:46] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 27 ms.
[2024-05-27 00:27:47] [INFO ] Added : 81 causal constraints over 17 iterations in 743 ms. Result :sat
Minimization took 88 ms.
[2024-05-27 00:27:47] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2024-05-27 00:27:47] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 179 ms returned sat
[2024-05-27 00:27:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:27:47] [INFO ] [Real]Absence check using state equation in 436 ms returned sat
[2024-05-27 00:27:47] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 00:27:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2024-05-27 00:27:48] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 185 ms returned sat
[2024-05-27 00:27:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 00:27:48] [INFO ] [Nat]Absence check using state equation in 348 ms returned sat
[2024-05-27 00:27:48] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 19 ms.
[2024-05-27 00:27:49] [INFO ] Added : 80 causal constraints over 16 iterations in 679 ms. Result :sat
Minimization took 84 ms.
[2024-05-27 00:27:49] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2024-05-27 00:27:49] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 180 ms returned sat
[2024-05-27 00:27:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:27:49] [INFO ] [Real]Absence check using state equation in 52 ms returned unsat
[2024-05-27 00:27:49] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2024-05-27 00:27:50] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 187 ms returned sat
[2024-05-27 00:27:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:27:50] [INFO ] [Real]Absence check using state equation in 456 ms returned sat
[2024-05-27 00:27:50] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 00:27:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2024-05-27 00:27:50] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 179 ms returned sat
[2024-05-27 00:27:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 00:27:51] [INFO ] [Nat]Absence check using state equation in 335 ms returned sat
[2024-05-27 00:27:51] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 25 ms.
[2024-05-27 00:27:51] [INFO ] Added : 61 causal constraints over 13 iterations in 525 ms. Result :sat
Minimization took 79 ms.
[2024-05-27 00:27:52] [INFO ] [Real]Absence check using 3 positive place invariants in 10 ms returned sat
[2024-05-27 00:27:52] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 191 ms returned sat
[2024-05-27 00:27:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:27:52] [INFO ] [Real]Absence check using state equation in 372 ms returned sat
[2024-05-27 00:27:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 00:27:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2024-05-27 00:27:53] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 167 ms returned sat
[2024-05-27 00:27:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 00:27:53] [INFO ] [Nat]Absence check using state equation in 355 ms returned sat
[2024-05-27 00:27:53] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 22 ms.
[2024-05-27 00:27:54] [INFO ] Added : 82 causal constraints over 17 iterations in 755 ms. Result :sat
Minimization took 93 ms.
[2024-05-27 00:27:54] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2024-05-27 00:27:54] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 180 ms returned sat
[2024-05-27 00:27:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:27:54] [INFO ] [Real]Absence check using state equation in 338 ms returned sat
[2024-05-27 00:27:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 00:27:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 11 ms returned sat
[2024-05-27 00:27:55] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 185 ms returned sat
[2024-05-27 00:27:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 00:27:55] [INFO ] [Nat]Absence check using state equation in 353 ms returned sat
[2024-05-27 00:27:55] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 19 ms.
[2024-05-27 00:27:56] [INFO ] Added : 83 causal constraints over 17 iterations in 683 ms. Result :sat
Minimization took 92 ms.
[2024-05-27 00:27:56] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2024-05-27 00:27:56] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 183 ms returned sat
[2024-05-27 00:27:56] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:27:57] [INFO ] [Real]Absence check using state equation in 339 ms returned sat
[2024-05-27 00:27:57] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 00:27:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2024-05-27 00:27:57] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 180 ms returned sat
[2024-05-27 00:27:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 00:27:57] [INFO ] [Nat]Absence check using state equation in 338 ms returned sat
[2024-05-27 00:27:57] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 23 ms.
[2024-05-27 00:27:58] [INFO ] Added : 84 causal constraints over 17 iterations in 709 ms. Result :sat
Minimization took 85 ms.
[2024-05-27 00:27:58] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2024-05-27 00:27:59] [INFO ] [Real]Absence check using 3 positive and 1100 generalized place invariants in 169 ms returned sat
[2024-05-27 00:27:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:27:59] [INFO ] [Real]Absence check using state equation in 307 ms returned sat
[2024-05-27 00:27:59] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 22 ms.
[2024-05-27 00:28:00] [INFO ] Added : 82 causal constraints over 17 iterations in 798 ms. Result :sat
Minimization took 101 ms.
[2024-05-27 00:28:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-27 00:28:00] [INFO ] [Nat]Absence check using 3 positive place invariants in 10 ms returned sat
[2024-05-27 00:28:00] [INFO ] [Nat]Absence check using 3 positive and 1100 generalized place invariants in 183 ms returned sat
[2024-05-27 00:28:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-27 00:28:01] [INFO ] [Nat]Absence check using state equation in 340 ms returned sat
[2024-05-27 00:28:01] [INFO ] Computed and/alt/rep : 216/254/216 causal constraints (skipped 60 transitions) in 20 ms.
[2024-05-27 00:28:01] [INFO ] Added : 81 causal constraints over 17 iterations in 703 ms. Result :sat
Minimization took 86 ms.
Current structural bounds on expressions (after SMT) : [19, -1, 10, 361, 1, 19, 1, 19, -1, -1, 19, 1] Max seen :[19, 0, 0, 0, 0, 0, 1, 0, 0, 0, 0, 0]
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-00 19 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-02 10 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 41 out of 1398 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1398/1398 places, 296/296 transitions.
Graph (complete) has 9608 edges and 1398 vertex of which 997 are kept as prefixes of interest. Removing 401 places using SCC suffix rule.5 ms
Discarding 401 places :
Also discarding 18 output transitions
Drop transitions removed 18 transitions
Drop transitions removed 119 transitions
Reduce isomorphic transitions removed 119 transitions.
Discarding 38 places :
Implicit places reduction removed 38 places
Drop transitions removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 175 rules applied. Total rules applied 176 place count 959 transition count 141
Reduce places removed 18 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 19 rules applied. Total rules applied 195 place count 941 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 196 place count 940 transition count 140
Performed 56 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 56 Pre rules applied. Total rules applied 196 place count 940 transition count 84
Deduced a syphon composed of 56 places in 0 ms
Ensure Unique test removed 342 places
Reduce places removed 398 places and 0 transitions.
Iterating global reduction 3 with 454 rules applied. Total rules applied 650 place count 542 transition count 84
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 651 place count 542 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 652 place count 541 transition count 83
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 652 place count 541 transition count 82
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 5 with 3 rules applied. Total rules applied 655 place count 539 transition count 82
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 656 place count 538 transition count 81
Applied a total of 656 rules in 154 ms. Remains 538 /1398 variables (removed 860) and now considering 81/296 (removed 215) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 538/1398 places, 81/296 transitions.
// Phase 1: matrix 81 rows 538 cols
[2024-05-27 00:28:02] [INFO ] Computed 457 invariants in 7 ms
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 1000000 steps, including 25000 resets, run finished after 5343 ms. (steps per millisecond=187 ) properties (out of 6) seen :35
Incomplete Best-First random walk after 1000001 steps, including 1033 resets, run finished after 1880 ms. (steps per millisecond=531 ) properties (out of 6) seen :40
Incomplete Best-First random walk after 1000001 steps, including 1012 resets, run finished after 1739 ms. (steps per millisecond=575 ) properties (out of 6) seen :40
Incomplete Best-First random walk after 1000001 steps, including 1639 resets, run finished after 1894 ms. (steps per millisecond=527 ) properties (out of 6) seen :34
Incomplete Best-First random walk after 1000001 steps, including 1549 resets, run finished after 1886 ms. (steps per millisecond=530 ) properties (out of 6) seen :34
Incomplete Best-First random walk after 1000001 steps, including 1639 resets, run finished after 1916 ms. (steps per millisecond=521 ) properties (out of 6) seen :35
Incomplete Best-First random walk after 1000001 steps, including 1649 resets, run finished after 1874 ms. (steps per millisecond=533 ) properties (out of 6) seen :33
[2024-05-27 00:28:19] [INFO ] Invariant cache hit.
[2024-05-27 00:28:19] [INFO ] [Real]Absence check using 1 positive place invariants in 5 ms returned sat
[2024-05-27 00:28:19] [INFO ] [Real]Absence check using 1 positive and 456 generalized place invariants in 56 ms returned sat
[2024-05-27 00:28:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:28:19] [INFO ] [Real]Absence check using state equation in 14 ms returned unsat
[2024-05-27 00:28:19] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-27 00:28:19] [INFO ] [Real]Absence check using 1 positive and 456 generalized place invariants in 60 ms returned sat
[2024-05-27 00:28:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:28:19] [INFO ] [Real]Absence check using state equation in 74 ms returned unsat
[2024-05-27 00:28:19] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-27 00:28:19] [INFO ] [Real]Absence check using 1 positive and 456 generalized place invariants in 67 ms returned sat
[2024-05-27 00:28:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:28:19] [INFO ] [Real]Absence check using state equation in 69 ms returned unsat
[2024-05-27 00:28:20] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-27 00:28:20] [INFO ] [Real]Absence check using 1 positive and 456 generalized place invariants in 61 ms returned sat
[2024-05-27 00:28:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:28:20] [INFO ] [Real]Absence check using state equation in 89 ms returned unsat
[2024-05-27 00:28:20] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-27 00:28:20] [INFO ] [Real]Absence check using 1 positive and 456 generalized place invariants in 65 ms returned sat
[2024-05-27 00:28:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:28:20] [INFO ] [Real]Absence check using state equation in 65 ms returned unsat
[2024-05-27 00:28:20] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-27 00:28:20] [INFO ] [Real]Absence check using 1 positive and 456 generalized place invariants in 59 ms returned sat
[2024-05-27 00:28:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-27 00:28:20] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
Current structural bounds on expressions (after SMT) : [19, 19, 1, 1, 1, 1] Max seen :[19, 19, 1, 1, 1, 1]
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-03 19 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-18-UpperBounds-01 19 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 44284 ms.

BK_STOP 1716769701402

--------------------
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.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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-18"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is QuasiCertifProtocol-PT-18, 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 r329-tall-171662361400051"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-18.tgz
mv QuasiCertifProtocol-PT-18 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;