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.r297-tall-167873951000869.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 ltsminxred
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 r297-tall-167873951000869
=====================================================================

--------------------
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 1679666387082

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=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-06
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 13:59:48] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-24 13:59:48] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 13:59:49] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2023-03-24 13:59:49] [INFO ] Transformed 270 places.
[2023-03-24 13:59:49] [INFO ] Transformed 116 transitions.
[2023-03-24 13:59:49] [INFO ] Parsed PT model containing 270 places and 116 transitions and 659 arcs in 127 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
// Phase 1: matrix 116 rows 270 cols
[2023-03-24 13:59:49] [INFO ] Computed 155 place invariants in 17 ms
FORMULA QuasiCertifProtocol-PT-06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 981 resets, run finished after 76 ms. (steps per millisecond=131 ) 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 180 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 13) seen :8
Incomplete Best-First random walk after 10000 steps, including 174 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :8
Incomplete Best-First random walk after 10001 steps, including 182 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 13) seen :8
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :8
Incomplete Best-First random walk after 10001 steps, including 178 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 176 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :8
Incomplete Best-First random walk after 10001 steps, including 167 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :8
Incomplete Best-First random walk after 10001 steps, including 176 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 180 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 13) seen :8
Incomplete Best-First random walk after 10001 steps, including 173 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 13) seen :8
Incomplete Best-First random walk after 10001 steps, including 179 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 13) seen :8
Incomplete Best-First random walk after 10001 steps, including 177 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 180 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 13) seen :8
[2023-03-24 13:59:49] [INFO ] Invariant cache hit.
[2023-03-24 13:59:49] [INFO ] [Real]Absence check using 3 positive place invariants in 7 ms returned sat
[2023-03-24 13:59:49] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 43 ms returned sat
[2023-03-24 13:59:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 13:59:49] [INFO ] [Real]Absence check using state equation in 86 ms returned sat
[2023-03-24 13:59:49] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 13:59:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-24 13:59:50] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 23 ms returned sat
[2023-03-24 13:59:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 13:59:50] [INFO ] [Nat]Absence check using state equation in 131 ms returned sat
[2023-03-24 13:59:50] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-24 13:59:50] [INFO ] Added : 37 causal constraints over 8 iterations in 137 ms. Result :sat
Minimization took 52 ms.
[2023-03-24 13:59:50] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-24 13:59:50] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 21 ms returned sat
[2023-03-24 13:59:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 13:59:50] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2023-03-24 13:59:50] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 13:59:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-24 13:59:50] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 27 ms returned sat
[2023-03-24 13:59:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 13:59:50] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2023-03-24 13:59:50] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 12 ms.
[2023-03-24 13:59:50] [INFO ] Added : 19 causal constraints over 4 iterations in 65 ms. Result :sat
Minimization took 22 ms.
[2023-03-24 13:59:50] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-24 13:59:50] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 19 ms returned sat
[2023-03-24 13:59:50] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 13:59:50] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2023-03-24 13:59:50] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-24 13:59:51] [INFO ] Added : 61 causal constraints over 13 iterations in 205 ms. Result :sat
Minimization took 44 ms.
[2023-03-24 13:59:51] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 13:59:51] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-24 13:59:51] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 22 ms returned sat
[2023-03-24 13:59:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 13:59:51] [INFO ] [Nat]Absence check using state equation in 66 ms returned sat
[2023-03-24 13:59:51] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 9 ms.
[2023-03-24 13:59:51] [INFO ] Added : 61 causal constraints over 13 iterations in 180 ms. Result :sat
Minimization took 46 ms.
[2023-03-24 13:59:51] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned unsat
[2023-03-24 13:59:51] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-24 13:59:51] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 20 ms returned sat
[2023-03-24 13:59:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 13:59:51] [INFO ] [Real]Absence check using state equation in 57 ms returned sat
[2023-03-24 13:59:51] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 15 ms.
[2023-03-24 13:59:51] [INFO ] Added : 58 causal constraints over 12 iterations in 184 ms. Result :sat
Minimization took 44 ms.
[2023-03-24 13:59:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 13:59:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-24 13:59:52] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 22 ms returned sat
[2023-03-24 13:59:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 13:59:52] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2023-03-24 13:59:52] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-24 13:59:52] [INFO ] Added : 58 causal constraints over 12 iterations in 145 ms. Result :sat
Minimization took 53 ms.
[2023-03-24 13:59:52] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-24 13:59:52] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 21 ms returned sat
[2023-03-24 13:59:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 13:59:52] [INFO ] [Real]Absence check using state equation in 52 ms returned sat
[2023-03-24 13:59:52] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 7 ms.
[2023-03-24 13:59:52] [INFO ] Added : 19 causal constraints over 4 iterations in 69 ms. Result :sat
Minimization took 25 ms.
[2023-03-24 13:59:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 13:59:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-24 13:59:52] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 25 ms returned sat
[2023-03-24 13:59:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 13:59:52] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2023-03-24 13:59:52] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-24 13:59:52] [INFO ] Added : 18 causal constraints over 4 iterations in 61 ms. Result :sat
Minimization took 17 ms.
[2023-03-24 13:59:52] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-24 13:59:52] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 22 ms returned sat
[2023-03-24 13:59:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 13:59:52] [INFO ] [Real]Absence check using state equation in 66 ms returned sat
[2023-03-24 13:59:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 13:59:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-24 13:59:53] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 24 ms returned sat
[2023-03-24 13:59:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 13:59:53] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2023-03-24 13:59:53] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-24 13:59:53] [INFO ] Added : 49 causal constraints over 10 iterations in 120 ms. Result :sat
Minimization took 74 ms.
[2023-03-24 13:59:53] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-24 13:59:53] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 19 ms returned sat
[2023-03-24 13:59:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 13:59:53] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2023-03-24 13:59:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 13:59:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-24 13:59:53] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 24 ms returned sat
[2023-03-24 13:59:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 13:59:53] [INFO ] [Nat]Absence check using state equation in 78 ms returned sat
[2023-03-24 13:59:53] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 14 ms.
[2023-03-24 13:59:53] [INFO ] Added : 49 causal constraints over 10 iterations in 129 ms. Result :sat
Minimization took 29 ms.
[2023-03-24 13:59:53] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-24 13:59:53] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 30 ms returned sat
[2023-03-24 13:59:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 13:59:53] [INFO ] [Real]Absence check using state equation in 64 ms returned sat
[2023-03-24 13:59:53] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 13:59:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-24 13:59:54] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 19 ms returned sat
[2023-03-24 13:59:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 13:59:54] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2023-03-24 13:59:54] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 11 ms.
[2023-03-24 13:59:54] [INFO ] Added : 27 causal constraints over 6 iterations in 82 ms. Result :sat
Minimization took 22 ms.
[2023-03-24 13:59:54] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-24 13:59:54] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 23 ms returned sat
[2023-03-24 13:59:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 13:59:54] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2023-03-24 13:59:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 13:59:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-24 13:59:54] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 21 ms returned sat
[2023-03-24 13:59:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 13:59:54] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2023-03-24 13:59:54] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 8 ms.
[2023-03-24 13:59:54] [INFO ] Added : 32 causal constraints over 7 iterations in 100 ms. Result :sat
Minimization took 21 ms.
[2023-03-24 13:59:54] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-24 13:59:54] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 22 ms returned sat
[2023-03-24 13:59:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 13:59:54] [INFO ] [Real]Absence check using state equation in 61 ms returned sat
[2023-03-24 13:59:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 13:59:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-24 13:59:54] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 22 ms returned sat
[2023-03-24 13:59:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 13:59:54] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2023-03-24 13:59:54] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-24 13:59:55] [INFO ] Added : 50 causal constraints over 10 iterations in 123 ms. Result :sat
Minimization took 29 ms.
[2023-03-24 13:59:55] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-24 13:59:55] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 22 ms returned sat
[2023-03-24 13:59:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 13:59:55] [INFO ] [Real]Absence check using state equation in 52 ms returned unsat
[2023-03-24 13:59:55] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-24 13:59:55] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 22 ms returned sat
[2023-03-24 13:59:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 13:59:55] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2023-03-24 13:59:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 13:59:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-24 13:59:55] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 22 ms returned sat
[2023-03-24 13:59:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 13:59:55] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2023-03-24 13:59:55] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 10 ms.
[2023-03-24 13:59:55] [INFO ] Added : 30 causal constraints over 6 iterations in 78 ms. Result :sat
Minimization took 23 ms.
Current structural bounds on expressions (after SMT) : [-1, 1, 49, 7, -1, 1, -1, 3, 7, -1, -1, 1, 1] Max seen :[0, 0, 0, 7, 0, 0, 0, 0, 0, 0, 0, 1, 0]
FORMULA QuasiCertifProtocol-PT-06-UpperBounds-13 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-06 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 113 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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.2 ms
Discarding 19 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 45 transitions
Reduce isomorphic transitions removed 45 transitions.
Discarding 13 places :
Implicit places reduction removed 13 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 60 rules applied. Total rules applied 61 place count 238 transition count 67
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 70 place count 236 transition count 60
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 77 place count 229 transition count 60
Performed 19 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 19 Pre rules applied. Total rules applied 77 place count 229 transition count 41
Deduced a syphon composed of 19 places in 0 ms
Ensure Unique test removed 19 places
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 3 with 57 rules applied. Total rules applied 134 place count 191 transition count 41
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 3 with 1 rules applied. Total rules applied 135 place count 190 transition count 41
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 135 place count 190 transition count 39
Deduced a syphon composed of 2 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 5 rules applied. Total rules applied 140 place count 187 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 142 place count 186 transition count 38
Applied a total of 142 rules in 38 ms. Remains 186 /270 variables (removed 84) and now considering 38/116 (removed 78) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 186/270 places, 38/116 transitions.
// Phase 1: matrix 38 rows 186 cols
[2023-03-24 13:59:55] [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 50036 resets, run finished after 6257 ms. (steps per millisecond=159 ) properties (out of 6) seen :108
Incomplete Best-First random walk after 1000000 steps, including 10441 resets, run finished after 2796 ms. (steps per millisecond=357 ) properties (out of 6) seen :105
Incomplete Best-First random walk after 1000001 steps, including 6989 resets, run finished after 1748 ms. (steps per millisecond=572 ) properties (out of 6) seen :108
Incomplete Best-First random walk after 1000001 steps, including 8696 resets, run finished after 2466 ms. (steps per millisecond=405 ) properties (out of 6) seen :108
Incomplete Best-First random walk after 1000001 steps, including 9947 resets, run finished after 1805 ms. (steps per millisecond=554 ) properties (out of 6) seen :108
Incomplete Best-First random walk after 1000001 steps, including 10432 resets, run finished after 1891 ms. (steps per millisecond=528 ) properties (out of 6) seen :107
Incomplete Best-First random walk after 1000001 steps, including 10271 resets, run finished after 1854 ms. (steps per millisecond=539 ) properties (out of 6) seen :108
[2023-03-24 14:00:14] [INFO ] Invariant cache hit.
[2023-03-24 14:00:14] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-24 14:00:14] [INFO ] [Real]Absence check using 7 positive and 141 generalized place invariants in 36 ms returned unsat
[2023-03-24 14:00:14] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-24 14:00:14] [INFO ] [Real]Absence check using 7 positive and 141 generalized place invariants in 21 ms returned sat
[2023-03-24 14:00:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 14:00:14] [INFO ] [Real]Absence check using state equation in 6 ms returned unsat
[2023-03-24 14:00:14] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-24 14:00:14] [INFO ] [Real]Absence check using 7 positive and 141 generalized place invariants in 25 ms returned unsat
[2023-03-24 14:00:14] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-24 14:00:14] [INFO ] [Real]Absence check using 7 positive and 141 generalized place invariants in 30 ms returned sat
[2023-03-24 14:00:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 14:00:15] [INFO ] [Real]Absence check using state equation in 32 ms returned unsat
[2023-03-24 14:00:15] [INFO ] [Real]Absence check using 7 positive place invariants in 3 ms returned sat
[2023-03-24 14:00:15] [INFO ] [Real]Absence check using 7 positive and 141 generalized place invariants in 12 ms returned unsat
[2023-03-24 14:00:15] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2023-03-24 14:00:15] [INFO ] [Real]Absence check using 7 positive and 141 generalized place invariants in 4 ms returned unsat
Current structural bounds on expressions (after SMT) : [49, 7, 49, 1, 1, 1] Max seen :[49, 7, 49, 1, 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-09 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 26382 ms.
ITS solved all properties within timeout

BK_STOP 1679666416183

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

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="ltsminxred"
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 ltsminxred"
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 r297-tall-167873951000869"
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 ;