Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r319-tall-167873970000109.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.....................
=====================================================================
Generated by BenchKit 2-5348
Executing tool gold2022
Input is QuasiCertifProtocol-PT-06, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r319-tall-167873970000109
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 860K
-rw-r--r-- 1 mcc users 16K Feb 26 01:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 131K Feb 26 01:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K Feb 26 01:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 64K Feb 26 01:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 36K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 37K Feb 26 01:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 300K Feb 26 01:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 01:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Feb 26 01:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.2K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 78K Mar 5 18:23 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-06-UpperBounds-00
FORMULA_NAME QuasiCertifProtocol-PT-06-UpperBounds-01
FORMULA_NAME QuasiCertifProtocol-PT-06-UpperBounds-02
FORMULA_NAME QuasiCertifProtocol-PT-06-UpperBounds-03
FORMULA_NAME QuasiCertifProtocol-PT-06-UpperBounds-04
FORMULA_NAME QuasiCertifProtocol-PT-06-UpperBounds-05
FORMULA_NAME QuasiCertifProtocol-PT-06-UpperBounds-06
FORMULA_NAME QuasiCertifProtocol-PT-06-UpperBounds-07
FORMULA_NAME QuasiCertifProtocol-PT-06-UpperBounds-08
FORMULA_NAME QuasiCertifProtocol-PT-06-UpperBounds-09
FORMULA_NAME QuasiCertifProtocol-PT-06-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-PT-06-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-PT-06-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-PT-06-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-PT-06-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-PT-06-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1678881941778

