Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r297-tall-167873951100893.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is QuasiCertifProtocol-PT-22, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r297-tall-167873951100893
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.2M
-rw-r--r-- 1 mcc users 33K Feb 26 01:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 225K Feb 26 01:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 15K Feb 26 01:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K Feb 26 01:27 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 49K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 214K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 31K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 102K Feb 26 01:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 667K Feb 26 01:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 20K Feb 26 01:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 117K Feb 26 01:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 8.0K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 503K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME QuasiCertifProtocol-PT-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 1679673924243

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-22
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-24 16:05:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -timeout, 360, -rebuildPNML]
[2023-03-24 16:05:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-24 16:05:26] [INFO ] Load time of PNML (sax parser for PT used): 101 ms
[2023-03-24 16:05:26] [INFO ] Transformed 1966 places.
[2023-03-24 16:05:26] [INFO ] Transformed 356 transitions.
[2023-03-24 16:05:26] [INFO ] Parsed PT model containing 1966 places and 356 transitions and 4323 arcs in 182 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 12 ms.
// Phase 1: matrix 356 rows 1966 cols
[2023-03-24 16:05:26] [INFO ] Computed 1611 place invariants in 125 ms
Incomplete random walk after 10000 steps, including 370 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 16) seen :49
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 14) seen :47
Incomplete Best-First random walk after 10001 steps, including 24 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 14) seen :47
Incomplete Best-First random walk after 10000 steps, including 24 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 14) seen :47
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 14) seen :47
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 14) seen :47
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 14) seen :47
Incomplete Best-First random walk after 10001 steps, including 20 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 23 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 24 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 23 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 14) seen :47
Incomplete Best-First random walk after 10001 steps, including 23 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 14) seen :47
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 14) seen :47
Incomplete Best-First random walk after 10001 steps, including 22 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 14) seen :47
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 14) seen :47
[2023-03-24 16:05:27] [INFO ] Invariant cache hit.
[2023-03-24 16:05:27] [INFO ] [Real]Absence check using 3 positive place invariants in 23 ms returned unsat
[2023-03-24 16:05:27] [INFO ] [Real]Absence check using 3 positive place invariants in 18 ms returned sat
[2023-03-24 16:05:28] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 370 ms returned sat
[2023-03-24 16:05:28] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 16:05:29] [INFO ] [Real]Absence check using state equation in 1077 ms returned sat
[2023-03-24 16:05:29] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 16:05:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 22 ms returned sat
[2023-03-24 16:05:30] [INFO ] [Nat]Absence check using 3 positive and 1608 generalized place invariants in 387 ms returned sat
[2023-03-24 16:05:30] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 16:05:31] [INFO ] [Nat]Absence check using state equation in 1048 ms returned sat
[2023-03-24 16:05:31] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 35 ms.
[2023-03-24 16:05:32] [INFO ] Added : 95 causal constraints over 19 iterations in 1210 ms. Result :sat
Minimization took 172 ms.
[2023-03-24 16:05:33] [INFO ] [Real]Absence check using 3 positive place invariants in 30 ms returned sat
[2023-03-24 16:05:33] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 346 ms returned sat
[2023-03-24 16:05:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 16:05:34] [INFO ] [Real]Absence check using state equation in 950 ms returned sat
[2023-03-24 16:05:34] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 16:05:34] [INFO ] [Nat]Absence check using 3 positive place invariants in 16 ms returned sat
[2023-03-24 16:05:35] [INFO ] [Nat]Absence check using 3 positive and 1608 generalized place invariants in 341 ms returned sat
[2023-03-24 16:05:35] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 16:05:35] [INFO ] [Nat]Absence check using state equation in 599 ms returned sat
[2023-03-24 16:05:35] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 30 ms.
[2023-03-24 16:05:36] [INFO ] Added : 47 causal constraints over 10 iterations in 595 ms. Result :sat
Minimization took 106 ms.
[2023-03-24 16:05:36] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2023-03-24 16:05:37] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 344 ms returned sat
[2023-03-24 16:05:37] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 16:05:37] [INFO ] [Real]Absence check using state equation in 597 ms returned sat
[2023-03-24 16:05:37] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 16:05:37] [INFO ] [Nat]Absence check using 3 positive place invariants in 17 ms returned sat
[2023-03-24 16:05:38] [INFO ] [Nat]Absence check using 3 positive and 1608 generalized place invariants in 334 ms returned sat
[2023-03-24 16:05:38] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 16:05:38] [INFO ] [Nat]Absence check using state equation in 595 ms returned sat
[2023-03-24 16:05:39] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 35 ms.
[2023-03-24 16:05:39] [INFO ] Added : 73 causal constraints over 15 iterations in 835 ms. Result :sat
Minimization took 165 ms.
[2023-03-24 16:05:40] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2023-03-24 16:05:40] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 333 ms returned sat
[2023-03-24 16:05:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 16:05:41] [INFO ] [Real]Absence check using state equation in 605 ms returned sat
[2023-03-24 16:05:41] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 16:05:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 17 ms returned sat
[2023-03-24 16:05:41] [INFO ] [Nat]Absence check using 3 positive and 1608 generalized place invariants in 338 ms returned sat
[2023-03-24 16:05:41] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 16:05:42] [INFO ] [Nat]Absence check using state equation in 666 ms returned sat
[2023-03-24 16:05:42] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 32 ms.
[2023-03-24 16:05:43] [INFO ] Added : 71 causal constraints over 15 iterations in 844 ms. Result :sat
Minimization took 170 ms.
[2023-03-24 16:05:43] [INFO ] [Real]Absence check using 3 positive place invariants in 15 ms returned sat
[2023-03-24 16:05:44] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 355 ms returned unsat
[2023-03-24 16:05:44] [INFO ] [Real]Absence check using 3 positive place invariants in 21 ms returned sat
[2023-03-24 16:05:44] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 301 ms returned sat
[2023-03-24 16:05:44] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 16:05:45] [INFO ] [Real]Absence check using state equation in 645 ms returned sat
[2023-03-24 16:05:45] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 16:05:45] [INFO ] [Nat]Absence check using 3 positive place invariants in 20 ms returned sat
[2023-03-24 16:05:46] [INFO ] [Nat]Absence check using 3 positive and 1608 generalized place invariants in 295 ms returned sat
[2023-03-24 16:05:46] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 16:05:46] [INFO ] [Nat]Absence check using state equation in 598 ms returned sat
[2023-03-24 16:05:46] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 32 ms.
[2023-03-24 16:05:47] [INFO ] Added : 49 causal constraints over 10 iterations in 580 ms. Result :sat
Minimization took 136 ms.
[2023-03-24 16:05:47] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2023-03-24 16:05:47] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 326 ms returned sat
[2023-03-24 16:05:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 16:05:48] [INFO ] [Real]Absence check using state equation in 595 ms returned sat
[2023-03-24 16:05:48] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 16:05:48] [INFO ] [Nat]Absence check using 3 positive place invariants in 16 ms returned sat
[2023-03-24 16:05:49] [INFO ] [Nat]Absence check using 3 positive and 1608 generalized place invariants in 336 ms returned sat
[2023-03-24 16:05:49] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 16:05:49] [INFO ] [Nat]Absence check using state equation in 566 ms returned sat
[2023-03-24 16:05:49] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 30 ms.
[2023-03-24 16:05:50] [INFO ] Added : 66 causal constraints over 14 iterations in 793 ms. Result :sat
Minimization took 112 ms.
[2023-03-24 16:05:51] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2023-03-24 16:05:51] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 364 ms returned sat
[2023-03-24 16:05:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 16:05:52] [INFO ] [Real]Absence check using state equation in 1063 ms returned sat
[2023-03-24 16:05:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 16:05:52] [INFO ] [Nat]Absence check using 3 positive place invariants in 16 ms returned sat
[2023-03-24 16:05:53] [INFO ] [Nat]Absence check using 3 positive and 1608 generalized place invariants in 343 ms returned sat
[2023-03-24 16:05:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 16:05:53] [INFO ] [Nat]Absence check using state equation in 707 ms returned sat
[2023-03-24 16:05:53] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 35 ms.
[2023-03-24 16:05:55] [INFO ] Added : 103 causal constraints over 21 iterations in 1193 ms. Result :sat
Minimization took 118 ms.
[2023-03-24 16:05:55] [INFO ] [Real]Absence check using 3 positive place invariants in 13 ms returned sat
[2023-03-24 16:05:55] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 322 ms returned sat
[2023-03-24 16:05:55] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 16:05:56] [INFO ] [Real]Absence check using state equation in 780 ms returned sat
[2023-03-24 16:05:56] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 16:05:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2023-03-24 16:05:57] [INFO ] [Nat]Absence check using 3 positive and 1608 generalized place invariants in 337 ms returned sat
[2023-03-24 16:05:57] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 16:05:57] [INFO ] [Nat]Absence check using state equation in 796 ms returned sat
[2023-03-24 16:05:58] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 35 ms.
[2023-03-24 16:05:59] [INFO ] Added : 96 causal constraints over 20 iterations in 1163 ms. Result :sat
Minimization took 339 ms.
[2023-03-24 16:05:59] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2023-03-24 16:06:00] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 338 ms returned sat
[2023-03-24 16:06:00] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 16:06:00] [INFO ] [Real]Absence check using state equation in 620 ms returned sat
[2023-03-24 16:06:00] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 16:06:01] [INFO ] [Nat]Absence check using 3 positive place invariants in 27 ms returned sat
[2023-03-24 16:06:01] [INFO ] [Nat]Absence check using 3 positive and 1608 generalized place invariants in 352 ms returned sat
[2023-03-24 16:06:01] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 16:06:02] [INFO ] [Nat]Absence check using state equation in 613 ms returned sat
[2023-03-24 16:06:02] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 38 ms.
[2023-03-24 16:06:02] [INFO ] Added : 65 causal constraints over 13 iterations in 766 ms. Result :sat
Minimization took 117 ms.
[2023-03-24 16:06:03] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2023-03-24 16:06:03] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 339 ms returned sat
[2023-03-24 16:06:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 16:06:04] [INFO ] [Real]Absence check using state equation in 596 ms returned sat
[2023-03-24 16:06:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 16:06:04] [INFO ] [Nat]Absence check using 3 positive place invariants in 17 ms returned sat
[2023-03-24 16:06:04] [INFO ] [Nat]Absence check using 3 positive and 1608 generalized place invariants in 348 ms returned sat
[2023-03-24 16:06:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 16:06:05] [INFO ] [Nat]Absence check using state equation in 571 ms returned sat
[2023-03-24 16:06:05] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 31 ms.
[2023-03-24 16:06:06] [INFO ] Added : 42 causal constraints over 9 iterations in 552 ms. Result :sat
Minimization took 106 ms.
[2023-03-24 16:06:06] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2023-03-24 16:06:06] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 347 ms returned sat
[2023-03-24 16:06:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 16:06:06] [INFO ] [Real]Absence check using state equation in 91 ms returned unsat
[2023-03-24 16:06:07] [INFO ] [Real]Absence check using 3 positive place invariants in 14 ms returned sat
[2023-03-24 16:06:07] [INFO ] [Real]Absence check using 3 positive and 1608 generalized place invariants in 363 ms returned sat
[2023-03-24 16:06:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 16:06:08] [INFO ] [Real]Absence check using state equation in 787 ms returned sat
[2023-03-24 16:06:08] [INFO ] Solution in real domain found non-integer solution.
[2023-03-24 16:06:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 15 ms returned sat
[2023-03-24 16:06:08] [INFO ] [Nat]Absence check using 3 positive and 1608 generalized place invariants in 355 ms returned sat
[2023-03-24 16:06:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-24 16:06:09] [INFO ] [Nat]Absence check using state equation in 642 ms returned sat
[2023-03-24 16:06:09] [INFO ] Computed and/alt/rep : 260/306/260 causal constraints (skipped 72 transitions) in 32 ms.
[2023-03-24 16:06:11] [INFO ] Added : 130 causal constraints over 26 iterations in 1486 ms. Result :sat
Minimization took 124 ms.
Current structural bounds on expressions (after SMT) : [23, 12167, 1, 529, 529, 23, -1, 1, 23, 13, -1, -1, 1, 23] Max seen :[23, 0, 0, 0, 0, 23, 0, 0, 0, 0, 0, 0, 1, 0]
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-06 23 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-00 23 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-10 13 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 602 out of 1966 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1966/1966 places, 356/356 transitions.
Graph (complete) has 16044 edges and 1966 vertex of which 1917 are kept as prefixes of interest. Removing 49 places using SCC suffix rule.13 ms
Discarding 49 places :
Also discarding 0 output transitions
Drop transitions removed 119 transitions
Reduce isomorphic transitions removed 119 transitions.
Discarding 46 places :
Implicit places reduction removed 46 places
Iterating post reduction 0 with 165 rules applied. Total rules applied 166 place count 1871 transition count 237
Performed 47 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 47 Pre rules applied. Total rules applied 166 place count 1871 transition count 190
Deduced a syphon composed of 47 places in 5 ms
Ensure Unique test removed 67 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 1 with 161 rules applied. Total rules applied 327 place count 1757 transition count 190
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 1 with 1 rules applied. Total rules applied 328 place count 1756 transition count 190
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 328 place count 1756 transition count 189
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 331 place count 1754 transition count 189
Applied a total of 331 rules in 310 ms. Remains 1754 /1966 variables (removed 212) and now considering 189/356 (removed 167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 310 ms. Remains : 1754/1966 places, 189/356 transitions.
// Phase 1: matrix 189 rows 1754 cols
[2023-03-24 16:06:13] [INFO ] Computed 1565 place invariants in 23 ms
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 1000000 steps, including 17934 resets, run finished after 17223 ms. (steps per millisecond=58 ) properties (out of 7) seen :54
Interrupted Best-First random walk after 506362 steps, including 488 resets, run timeout after 5001 ms. (steps per millisecond=101 ) properties seen 50
Finished Best-First random walk after 600572 steps, including 209 resets, run visited all 7 properties in 5001 ms. (steps per millisecond=120 )
Incomplete Best-First random walk after 1000001 steps, including 626 resets, run finished after 2695 ms. (steps per millisecond=371 ) properties (out of 7) seen :58
Incomplete Best-First random walk after 1000001 steps, including 1363 resets, run finished after 4074 ms. (steps per millisecond=245 ) properties (out of 7) seen :36
Incomplete Best-First random walk after 1000001 steps, including 960 resets, run finished after 3246 ms. (steps per millisecond=308 ) properties (out of 7) seen :51
Incomplete Best-First random walk after 1000001 steps, including 962 resets, run finished after 3237 ms. (steps per millisecond=308 ) properties (out of 7) seen :54
Incomplete Best-First random walk after 1000001 steps, including 962 resets, run finished after 3223 ms. (steps per millisecond=310 ) properties (out of 7) seen :50
[2023-03-24 16:06:57] [INFO ] Invariant cache hit.
[2023-03-24 16:06:57] [INFO ] [Real]Absence check using 1 positive place invariants in 21 ms returned sat
[2023-03-24 16:06:58] [INFO ] [Real]Absence check using 1 positive and 1564 generalized place invariants in 438 ms returned sat
[2023-03-24 16:06:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 16:07:01] [INFO ] [Real]Absence check using state equation in 3141 ms returned unsat
[2023-03-24 16:07:01] [INFO ] [Real]Absence check using 1 positive place invariants in 19 ms returned sat
[2023-03-24 16:07:02] [INFO ] [Real]Absence check using 1 positive and 1564 generalized place invariants in 314 ms returned sat
[2023-03-24 16:07:02] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 16:07:02] [INFO ] [Real]Absence check using state equation in 435 ms returned unsat
[2023-03-24 16:07:02] [INFO ] [Real]Absence check using 1 positive place invariants in 14 ms returned sat
[2023-03-24 16:07:03] [INFO ] [Real]Absence check using 1 positive and 1564 generalized place invariants in 347 ms returned sat
[2023-03-24 16:07:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 16:07:03] [INFO ] [Real]Absence check using state equation in 437 ms returned unsat
[2023-03-24 16:07:03] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-24 16:07:04] [INFO ] [Real]Absence check using 1 positive and 1564 generalized place invariants in 332 ms returned sat
[2023-03-24 16:07:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 16:07:04] [INFO ] [Real]Absence check using state equation in 429 ms returned unsat
[2023-03-24 16:07:04] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-24 16:07:05] [INFO ] [Real]Absence check using 1 positive and 1564 generalized place invariants in 342 ms returned sat
[2023-03-24 16:07:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 16:07:06] [INFO ] [Real]Absence check using state equation in 1073 ms returned unsat
[2023-03-24 16:07:06] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-24 16:07:06] [INFO ] [Real]Absence check using 1 positive and 1564 generalized place invariants in 339 ms returned sat
[2023-03-24 16:07:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 16:07:07] [INFO ] [Real]Absence check using state equation in 1106 ms returned unsat
[2023-03-24 16:07:08] [INFO ] [Real]Absence check using 1 positive place invariants in 12 ms returned sat
[2023-03-24 16:07:08] [INFO ] [Real]Absence check using 1 positive and 1564 generalized place invariants in 357 ms returned sat
[2023-03-24 16:07:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-24 16:07:08] [INFO ] [Real]Absence check using state equation in 494 ms returned unsat
Current structural bounds on expressions (after SMT) : [529, 23, 23, 23, 1, 1, 1] Max seen :[529, 23, 23, 23, 1, 1, 1]
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
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-07 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 23 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-22-UpperBounds-02 529 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 102714 ms.
ITS solved all properties within timeout

BK_STOP 1679674029801

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="QuasiCertifProtocol-PT-22"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool ltsminxred"
echo " Input is QuasiCertifProtocol-PT-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 r297-tall-167873951100893"
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 ;