Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r373-tall-171683788900279.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is ShieldPPPs-PT-010B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683788900279
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 16:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 19:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 11:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 112K Apr 13 11:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 13 11:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K Apr 13 11:56 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:53 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:53 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 172K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldPPPs-PT-010B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716969991547

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=gold2023
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-010B
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-29 08:06:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 08:06:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 08:06:33] [INFO ] Load time of PNML (sax parser for PT used): 87 ms
[2024-05-29 08:06:33] [INFO ] Transformed 683 places.
[2024-05-29 08:06:33] [INFO ] Transformed 633 transitions.
[2024-05-29 08:06:33] [INFO ] Found NUPN structural information;
[2024-05-29 08:06:33] [INFO ] Parsed PT model containing 683 places and 633 transitions and 1746 arcs in 174 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPs-PT-010B-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-010B-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 6 resets, run finished after 400 ms. (steps per millisecond=25 ) properties (out of 14) seen :12
FORMULA ShieldPPPs-PT-010B-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-010B-ReachabilityCardinality-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 633 rows 683 cols
[2024-05-29 08:06:34] [INFO ] Computed 111 invariants in 23 ms
[2024-05-29 08:06:34] [INFO ] After 345ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 08:06:34] [INFO ] [Nat]Absence check using 111 positive place invariants in 33 ms returned sat
[2024-05-29 08:06:35] [INFO ] After 348ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 08:06:35] [INFO ] Deduced a trap composed of 21 places in 196 ms of which 9 ms to minimize.
[2024-05-29 08:06:35] [INFO ] Deduced a trap composed of 13 places in 111 ms of which 1 ms to minimize.
[2024-05-29 08:06:35] [INFO ] Deduced a trap composed of 23 places in 109 ms of which 1 ms to minimize.
[2024-05-29 08:06:35] [INFO ] Deduced a trap composed of 25 places in 101 ms of which 1 ms to minimize.
[2024-05-29 08:06:35] [INFO ] Deduced a trap composed of 16 places in 97 ms of which 1 ms to minimize.
[2024-05-29 08:06:36] [INFO ] Deduced a trap composed of 25 places in 95 ms of which 1 ms to minimize.
[2024-05-29 08:06:36] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 1 ms to minimize.
[2024-05-29 08:06:36] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 0 ms to minimize.
[2024-05-29 08:06:36] [INFO ] Deduced a trap composed of 28 places in 88 ms of which 0 ms to minimize.
[2024-05-29 08:06:36] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 0 ms to minimize.
[2024-05-29 08:06:36] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 1 ms to minimize.
[2024-05-29 08:06:36] [INFO ] Deduced a trap composed of 37 places in 71 ms of which 0 ms to minimize.
[2024-05-29 08:06:36] [INFO ] Deduced a trap composed of 40 places in 72 ms of which 1 ms to minimize.
[2024-05-29 08:06:36] [INFO ] Deduced a trap composed of 25 places in 81 ms of which 0 ms to minimize.
[2024-05-29 08:06:37] [INFO ] Deduced a trap composed of 47 places in 78 ms of which 1 ms to minimize.
[2024-05-29 08:06:37] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 1 ms to minimize.
[2024-05-29 08:06:37] [INFO ] Deduced a trap composed of 20 places in 107 ms of which 0 ms to minimize.
[2024-05-29 08:06:37] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 1 ms to minimize.
[2024-05-29 08:06:37] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 0 ms to minimize.
[2024-05-29 08:06:37] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 0 ms to minimize.
[2024-05-29 08:06:37] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 1 ms to minimize.
[2024-05-29 08:06:38] [INFO ] Deduced a trap composed of 27 places in 99 ms of which 1 ms to minimize.
[2024-05-29 08:06:38] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 3 ms to minimize.
[2024-05-29 08:06:38] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 1 ms to minimize.
[2024-05-29 08:06:38] [INFO ] Deduced a trap composed of 22 places in 79 ms of which 0 ms to minimize.
[2024-05-29 08:06:38] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 3 ms to minimize.
[2024-05-29 08:06:38] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 1 ms to minimize.
[2024-05-29 08:06:38] [INFO ] Deduced a trap composed of 34 places in 77 ms of which 0 ms to minimize.
[2024-05-29 08:06:38] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 0 ms to minimize.
[2024-05-29 08:06:39] [INFO ] Deduced a trap composed of 41 places in 71 ms of which 0 ms to minimize.
[2024-05-29 08:06:39] [INFO ] Deduced a trap composed of 37 places in 68 ms of which 0 ms to minimize.
[2024-05-29 08:06:39] [INFO ] Deduced a trap composed of 34 places in 65 ms of which 0 ms to minimize.
[2024-05-29 08:06:39] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 4060 ms
[2024-05-29 08:06:39] [INFO ] Deduced a trap composed of 22 places in 151 ms of which 0 ms to minimize.
[2024-05-29 08:06:39] [INFO ] Deduced a trap composed of 26 places in 139 ms of which 1 ms to minimize.
[2024-05-29 08:06:39] [INFO ] Deduced a trap composed of 22 places in 155 ms of which 1 ms to minimize.
[2024-05-29 08:06:40] [INFO ] Deduced a trap composed of 21 places in 152 ms of which 1 ms to minimize.
[2024-05-29 08:06:40] [INFO ] Deduced a trap composed of 17 places in 147 ms of which 0 ms to minimize.
[2024-05-29 08:06:40] [INFO ] Deduced a trap composed of 29 places in 146 ms of which 0 ms to minimize.
[2024-05-29 08:06:40] [INFO ] Deduced a trap composed of 20 places in 149 ms of which 0 ms to minimize.
[2024-05-29 08:06:40] [INFO ] Deduced a trap composed of 24 places in 143 ms of which 1 ms to minimize.
[2024-05-29 08:06:40] [INFO ] Deduced a trap composed of 29 places in 143 ms of which 0 ms to minimize.
[2024-05-29 08:06:41] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 1 ms to minimize.
[2024-05-29 08:06:41] [INFO ] Deduced a trap composed of 27 places in 127 ms of which 1 ms to minimize.
[2024-05-29 08:06:41] [INFO ] Deduced a trap composed of 21 places in 121 ms of which 0 ms to minimize.
[2024-05-29 08:06:41] [INFO ] Deduced a trap composed of 23 places in 120 ms of which 0 ms to minimize.
[2024-05-29 08:06:41] [INFO ] Deduced a trap composed of 28 places in 118 ms of which 0 ms to minimize.
[2024-05-29 08:06:41] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 1 ms to minimize.
[2024-05-29 08:06:42] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 0 ms to minimize.
[2024-05-29 08:06:42] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 1 ms to minimize.
[2024-05-29 08:06:42] [INFO ] Deduced a trap composed of 25 places in 128 ms of which 0 ms to minimize.
[2024-05-29 08:06:42] [INFO ] Deduced a trap composed of 36 places in 131 ms of which 1 ms to minimize.
[2024-05-29 08:06:42] [INFO ] Deduced a trap composed of 25 places in 129 ms of which 0 ms to minimize.
[2024-05-29 08:06:42] [INFO ] Deduced a trap composed of 27 places in 100 ms of which 0 ms to minimize.
[2024-05-29 08:06:42] [INFO ] Deduced a trap composed of 36 places in 116 ms of which 0 ms to minimize.
[2024-05-29 08:06:43] [INFO ] Deduced a trap composed of 36 places in 118 ms of which 1 ms to minimize.
[2024-05-29 08:06:43] [INFO ] Deduced a trap composed of 17 places in 122 ms of which 3 ms to minimize.
[2024-05-29 08:06:43] [INFO ] Deduced a trap composed of 33 places in 113 ms of which 0 ms to minimize.
[2024-05-29 08:06:43] [INFO ] Deduced a trap composed of 23 places in 114 ms of which 1 ms to minimize.
[2024-05-29 08:06:43] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 0 ms to minimize.
[2024-05-29 08:06:43] [INFO ] Deduced a trap composed of 37 places in 111 ms of which 0 ms to minimize.
[2024-05-29 08:06:43] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 0 ms to minimize.
[2024-05-29 08:06:43] [INFO ] Trap strengthening (SAT) tested/added 30/29 trap constraints in 4598 ms
[2024-05-29 08:06:43] [INFO ] After 9190ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 357 ms.
[2024-05-29 08:06:44] [INFO ] After 9756ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 38 ms.
Support contains 29 out of 683 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 683/683 places, 633/633 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 61 place count 683 transition count 572
Reduce places removed 61 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 65 rules applied. Total rules applied 126 place count 622 transition count 568
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 130 place count 618 transition count 568
Performed 49 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 49 Pre rules applied. Total rules applied 130 place count 618 transition count 519
Deduced a syphon composed of 49 places in 2 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 228 place count 569 transition count 519
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 289 place count 508 transition count 458
Iterating global reduction 3 with 61 rules applied. Total rules applied 350 place count 508 transition count 458
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 350 place count 508 transition count 437
Deduced a syphon composed of 21 places in 2 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 392 place count 487 transition count 437
Performed 144 Post agglomeration using F-continuation condition.Transition count delta: 144
Deduced a syphon composed of 144 places in 0 ms
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 3 with 288 rules applied. Total rules applied 680 place count 343 transition count 293
Partial Free-agglomeration rule applied 80 times.
Drop transitions removed 80 transitions
Iterating global reduction 3 with 80 rules applied. Total rules applied 760 place count 343 transition count 293
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 761 place count 342 transition count 292
Applied a total of 761 rules in 154 ms. Remains 342 /683 variables (removed 341) and now considering 292/633 (removed 341) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 342/683 places, 292/633 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 186 ms. (steps per millisecond=53 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 293965 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 293965 steps, saw 216969 distinct states, run finished after 3002 ms. (steps per millisecond=97 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 292 rows 342 cols
[2024-05-29 08:06:47] [INFO ] Computed 111 invariants in 12 ms
[2024-05-29 08:06:47] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 08:06:47] [INFO ] [Nat]Absence check using 103 positive place invariants in 22 ms returned sat
[2024-05-29 08:06:47] [INFO ] [Nat]Absence check using 103 positive and 8 generalized place invariants in 1 ms returned sat
[2024-05-29 08:06:48] [INFO ] After 303ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 08:06:48] [INFO ] Deduced a trap composed of 7 places in 54 ms of which 1 ms to minimize.
[2024-05-29 08:06:48] [INFO ] Deduced a trap composed of 6 places in 50 ms of which 1 ms to minimize.
[2024-05-29 08:06:48] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-05-29 08:06:48] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 0 ms to minimize.
[2024-05-29 08:06:48] [INFO ] Deduced a trap composed of 6 places in 67 ms of which 0 ms to minimize.
[2024-05-29 08:06:48] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 0 ms to minimize.
[2024-05-29 08:06:48] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 0 ms to minimize.
[2024-05-29 08:06:48] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 0 ms to minimize.
[2024-05-29 08:06:48] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-29 08:06:49] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 1 ms to minimize.
[2024-05-29 08:06:49] [INFO ] Deduced a trap composed of 5 places in 64 ms of which 0 ms to minimize.
[2024-05-29 08:06:49] [INFO ] Deduced a trap composed of 11 places in 36 ms of which 1 ms to minimize.
[2024-05-29 08:06:49] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-05-29 08:06:49] [INFO ] Deduced a trap composed of 8 places in 34 ms of which 1 ms to minimize.
[2024-05-29 08:06:49] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 0 ms to minimize.
[2024-05-29 08:06:49] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2024-05-29 08:06:49] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2024-05-29 08:06:49] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:06:49] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 0 ms to minimize.
[2024-05-29 08:06:49] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 0 ms to minimize.
[2024-05-29 08:06:49] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-29 08:06:49] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 1334 ms
[2024-05-29 08:06:49] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 0 ms to minimize.
[2024-05-29 08:06:50] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 0 ms to minimize.
[2024-05-29 08:06:50] [INFO ] Deduced a trap composed of 7 places in 57 ms of which 0 ms to minimize.
[2024-05-29 08:06:50] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-29 08:06:50] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 0 ms to minimize.
[2024-05-29 08:06:50] [INFO ] Deduced a trap composed of 14 places in 45 ms of which 0 ms to minimize.
[2024-05-29 08:06:50] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-29 08:06:50] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 0 ms to minimize.
[2024-05-29 08:06:50] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 0 ms to minimize.
[2024-05-29 08:06:50] [INFO ] Deduced a trap composed of 9 places in 21 ms of which 0 ms to minimize.
[2024-05-29 08:06:50] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 845 ms
[2024-05-29 08:06:50] [INFO ] After 2715ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 502 ms.
[2024-05-29 08:06:51] [INFO ] After 3310ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 29 out of 342 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 292/292 transitions.
Applied a total of 0 rules in 24 ms. Remains 342 /342 variables (removed 0) and now considering 292/292 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 342/342 places, 292/292 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 342/342 places, 292/292 transitions.
Applied a total of 0 rules in 12 ms. Remains 342 /342 variables (removed 0) and now considering 292/292 (removed 0) transitions.
[2024-05-29 08:06:51] [INFO ] Invariant cache hit.
[2024-05-29 08:06:51] [INFO ] Implicit Places using invariants in 263 ms returned []
[2024-05-29 08:06:51] [INFO ] Invariant cache hit.
[2024-05-29 08:06:51] [INFO ] Implicit Places using invariants and state equation in 333 ms returned []
Implicit Place search using SMT with State Equation took 598 ms to find 0 implicit places.
[2024-05-29 08:06:51] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-29 08:06:51] [INFO ] Invariant cache hit.
[2024-05-29 08:06:52] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 793 ms. Remains : 342/342 places, 292/292 transitions.
Applied a total of 0 rules in 12 ms. Remains 342 /342 variables (removed 0) and now considering 292/292 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-29 08:06:52] [INFO ] Invariant cache hit.
[2024-05-29 08:06:52] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 08:06:52] [INFO ] [Nat]Absence check using 103 positive place invariants in 15 ms returned sat
[2024-05-29 08:06:52] [INFO ] [Nat]Absence check using 103 positive and 8 generalized place invariants in 1 ms returned sat
[2024-05-29 08:06:52] [INFO ] After 228ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 08:06:52] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 1 ms to minimize.
[2024-05-29 08:06:52] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 1 ms to minimize.
[2024-05-29 08:06:52] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 1 ms to minimize.
[2024-05-29 08:06:52] [INFO ] Deduced a trap composed of 6 places in 53 ms of which 0 ms to minimize.
[2024-05-29 08:06:52] [INFO ] Deduced a trap composed of 10 places in 49 ms of which 0 ms to minimize.
[2024-05-29 08:06:52] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 0 ms to minimize.
[2024-05-29 08:06:52] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2024-05-29 08:06:53] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 499 ms
[2024-05-29 08:06:53] [INFO ] Deduced a trap composed of 7 places in 61 ms of which 0 ms to minimize.
[2024-05-29 08:06:53] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2024-05-29 08:06:53] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 0 ms to minimize.
[2024-05-29 08:06:53] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 0 ms to minimize.
[2024-05-29 08:06:53] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 ms to minimize.
[2024-05-29 08:06:53] [INFO ] Deduced a trap composed of 9 places in 54 ms of which 1 ms to minimize.
[2024-05-29 08:06:53] [INFO ] Deduced a trap composed of 4 places in 58 ms of which 0 ms to minimize.
[2024-05-29 08:06:53] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 1 ms to minimize.
[2024-05-29 08:06:53] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-05-29 08:06:53] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 0 ms to minimize.
[2024-05-29 08:06:53] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-05-29 08:06:53] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-05-29 08:06:54] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 5 ms to minimize.
[2024-05-29 08:06:54] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2024-05-29 08:06:54] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2024-05-29 08:06:54] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 1 ms to minimize.
[2024-05-29 08:06:54] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1104 ms
[2024-05-29 08:06:54] [INFO ] After 1944ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 251 ms.
[2024-05-29 08:06:54] [INFO ] After 2279ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-29 08:06:54] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-05-29 08:06:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 342 places, 292 transitions and 1243 arcs took 2 ms.
[2024-05-29 08:06:54] [INFO ] Flatten gal took : 64 ms
Total runtime 21338 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldPPPs-PT-010B
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/363
ReachabilityCardinality

