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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.7M
-rw-r--r-- 1 mcc users 47K Apr 30 13:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 326K Apr 30 13:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 30 13:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 110K Apr 30 13:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 57K May 9 08:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 242K May 9 08:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 9 08:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 9 08:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K May 9 08:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.8K 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 749K 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-28-UpperBounds-00
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-01
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-02
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-03
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-04
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-05
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-06
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-07
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-08
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-09
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-10
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-11
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-12
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-13
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-14
FORMULA_NAME QuasiCertifProtocol-PT-28-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1653000822348

Running Version 202205111006
[2022-05-19 22:53:43] [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:53:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 22:53:43] [INFO ] Load time of PNML (sax parser for PT used): 156 ms
[2022-05-19 22:53:43] [INFO ] Transformed 2998 places.
[2022-05-19 22:53:43] [INFO ] Transformed 446 transitions.
[2022-05-19 22:53:43] [INFO ] Parsed PT model containing 2998 places and 446 transitions in 262 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 199 ms.
// Phase 1: matrix 446 rows 2998 cols
[2022-05-19 22:53:44] [INFO ] Computed 2553 place invariants in 138 ms
Incomplete random walk after 10000 steps, including 301 resets, run finished after 93 ms. (steps per millisecond=107 ) properties (out of 16) seen :67
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-14 16 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 14) seen :49
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :47
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) seen :49
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) seen :47
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 14) seen :47
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 14) seen :48
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 14) seen :58
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) seen :46
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 14) seen :47
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 14) seen :45
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 14) seen :48
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 14) seen :49
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 14) seen :47
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 14) seen :49
// Phase 1: matrix 446 rows 2998 cols
[2022-05-19 22:53:44] [INFO ] Computed 2553 place invariants in 56 ms
[2022-05-19 22:53:45] [INFO ] [Real]Absence check using 32 positive place invariants in 66 ms returned sat
[2022-05-19 22:53:45] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 529 ms returned sat
[2022-05-19 22:53:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 22:53:46] [INFO ] [Real]Absence check using state equation in 890 ms returned sat
[2022-05-19 22:53:46] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 44 ms.
[2022-05-19 22:53:49] [INFO ] Added : 135 causal constraints over 27 iterations in 2336 ms. Result :sat
Minimization took 232 ms.
[2022-05-19 22:53:49] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 22:53:50] [INFO ] [Nat]Absence check using 32 positive place invariants in 60 ms returned sat
[2022-05-19 22:53:50] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 506 ms returned sat
[2022-05-19 22:53:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 22:53:51] [INFO ] [Nat]Absence check using state equation in 981 ms returned sat
[2022-05-19 22:53:51] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 37 ms.
[2022-05-19 22:53:53] [INFO ] Added : 135 causal constraints over 27 iterations in 1992 ms. Result :sat
Minimization took 204 ms.
[2022-05-19 22:53:54] [INFO ] [Real]Absence check using 32 positive place invariants in 52 ms returned sat
[2022-05-19 22:53:54] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 513 ms returned sat
[2022-05-19 22:53:54] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 22:53:57] [INFO ] [Real]Absence check using state equation in 2528 ms returned sat
[2022-05-19 22:53:57] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 22:53:57] [INFO ] [Nat]Absence check using 32 positive place invariants in 53 ms returned sat
[2022-05-19 22:53:58] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 518 ms returned sat
[2022-05-19 22:53:58] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 22:53:59] [INFO ] [Nat]Absence check using state equation in 979 ms returned sat
[2022-05-19 22:53:59] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 35 ms.
[2022-05-19 22:54:01] [INFO ] Added : 119 causal constraints over 24 iterations in 1814 ms. Result :sat
Minimization took 449 ms.
[2022-05-19 22:54:02] [INFO ] [Real]Absence check using 32 positive place invariants in 57 ms returned sat
[2022-05-19 22:54:02] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 520 ms returned sat
[2022-05-19 22:54:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 22:54:03] [INFO ] [Real]Absence check using state equation in 1154 ms returned sat
[2022-05-19 22:54:03] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 32 ms.
[2022-05-19 22:54:05] [INFO ] Added : 122 causal constraints over 25 iterations in 2097 ms. Result :sat
Minimization took 267 ms.
[2022-05-19 22:54:06] [INFO ] [Real]Absence check using 32 positive place invariants in 50 ms returned sat
[2022-05-19 22:54:07] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 510 ms returned sat
[2022-05-19 22:54:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 22:54:08] [INFO ] [Real]Absence check using state equation in 931 ms returned sat
[2022-05-19 22:54:08] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 36 ms.
[2022-05-19 22:54:10] [INFO ] Added : 135 causal constraints over 27 iterations in 2305 ms. Result :sat
Minimization took 592 ms.
[2022-05-19 22:54:11] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 22:54:11] [INFO ] [Nat]Absence check using 32 positive place invariants in 53 ms returned sat
[2022-05-19 22:54:12] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 540 ms returned sat
[2022-05-19 22:54:12] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 22:54:13] [INFO ] [Nat]Absence check using state equation in 967 ms returned sat
[2022-05-19 22:54:13] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 46 ms.
[2022-05-19 22:54:15] [INFO ] Added : 135 causal constraints over 27 iterations in 1988 ms. Result :sat
Minimization took 677 ms.
[2022-05-19 22:54:16] [INFO ] [Real]Absence check using 32 positive place invariants in 58 ms returned sat
[2022-05-19 22:54:16] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 511 ms returned sat
[2022-05-19 22:54:16] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 22:54:20] [INFO ] [Real]Absence check using state equation in 3327 ms returned sat
[2022-05-19 22:54:20] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 22:54:20] [INFO ] [Nat]Absence check using 32 positive place invariants in 60 ms returned sat
[2022-05-19 22:54:20] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 509 ms returned sat
[2022-05-19 22:54:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 22:54:22] [INFO ] [Nat]Absence check using state equation in 1873 ms returned sat
[2022-05-19 22:54:22] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 27 ms.
[2022-05-19 22:54:23] [INFO ] Added : 63 causal constraints over 13 iterations in 1042 ms. Result :sat
Minimization took 415 ms.
[2022-05-19 22:54:24] [INFO ] [Real]Absence check using 32 positive place invariants in 48 ms returned sat
[2022-05-19 22:54:25] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 510 ms returned sat
[2022-05-19 22:54:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 22:54:26] [INFO ] [Real]Absence check using state equation in 1494 ms returned sat
[2022-05-19 22:54:26] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 22:54:27] [INFO ] [Nat]Absence check using 32 positive place invariants in 50 ms returned sat
[2022-05-19 22:54:27] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 514 ms returned sat
[2022-05-19 22:54:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 22:54:28] [INFO ] [Nat]Absence check using state equation in 1413 ms returned sat
[2022-05-19 22:54:29] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 31 ms.
[2022-05-19 22:54:30] [INFO ] Added : 64 causal constraints over 13 iterations in 1087 ms. Result :sat
Minimization took 203 ms.
[2022-05-19 22:54:30] [INFO ] [Real]Absence check using 32 positive place invariants in 48 ms returned sat
[2022-05-19 22:54:31] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 514 ms returned sat
[2022-05-19 22:54:31] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 22:54:32] [INFO ] [Real]Absence check using state equation in 913 ms returned unsat
[2022-05-19 22:54:32] [INFO ] [Real]Absence check using 32 positive place invariants in 49 ms returned sat
[2022-05-19 22:54:32] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 504 ms returned unsat
[2022-05-19 22:54:33] [INFO ] [Real]Absence check using 32 positive place invariants in 49 ms returned sat
[2022-05-19 22:54:33] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 523 ms returned sat
[2022-05-19 22:54:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 22:54:37] [INFO ] [Real]Absence check using state equation in 4183 ms returned unknown
[2022-05-19 22:54:38] [INFO ] [Real]Absence check using 32 positive place invariants in 50 ms returned sat
[2022-05-19 22:54:38] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 514 ms returned sat
[2022-05-19 22:54:38] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 22:54:40] [INFO ] [Real]Absence check using state equation in 1851 ms returned sat
[2022-05-19 22:54:40] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 22:54:40] [INFO ] [Nat]Absence check using 32 positive place invariants in 49 ms returned sat
[2022-05-19 22:54:41] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 527 ms returned sat
[2022-05-19 22:54:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 22:54:43] [INFO ] [Nat]Absence check using state equation in 1876 ms returned sat
[2022-05-19 22:54:43] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 28 ms.
[2022-05-19 22:54:44] [INFO ] Added : 59 causal constraints over 12 iterations in 985 ms. Result :sat
Minimization took 206 ms.
[2022-05-19 22:54:45] [INFO ] [Real]Absence check using 32 positive place invariants in 48 ms returned sat
[2022-05-19 22:54:45] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 516 ms returned sat
[2022-05-19 22:54:45] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 22:54:46] [INFO ] [Real]Absence check using state equation in 1059 ms returned sat
[2022-05-19 22:54:46] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 22:54:46] [INFO ] [Nat]Absence check using 32 positive place invariants in 53 ms returned sat
[2022-05-19 22:54:47] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 489 ms returned sat
[2022-05-19 22:54:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 22:54:51] [INFO ] [Nat]Absence check using state equation in 3621 ms returned sat
[2022-05-19 22:54:51] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 30 ms.
[2022-05-19 22:54:51] [INFO ] Added : 35 causal constraints over 7 iterations in 532 ms. Result :unknown
[2022-05-19 22:54:51] [INFO ] [Real]Absence check using 32 positive place invariants in 48 ms returned sat
[2022-05-19 22:54:52] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 514 ms returned sat
[2022-05-19 22:54:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 22:54:53] [INFO ] [Real]Absence check using state equation in 1097 ms returned sat
[2022-05-19 22:54:53] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 22:54:53] [INFO ] [Nat]Absence check using 32 positive place invariants in 50 ms returned sat
[2022-05-19 22:54:54] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 522 ms returned sat
[2022-05-19 22:54:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 22:54:55] [INFO ] [Nat]Absence check using state equation in 965 ms returned sat
[2022-05-19 22:54:55] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 27 ms.
[2022-05-19 22:54:57] [INFO ] Added : 121 causal constraints over 25 iterations in 1900 ms. Result :sat
Minimization took 203 ms.
[2022-05-19 22:54:57] [INFO ] [Real]Absence check using 32 positive place invariants in 51 ms returned sat
[2022-05-19 22:54:58] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 506 ms returned sat
[2022-05-19 22:54:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 22:54:59] [INFO ] [Real]Absence check using state equation in 1028 ms returned sat
[2022-05-19 22:54:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 22:54:59] [INFO ] [Nat]Absence check using 32 positive place invariants in 48 ms returned sat
[2022-05-19 22:55:00] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 543 ms returned sat
[2022-05-19 22:55:00] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 22:55:01] [INFO ] [Nat]Absence check using state equation in 1417 ms returned sat
[2022-05-19 22:55:01] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 29 ms.
[2022-05-19 22:55:03] [INFO ] Added : 119 causal constraints over 24 iterations in 1929 ms. Result :sat
Minimization took 199 ms.
[2022-05-19 22:55:04] [INFO ] [Real]Absence check using 32 positive place invariants in 49 ms returned sat
[2022-05-19 22:55:04] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 523 ms returned sat
[2022-05-19 22:55:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 22:55:06] [INFO ] [Real]Absence check using state equation in 1093 ms returned sat
[2022-05-19 22:55:06] [INFO ] Solution in real domain found non-integer solution.
[2022-05-19 22:55:06] [INFO ] [Nat]Absence check using 32 positive place invariants in 48 ms returned sat
[2022-05-19 22:55:06] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 513 ms returned sat
[2022-05-19 22:55:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-19 22:55:07] [INFO ] [Nat]Absence check using state equation in 948 ms returned sat
[2022-05-19 22:55:08] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 51 ms.
[2022-05-19 22:55:09] [INFO ] Added : 121 causal constraints over 25 iterations in 1925 ms. Result :sat
Minimization took 208 ms.
Current structural bounds on expressions (after SMT) : [1, 841, 841, -1, -1, 1, 29, 29, 29, -1, -1, 29, 29, 29] Max seen :[0, 0, 0, 0, 0, 0, 29, 29, 0, 0, 0, 0, 0, 0]
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-07 29 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-06 29 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 120 out of 2998 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2998/2998 places, 446/446 transitions.
Graph (complete) has 30318 edges and 2998 vertex of which 2935 are kept as prefixes of interest. Removing 63 places using SCC suffix rule.21 ms
Discarding 63 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 148 transitions
Reduce isomorphic transitions removed 148 transitions.
Discarding 57 places :
Implicit places reduction removed 57 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 206 rules applied. Total rules applied 207 place count 2878 transition count 295
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 208 place count 2877 transition count 295
Performed 58 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 58 Pre rules applied. Total rules applied 208 place count 2877 transition count 237
Deduced a syphon composed of 58 places in 1 ms
Ensure Unique test removed 57 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 173 rules applied. Total rules applied 381 place count 2762 transition count 237
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 381 place count 2762 transition count 236
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 2 with 3 rules applied. Total rules applied 384 place count 2760 transition count 236
Applied a total of 384 rules in 447 ms. Remains 2760 /2998 variables (removed 238) and now considering 236/446 (removed 210) transitions.
Finished structural reductions, in 1 iterations. Remains : 2760/2998 places, 236/446 transitions.
// Phase 1: matrix 236 rows 2760 cols
[2022-05-19 22:55:12] [INFO ] Computed 2524 place invariants in 8 ms
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-02 29 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 1000000 steps, including 12815 resets, run finished after 10113 ms. (steps per millisecond=98 ) properties (out of 7) seen :84
Finished Best-First random walk after 755505 steps, including 430 resets, run visited all 7 properties in 5001 ms. (steps per millisecond=151 )
Finished Best-First random walk after 935678 steps, including 641 resets, run visited all 7 properties in 5001 ms. (steps per millisecond=187 )
Interrupted Best-First random walk after 969053 steps, including 686 resets, run timeout after 5001 ms. (steps per millisecond=193 ) properties seen 51
Finished Best-First random walk after 721003 steps, including 322 resets, run visited all 7 properties in 5001 ms. (steps per millisecond=144 )
Incomplete Best-First random walk after 1000001 steps, including 708 resets, run finished after 4718 ms. (steps per millisecond=211 ) properties (out of 7) seen :51
Incomplete Best-First random walk after 1000001 steps, including 690 resets, run finished after 4802 ms. (steps per millisecond=208 ) properties (out of 7) seen :84
Incomplete Best-First random walk after 1000001 steps, including 691 resets, run finished after 4779 ms. (steps per millisecond=209 ) properties (out of 7) seen :83
// Phase 1: matrix 236 rows 2760 cols
[2022-05-19 22:55:56] [INFO ] Computed 2524 place invariants in 17 ms
[2022-05-19 22:55:57] [INFO ] [Real]Absence check using 867 positive place invariants in 199 ms returned sat
[2022-05-19 22:55:57] [INFO ] [Real]Absence check using 867 positive and 1657 generalized place invariants in 349 ms returned sat
[2022-05-19 22:55:57] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 22:56:00] [INFO ] [Real]Absence check using state equation in 2776 ms returned unsat
[2022-05-19 22:56:00] [INFO ] [Real]Absence check using 867 positive place invariants in 185 ms returned sat
[2022-05-19 22:56:01] [INFO ] [Real]Absence check using 867 positive and 1657 generalized place invariants in 339 ms returned sat
[2022-05-19 22:56:01] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 22:56:05] [INFO ] [Real]Absence check using state equation in 4559 ms returned unsat
[2022-05-19 22:56:06] [INFO ] [Real]Absence check using 867 positive place invariants in 199 ms returned sat
[2022-05-19 22:56:06] [INFO ] [Real]Absence check using 867 positive and 1657 generalized place invariants in 336 ms returned unsat
[2022-05-19 22:56:06] [INFO ] [Real]Absence check using 867 positive place invariants in 175 ms returned sat
[2022-05-19 22:56:07] [INFO ] [Real]Absence check using 867 positive and 1657 generalized place invariants in 312 ms returned sat
[2022-05-19 22:56:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 22:56:10] [INFO ] [Real]Absence check using state equation in 3095 ms returned unsat
[2022-05-19 22:56:10] [INFO ] [Real]Absence check using 867 positive place invariants in 201 ms returned sat
[2022-05-19 22:56:10] [INFO ] [Real]Absence check using 867 positive and 1657 generalized place invariants in 98 ms returned unsat
[2022-05-19 22:56:11] [INFO ] [Real]Absence check using 867 positive place invariants in 190 ms returned sat
[2022-05-19 22:56:11] [INFO ] [Real]Absence check using 867 positive and 1657 generalized place invariants in 346 ms returned sat
[2022-05-19 22:56:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 22:56:12] [INFO ] [Real]Absence check using state equation in 545 ms returned unsat
[2022-05-19 22:56:12] [INFO ] [Real]Absence check using 867 positive place invariants in 190 ms returned sat
[2022-05-19 22:56:12] [INFO ] [Real]Absence check using 867 positive and 1657 generalized place invariants in 343 ms returned sat
[2022-05-19 22:56:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-19 22:56:13] [INFO ] [Real]Absence check using state equation in 622 ms returned unsat
Current structural bounds on expressions (after SMT) : [29, 29, 29, 1, 1, 1, 1] Max seen :[29, 29, 29, 1, 1, 1, 1]
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-04 29 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-03 29 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-01 29 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 149972 ms.

BK_STOP 1653000973503

--------------------
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-28"
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-28, 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-165277017500997"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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