fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r319-tall-167873970000113
Last Updated
May 14, 2023

About the Execution of 2022-gold for QuasiCertifProtocol-PT-28

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
900.544 193219.00 212212.00 3300.30 1 29 29 29 29 29 29 29 1 1 16 1 1 16 1 16 normal

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.r319-tall-167873970000113.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 gold2022
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 r319-tall-167873970000113
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.8M
-rw-r--r-- 1 mcc users 80K Feb 26 01:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 452K Feb 26 01:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 19K Feb 26 01:27 CTLFireability.txt
-rw-r--r-- 1 mcc users 124K 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 46K Feb 25 16:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 182K Feb 25 16:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 9.9K Feb 25 16:37 LTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 16:37 LTLFireability.xml
-rw-r--r-- 1 mcc users 106K Feb 26 01:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 644K Feb 26 01:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 35K Feb 26 01:39 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 218K Feb 26 01:39 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 9.4K 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 749K 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-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 1678882088958

Running Version 202205111006
[2023-03-15 12:08:10] [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]
[2023-03-15 12:08:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-15 12:08:10] [INFO ] Load time of PNML (sax parser for PT used): 245 ms
[2023-03-15 12:08:10] [INFO ] Transformed 2998 places.
[2023-03-15 12:08:10] [INFO ] Transformed 446 transitions.
[2023-03-15 12:08:10] [INFO ] Parsed PT model containing 2998 places and 446 transitions in 365 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 8 ms.
// Phase 1: matrix 446 rows 2998 cols
[2023-03-15 12:08:10] [INFO ] Computed 2553 place invariants in 184 ms
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-15 16 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 304 resets, run finished after 157 ms. (steps per millisecond=63 ) properties (out of 15) seen :92
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-10 16 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :72
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :72
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 12) seen :72
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 12) seen :72
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :72
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :72
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :80
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 12) seen :72
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 12) seen :72
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :72
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 12) seen :72
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 12) seen :72
// Phase 1: matrix 446 rows 2998 cols
[2023-03-15 12:08:11] [INFO ] Computed 2553 place invariants in 56 ms
[2023-03-15 12:08:11] [INFO ] [Real]Absence check using 32 positive place invariants in 33 ms returned unsat
[2023-03-15 12:08:12] [INFO ] [Real]Absence check using 32 positive place invariants in 53 ms returned sat
[2023-03-15 12:08:12] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 507 ms returned sat
[2023-03-15 12:08:12] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:08:16] [INFO ] [Real]Absence check using state equation in 4084 ms returned sat
[2023-03-15 12:08:16] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:08:17] [INFO ] [Nat]Absence check using 32 positive place invariants in 50 ms returned sat
[2023-03-15 12:08:17] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 503 ms returned sat
[2023-03-15 12:08:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:08:18] [INFO ] [Nat]Absence check using state equation in 916 ms returned sat
[2023-03-15 12:08:18] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 43 ms.
[2023-03-15 12:08:20] [INFO ] Added : 119 causal constraints over 24 iterations in 1861 ms. Result :sat
Minimization took 399 ms.
[2023-03-15 12:08:21] [INFO ] [Real]Absence check using 32 positive place invariants in 57 ms returned sat
[2023-03-15 12:08:21] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 461 ms returned sat
[2023-03-15 12:08:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:08:26] [INFO ] [Real]Absence check using state equation in 4245 ms returned unknown
[2023-03-15 12:08:26] [INFO ] [Real]Absence check using 32 positive place invariants in 53 ms returned sat
[2023-03-15 12:08:27] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 513 ms returned sat
[2023-03-15 12:08:27] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:08:27] [INFO ] [Real]Absence check using state equation in 919 ms returned sat
[2023-03-15 12:08:28] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 58 ms.
[2023-03-15 12:08:30] [INFO ] Added : 135 causal constraints over 27 iterations in 2164 ms. Result :sat
Minimization took 577 ms.
[2023-03-15 12:08:30] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:08:31] [INFO ] [Nat]Absence check using 32 positive place invariants in 48 ms returned sat
[2023-03-15 12:08:31] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 491 ms returned sat
[2023-03-15 12:08:31] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:08:32] [INFO ] [Nat]Absence check using state equation in 977 ms returned sat
[2023-03-15 12:08:32] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 39 ms.
[2023-03-15 12:08:34] [INFO ] Added : 135 causal constraints over 27 iterations in 1962 ms. Result :sat
Minimization took 653 ms.
[2023-03-15 12:08:35] [INFO ] [Real]Absence check using 32 positive place invariants in 49 ms returned sat
[2023-03-15 12:08:36] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 564 ms returned sat
[2023-03-15 12:08:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:08:38] [INFO ] [Real]Absence check using state equation in 2106 ms returned sat
[2023-03-15 12:08:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:08:38] [INFO ] [Nat]Absence check using 32 positive place invariants in 52 ms returned sat
[2023-03-15 12:08:39] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 577 ms returned sat
[2023-03-15 12:08:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:08:41] [INFO ] [Nat]Absence check using state equation in 1984 ms returned sat
[2023-03-15 12:08:41] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 37 ms.
[2023-03-15 12:08:42] [INFO ] Added : 66 causal constraints over 14 iterations in 1119 ms. Result :sat
Minimization took 426 ms.
[2023-03-15 12:08:43] [INFO ] [Real]Absence check using 32 positive place invariants in 49 ms returned sat
[2023-03-15 12:08:43] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 535 ms returned sat
[2023-03-15 12:08:43] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:08:45] [INFO ] [Real]Absence check using state equation in 1288 ms returned unsat
[2023-03-15 12:08:45] [INFO ] [Real]Absence check using 32 positive place invariants in 52 ms returned sat
[2023-03-15 12:08:46] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 516 ms returned sat
[2023-03-15 12:08:46] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:08:50] [INFO ] [Real]Absence check using state equation in 4181 ms returned unknown
[2023-03-15 12:08:50] [INFO ] [Real]Absence check using 32 positive place invariants in 49 ms returned sat
[2023-03-15 12:08:51] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 531 ms returned sat
[2023-03-15 12:08:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:08:52] [INFO ] [Real]Absence check using state equation in 938 ms returned sat
[2023-03-15 12:08:52] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 43 ms.
[2023-03-15 12:08:54] [INFO ] Added : 135 causal constraints over 27 iterations in 2351 ms. Result :sat
Minimization took 236 ms.
[2023-03-15 12:08:54] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:08:55] [INFO ] [Nat]Absence check using 32 positive place invariants in 51 ms returned sat
[2023-03-15 12:08:55] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 550 ms returned sat
[2023-03-15 12:08:55] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:08:56] [INFO ] [Nat]Absence check using state equation in 918 ms returned sat
[2023-03-15 12:08:56] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 30 ms.
[2023-03-15 12:08:58] [INFO ] Added : 135 causal constraints over 27 iterations in 1972 ms. Result :sat
Minimization took 198 ms.
[2023-03-15 12:08:59] [INFO ] [Real]Absence check using 32 positive place invariants in 47 ms returned sat
[2023-03-15 12:08:59] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 532 ms returned sat
[2023-03-15 12:08:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:09:01] [INFO ] [Real]Absence check using state equation in 1510 ms returned sat
[2023-03-15 12:09:01] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:09:01] [INFO ] [Nat]Absence check using 32 positive place invariants in 49 ms returned sat
[2023-03-15 12:09:02] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 500 ms returned sat
[2023-03-15 12:09:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:09:03] [INFO ] [Nat]Absence check using state equation in 1349 ms returned sat
[2023-03-15 12:09:03] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 41 ms.
[2023-03-15 12:09:04] [INFO ] Added : 64 causal constraints over 13 iterations in 1005 ms. Result :sat
Minimization took 214 ms.
[2023-03-15 12:09:05] [INFO ] [Real]Absence check using 32 positive place invariants in 61 ms returned sat
[2023-03-15 12:09:05] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 498 ms returned sat
[2023-03-15 12:09:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:09:06] [INFO ] [Real]Absence check using state equation in 953 ms returned sat
[2023-03-15 12:09:06] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:09:07] [INFO ] [Nat]Absence check using 32 positive place invariants in 49 ms returned sat
[2023-03-15 12:09:07] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 527 ms returned sat
[2023-03-15 12:09:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:09:08] [INFO ] [Nat]Absence check using state equation in 960 ms returned sat
[2023-03-15 12:09:08] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 32 ms.
[2023-03-15 12:09:10] [INFO ] Added : 135 causal constraints over 27 iterations in 1969 ms. Result :sat
Minimization took 190 ms.
[2023-03-15 12:09:11] [INFO ] [Real]Absence check using 32 positive place invariants in 57 ms returned sat
[2023-03-15 12:09:11] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 512 ms returned sat
[2023-03-15 12:09:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:09:12] [INFO ] [Real]Absence check using state equation in 936 ms returned sat
[2023-03-15 12:09:12] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 31 ms.
[2023-03-15 12:09:15] [INFO ] Added : 131 causal constraints over 27 iterations in 2294 ms. Result :sat
Minimization took 273 ms.
[2023-03-15 12:09:15] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:09:15] [INFO ] [Nat]Absence check using 32 positive place invariants in 72 ms returned sat
[2023-03-15 12:09:16] [INFO ] [Nat]Absence check using 32 positive and 2521 generalized place invariants in 562 ms returned sat
[2023-03-15 12:09:16] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:09:17] [INFO ] [Nat]Absence check using state equation in 991 ms returned sat
[2023-03-15 12:09:17] [INFO ] Computed and/alt/rep : 326/384/326 causal constraints (skipped 90 transitions) in 31 ms.
[2023-03-15 12:09:19] [INFO ] Added : 132 causal constraints over 27 iterations in 1984 ms. Result :sat
Minimization took 394 ms.
[2023-03-15 12:09:20] [INFO ] [Real]Absence check using 32 positive place invariants in 49 ms returned sat
[2023-03-15 12:09:20] [INFO ] [Real]Absence check using 32 positive and 2521 generalized place invariants in 524 ms returned sat
[2023-03-15 12:09:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:09:22] [INFO ] [Real]Absence check using state equation in 2095 ms returned unsat
Current structural bounds on expressions (after SMT) : [29, 841, 841, -1, -1, 29, 841, -1, 1, 1, 16, 1] Max seen :[29, 0, 0, 0, 0, 29, 21, 0, 0, 0, 0, 1]
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-06 29 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-01 29 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-13 16 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 145 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 2906 are kept as prefixes of interest. Removing 92 places using SCC suffix rule.24 ms
Discarding 92 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 91 transitions
Reduce isomorphic transitions removed 91 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 92 rules applied. Total rules applied 93 place count 2906 transition count 352
Reduce places removed 1 places and 0 transitions.
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Iterating post reduction 1 with 30 rules applied. Total rules applied 123 place count 2905 transition count 323
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 2 with 29 rules applied. Total rules applied 152 place count 2876 transition count 323
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 152 place count 2876 transition count 322
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 154 place count 2875 transition count 322
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 155 place count 2874 transition count 321
Ensure Unique test removed 29 places
Iterating post reduction 3 with 29 rules applied. Total rules applied 184 place count 2845 transition count 321
Applied a total of 184 rules in 687 ms. Remains 2845 /2998 variables (removed 153) and now considering 321/446 (removed 125) transitions.
Finished structural reductions, in 1 iterations. Remains : 2845/2998 places, 321/446 transitions.
// Phase 1: matrix 321 rows 2845 cols
[2023-03-15 12:09:24] [INFO ] Computed 2524 place invariants in 11 ms
Incomplete random walk after 1000000 steps, including 16666 resets, run finished after 5271 ms. (steps per millisecond=189 ) properties (out of 6) seen :36
Incomplete Best-First random walk after 1000001 steps, including 901 resets, run finished after 1792 ms. (steps per millisecond=558 ) properties (out of 6) seen :34
Incomplete Best-First random walk after 1000001 steps, including 900 resets, run finished after 1782 ms. (steps per millisecond=561 ) properties (out of 6) seen :33
Incomplete Best-First random walk after 1000001 steps, including 901 resets, run finished after 1782 ms. (steps per millisecond=561 ) properties (out of 6) seen :34
Incomplete Best-First random walk after 1000001 steps, including 901 resets, run finished after 1912 ms. (steps per millisecond=523 ) properties (out of 6) seen :37
Incomplete Best-First random walk after 1000001 steps, including 486 resets, run finished after 1887 ms. (steps per millisecond=529 ) properties (out of 6) seen :42
Incomplete Best-First random walk after 1000001 steps, including 904 resets, run finished after 1508 ms. (steps per millisecond=663 ) properties (out of 6) seen :34
// Phase 1: matrix 321 rows 2845 cols
[2023-03-15 12:09:40] [INFO ] Computed 2524 place invariants in 14 ms
[2023-03-15 12:09:41] [INFO ] [Real]Absence check using 0 positive and 2524 generalized place invariants in 529 ms returned sat
[2023-03-15 12:09:41] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:09:47] [INFO ] [Real]Absence check using state equation in 5475 ms returned sat
[2023-03-15 12:09:47] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:09:47] [INFO ] [Nat]Absence check using 0 positive and 2524 generalized place invariants in 504 ms returned sat
[2023-03-15 12:09:47] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:09:55] [INFO ] [Nat]Absence check using state equation in 7701 ms returned sat
[2023-03-15 12:09:55] [INFO ] Computed and/alt/rep : 203/261/203 causal constraints (skipped 89 transitions) in 46 ms.
[2023-03-15 12:09:56] [INFO ] Added : 89 causal constraints over 18 iterations in 1256 ms. Result :sat
Minimization took 1079 ms.
[2023-03-15 12:09:58] [INFO ] [Real]Absence check using 0 positive and 2524 generalized place invariants in 541 ms returned sat
[2023-03-15 12:09:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:10:04] [INFO ] [Real]Absence check using state equation in 5276 ms returned sat
[2023-03-15 12:10:04] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:10:05] [INFO ] [Nat]Absence check using 0 positive and 2524 generalized place invariants in 557 ms returned sat
[2023-03-15 12:10:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:10:10] [INFO ] [Nat]Absence check using state equation in 5316 ms returned sat
[2023-03-15 12:10:10] [INFO ] Computed and/alt/rep : 203/261/203 causal constraints (skipped 89 transitions) in 33 ms.
[2023-03-15 12:10:11] [INFO ] Added : 87 causal constraints over 18 iterations in 1247 ms. Result :sat
Minimization took 2032 ms.
[2023-03-15 12:10:14] [INFO ] [Real]Absence check using 0 positive and 2524 generalized place invariants in 543 ms returned sat
[2023-03-15 12:10:14] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:10:29] [INFO ] [Real]Absence check using state equation in 15373 ms returned unsat
[2023-03-15 12:10:30] [INFO ] [Real]Absence check using 0 positive and 2524 generalized place invariants in 642 ms returned sat
[2023-03-15 12:10:30] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:10:32] [INFO ] [Real]Absence check using state equation in 1398 ms returned unsat
[2023-03-15 12:10:33] [INFO ] [Real]Absence check using 0 positive and 2524 generalized place invariants in 475 ms returned sat
[2023-03-15 12:10:33] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:10:38] [INFO ] [Real]Absence check using state equation in 5194 ms returned sat
[2023-03-15 12:10:38] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:10:39] [INFO ] [Nat]Absence check using 0 positive and 2524 generalized place invariants in 535 ms returned sat
[2023-03-15 12:10:39] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:10:44] [INFO ] [Nat]Absence check using state equation in 5332 ms returned sat
[2023-03-15 12:10:44] [INFO ] Computed and/alt/rep : 203/261/203 causal constraints (skipped 89 transitions) in 27 ms.
[2023-03-15 12:10:45] [INFO ] Added : 87 causal constraints over 18 iterations in 1242 ms. Result :sat
Minimization took 693 ms.
[2023-03-15 12:10:47] [INFO ] [Real]Absence check using 0 positive and 2524 generalized place invariants in 555 ms returned sat
[2023-03-15 12:10:47] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:10:52] [INFO ] [Real]Absence check using state equation in 5413 ms returned sat
[2023-03-15 12:10:52] [INFO ] Solution in real domain found non-integer solution.
[2023-03-15 12:10:53] [INFO ] [Nat]Absence check using 0 positive and 2524 generalized place invariants in 540 ms returned sat
[2023-03-15 12:10:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-15 12:10:59] [INFO ] [Nat]Absence check using state equation in 5499 ms returned sat
[2023-03-15 12:10:59] [INFO ] Computed and/alt/rep : 203/261/203 causal constraints (skipped 89 transitions) in 26 ms.
[2023-03-15 12:11:00] [INFO ] Added : 87 causal constraints over 18 iterations in 1275 ms. Result :sat
Minimization took 3007 ms.
Current structural bounds on expressions (after SMT) : [841, 841, 29, 29, 841, -1] Max seen :[29, 29, 29, 29, 29, 1]
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-05 29 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-04 29 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 88 out of 2845 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 2845/2845 places, 321/321 transitions.
Graph (complete) has 54202 edges and 2845 vertex of which 2005 are kept as prefixes of interest. Removing 840 places using SCC suffix rule.4 ms
Discarding 840 places :
Also discarding 28 output transitions
Drop transitions removed 28 transitions
Drop transitions removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 2005 transition count 265
Applied a total of 29 rules in 232 ms. Remains 2005 /2845 variables (removed 840) and now considering 265/321 (removed 56) transitions.
Finished structural reductions, in 1 iterations. Remains : 2005/2845 places, 265/321 transitions.
// Phase 1: matrix 265 rows 2005 cols
[2023-03-15 12:11:04] [INFO ] Computed 1740 place invariants in 6 ms
Incomplete random walk after 1000000 steps, including 16666 resets, run finished after 4237 ms. (steps per millisecond=236 ) properties (out of 4) seen :35
Incomplete Best-First random walk after 1000001 steps, including 902 resets, run finished after 1764 ms. (steps per millisecond=566 ) properties (out of 4) seen :32
Incomplete Best-First random walk after 1000001 steps, including 902 resets, run finished after 1751 ms. (steps per millisecond=571 ) properties (out of 4) seen :33
Incomplete Best-First random walk after 1000000 steps, including 487 resets, run finished after 1771 ms. (steps per millisecond=564 ) properties (out of 4) seen :42
Incomplete Best-First random walk after 1000001 steps, including 902 resets, run finished after 1425 ms. (steps per millisecond=701 ) properties (out of 4) seen :33
// Phase 1: matrix 265 rows 2005 cols
[2023-03-15 12:11:15] [INFO ] Computed 1740 place invariants in 12 ms
[2023-03-15 12:11:15] [INFO ] [Real]Absence check using 0 positive and 1740 generalized place invariants in 338 ms returned sat
[2023-03-15 12:11:15] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:11:16] [INFO ] [Real]Absence check using state equation in 921 ms returned unsat
[2023-03-15 12:11:17] [INFO ] [Real]Absence check using 0 positive and 1740 generalized place invariants in 338 ms returned sat
[2023-03-15 12:11:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:11:18] [INFO ] [Real]Absence check using state equation in 1576 ms returned unsat
[2023-03-15 12:11:19] [INFO ] [Real]Absence check using 0 positive and 1740 generalized place invariants in 334 ms returned sat
[2023-03-15 12:11:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:11:21] [INFO ] [Real]Absence check using state equation in 1570 ms returned unsat
[2023-03-15 12:11:21] [INFO ] [Real]Absence check using 0 positive and 1740 generalized place invariants in 349 ms returned sat
[2023-03-15 12:11:21] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-15 12:11:22] [INFO ] [Real]Absence check using state equation in 559 ms returned unsat
Current structural bounds on expressions (after SMT) : [29, 29, 29, 1] Max seen :[29, 29, 29, 1]
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA QuasiCertifProtocol-PT-28-UpperBounds-07 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-02 29 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 191983 ms.

BK_STOP 1678882282177

--------------------
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="gold2022"
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 gold2022"
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 r319-tall-167873970000113"
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 ;