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-171683789700599.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 ShieldRVt-PT-005B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683789700599
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K 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.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:33 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.7K Apr 11 21:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 63K Apr 11 21:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Apr 11 21:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 11 21:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:55 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 60K 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 ShieldRVt-PT-005B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldRVt-PT-005B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717013131290

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=ShieldRVt-PT-005B
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-29 20:05:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 20:05:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 20:05:33] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2024-05-29 20:05:33] [INFO ] Transformed 253 places.
[2024-05-29 20:05:33] [INFO ] Transformed 253 transitions.
[2024-05-29 20:05:33] [INFO ] Found NUPN structural information;
[2024-05-29 20:05:33] [INFO ] Parsed PT model containing 253 places and 253 transitions and 596 arcs in 144 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVt-PT-005B-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-005B-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-005B-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 230 ms. (steps per millisecond=43 ) properties (out of 13) seen :10
FORMULA ShieldRVt-PT-005B-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-005B-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-005B-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-005B-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-005B-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-005B-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-005B-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-005B-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-005B-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-005B-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :1
FORMULA ShieldRVt-PT-005B-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running SMT prover for 2 properties.
// Phase 1: matrix 253 rows 253 cols
[2024-05-29 20:05:33] [INFO ] Computed 21 invariants in 15 ms
[2024-05-29 20:05:34] [INFO ] After 234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 20:05:34] [INFO ] [Nat]Absence check using 21 positive place invariants in 8 ms returned sat
[2024-05-29 20:05:34] [INFO ] After 127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 20:05:34] [INFO ] Deduced a trap composed of 28 places in 74 ms of which 6 ms to minimize.
[2024-05-29 20:05:34] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 0 ms to minimize.
[2024-05-29 20:05:34] [INFO ] Deduced a trap composed of 25 places in 34 ms of which 1 ms to minimize.
[2024-05-29 20:05:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 206 ms
[2024-05-29 20:05:34] [INFO ] Deduced a trap composed of 29 places in 49 ms of which 1 ms to minimize.
[2024-05-29 20:05:34] [INFO ] Deduced a trap composed of 30 places in 41 ms of which 1 ms to minimize.
[2024-05-29 20:05:34] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 1 ms to minimize.
[2024-05-29 20:05:34] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 160 ms
[2024-05-29 20:05:34] [INFO ] After 528ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 50 ms.
[2024-05-29 20:05:34] [INFO ] After 696ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 12 ms.
Support contains 21 out of 253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 253/253 places, 253/253 transitions.
Drop transitions removed 67 transitions
Trivial Post-agglo rules discarded 67 transitions
Performed 67 trivial Post agglomeration. Transition count delta: 67
Iterating post reduction 0 with 67 rules applied. Total rules applied 67 place count 253 transition count 186
Reduce places removed 67 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 69 rules applied. Total rules applied 136 place count 186 transition count 184
Reduce places removed 1 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 6 rules applied. Total rules applied 142 place count 185 transition count 179
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 147 place count 180 transition count 179
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 20 Pre rules applied. Total rules applied 147 place count 180 transition count 159
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 4 with 40 rules applied. Total rules applied 187 place count 160 transition count 159
Discarding 27 places :
Symmetric choice reduction at 4 with 27 rule applications. Total rules 214 place count 133 transition count 132
Iterating global reduction 4 with 27 rules applied. Total rules applied 241 place count 133 transition count 132
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 241 place count 133 transition count 123
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 259 place count 124 transition count 123
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 4 with 86 rules applied. Total rules applied 345 place count 81 transition count 80
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 363 place count 72 transition count 83
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 364 place count 72 transition count 82
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 365 place count 71 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 366 place count 70 transition count 81
Applied a total of 366 rules in 53 ms. Remains 70 /253 variables (removed 183) and now considering 81/253 (removed 172) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 70/253 places, 81/253 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 129 ms. (steps per millisecond=77 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 684949 steps, run timeout after 3001 ms. (steps per millisecond=228 ) properties seen :{}
Probabilistic random walk after 684949 steps, saw 360752 distinct states, run finished after 3002 ms. (steps per millisecond=228 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 81 rows 70 cols
[2024-05-29 20:05:38] [INFO ] Computed 20 invariants in 1 ms
[2024-05-29 20:05:38] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 20:05:38] [INFO ] [Nat]Absence check using 20 positive place invariants in 3 ms returned sat
[2024-05-29 20:05:38] [INFO ] After 38ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 20:05:38] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 20:05:38] [INFO ] After 21ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 20:05:38] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2024-05-29 20:05:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2024-05-29 20:05:38] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 0 ms to minimize.
[2024-05-29 20:05:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2024-05-29 20:05:38] [INFO ] After 128ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 16 ms.
[2024-05-29 20:05:38] [INFO ] After 219ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 21 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 81/81 transitions.
Applied a total of 0 rules in 14 ms. Remains 70 /70 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 70/70 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 81/81 transitions.
Applied a total of 0 rules in 3 ms. Remains 70 /70 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-29 20:05:38] [INFO ] Invariant cache hit.
[2024-05-29 20:05:38] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-29 20:05:38] [INFO ] Invariant cache hit.
[2024-05-29 20:05:38] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-05-29 20:05:38] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
[2024-05-29 20:05:38] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-29 20:05:38] [INFO ] Invariant cache hit.
[2024-05-29 20:05:38] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 70/70 places, 81/81 transitions.
Graph (trivial) has 10 edges and 70 vertex of which 2 / 70 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 9 edges and 68 vertex of which 2 / 68 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 67 transition count 77
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 66 transition count 74
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 9 place count 66 transition count 73
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 11 place count 65 transition count 73
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 64 transition count 72
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 2 with 8 rules applied. Total rules applied 21 place count 64 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 63 transition count 64
Applied a total of 22 rules in 16 ms. Remains 63 /70 variables (removed 7) and now considering 64/81 (removed 17) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 64 rows 63 cols
[2024-05-29 20:05:38] [INFO ] Computed 17 invariants in 1 ms
[2024-05-29 20:05:38] [INFO ] After 26ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 20:05:38] [INFO ] [Nat]Absence check using 17 positive place invariants in 3 ms returned sat
[2024-05-29 20:05:38] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 20:05:38] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-29 20:05:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 30 ms
[2024-05-29 20:05:38] [INFO ] After 79ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-29 20:05:38] [INFO ] After 125ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2024-05-29 20:05:38] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-05-29 20:05:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 70 places, 81 transitions and 303 arcs took 1 ms.
[2024-05-29 20:05:38] [INFO ] Flatten gal took : 30 ms
Total runtime 5641 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldRVt-PT-005B
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/373
ReachabilityCardinality

