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-165277017500989.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-22, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r168-tall-165277017500989
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 72K Apr 30 13:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 452K Apr 30 13:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 30 13:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 74K Apr 30 13:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 15K May 9 08:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 9 08:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 9 08:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 36K May 9 08:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K May 9 08:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 24K May 9 08:31 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 503K 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-22-UpperBounds-00
FORMULA_NAME QuasiCertifProtocol-PT-22-UpperBounds-01
FORMULA_NAME QuasiCertifProtocol-PT-22-UpperBounds-02
FORMULA_NAME QuasiCertifProtocol-PT-22-UpperBounds-03
FORMULA_NAME QuasiCertifProtocol-PT-22-UpperBounds-04
FORMULA_NAME QuasiCertifProtocol-PT-22-UpperBounds-05
FORMULA_NAME QuasiCertifProtocol-PT-22-UpperBounds-06
FORMULA_NAME QuasiCertifProtocol-PT-22-UpperBounds-07
FORMULA_NAME QuasiCertifProtocol-PT-22-UpperBounds-08
FORMULA_NAME QuasiCertifProtocol-PT-22-UpperBounds-09
FORMULA_NAME QuasiCertifProtocol-PT-22-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-PT-22-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-PT-22-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-PT-22-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-PT-22-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-PT-22-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1652998350681