FORMULA ShieldPPPs-PT-010B-ReachabilityCardinality-2024-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldPPPs-PT-010B-ReachabilityCardinality-2024-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1716970016577

--------------------
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:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/363/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/363/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/363/ReachabilityCardinality.xml
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 13 (type EXCL) for 0 ShieldPPPs-PT-010B-ReachabilityCardinality-2024-00
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 8 (type FNDP) for 0 ShieldPPPs-PT-010B-ReachabilityCardinality-2024-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 10 (type EQUN) for 0 ShieldPPPs-PT-010B-ReachabilityCardinality-2024-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 12 (type SRCH) for 0 ShieldPPPs-PT-010B-ReachabilityCardinality-2024-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: try reading problem file /home/mcc/execution/363/ReachabilityCardinality-10.sara.
sara: place or transition ordering is non-deterministic
lola: FINISHED task # 12 (type SRCH) for ShieldPPPs-PT-010B-ReachabilityCardinality-2024-00
lola: result : false
lola: markings : 86526
lola: fired transitions : 104532
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 8 (type FNDP) for ShieldPPPs-PT-010B-ReachabilityCardinality-2024-00 (obsolete)
lola: CANCELED task # 10 (type EQUN) for ShieldPPPs-PT-010B-ReachabilityCardinality-2024-00 (obsolete)
lola: CANCELED task # 13 (type EXCL) for ShieldPPPs-PT-010B-ReachabilityCardinality-2024-00 (obsolete)
lola: LAUNCH task # 16 (type EXCL) for 3 ShieldPPPs-PT-010B-ReachabilityCardinality-2024-07
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 6 (type FNDP) for 3 ShieldPPPs-PT-010B-ReachabilityCardinality-2024-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 7 (type EQUN) for 3 ShieldPPPs-PT-010B-ReachabilityCardinality-2024-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 15 (type SRCH) for 3 ShieldPPPs-PT-010B-ReachabilityCardinality-2024-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 8 (type FNDP) for ShieldPPPs-PT-010B-ReachabilityCardinality-2024-00
lola: result : unknown
lola: fired transitions : 66503
lola: tried executions : 13529
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 10 (type EQUN) for ShieldPPPs-PT-010B-ReachabilityCardinality-2024-00
lola: result : unknown
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 15 (type SRCH) for ShieldPPPs-PT-010B-ReachabilityCardinality-2024-07
lola: result : false
lola: markings : 7
lola: fired transitions : 6
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 6 (type FNDP) for ShieldPPPs-PT-010B-ReachabilityCardinality-2024-07 (obsolete)
lola: CANCELED task # 7 (type EQUN) for ShieldPPPs-PT-010B-ReachabilityCardinality-2024-07 (obsolete)
lola: CANCELED task # 16 (type EXCL) for ShieldPPPs-PT-010B-ReachabilityCardinality-2024-07 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-010B-ReachabilityCardinality-2024-00: EF false tandem / insertion
ShieldPPPs-PT-010B-ReachabilityCardinality-2024-07: EF false tandem / insertion


Time elapsed: 0 secs. Pages in use: 2

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="ShieldPPPs-PT-010B"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is ShieldPPPs-PT-010B, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r373-tall-171683788900279"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-010B.tgz
mv ShieldPPPs-PT-010B execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;