FORMULA ShieldRVt-PT-005B-ReachabilityCardinality-2024-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldRVt-PT-005B-ReachabilityCardinality-2024-06 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1717013139818

--------------------
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/373/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/373/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/373/ReachabilityCardinality.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
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: LAUNCH task # 10 (type EXCL) for 0 ShieldRVt-PT-005B-ReachabilityCardinality-2024-05
lola: time limit : 1800 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 6 (type FNDP) for 0 ShieldRVt-PT-005B-ReachabilityCardinality-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 7 (type EQUN) for 0 ShieldRVt-PT-005B-ReachabilityCardinality-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 9 (type SRCH) for 0 ShieldRVt-PT-005B-ReachabilityCardinality-2024-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 10 (type EXCL) for ShieldRVt-PT-005B-ReachabilityCardinality-2024-05
lola: result : true
lola: markings : 48
lola: fired transitions : 57
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 6 (type FNDP) for ShieldRVt-PT-005B-ReachabilityCardinality-2024-05 (obsolete)
lola: CANCELED task # 7 (type EQUN) for ShieldRVt-PT-005B-ReachabilityCardinality-2024-05 (obsolete)
lola: CANCELED task # 9 (type SRCH) for ShieldRVt-PT-005B-ReachabilityCardinality-2024-05 (obsolete)
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: FINISHED task # 6 (type FNDP) for ShieldRVt-PT-005B-ReachabilityCardinality-2024-05
lola: result : true
lola: fired transitions : 21
lola: tried executions : 2
lola: time used : 0.000000
lola: memory pages used : 0
lola: LAUNCH task # 16 (type EXCL) for 3 ShieldRVt-PT-005B-ReachabilityCardinality-2024-06
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 12 (type FNDP) for 3 ShieldRVt-PT-005B-ReachabilityCardinality-2024-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 13 (type EQUN) for 3 ShieldRVt-PT-005B-ReachabilityCardinality-2024-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 15 (type SRCH) for 3 ShieldRVt-PT-005B-ReachabilityCardinality-2024-06
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 15 (type SRCH) for ShieldRVt-PT-005B-ReachabilityCardinality-2024-06
lola: result : false
lola: markings : 17
lola: fired transitions : 21
lola: time used : 0.000000
lola: memory pages used : 1
sara: try reading problem file /home/mcc/execution/373/ReachabilityCardinality-13.sara.
sara: try reading problem file /home/mcc/execution/373/ReachabilityCardinality-7.sara.
lola: CANCELED task # 12 (type FNDP) for ShieldRVt-PT-005B-ReachabilityCardinality-2024-06 (obsolete)
lola: CANCELED task # 13 (type EQUN) for ShieldRVt-PT-005B-ReachabilityCardinality-2024-06 (obsolete)
lola: CANCELED task # 16 (type EXCL) for ShieldRVt-PT-005B-ReachabilityCardinality-2024-06 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldRVt-PT-005B-ReachabilityCardinality-2024-05: EF true tandem / relaxed
ShieldRVt-PT-005B-ReachabilityCardinality-2024-06: 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="ShieldRVt-PT-005B"
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 ShieldRVt-PT-005B, 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-171683789700599"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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