Running Version 202205111006
[2022-05-19 22:12:31] [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 22:12:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 22:12:32] [INFO ] Load time of PNML (sax parser for PT used): 196 ms
[2022-05-19 22:12:32] [INFO ] Transformed 1966 places.
[2022-05-19 22:12:32] [INFO ] Transformed 356 transitions.
[2022-05-19 22:12:32] [INFO ] Parsed PT model containing 1966 places and 356 transitions in 316 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 13 ms.
// Phase 1: matrix 356 rows 1966 cols
[2022-05-19 22:12:32] [INFO ] Computed 1611 place invariants in 104 ms
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 373 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 15) seen :39
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-14 13 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :25
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 13) seen :25
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 13) seen :25
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 13) seen :25
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :25
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 13) seen :25
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 13) seen :25
Incomplete Best-First random walk after 10000 steps, including 23 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 13) seen :25
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :25
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :25
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 13) seen :25
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 13) seen :25
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 13) seen :25
// Phase 1: matrix 356 rows 1966 cols
[2022-05-19 22:12:32] [INFO ] Computed 1611 place invariants in 45 ms
[2022-05-19 22:12:33] [INFO ] [Real]Absence check using 3 positive place invariants in 23 ms returned sat
[2022-05-19 22:12:33] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 307 ms returned sat
[2022-05-19 22:12:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 22:12:34] [INFO ] [Real]Absence check using state equation in 535 ms returned sat
[2022-05-19 22:12:34] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 22:12:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 32 ms returned sat
[2022-05-19 22:12:34] [INFO ] [Nat]Absence check using 3 positive and 1608 generalized place invariants in 300 ms returned sat
[2022-05-19 22:12:34] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 22:12:35] [INFO ] [Nat]Absence check using state equation in 508 ms returned sat
[2022-05-19 22:12:35] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 38 ms.
[2022-05-19 22:12:36] [INFO ] Added : 49 causal constraints over 10 iterations in 731 ms. Result :sat
Minimization took 138 ms.
[2022-05-19 22:12:36] [INFO ] [Real]Absence check using 3 positive place invariants in 26 ms returned sat
[2022-05-19 22:12:36] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 293 ms returned sat
[2022-05-19 22:12:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 22:12:37] [INFO ] [Real]Absence check using state equation in 498 ms returned sat
[2022-05-19 22:12:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 22:12:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 16 ms returned sat
[2022-05-19 22:12:37] [INFO ] [Nat]Absence check using 3 positive and 1608 generalized place invariants in 314 ms returned sat
[2022-05-19 22:12:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 22:12:38] [INFO ] [Nat]Absence check using state equation in 557 ms returned sat
[2022-05-19 22:12:38] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 26 ms.
[2022-05-19 22:12:38] [INFO ] Added : 27 causal constraints over 6 iterations in 409 ms. Result :sat
Minimization took 146 ms.
[2022-05-19 22:12:39] [INFO ] [Real]Absence check using 3 positive place invariants in 22 ms returned sat
[2022-05-19 22:12:39] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 283 ms returned sat
[2022-05-19 22:12:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 22:12:40] [INFO ] [Real]Absence check using state equation in 520 ms returned unsat
[2022-05-19 22:12:40] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-05-19 22:12:40] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 357 ms returned sat
[2022-05-19 22:12:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 22:12:41] [INFO ] [Real]Absence check using state equation in 1046 ms returned sat
[2022-05-19 22:12:41] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 22:12:42] [INFO ] [Nat]Absence check using 3 positive place invariants in 16 ms returned sat
[2022-05-19 22:12:42] [INFO ] [Nat]Absence check using 3 positive and 1608 generalized place invariants in 355 ms returned sat
[2022-05-19 22:12:42] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 22:12:43] [INFO ] [Nat]Absence check using state equation in 1017 ms returned sat
[2022-05-19 22:12:43] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 24 ms.
[2022-05-19 22:12:44] [INFO ] Added : 95 causal constraints over 19 iterations in 1032 ms. Result :sat
Minimization took 159 ms.
[2022-05-19 22:12:44] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-05-19 22:12:45] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 295 ms returned sat
[2022-05-19 22:12:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 22:12:45] [INFO ] [Real]Absence check using state equation in 541 ms returned sat
[2022-05-19 22:12:45] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 22:12:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 16 ms returned sat
[2022-05-19 22:12:46] [INFO ] [Nat]Absence check using 3 positive and 1608 generalized place invariants in 305 ms returned sat
[2022-05-19 22:12:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 22:12:46] [INFO ] [Nat]Absence check using state equation in 595 ms returned sat
[2022-05-19 22:12:46] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 27 ms.
[2022-05-19 22:12:48] [INFO ] Added : 109 causal constraints over 22 iterations in 1255 ms. Result :sat
Minimization took 424 ms.
[2022-05-19 22:12:48] [INFO ] [Real]Absence check using 3 positive place invariants in 15 ms returned sat
[2022-05-19 22:12:49] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 293 ms returned sat
[2022-05-19 22:12:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 22:12:49] [INFO ] [Real]Absence check using state equation in 666 ms returned sat
[2022-05-19 22:12:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 22:12:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 16 ms returned sat
[2022-05-19 22:12:50] [INFO ] [Nat]Absence check using 3 positive and 1608 generalized place invariants in 297 ms returned sat
[2022-05-19 22:12:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 22:12:51] [INFO ] [Nat]Absence check using state equation in 676 ms returned sat
[2022-05-19 22:12:51] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 27 ms.
[2022-05-19 22:12:52] [INFO ] Added : 97 causal constraints over 20 iterations in 1137 ms. Result :sat
Minimization took 222 ms.
[2022-05-19 22:12:52] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-05-19 22:12:53] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 360 ms returned sat
[2022-05-19 22:12:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 22:12:53] [INFO ] [Real]Absence check using state equation in 545 ms returned sat
[2022-05-19 22:12:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 22:12:53] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2022-05-19 22:12:58] [INFO ] [Nat]Absence check using 3 positive and 1608 generalized place invariants in 4797 ms returned unknown
[2022-05-19 22:12:58] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-05-19 22:12:59] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 327 ms returned sat
[2022-05-19 22:12:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 22:12:59] [INFO ] [Real]Absence check using state equation in 516 ms returned unsat
[2022-05-19 22:13:00] [INFO ] [Real]Absence check using 3 positive place invariants in 20 ms returned sat
[2022-05-19 22:13:00] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 281 ms returned sat
[2022-05-19 22:13:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 22:13:00] [INFO ] [Real]Absence check using state equation in 495 ms returned sat
[2022-05-19 22:13:00] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 22:13:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2022-05-19 22:13:01] [INFO ] [Nat]Absence check using 3 positive and 1608 generalized place invariants in 279 ms returned sat
[2022-05-19 22:13:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 22:13:01] [INFO ] [Nat]Absence check using state equation in 543 ms returned sat
[2022-05-19 22:13:01] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 28 ms.
[2022-05-19 22:13:02] [INFO ] Added : 42 causal constraints over 9 iterations in 569 ms. Result :sat
Minimization took 104 ms.
[2022-05-19 22:13:02] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2022-05-19 22:13:03] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 289 ms returned sat
[2022-05-19 22:13:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 22:13:03] [INFO ] [Real]Absence check using state equation in 483 ms returned sat
[2022-05-19 22:13:03] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 22:13:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 22 ms returned sat
[2022-05-19 22:13:04] [INFO ] [Nat]Absence check using 3 positive and 1608 generalized place invariants in 277 ms returned sat
[2022-05-19 22:13:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 22:13:04] [INFO ] [Nat]Absence check using state equation in 609 ms returned sat
[2022-05-19 22:13:04] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 29 ms.
[2022-05-19 22:13:05] [INFO ] Added : 65 causal constraints over 13 iterations in 743 ms. Result :sat
Minimization took 106 ms.
[2022-05-19 22:13:05] [INFO ] [Real]Absence check using 3 positive place invariants in 29 ms returned sat
[2022-05-19 22:13:06] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 291 ms returned sat
[2022-05-19 22:13:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 22:13:06] [INFO ] [Real]Absence check using state equation in 517 ms returned sat
[2022-05-19 22:13:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 22:13:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 22 ms returned sat
[2022-05-19 22:13:07] [INFO ] [Nat]Absence check using 3 positive and 1608 generalized place invariants in 295 ms returned sat
[2022-05-19 22:13:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 22:13:07] [INFO ] [Nat]Absence check using state equation in 536 ms returned sat
[2022-05-19 22:13:07] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 29 ms.
[2022-05-19 22:13:08] [INFO ] Added : 66 causal constraints over 14 iterations in 820 ms. Result :sat
Minimization took 102 ms.
[2022-05-19 22:13:09] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2022-05-19 22:13:09] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 284 ms returned sat
[2022-05-19 22:13:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 22:13:09] [INFO ] [Real]Absence check using state equation in 548 ms returned sat
[2022-05-19 22:13:09] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 22:13:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 19 ms returned sat
[2022-05-19 22:13:10] [INFO ] [Nat]Absence check using 3 positive and 1608 generalized place invariants in 298 ms returned sat
[2022-05-19 22:13:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 22:13:10] [INFO ] [Nat]Absence check using state equation in 533 ms returned sat
[2022-05-19 22:13:11] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 25 ms.
[2022-05-19 22:13:11] [INFO ] Added : 23 causal constraints over 5 iterations in 356 ms. Result :sat
Minimization took 100 ms.
[2022-05-19 22:13:11] [INFO ] [Real]Absence check using 3 positive place invariants in 18 ms returned sat
[2022-05-19 22:13:12] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 297 ms returned sat
[2022-05-19 22:13:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 22:13:12] [INFO ] [Real]Absence check using state equation in 69 ms returned unsat
Current structural bounds on expressions (after SMT) : [-1, -1, 23, 12167, 529, 529, 529, 1, -1, -1, 1, 1, 1] Max seen :[0, 0, 23, 0, 0, 0, 0, 1, 0, 0, 0, 0, 1]
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-03 23 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 646 out of 1966 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Graph (complete) has 16044 edges and 1966 vertex of which 1962 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.16 ms
Discarding 4 places :
Also discarding 0 output transitions
Drop transitions removed 143 transitions
Reduce isomorphic transitions removed 143 transitions.
Discarding 46 places :
Implicit places reduction removed 46 places
Iterating post reduction 0 with 189 rules applied. Total rules applied 190 place count 1916 transition count 213
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 24 Pre rules applied. Total rules applied 190 place count 1916 transition count 189
Deduced a syphon composed of 24 places in 1 ms
Ensure Unique test removed 45 places
Reduce places removed 69 places and 0 transitions.
Iterating global reduction 1 with 93 rules applied. Total rules applied 283 place count 1847 transition count 189
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 283 place count 1847 transition count 188
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 286 place count 1845 transition count 188
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 1 with 46 rules applied. Total rules applied 332 place count 1822 transition count 165
Applied a total of 332 rules in 411 ms. Remains 1822 /1966 variables (removed 144) and now considering 165/356 (removed 191) transitions.
Finished structural reductions, in 1 iterations. Remains : 1822/1966 places, 165/356 transitions.
// Phase 1: matrix 165 rows 1822 cols
[2022-05-19 22:13:13] [INFO ] Computed 1657 place invariants in 7 ms
Incomplete random walk after 1000000 steps, including 8333 resets, run finished after 27326 ms. (steps per millisecond=36 ) properties (out of 8) seen :543
Interrupted Best-First random walk after 756366 steps, including 421 resets, run timeout after 5001 ms. (steps per millisecond=151 ) properties seen 494
Interrupted Best-First random walk after 734707 steps, including 408 resets, run timeout after 5001 ms. (steps per millisecond=146 ) properties seen 518
Finished Best-First random walk after 254627 steps, including 138 resets, run visited all 8 properties in 5001 ms. (steps per millisecond=50 )
Interrupted Best-First random walk after 985074 steps, including 427 resets, run timeout after 5001 ms. (steps per millisecond=196 ) properties seen 503
Finished Best-First random walk after 670703 steps, including 363 resets, run visited all 8 properties in 5001 ms. (steps per millisecond=134 )
Interrupted Best-First random walk after 762916 steps, including 424 resets, run timeout after 5001 ms. (steps per millisecond=152 ) properties seen 495
Interrupted Best-First random walk after 815133 steps, including 453 resets, run timeout after 5001 ms. (steps per millisecond=162 ) properties seen 518
Interrupted Best-First random walk after 729820 steps, including 396 resets, run timeout after 5001 ms. (steps per millisecond=145 ) properties seen 519
// Phase 1: matrix 165 rows 1822 cols
[2022-05-19 22:14:21] [INFO ] Computed 1657 place invariants in 12 ms
[2022-05-19 22:14:21] [INFO ] [Real]Absence check using 1 positive place invariants in 21 ms returned sat
[2022-05-19 22:14:21] [INFO ] [Real]Absence check using 1 positive and 1656 generalized place invariants in 191 ms returned unsat
[2022-05-19 22:14:21] [INFO ] [Real]Absence check using 1 positive place invariants in 33 ms returned sat
[2022-05-19 22:14:22] [INFO ] [Real]Absence check using 1 positive and 1656 generalized place invariants in 280 ms returned unsat
[2022-05-19 22:14:22] [INFO ] [Real]Absence check using 1 positive place invariants in 13 ms returned sat
[2022-05-19 22:14:22] [INFO ] [Real]Absence check using 1 positive and 1656 generalized place invariants in 328 ms returned sat
[2022-05-19 22:14:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 22:14:23] [INFO ] [Real]Absence check using state equation in 678 ms returned unsat
[2022-05-19 22:14:23] [INFO ] [Real]Absence check using 1 positive place invariants in 13 ms returned sat
[2022-05-19 22:14:23] [INFO ] [Real]Absence check using 1 positive and 1656 generalized place invariants in 311 ms returned sat
[2022-05-19 22:14:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 22:14:23] [INFO ] [Real]Absence check using state equation in 108 ms returned unsat
[2022-05-19 22:14:24] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2022-05-19 22:14:24] [INFO ] [Real]Absence check using 1 positive and 1656 generalized place invariants in 320 ms returned sat
[2022-05-19 22:14:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 22:14:24] [INFO ] [Real]Absence check using state equation in 109 ms returned unsat
[2022-05-19 22:14:24] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2022-05-19 22:14:25] [INFO ] [Real]Absence check using 1 positive and 1656 generalized place invariants in 405 ms returned unsat
[2022-05-19 22:14:25] [INFO ] [Real]Absence check using 1 positive place invariants in 13 ms returned sat
[2022-05-19 22:14:25] [INFO ] [Real]Absence check using 1 positive and 1656 generalized place invariants in 161 ms returned unsat
[2022-05-19 22:14:25] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2022-05-19 22:14:25] [INFO ] [Real]Absence check using 1 positive and 1656 generalized place invariants in 278 ms returned sat
[2022-05-19 22:14:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 22:14:26] [INFO ] [Real]Absence check using state equation in 961 ms returned unsat
Current structural bounds on expressions (after SMT) : [23, 23, 529, 23, 23, 23, 1, 1] Max seen :[23, 23, 529, 23, 23, 23, 1, 1]
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-07 23 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-06 23 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-05 23 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-04 529 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-02 23 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-00 23 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 115079 ms.

BK_STOP 1652998466979

--------------------
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//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
++ perl -pe 's/.*\.//g'
+ 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-22"
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-22, 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-165277017500989"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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