Running Version 202205111006
[2023-03-15 12:05:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-15 12:05:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 12:05:43] [INFO ] Load time of PNML (sax parser for PT used): 98 ms
[2023-03-15 12:05:43] [INFO ] Transformed 270 places.
[2023-03-15 12:05:43] [INFO ] Transformed 116 transitions.
[2023-03-15 12:05:43] [INFO ] Parsed PT model containing 270 places and 116 transitions in 203 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 116 rows 270 cols
[2023-03-15 12:05:43] [INFO ] Computed 155 place invariants in 27 ms
FORMULA QuasiCertifProtocol-PT-06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 985 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 15) seen :12
FORMULA QuasiCertifProtocol-PT-06-UpperBounds-15 3 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-06-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 181 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :8
Incomplete Best-First random walk after 10000 steps, including 181 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 13) seen :8
Incomplete Best-First random walk after 10001 steps, including 182 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :8
Incomplete Best-First random walk after 10001 steps, including 105 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 13) seen :8
Incomplete Best-First random walk after 10001 steps, including 181 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :8
Incomplete Best-First random walk after 10000 steps, including 175 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 13) seen :8
Incomplete Best-First random walk after 10001 steps, including 174 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 13) seen :10
FORMULA QuasiCertifProtocol-PT-06-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10001 steps, including 174 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10000 steps, including 181 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10000 steps, including 173 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10001 steps, including 183 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10001 steps, including 182 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 12) seen :8
// Phase 1: matrix 116 rows 270 cols
[2023-03-15 12:05:43] [INFO ] Computed 155 place invariants in 9 ms
[2023-03-15 12:05:43] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2023-03-15 12:05:43] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 30 ms returned sat
[2023-03-15 12:05:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:05:43] [INFO ] [Real]Absence check using state equation in 116 ms returned sat
[2023-03-15 12:05:43] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:05:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-15 12:05:43] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 23 ms returned sat
[2023-03-15 12:05:43] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:05:44] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2023-03-15 12:05:44] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-15 12:05:44] [INFO ] Added : 36 causal constraints over 8 iterations in 145 ms. Result :sat
Minimization took 36 ms.
[2023-03-15 12:05:44] [INFO ] [Real]Absence check using 3 positive place invariants in 12 ms returned sat
[2023-03-15 12:05:44] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 18 ms returned sat
[2023-03-15 12:05:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:05:44] [INFO ] [Real]Absence check using state equation in 53 ms returned sat
[2023-03-15 12:05:44] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:05:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-15 12:05:44] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 19 ms returned sat
[2023-03-15 12:05:44] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:05:44] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2023-03-15 12:05:44] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-15 12:05:44] [INFO ] Added : 20 causal constraints over 4 iterations in 66 ms. Result :sat
Minimization took 20 ms.
[2023-03-15 12:05:44] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-15 12:05:44] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 21 ms returned sat
[2023-03-15 12:05:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:05:44] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2023-03-15 12:05:44] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-15 12:05:45] [INFO ] Added : 61 causal constraints over 13 iterations in 222 ms. Result :sat
Minimization took 39 ms.
[2023-03-15 12:05:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:05:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-15 12:05:45] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 19 ms returned sat
[2023-03-15 12:05:45] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:05:45] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2023-03-15 12:05:45] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 34 ms.
[2023-03-15 12:05:45] [INFO ] Added : 61 causal constraints over 13 iterations in 189 ms. Result :sat
Minimization took 48 ms.
[2023-03-15 12:05:45] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned unsat
[2023-03-15 12:05:45] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-15 12:05:45] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 26 ms returned sat
[2023-03-15 12:05:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:05:45] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2023-03-15 12:05:45] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-15 12:05:45] [INFO ] Added : 58 causal constraints over 12 iterations in 184 ms. Result :sat
Minimization took 42 ms.
[2023-03-15 12:05:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:05:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-15 12:05:46] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 20 ms returned sat
[2023-03-15 12:05:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:05:46] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2023-03-15 12:05:46] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-15 12:05:46] [INFO ] Added : 58 causal constraints over 12 iterations in 144 ms. Result :sat
Minimization took 49 ms.
[2023-03-15 12:05:46] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-15 12:05:46] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 25 ms returned sat
[2023-03-15 12:05:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:05:46] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2023-03-15 12:05:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:05:46] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-15 12:05:46] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 18 ms returned sat
[2023-03-15 12:05:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:05:46] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2023-03-15 12:05:46] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-15 12:05:46] [INFO ] Added : 46 causal constraints over 10 iterations in 122 ms. Result :sat
Minimization took 44 ms.
[2023-03-15 12:05:46] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-15 12:05:46] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 18 ms returned sat
[2023-03-15 12:05:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:05:46] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2023-03-15 12:05:46] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:05:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-15 12:05:47] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 21 ms returned sat
[2023-03-15 12:05:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:05:47] [INFO ] [Nat]Absence check using state equation in 74 ms returned sat
[2023-03-15 12:05:47] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-15 12:05:47] [INFO ] Added : 51 causal constraints over 11 iterations in 127 ms. Result :sat
Minimization took 39 ms.
[2023-03-15 12:05:47] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2023-03-15 12:05:47] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 20 ms returned sat
[2023-03-15 12:05:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:05:47] [INFO ] [Real]Absence check using state equation in 21 ms returned unsat
[2023-03-15 12:05:47] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-15 12:05:47] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 22 ms returned sat
[2023-03-15 12:05:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:05:47] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2023-03-15 12:05:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:05:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-15 12:05:47] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 28 ms returned sat
[2023-03-15 12:05:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:05:47] [INFO ] [Nat]Absence check using state equation in 50 ms returned sat
[2023-03-15 12:05:47] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-15 12:05:47] [INFO ] Added : 30 causal constraints over 6 iterations in 93 ms. Result :sat
Minimization took 19 ms.
[2023-03-15 12:05:47] [INFO ] [Real]Absence check using 3 positive place invariants in 8 ms returned sat
[2023-03-15 12:05:47] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 17 ms returned sat
[2023-03-15 12:05:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:05:47] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-15 12:05:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:05:47] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-15 12:05:47] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 17 ms returned sat
[2023-03-15 12:05:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:05:48] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2023-03-15 12:05:48] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-15 12:05:48] [INFO ] Added : 49 causal constraints over 10 iterations in 147 ms. Result :sat
Minimization took 29 ms.
[2023-03-15 12:05:48] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-15 12:05:48] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 21 ms returned sat
[2023-03-15 12:05:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:05:48] [INFO ] [Real]Absence check using state equation in 45 ms returned unsat
[2023-03-15 12:05:48] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-15 12:05:48] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 16 ms returned sat
[2023-03-15 12:05:48] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:05:48] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2023-03-15 12:05:48] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-15 12:05:48] [INFO ] Added : 29 causal constraints over 6 iterations in 87 ms. Result :sat
Minimization took 28 ms.
[2023-03-15 12:05:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:05:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-15 12:05:48] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 19 ms returned sat
[2023-03-15 12:05:48] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:05:48] [INFO ] [Nat]Absence check using state equation in 69 ms returned sat
[2023-03-15 12:05:48] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-15 12:05:48] [INFO ] Added : 30 causal constraints over 6 iterations in 75 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : [-1, 1, 49, 7, -1, -1, 3, 1, -1, -1, 1, 1] Max seen :[0, 0, 0, 7, 0, 0, 0, 1, 0, 0, 1, 0]
FORMULA QuasiCertifProtocol-PT-06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-06-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-06-UpperBounds-04 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-06-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-06-UpperBounds-08 3 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 112 out of 270 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 270/270 places, 116/116 transitions.
Graph (complete) has 860 edges and 270 vertex of which 251 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.79 ms
Discarding 19 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Discarding 14 places :
Implicit places reduction removed 14 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 62 rules applied. Total rules applied 63 place count 237 transition count 66
Reduce places removed 2 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 9 rules applied. Total rules applied 72 place count 235 transition count 59
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 79 place count 228 transition count 59
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 79 place count 228 transition count 38
Deduced a syphon composed of 21 places in 0 ms
Ensure Unique test removed 20 places
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 141 place count 187 transition count 38
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 142 place count 187 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 143 place count 186 transition count 37
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 143 place count 186 transition count 36
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 146 place count 184 transition count 36
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 147 place count 183 transition count 35
Applied a total of 147 rules in 136 ms. Remains 183 /270 variables (removed 87) and now considering 35/116 (removed 81) transitions.
Finished structural reductions, in 1 iterations. Remains : 183/270 places, 35/116 transitions.
// Phase 1: matrix 35 rows 183 cols
[2023-03-15 12:05:49] [INFO ] Computed 148 place invariants in 3 ms
FORMULA QuasiCertifProtocol-PT-06-UpperBounds-03 7 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 1000000 steps, including 34482 resets, run finished after 5100 ms. (steps per millisecond=196 ) properties (out of 5) seen :107
Incomplete Best-First random walk after 1000001 steps, including 7299 resets, run finished after 2384 ms. (steps per millisecond=419 ) properties (out of 5) seen :104
Incomplete Best-First random walk after 1000001 steps, including 4268 resets, run finished after 1473 ms. (steps per millisecond=678 ) properties (out of 5) seen :107
Incomplete Best-First random walk after 1000001 steps, including 5555 resets, run finished after 2348 ms. (steps per millisecond=425 ) properties (out of 5) seen :107
Incomplete Best-First random walk after 1000001 steps, including 6965 resets, run finished after 1683 ms. (steps per millisecond=594 ) properties (out of 5) seen :106
Incomplete Best-First random walk after 1000001 steps, including 6798 resets, run finished after 1675 ms. (steps per millisecond=597 ) properties (out of 5) seen :107
// Phase 1: matrix 35 rows 183 cols
[2023-03-15 12:06:03] [INFO ] Computed 148 place invariants in 2 ms
[2023-03-15 12:06:03] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-15 12:06:03] [INFO ] [Real]Absence check using 7 positive and 141 generalized place invariants in 21 ms returned unsat
[2023-03-15 12:06:03] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-15 12:06:03] [INFO ] [Real]Absence check using 7 positive and 141 generalized place invariants in 17 ms returned sat
[2023-03-15 12:06:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:06:03] [INFO ] [Real]Absence check using state equation in 5 ms returned unsat
[2023-03-15 12:06:04] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-15 12:06:04] [INFO ] [Real]Absence check using 7 positive and 141 generalized place invariants in 20 ms returned unsat
[2023-03-15 12:06:04] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-15 12:06:04] [INFO ] [Real]Absence check using 7 positive and 141 generalized place invariants in 3 ms returned unsat
[2023-03-15 12:06:04] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-15 12:06:04] [INFO ] [Real]Absence check using 7 positive and 141 generalized place invariants in 6 ms returned unsat
Current structural bounds on expressions (after SMT) : [49, 7, 49, 1, 1] Max seen :[49, 7, 49, 1, 1]
FORMULA QuasiCertifProtocol-PT-06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-06-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-06-UpperBounds-07 49 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-06-UpperBounds-05 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-06-UpperBounds-00 49 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 21160 ms.

BK_STOP 1678881964240

--------------------
content from stderr:

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination UpperBounds -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-06"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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-5348"
echo " Executing tool gold2022"
echo " Input is QuasiCertifProtocol-PT-06, 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 r319-tall-167873970000109"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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