fond
Model Checking Contest 2021
11th edition, Paris, France, June 23, 2021
Execution of r178-tajo-162089415200099
Last Updated
Jun 28, 2021

About the Execution of ITS-Tools for QuasiCertifProtocol-PT-22

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
2486.336 103003.00 130484.00 143.00 23 1 13 1 23 23 529 1 1 1 1 1 1 1 1 1 normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2021-input.r178-tajo-162089415200099.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2021-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
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 r178-tajo-162089415200099
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.7M
-rw-r--r-- 1 mcc users 384K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 2.3M May 10 09:43 CTLCardinality.xml
-rw-r--r-- 1 mcc users 78K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 476K May 10 09:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 43K Mar 28 16:28 LTLCardinality.txt
-rw-r--r-- 1 mcc users 180K Mar 28 16:28 LTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Mar 28 16:28 LTLFireability.txt
-rw-r--r-- 1 mcc users 40K Mar 28 16:28 LTLFireability.xml
-rw-r--r-- 1 mcc users 25K Mar 27 10:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Mar 27 10:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Mar 25 13:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 31K Mar 25 13:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 8.4K Mar 22 08:13 UpperBounds.txt
-rw-r--r-- 1 mcc users 22K Mar 22 08:13 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 5 16:51 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:51 instance
-rw-r--r-- 1 mcc users 6 May 5 16:51 iscolored
-rw-r--r-- 1 mcc users 949K May 5 16:51 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 1621235880195

