Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r168-tall-165277017400965.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
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 r168-tall-165277017400965
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 376K
-rw-r--r-- 1 mcc users 12K Apr 30 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 104K Apr 30 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 30 13:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 30 13:20 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.9K May 9 08:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 38K May 9 08:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 9 08:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 25K May 9 08:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 2.8K May 9 08:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 7.1K May 9 08:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 78K May 10 09:34 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 1652993063352

Running Version 202205111006
[2022-05-19 20:44:24] [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]
[2022-05-19 20:44:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 20:44:24] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2022-05-19 20:44:24] [INFO ] Transformed 270 places.
[2022-05-19 20:44:24] [INFO ] Transformed 116 transitions.
[2022-05-19 20:44:24] [INFO ] Parsed PT model containing 270 places and 116 transitions in 180 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
// Phase 1: matrix 116 rows 270 cols
[2022-05-19 20:44:24] [INFO ] Computed 155 place invariants in 30 ms
FORMULA QuasiCertifProtocol-PT-06-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 984 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 15) seen :11
FORMULA QuasiCertifProtocol-PT-06-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-06-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-06-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 179 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10001 steps, including 177 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10000 steps, including 175 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10001 steps, including 136 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10001 steps, including 176 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10001 steps, including 181 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10001 steps, including 177 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 12) seen :8
Incomplete Best-First random walk after 10001 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 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 176 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 178 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 170 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 12) seen :8
// Phase 1: matrix 116 rows 270 cols
[2022-05-19 20:44:25] [INFO ] Computed 155 place invariants in 6 ms
[2022-05-19 20:44:25] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2022-05-19 20:44:25] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 25 ms returned sat
[2022-05-19 20:44:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 20:44:25] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2022-05-19 20:44:25] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 11 ms.
[2022-05-19 20:44:25] [INFO ] Added : 26 causal constraints over 6 iterations in 95 ms. Result :sat
Minimization took 30 ms.
[2022-05-19 20:44:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 20:44:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2022-05-19 20:44:25] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 20 ms returned sat
[2022-05-19 20:44:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 20:44:25] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2022-05-19 20:44:25] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-19 20:44:25] [INFO ] Added : 26 causal constraints over 6 iterations in 88 ms. Result :sat
Minimization took 43 ms.
[2022-05-19 20:44:25] [INFO ] [Real]Absence check using 3 positive place invariants in 11 ms returned sat
[2022-05-19 20:44:25] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 22 ms returned sat
[2022-05-19 20:44:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 20:44:25] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2022-05-19 20:44:25] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 20:44:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 7 ms returned sat
[2022-05-19 20:44:25] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 17 ms returned sat
[2022-05-19 20:44:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 20:44:26] [INFO ] [Nat]Absence check using state equation in 59 ms returned sat
[2022-05-19 20:44:26] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-19 20:44:26] [INFO ] Added : 46 causal constraints over 10 iterations in 138 ms. Result :sat
Minimization took 46 ms.
[2022-05-19 20:44:26] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-05-19 20:44:26] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 18 ms returned sat
[2022-05-19 20:44:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 20:44:26] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2022-05-19 20:44:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 20:44:26] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-19 20:44:26] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 18 ms returned sat
[2022-05-19 20:44:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 20:44:26] [INFO ] [Nat]Absence check using state equation in 124 ms returned sat
[2022-05-19 20:44:26] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-19 20:44:26] [INFO ] Added : 36 causal constraints over 8 iterations in 112 ms. Result :sat
Minimization took 30 ms.
[2022-05-19 20:44:26] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-19 20:44:26] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 20 ms returned sat
[2022-05-19 20:44:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 20:44:26] [INFO ] [Real]Absence check using state equation in 54 ms returned unsat
[2022-05-19 20:44:26] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-05-19 20:44:26] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 26 ms returned sat
[2022-05-19 20:44:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 20:44:27] [INFO ] [Real]Absence check using state equation in 48 ms returned sat
[2022-05-19 20:44:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 20:44:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-05-19 20:44:27] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 19 ms returned sat
[2022-05-19 20:44:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 20:44:27] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2022-05-19 20:44:27] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 21 ms.
[2022-05-19 20:44:27] [INFO ] Added : 11 causal constraints over 3 iterations in 64 ms. Result :sat
Minimization took 26 ms.
[2022-05-19 20:44:27] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-19 20:44:27] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 19 ms returned sat
[2022-05-19 20:44:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 20:44:27] [INFO ] [Real]Absence check using state equation in 49 ms returned sat
[2022-05-19 20:44:27] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-19 20:44:27] [INFO ] Added : 61 causal constraints over 13 iterations in 202 ms. Result :sat
Minimization took 40 ms.
[2022-05-19 20:44:27] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 20:44:27] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-05-19 20:44:27] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 21 ms returned sat
[2022-05-19 20:44:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 20:44:27] [INFO ] [Nat]Absence check using state equation in 61 ms returned sat
[2022-05-19 20:44:27] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 9 ms.
[2022-05-19 20:44:27] [INFO ] Added : 61 causal constraints over 13 iterations in 175 ms. Result :sat
Minimization took 51 ms.
[2022-05-19 20:44:28] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-19 20:44:28] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 19 ms returned sat
[2022-05-19 20:44:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 20:44:28] [INFO ] [Real]Absence check using state equation in 59 ms returned sat
[2022-05-19 20:44:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 20:44:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-19 20:44:28] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 20 ms returned sat
[2022-05-19 20:44:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 20:44:28] [INFO ] [Nat]Absence check using state equation in 57 ms returned sat
[2022-05-19 20:44:28] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-19 20:44:28] [INFO ] Added : 18 causal constraints over 4 iterations in 63 ms. Result :sat
Minimization took 18 ms.
[2022-05-19 20:44:28] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2022-05-19 20:44:28] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 19 ms returned sat
[2022-05-19 20:44:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 20:44:28] [INFO ] [Real]Absence check using state equation in 55 ms returned sat
[2022-05-19 20:44:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 20:44:28] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2022-05-19 20:44:28] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 23 ms returned sat
[2022-05-19 20:44:28] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 20:44:28] [INFO ] [Nat]Absence check using state equation in 60 ms returned sat
[2022-05-19 20:44:28] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-19 20:44:28] [INFO ] Added : 50 causal constraints over 10 iterations in 121 ms. Result :sat
Minimization took 26 ms.
[2022-05-19 20:44:28] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-05-19 20:44:28] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 20 ms returned sat
[2022-05-19 20:44:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 20:44:28] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2022-05-19 20:44:28] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 20:44:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-05-19 20:44:29] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 20 ms returned sat
[2022-05-19 20:44:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 20:44:29] [INFO ] [Nat]Absence check using state equation in 55 ms returned sat
[2022-05-19 20:44:29] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 8 ms.
[2022-05-19 20:44:29] [INFO ] Added : 28 causal constraints over 6 iterations in 82 ms. Result :sat
Minimization took 20 ms.
[2022-05-19 20:44:29] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-05-19 20:44:29] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 19 ms returned sat
[2022-05-19 20:44:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 20:44:29] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2022-05-19 20:44:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 20:44:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-05-19 20:44:29] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 18 ms returned sat
[2022-05-19 20:44:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 20:44:29] [INFO ] [Nat]Absence check using state equation in 48 ms returned sat
[2022-05-19 20:44:29] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 10 ms.
[2022-05-19 20:44:29] [INFO ] Added : 49 causal constraints over 10 iterations in 128 ms. Result :sat
Minimization took 25 ms.
[2022-05-19 20:44:29] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-05-19 20:44:29] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 19 ms returned sat
[2022-05-19 20:44:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 20:44:29] [INFO ] [Real]Absence check using state equation in 47 ms returned sat
[2022-05-19 20:44:29] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 20:44:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2022-05-19 20:44:29] [INFO ] [Nat]Absence check using 3 positive and 152 generalized place invariants in 19 ms returned sat
[2022-05-19 20:44:29] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 20:44:29] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2022-05-19 20:44:29] [INFO ] Computed and/alt/rep : 108/283/108 causal constraints (skipped 0 transitions) in 7 ms.
[2022-05-19 20:44:29] [INFO ] Added : 30 causal constraints over 6 iterations in 80 ms. Result :sat
Minimization took 24 ms.
[2022-05-19 20:44:30] [INFO ] [Real]Absence check using 3 positive place invariants in 6 ms returned sat
[2022-05-19 20:44:30] [INFO ] [Real]Absence check using 3 positive and 152 generalized place invariants in 19 ms returned sat
[2022-05-19 20:44:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 20:44:30] [INFO ] [Real]Absence check using state equation in 45 ms returned unsat
Current structural bounds on expressions (after SMT) : [49, -1, -1, 7, 1, 49, -1, -1, 7, -1, -1, 1] Max seen :[0, 0, 0, 7, 0, 0, 0, 0, 0, 0, 0, 1]
FORMULA QuasiCertifProtocol-PT-06-UpperBounds-15 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-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 115 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 259 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.5 ms
Discarding 11 places :
Also discarding 0 output transitions
Drop transitions removed 46 transitions
Reduce isomorphic transitions removed 46 transitions.
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 54 rules applied. Total rules applied 55 place count 252 transition count 69
Reduce places removed 1 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 9 rules applied. Total rules applied 64 place count 251 transition count 61
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 72 place count 243 transition count 61
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 72 place count 243 transition count 54
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 27 rules applied. Total rules applied 99 place count 223 transition count 54
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 99 place count 223 transition count 53
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 102 place count 221 transition count 53
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 103 place count 220 transition count 52
Applied a total of 103 rules in 43 ms. Remains 220 /270 variables (removed 50) and now considering 52/116 (removed 64) transitions.
Finished structural reductions, in 1 iterations. Remains : 220/270 places, 52/116 transitions.
// Phase 1: matrix 52 rows 220 cols
[2022-05-19 20:44:30] [INFO ] Computed 168 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 49993 resets, run finished after 2975 ms. (steps per millisecond=336 ) properties (out of 9) seen :117
Incomplete Best-First random walk after 1000001 steps, including 6483 resets, run finished after 1018 ms. (steps per millisecond=982 ) properties (out of 9) seen :117
Incomplete Best-First random walk after 1000001 steps, including 10443 resets, run finished after 1343 ms. (steps per millisecond=744 ) properties (out of 9) seen :46
Incomplete Best-First random walk after 1000000 steps, including 10859 resets, run finished after 1409 ms. (steps per millisecond=709 ) properties (out of 9) seen :53
Incomplete Best-First random walk after 1000001 steps, including 10422 resets, run finished after 945 ms. (steps per millisecond=1058 ) properties (out of 9) seen :46
Incomplete Best-First random walk after 1000000 steps, including 10486 resets, run finished after 887 ms. (steps per millisecond=1127 ) properties (out of 9) seen :39
Incomplete Best-First random walk after 1000001 steps, including 10430 resets, run finished after 866 ms. (steps per millisecond=1154 ) properties (out of 9) seen :46
Incomplete Best-First random walk after 1000001 steps, including 10318 resets, run finished after 874 ms. (steps per millisecond=1144 ) properties (out of 9) seen :53
Incomplete Best-First random walk after 1000001 steps, including 10441 resets, run finished after 872 ms. (steps per millisecond=1146 ) properties (out of 9) seen :46
Incomplete Best-First random walk after 1000001 steps, including 10509 resets, run finished after 895 ms. (steps per millisecond=1117 ) properties (out of 9) seen :46
// Phase 1: matrix 52 rows 220 cols
[2022-05-19 20:44:42] [INFO ] Computed 168 place invariants in 7 ms
[2022-05-19 20:44:42] [INFO ] [Real]Absence check using 0 positive and 168 generalized place invariants in 26 ms returned sat
[2022-05-19 20:44:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 20:44:42] [INFO ] [Real]Absence check using state equation in 12 ms returned unsat
[2022-05-19 20:44:42] [INFO ] [Real]Absence check using 0 positive and 168 generalized place invariants in 31 ms returned unsat
[2022-05-19 20:44:42] [INFO ] [Real]Absence check using 0 positive and 168 generalized place invariants in 29 ms returned sat
[2022-05-19 20:44:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 20:44:42] [INFO ] [Real]Absence check using state equation in 11 ms returned unsat
[2022-05-19 20:44:42] [INFO ] [Real]Absence check using 0 positive and 168 generalized place invariants in 10 ms returned unsat
[2022-05-19 20:44:42] [INFO ] [Real]Absence check using 0 positive and 168 generalized place invariants in 6 ms returned unsat
[2022-05-19 20:44:42] [INFO ] [Real]Absence check using 0 positive and 168 generalized place invariants in 26 ms returned sat
[2022-05-19 20:44:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 20:44:42] [INFO ] [Real]Absence check using state equation in 11 ms returned unsat
[2022-05-19 20:44:42] [INFO ] [Real]Absence check using 0 positive and 168 generalized place invariants in 25 ms returned sat
[2022-05-19 20:44:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 20:44:42] [INFO ] [Real]Absence check using state equation in 39 ms returned unsat
[2022-05-19 20:44:42] [INFO ] [Real]Absence check using 0 positive and 168 generalized place invariants in 14 ms returned unsat
[2022-05-19 20:44:43] [INFO ] [Real]Absence check using 0 positive and 168 generalized place invariants in 12 ms returned unsat
Current structural bounds on expressions (after SMT) : [7, 49, 49, 7, 1, 1, 1, 1, 1] Max seen :[7, 49, 49, 7, 1, 1, 1, 1, 1]
FORMULA QuasiCertifProtocol-PT-06-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-06-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-06-UpperBounds-11 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-06 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-06-UpperBounds-03 49 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-06-UpperBounds-01 49 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-06-UpperBounds-00 7 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 18479 ms.

BK_STOP 1652993083079

--------------------
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="itstools"
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-4028"
echo " Executing tool itstools"
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 r168-tall-165277017400965"
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 ;