Running Version 0
[2021-05-17 07:18:03] [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]
[2021-05-17 07:18:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-17 07:18:03] [INFO ] Load time of PNML (sax parser for PT used): 154 ms
[2021-05-17 07:18:03] [INFO ] Transformed 1966 places.
[2021-05-17 07:18:03] [INFO ] Transformed 356 transitions.
[2021-05-17 07:18:03] [INFO ] Parsed PT model containing 1966 places and 356 transitions in 229 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 27 ms.
// Phase 1: matrix 356 rows 1966 cols
[2021-05-17 07:18:03] [INFO ] Computed 1611 place invariants in 101 ms
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 370 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 15) seen :47
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 14) seen :46
Incomplete Best-First random walk after 10001 steps, including 21 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 12 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :46
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 14) seen :46
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 14) seen :46
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 14) seen :46
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 14) seen :46
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 14) seen :46
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 14) seen :46
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 14) seen :46
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 14) seen :46
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 14) seen :46
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 14) seen :46
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 14) seen :46
// Phase 1: matrix 356 rows 1966 cols
[2021-05-17 07:18:04] [INFO ] Computed 1611 place invariants in 80 ms
[2021-05-17 07:18:05] [INFO ] [Real]Absence check using 3 positive place invariants in 36 ms returned sat
[2021-05-17 07:18:05] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 339 ms returned sat
[2021-05-17 07:18:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:18:06] [INFO ] [Real]Absence check using state equation in 872 ms returned sat
[2021-05-17 07:18:06] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:18:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 44 ms returned sat
[2021-05-17 07:18:07] [INFO ] [Nat]Absence check using 3 positive and 1608 generalized place invariants in 581 ms returned sat
[2021-05-17 07:18:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:18:08] [INFO ] [Nat]Absence check using state equation in 646 ms returned sat
[2021-05-17 07:18:08] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 68 ms.
[2021-05-17 07:18:10] [INFO ] Added : 97 causal constraints over 20 iterations in 1961 ms. Result :sat
Minimization took 234 ms.
[2021-05-17 07:18:11] [INFO ] [Real]Absence check using 3 positive place invariants in 58 ms returned sat
[2021-05-17 07:18:11] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 661 ms returned sat
[2021-05-17 07:18:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:18:12] [INFO ] [Real]Absence check using state equation in 1142 ms returned sat
[2021-05-17 07:18:13] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:18:13] [INFO ] [Nat]Absence check using 3 positive place invariants in 19 ms returned sat
[2021-05-17 07:18:13] [INFO ] [Nat]Absence check using 3 positive and 1608 generalized place invariants in 281 ms returned sat
[2021-05-17 07:18:13] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:18:14] [INFO ] [Nat]Absence check using state equation in 682 ms returned sat
[2021-05-17 07:18:14] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 41 ms.
[2021-05-17 07:18:15] [INFO ] Added : 96 causal constraints over 20 iterations in 1389 ms. Result :sat
Minimization took 325 ms.
[2021-05-17 07:18:16] [INFO ] [Real]Absence check using 3 positive place invariants in 18 ms returned unsat
[2021-05-17 07:18:16] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned unsat
[2021-05-17 07:18:16] [INFO ] [Real]Absence check using 3 positive place invariants in 15 ms returned sat
[2021-05-17 07:18:17] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 342 ms returned sat
[2021-05-17 07:18:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:18:21] [INFO ] [Real]Absence check using state equation in 4432 ms returned unknown
[2021-05-17 07:18:21] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2021-05-17 07:18:22] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 286 ms returned sat
[2021-05-17 07:18:22] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:18:22] [INFO ] [Real]Absence check using state equation in 498 ms returned sat
[2021-05-17 07:18:22] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:18:22] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2021-05-17 07:18:23] [INFO ] [Nat]Absence check using 3 positive and 1608 generalized place invariants in 273 ms returned sat
[2021-05-17 07:18:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:18:23] [INFO ] [Nat]Absence check using state equation in 484 ms returned sat
[2021-05-17 07:18:23] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 29 ms.
[2021-05-17 07:18:24] [INFO ] Added : 23 causal constraints over 5 iterations in 461 ms. Result :sat
Minimization took 123 ms.
[2021-05-17 07:18:24] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2021-05-17 07:18:24] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 291 ms returned sat
[2021-05-17 07:18:24] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:18:25] [INFO ] [Real]Absence check using state equation in 495 ms returned sat
[2021-05-17 07:18:25] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:18:25] [INFO ] [Nat]Absence check using 3 positive place invariants in 22 ms returned sat
[2021-05-17 07:18:26] [INFO ] [Nat]Absence check using 3 positive and 1608 generalized place invariants in 344 ms returned sat
[2021-05-17 07:18:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:18:26] [INFO ] [Nat]Absence check using state equation in 696 ms returned sat
[2021-05-17 07:18:27] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 59 ms.
[2021-05-17 07:18:28] [INFO ] Added : 95 causal constraints over 19 iterations in 1472 ms. Result :sat
Minimization took 136 ms.
[2021-05-17 07:18:28] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2021-05-17 07:18:29] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 426 ms returned sat
[2021-05-17 07:18:29] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:18:30] [INFO ] [Real]Absence check using state equation in 1141 ms returned sat
[2021-05-17 07:18:30] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:18:30] [INFO ] [Nat]Absence check using 3 positive place invariants in 19 ms returned sat
[2021-05-17 07:18:31] [INFO ] [Nat]Absence check using 3 positive and 1608 generalized place invariants in 455 ms returned sat
[2021-05-17 07:18:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:18:32] [INFO ] [Nat]Absence check using state equation in 857 ms returned sat
[2021-05-17 07:18:32] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 73 ms.
[2021-05-17 07:18:33] [INFO ] Added : 109 causal constraints over 22 iterations in 1666 ms. Result :sat
Minimization took 178 ms.
[2021-05-17 07:18:34] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2021-05-17 07:18:34] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 287 ms returned sat
[2021-05-17 07:18:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:18:35] [INFO ] [Real]Absence check using state equation in 473 ms returned sat
[2021-05-17 07:18:35] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:18:35] [INFO ] [Nat]Absence check using 3 positive place invariants in 13 ms returned sat
[2021-05-17 07:18:35] [INFO ] [Nat]Absence check using 3 positive and 1608 generalized place invariants in 287 ms returned sat
[2021-05-17 07:18:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:18:36] [INFO ] [Nat]Absence check using state equation in 547 ms returned sat
[2021-05-17 07:18:36] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 67 ms.
[2021-05-17 07:18:37] [INFO ] Added : 96 causal constraints over 20 iterations in 1540 ms. Result :sat
Minimization took 148 ms.
[2021-05-17 07:18:38] [INFO ] [Real]Absence check using 3 positive place invariants in 30 ms returned sat
[2021-05-17 07:18:39] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 534 ms returned sat
[2021-05-17 07:18:39] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:18:40] [INFO ] [Real]Absence check using state equation in 836 ms returned sat
[2021-05-17 07:18:40] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:18:40] [INFO ] [Nat]Absence check using 3 positive place invariants in 20 ms returned sat
[2021-05-17 07:18:40] [INFO ] [Nat]Absence check using 3 positive and 1608 generalized place invariants in 489 ms returned sat
[2021-05-17 07:18:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:18:42] [INFO ] [Nat]Absence check using state equation in 1210 ms returned sat
[2021-05-17 07:18:42] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 33 ms.
[2021-05-17 07:18:43] [INFO ] Added : 96 causal constraints over 20 iterations in 1375 ms. Result :sat
Minimization took 122 ms.
[2021-05-17 07:18:44] [INFO ] [Real]Absence check using 3 positive place invariants in 20 ms returned sat
[2021-05-17 07:18:44] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 525 ms returned sat
[2021-05-17 07:18:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:18:45] [INFO ] [Real]Absence check using state equation in 852 ms returned sat
[2021-05-17 07:18:45] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:18:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 39 ms returned sat
[2021-05-17 07:18:46] [INFO ] [Nat]Absence check using 3 positive and 1608 generalized place invariants in 345 ms returned sat
[2021-05-17 07:18:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:18:46] [INFO ] [Nat]Absence check using state equation in 772 ms returned sat
[2021-05-17 07:18:47] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 61 ms.
[2021-05-17 07:18:48] [INFO ] Added : 100 causal constraints over 20 iterations in 1513 ms. Result :sat
Minimization took 168 ms.
[2021-05-17 07:18:49] [INFO ] [Real]Absence check using 3 positive place invariants in 36 ms returned sat
[2021-05-17 07:18:49] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 290 ms returned sat
[2021-05-17 07:18:49] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:18:50] [INFO ] [Real]Absence check using state equation in 818 ms returned sat
[2021-05-17 07:18:50] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:18:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2021-05-17 07:18:50] [INFO ] [Nat]Absence check using 3 positive and 1608 generalized place invariants in 284 ms returned sat
[2021-05-17 07:18:50] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:18:51] [INFO ] [Nat]Absence check using state equation in 676 ms returned sat
[2021-05-17 07:18:51] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 79 ms.
[2021-05-17 07:18:53] [INFO ] Added : 100 causal constraints over 20 iterations in 1474 ms. Result :sat
Minimization took 166 ms.
[2021-05-17 07:18:53] [INFO ] [Real]Absence check using 3 positive place invariants in 23 ms returned sat
[2021-05-17 07:18:53] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 368 ms returned sat
[2021-05-17 07:18:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:18:54] [INFO ] [Real]Absence check using state equation in 591 ms returned sat
[2021-05-17 07:18:54] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:18:54] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2021-05-17 07:18:54] [INFO ] [Nat]Absence check using 3 positive and 1608 generalized place invariants in 269 ms returned sat
[2021-05-17 07:18:54] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:18:55] [INFO ] [Nat]Absence check using state equation in 479 ms returned sat
[2021-05-17 07:18:55] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 23 ms.
[2021-05-17 07:18:57] [INFO ] Added : 109 causal constraints over 22 iterations in 1687 ms. Result :sat
Minimization took 199 ms.
[2021-05-17 07:18:57] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2021-05-17 07:18:58] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 487 ms returned sat
[2021-05-17 07:18:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:18:59] [INFO ] [Real]Absence check using state equation in 826 ms returned sat
[2021-05-17 07:18:59] [INFO ] Solution in real domain found non-integer solution.
[2021-05-17 07:18:59] [INFO ] [Nat]Absence check using 3 positive place invariants in 14 ms returned sat
[2021-05-17 07:18:59] [INFO ] [Nat]Absence check using 3 positive and 1608 generalized place invariants in 280 ms returned sat
[2021-05-17 07:18:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-17 07:19:00] [INFO ] [Nat]Absence check using state equation in 499 ms returned sat
[2021-05-17 07:19:00] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 30 ms.
[2021-05-17 07:19:01] [INFO ] Added : 109 causal constraints over 22 iterations in 1470 ms. Result :sat
Minimization took 112 ms.
Current structural bounds on expressions (after SMT) : [529, 13, 23, 23, -1, 1, -1, 23, -1, -1, 23, 23, 23, 23] Max seen :[0, 0, 23, 23, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0]
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-05 23 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-04 23 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Incomplete Parikh walk after 14700 steps, including 181 resets, run finished after 360 ms. (steps per millisecond=40 ) properties (out of 12) seen :550 could not realise parikh vector
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-02 13 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Incomplete Parikh walk after 14700 steps, including 185 resets, run finished after 297 ms. (steps per millisecond=49 ) properties (out of 10) seen :536 could not realise parikh vector
Incomplete Parikh walk after 13900 steps, including 165 resets, run finished after 251 ms. (steps per millisecond=55 ) properties (out of 10) seen :540 could not realise parikh vector
Incomplete Parikh walk after 13900 steps, including 163 resets, run finished after 206 ms. (steps per millisecond=67 ) properties (out of 10) seen :541 could not realise parikh vector
Incomplete Parikh walk after 13400 steps, including 139 resets, run finished after 193 ms. (steps per millisecond=69 ) properties (out of 10) seen :534 could not realise parikh vector
Incomplete Parikh walk after 13200 steps, including 161 resets, run finished after 176 ms. (steps per millisecond=75 ) properties (out of 10) seen :533 could not realise parikh vector
Incomplete Parikh walk after 14700 steps, including 182 resets, run finished after 236 ms. (steps per millisecond=62 ) properties (out of 10) seen :536 could not realise parikh vector
Incomplete Parikh walk after 10300 steps, including 140 resets, run finished after 128 ms. (steps per millisecond=80 ) properties (out of 10) seen :116 could not realise parikh vector
Incomplete Parikh walk after 2500 steps, including 94 resets, run finished after 25 ms. (steps per millisecond=100 ) properties (out of 10) seen :0 could not realise parikh vector
Incomplete Parikh walk after 14500 steps, including 139 resets, run finished after 340 ms. (steps per millisecond=42 ) properties (out of 10) seen :534 could not realise parikh vector
Incomplete Parikh walk after 16600 steps, including 164 resets, run finished after 441 ms. (steps per millisecond=37 ) properties (out of 10) seen :560 could not realise parikh vector
Support contains 556 out of 1966 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 1966/1966 places, 356/356 transitions.
Graph (complete) has 16044 edges and 1966 vertex of which 1458 are kept as prefixes of interest. Removing 508 places using SCC suffix rule.28 ms
Discarding 508 places :
Also discarding 40 output transitions
Drop transitions removed 40 transitions
Drop transitions removed 146 transitions
Reduce isomorphic transitions removed 146 transitions.
Discarding 46 places :
Implicit places reduction removed 46 places
Drop transitions removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 217 rules applied. Total rules applied 218 place count 1412 transition count 145
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 1 with 25 rules applied. Total rules applied 243 place count 1387 transition count 145
Performed 46 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 46 Pre rules applied. Total rules applied 243 place count 1387 transition count 99
Deduced a syphon composed of 46 places in 0 ms
Ensure Unique test removed 68 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 403 place count 1273 transition count 99
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 404 place count 1273 transition count 98
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 405 place count 1272 transition count 98
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 405 place count 1272 transition count 97
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 4 with 3 rules applied. Total rules applied 408 place count 1270 transition count 97
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Ensure Unique test removed 506 places
Reduce places removed 529 places and 0 transitions.
Iterating global reduction 4 with 552 rules applied. Total rules applied 960 place count 741 transition count 74
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 961 place count 740 transition count 73
Ensure Unique test removed 23 places
Iterating post reduction 4 with 23 rules applied. Total rules applied 984 place count 717 transition count 73
Applied a total of 984 rules in 477 ms. Remains 717 /1966 variables (removed 1249) and now considering 73/356 (removed 283) transitions.
Finished structural reductions, in 1 iterations. Remains : 717/1966 places, 73/356 transitions.
// Phase 1: matrix 73 rows 717 cols
[2021-05-17 07:19:05] [INFO ] Computed 644 place invariants in 2 ms
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-06 529 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-00 23 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 1000000 steps, including 13513 resets, run finished after 12300 ms. (steps per millisecond=81 ) properties (out of 5) seen :5
Interrupted Best-First random walk after 988965 steps, including 960 resets, run timeout after 5001 ms. (steps per millisecond=197 ) properties seen :{0=1, 1=1, 2=1, 3=1, 4=1}
Incomplete Best-First random walk after 1000001 steps, including 971 resets, run finished after 4876 ms. (steps per millisecond=205 ) properties (out of 5) seen :5
Incomplete Best-First random walk after 1000001 steps, including 971 resets, run finished after 4870 ms. (steps per millisecond=205 ) properties (out of 5) seen :5
Incomplete Best-First random walk after 1000001 steps, including 970 resets, run finished after 4614 ms. (steps per millisecond=216 ) properties (out of 5) seen :5
Incomplete Best-First random walk after 1000001 steps, including 970 resets, run finished after 4369 ms. (steps per millisecond=228 ) properties (out of 5) seen :5
// Phase 1: matrix 73 rows 717 cols
[2021-05-17 07:19:41] [INFO ] Computed 644 place invariants in 2 ms
[2021-05-17 07:19:41] [INFO ] [Real]Absence check using 552 positive place invariants in 157 ms returned sat
[2021-05-17 07:19:41] [INFO ] [Real]Absence check using 552 positive and 92 generalized place invariants in 18 ms returned sat
[2021-05-17 07:19:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:19:41] [INFO ] [Real]Absence check using state equation in 23 ms returned unsat
[2021-05-17 07:19:41] [INFO ] [Real]Absence check using 552 positive place invariants in 119 ms returned sat
[2021-05-17 07:19:41] [INFO ] [Real]Absence check using 552 positive and 92 generalized place invariants in 20 ms returned sat
[2021-05-17 07:19:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:19:41] [INFO ] [Real]Absence check using state equation in 37 ms returned unsat
[2021-05-17 07:19:41] [INFO ] [Real]Absence check using 552 positive place invariants in 118 ms returned sat
[2021-05-17 07:19:41] [INFO ] [Real]Absence check using 552 positive and 92 generalized place invariants in 19 ms returned sat
[2021-05-17 07:19:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:19:42] [INFO ] [Real]Absence check using state equation in 36 ms returned unsat
[2021-05-17 07:19:42] [INFO ] [Real]Absence check using 552 positive place invariants in 101 ms returned sat
[2021-05-17 07:19:42] [INFO ] [Real]Absence check using 552 positive and 92 generalized place invariants in 15 ms returned sat
[2021-05-17 07:19:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:19:42] [INFO ] [Real]Absence check using state equation in 27 ms returned unsat
[2021-05-17 07:19:42] [INFO ] [Real]Absence check using 552 positive place invariants in 93 ms returned sat
[2021-05-17 07:19:42] [INFO ] [Real]Absence check using 552 positive and 92 generalized place invariants in 15 ms returned sat
[2021-05-17 07:19:42] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-17 07:19:42] [INFO ] [Real]Absence check using state equation in 18 ms returned unsat
Current structural bounds on expressions (after SMT) : [1, 1, 1, 1, 1] Max seen :[1, 1, 1, 1, 1]
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.

BK_STOP 1621235983198

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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 r178-tajo-162089415200099"
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 ;