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-171683789200389.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 ShieldPPPt-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-171683789200389
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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.5K May 19 07:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 16:35 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 14:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 121K Apr 11 14:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Apr 11 14:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 31K Apr 11 14:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:54 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 185K 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 ShieldPPPt-PT-010B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldPPPt-PT-010B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716984930231

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=ShieldPPPt-PT-010B
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-29 12:15:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-29 12:15:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 12:15:32] [INFO ] Load time of PNML (sax parser for PT used): 91 ms
[2024-05-29 12:15:32] [INFO ] Transformed 783 places.
[2024-05-29 12:15:32] [INFO ] Transformed 713 transitions.
[2024-05-29 12:15:32] [INFO ] Found NUPN structural information;
[2024-05-29 12:15:32] [INFO ] Parsed PT model containing 783 places and 713 transitions and 1786 arcs in 178 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 412 ms. (steps per millisecond=24 ) properties (out of 13) seen :10
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 713 rows 783 cols
[2024-05-29 12:15:33] [INFO ] Computed 111 invariants in 32 ms
[2024-05-29 12:15:33] [INFO ] [Real]Absence check using 111 positive place invariants in 67 ms returned sat
[2024-05-29 12:15:34] [INFO ] After 558ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-29 12:15:34] [INFO ] Deduced a trap composed of 23 places in 180 ms of which 7 ms to minimize.
[2024-05-29 12:15:34] [INFO ] Deduced a trap composed of 21 places in 146 ms of which 1 ms to minimize.
[2024-05-29 12:15:34] [INFO ] Deduced a trap composed of 27 places in 111 ms of which 1 ms to minimize.
[2024-05-29 12:15:34] [INFO ] Deduced a trap composed of 28 places in 105 ms of which 1 ms to minimize.
[2024-05-29 12:15:34] [INFO ] Deduced a trap composed of 24 places in 106 ms of which 0 ms to minimize.
[2024-05-29 12:15:34] [INFO ] Deduced a trap composed of 22 places in 94 ms of which 1 ms to minimize.
[2024-05-29 12:15:35] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 1 ms to minimize.
[2024-05-29 12:15:35] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 0 ms to minimize.
[2024-05-29 12:15:35] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-05-29 12:15:35] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 0 ms to minimize.
[2024-05-29 12:15:35] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 0 ms to minimize.
[2024-05-29 12:15:35] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 1 ms to minimize.
[2024-05-29 12:15:35] [INFO ] Deduced a trap composed of 27 places in 54 ms of which 0 ms to minimize.
[2024-05-29 12:15:35] [INFO ] Deduced a trap composed of 23 places in 50 ms of which 1 ms to minimize.
[2024-05-29 12:15:35] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 1732 ms
[2024-05-29 12:15:35] [INFO ] After 2325ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 12:15:35] [INFO ] After 2795ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 12:15:36] [INFO ] [Nat]Absence check using 111 positive place invariants in 35 ms returned sat
[2024-05-29 12:15:36] [INFO ] After 707ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 12:15:37] [INFO ] Deduced a trap composed of 27 places in 120 ms of which 1 ms to minimize.
[2024-05-29 12:15:37] [INFO ] Deduced a trap composed of 25 places in 122 ms of which 1 ms to minimize.
[2024-05-29 12:15:37] [INFO ] Deduced a trap composed of 22 places in 122 ms of which 0 ms to minimize.
[2024-05-29 12:15:37] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 0 ms to minimize.
[2024-05-29 12:15:37] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 1 ms to minimize.
[2024-05-29 12:15:37] [INFO ] Deduced a trap composed of 24 places in 101 ms of which 1 ms to minimize.
[2024-05-29 12:15:37] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 1 ms to minimize.
[2024-05-29 12:15:38] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 0 ms to minimize.
[2024-05-29 12:15:38] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 1 ms to minimize.
[2024-05-29 12:15:38] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 1 ms to minimize.
[2024-05-29 12:15:38] [INFO ] Deduced a trap composed of 21 places in 67 ms of which 1 ms to minimize.
[2024-05-29 12:15:38] [INFO ] Deduced a trap composed of 26 places in 62 ms of which 0 ms to minimize.
[2024-05-29 12:15:38] [INFO ] Deduced a trap composed of 22 places in 67 ms of which 0 ms to minimize.
[2024-05-29 12:15:38] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1607 ms
[2024-05-29 12:15:38] [INFO ] Deduced a trap composed of 24 places in 131 ms of which 0 ms to minimize.
[2024-05-29 12:15:39] [INFO ] Deduced a trap composed of 25 places in 123 ms of which 0 ms to minimize.
[2024-05-29 12:15:39] [INFO ] Deduced a trap composed of 25 places in 130 ms of which 0 ms to minimize.
[2024-05-29 12:15:39] [INFO ] Deduced a trap composed of 27 places in 109 ms of which 0 ms to minimize.
[2024-05-29 12:15:39] [INFO ] Deduced a trap composed of 20 places in 106 ms of which 0 ms to minimize.
[2024-05-29 12:15:39] [INFO ] Deduced a trap composed of 24 places in 99 ms of which 0 ms to minimize.
[2024-05-29 12:15:39] [INFO ] Deduced a trap composed of 19 places in 121 ms of which 1 ms to minimize.
[2024-05-29 12:15:39] [INFO ] Deduced a trap composed of 25 places in 117 ms of which 1 ms to minimize.
[2024-05-29 12:15:40] [INFO ] Deduced a trap composed of 32 places in 116 ms of which 0 ms to minimize.
[2024-05-29 12:15:40] [INFO ] Deduced a trap composed of 26 places in 108 ms of which 0 ms to minimize.
[2024-05-29 12:15:40] [INFO ] Deduced a trap composed of 26 places in 110 ms of which 1 ms to minimize.
[2024-05-29 12:15:40] [INFO ] Deduced a trap composed of 21 places in 106 ms of which 0 ms to minimize.
[2024-05-29 12:15:40] [INFO ] Deduced a trap composed of 22 places in 102 ms of which 1 ms to minimize.
[2024-05-29 12:15:40] [INFO ] Deduced a trap composed of 24 places in 109 ms of which 1 ms to minimize.
[2024-05-29 12:15:41] [INFO ] Deduced a trap composed of 26 places in 105 ms of which 1 ms to minimize.
[2024-05-29 12:15:41] [INFO ] Trap strengthening (SAT) tested/added 16/15 trap constraints in 2440 ms
[2024-05-29 12:15:41] [INFO ] Deduced a trap composed of 19 places in 110 ms of which 1 ms to minimize.
[2024-05-29 12:15:41] [INFO ] Deduced a trap composed of 14 places in 113 ms of which 0 ms to minimize.
[2024-05-29 12:15:41] [INFO ] Deduced a trap composed of 18 places in 95 ms of which 1 ms to minimize.
[2024-05-29 12:15:41] [INFO ] Deduced a trap composed of 28 places in 80 ms of which 0 ms to minimize.
[2024-05-29 12:15:41] [INFO ] Deduced a trap composed of 20 places in 76 ms of which 0 ms to minimize.
[2024-05-29 12:15:42] [INFO ] Deduced a trap composed of 24 places in 80 ms of which 0 ms to minimize.
[2024-05-29 12:15:42] [INFO ] Deduced a trap composed of 27 places in 82 ms of which 0 ms to minimize.
[2024-05-29 12:15:42] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 0 ms to minimize.
[2024-05-29 12:15:42] [INFO ] Deduced a trap composed of 26 places in 80 ms of which 1 ms to minimize.
[2024-05-29 12:15:42] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 1 ms to minimize.
[2024-05-29 12:15:42] [INFO ] Deduced a trap composed of 30 places in 77 ms of which 1 ms to minimize.
[2024-05-29 12:15:42] [INFO ] Deduced a trap composed of 29 places in 71 ms of which 0 ms to minimize.
[2024-05-29 12:15:42] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 0 ms to minimize.
[2024-05-29 12:15:42] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1652 ms
[2024-05-29 12:15:42] [INFO ] After 6835ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 429 ms.
[2024-05-29 12:15:43] [INFO ] After 7551ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 70 ms.
Support contains 90 out of 783 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 783/783 places, 713/713 transitions.
Drop transitions removed 132 transitions
Trivial Post-agglo rules discarded 132 transitions
Performed 132 trivial Post agglomeration. Transition count delta: 132
Iterating post reduction 0 with 132 rules applied. Total rules applied 132 place count 783 transition count 581
Reduce places removed 132 places and 0 transitions.
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Iterating post reduction 1 with 150 rules applied. Total rules applied 282 place count 651 transition count 563
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 2 with 18 rules applied. Total rules applied 300 place count 633 transition count 563
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 300 place count 633 transition count 524
Deduced a syphon composed of 39 places in 3 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 378 place count 594 transition count 524
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 431 place count 541 transition count 471
Iterating global reduction 3 with 53 rules applied. Total rules applied 484 place count 541 transition count 471
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 21 Pre rules applied. Total rules applied 484 place count 541 transition count 450
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 3 with 42 rules applied. Total rules applied 526 place count 520 transition count 450
Performed 137 Post agglomeration using F-continuation condition.Transition count delta: 137
Deduced a syphon composed of 137 places in 1 ms
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 3 with 274 rules applied. Total rules applied 800 place count 383 transition count 313
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 826 place count 370 transition count 313
Free-agglomeration rule applied 11 times.
Iterating global reduction 3 with 11 rules applied. Total rules applied 837 place count 370 transition count 302
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 848 place count 359 transition count 302
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 4 with 20 rules applied. Total rules applied 868 place count 359 transition count 302
Applied a total of 868 rules in 179 ms. Remains 359 /783 variables (removed 424) and now considering 302/713 (removed 411) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 179 ms. Remains : 359/783 places, 302/713 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 143 ms. (steps per millisecond=69 ) properties (out of 3) seen :1
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 302 rows 359 cols
[2024-05-29 12:15:43] [INFO ] Computed 111 invariants in 2 ms
[2024-05-29 12:15:43] [INFO ] [Real]Absence check using 111 positive place invariants in 18 ms returned sat
[2024-05-29 12:15:44] [INFO ] After 225ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-29 12:15:44] [INFO ] [Nat]Absence check using 111 positive place invariants in 19 ms returned sat
[2024-05-29 12:15:44] [INFO ] After 199ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-29 12:15:44] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-29 12:15:44] [INFO ] After 136ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-29 12:15:44] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 1 ms to minimize.
[2024-05-29 12:15:44] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-29 12:15:44] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-29 12:15:44] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 1 ms to minimize.
[2024-05-29 12:15:44] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2024-05-29 12:15:44] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 300 ms
[2024-05-29 12:15:44] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-05-29 12:15:45] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 0 ms to minimize.
[2024-05-29 12:15:45] [INFO ] Deduced a trap composed of 9 places in 43 ms of which 1 ms to minimize.
[2024-05-29 12:15:45] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-29 12:15:45] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 0 ms to minimize.
[2024-05-29 12:15:45] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 353 ms
[2024-05-29 12:15:45] [INFO ] After 877ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 103 ms.
[2024-05-29 12:15:45] [INFO ] After 1287ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 21 ms.
Support contains 47 out of 359 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 359/359 places, 302/302 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 359 transition count 290
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 25 place count 347 transition count 289
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 26 place count 346 transition count 289
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 26 place count 346 transition count 281
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 42 place count 338 transition count 281
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 43 place count 337 transition count 280
Iterating global reduction 3 with 1 rules applied. Total rules applied 44 place count 337 transition count 280
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 88 place count 315 transition count 258
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 100 place count 309 transition count 258
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 101 place count 309 transition count 257
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 102 place count 308 transition count 257
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 107 place count 308 transition count 257
Applied a total of 107 rules in 64 ms. Remains 308 /359 variables (removed 51) and now considering 257/302 (removed 45) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 308/359 places, 257/302 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :1
FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 257 rows 308 cols
[2024-05-29 12:15:45] [INFO ] Computed 111 invariants in 15 ms
[2024-05-29 12:15:45] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 12:15:45] [INFO ] [Nat]Absence check using 111 positive place invariants in 21 ms returned sat
[2024-05-29 12:15:45] [INFO ] After 159ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 12:15:45] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-29 12:15:45] [INFO ] After 82ms SMT Verify possible using 47 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 12:15:46] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2024-05-29 12:15:46] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-29 12:15:46] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 0 ms to minimize.
[2024-05-29 12:15:46] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2024-05-29 12:15:46] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-29 12:15:46] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 0 ms to minimize.
[2024-05-29 12:15:46] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 365 ms
[2024-05-29 12:15:46] [INFO ] After 501ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 61 ms.
[2024-05-29 12:15:46] [INFO ] After 819ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 43 out of 308 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 308/308 places, 257/257 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 308 transition count 255
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 306 transition count 255
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 304 transition count 253
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 304 transition count 252
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 303 transition count 252
Applied a total of 10 rules in 35 ms. Remains 303 /308 variables (removed 5) and now considering 252/257 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 303/308 places, 252/257 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 809355 steps, run timeout after 3001 ms. (steps per millisecond=269 ) properties seen :{}
Probabilistic random walk after 809355 steps, saw 491381 distinct states, run finished after 3004 ms. (steps per millisecond=269 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 252 rows 303 cols
[2024-05-29 12:15:49] [INFO ] Computed 111 invariants in 5 ms
[2024-05-29 12:15:49] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 12:15:49] [INFO ] [Nat]Absence check using 111 positive place invariants in 17 ms returned sat
[2024-05-29 12:15:49] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 12:15:49] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-29 12:15:49] [INFO ] After 74ms SMT Verify possible using 47 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 12:15:50] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 0 ms to minimize.
[2024-05-29 12:15:50] [INFO ] Deduced a trap composed of 4 places in 45 ms of which 1 ms to minimize.
[2024-05-29 12:15:50] [INFO ] Deduced a trap composed of 4 places in 40 ms of which 1 ms to minimize.
[2024-05-29 12:15:50] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 0 ms to minimize.
[2024-05-29 12:15:50] [INFO ] Deduced a trap composed of 5 places in 44 ms of which 0 ms to minimize.
[2024-05-29 12:15:50] [INFO ] Deduced a trap composed of 8 places in 51 ms of which 0 ms to minimize.
[2024-05-29 12:15:50] [INFO ] Deduced a trap composed of 10 places in 50 ms of which 1 ms to minimize.
[2024-05-29 12:15:50] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 485 ms
[2024-05-29 12:15:50] [INFO ] After 631ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 56 ms.
[2024-05-29 12:15:50] [INFO ] After 922ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 43 out of 303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 252/252 transitions.
Applied a total of 0 rules in 9 ms. Remains 303 /303 variables (removed 0) and now considering 252/252 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 303/303 places, 252/252 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 252/252 transitions.
Applied a total of 0 rules in 8 ms. Remains 303 /303 variables (removed 0) and now considering 252/252 (removed 0) transitions.
[2024-05-29 12:15:50] [INFO ] Invariant cache hit.
[2024-05-29 12:15:50] [INFO ] Implicit Places using invariants in 165 ms returned []
[2024-05-29 12:15:50] [INFO ] Invariant cache hit.
[2024-05-29 12:15:50] [INFO ] State equation strengthened by 47 read => feed constraints.
[2024-05-29 12:15:51] [INFO ] Implicit Places using invariants and state equation in 409 ms returned []
Implicit Place search using SMT with State Equation took 579 ms to find 0 implicit places.
[2024-05-29 12:15:51] [INFO ] Redundant transitions in 11 ms returned []
[2024-05-29 12:15:51] [INFO ] Invariant cache hit.
[2024-05-29 12:15:51] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 776 ms. Remains : 303/303 places, 252/252 transitions.
Partial Free-agglomeration rule applied 42 times.
Drop transitions removed 42 transitions
Iterating global reduction 0 with 42 rules applied. Total rules applied 42 place count 303 transition count 252
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 303 transition count 250
Applied a total of 44 rules in 22 ms. Remains 303 /303 variables (removed 0) and now considering 250/252 (removed 2) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 250 rows 303 cols
[2024-05-29 12:15:51] [INFO ] Computed 111 invariants in 3 ms
[2024-05-29 12:15:51] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 12:15:51] [INFO ] [Nat]Absence check using 111 positive place invariants in 17 ms returned sat
[2024-05-29 12:15:51] [INFO ] After 151ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 12:15:51] [INFO ] State equation strengthened by 31 read => feed constraints.
[2024-05-29 12:15:51] [INFO ] After 71ms SMT Verify possible using 31 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 12:15:51] [INFO ] Deduced a trap composed of 4 places in 53 ms of which 0 ms to minimize.
[2024-05-29 12:15:51] [INFO ] Deduced a trap composed of 5 places in 47 ms of which 1 ms to minimize.
[2024-05-29 12:15:52] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-05-29 12:15:52] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 0 ms to minimize.
[2024-05-29 12:15:52] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 1 ms to minimize.
[2024-05-29 12:15:52] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2024-05-29 12:15:52] [INFO ] Deduced a trap composed of 4 places in 44 ms of which 0 ms to minimize.
[2024-05-29 12:15:52] [INFO ] Deduced a trap composed of 7 places in 45 ms of which 0 ms to minimize.
[2024-05-29 12:15:52] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 0 ms to minimize.
[2024-05-29 12:15:52] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-29 12:15:52] [INFO ] Deduced a trap composed of 7 places in 43 ms of which 1 ms to minimize.
[2024-05-29 12:15:52] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2024-05-29 12:15:52] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 1 ms to minimize.
[2024-05-29 12:15:52] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 0 ms to minimize.
[2024-05-29 12:15:52] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 0 ms to minimize.
[2024-05-29 12:15:52] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2024-05-29 12:15:52] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 0 ms to minimize.
[2024-05-29 12:15:52] [INFO ] Trap strengthening (SAT) tested/added 18/17 trap constraints in 1080 ms
[2024-05-29 12:15:52] [INFO ] After 1217ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 69 ms.
[2024-05-29 12:15:52] [INFO ] After 1515ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-29 12:15:53] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 4 ms.
[2024-05-29 12:15:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 303 places, 252 transitions and 1021 arcs took 2 ms.
[2024-05-29 12:15:53] [INFO ] Flatten gal took : 59 ms
Total runtime 21098 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldPPPt-PT-010B
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/371
ReachabilityCardinality

FORMULA ShieldPPPt-PT-010B-ReachabilityCardinality-2024-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1716984954306

--------------------
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/371/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/371/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/371/ReachabilityCardinality.xml
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 # 7 (type EXCL) for 0 ShieldPPPt-PT-010B-ReachabilityCardinality-2024-01
lola: time limit : 3600 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 3 (type FNDP) for 0 ShieldPPPt-PT-010B-ReachabilityCardinality-2024-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 4 (type EQUN) for 0 ShieldPPPt-PT-010B-ReachabilityCardinality-2024-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 6 (type SRCH) for 0 ShieldPPPt-PT-010B-ReachabilityCardinality-2024-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 6 (type SRCH) for ShieldPPPt-PT-010B-ReachabilityCardinality-2024-01
lola: result : true
lola: markings : 69
lola: fired transitions : 68
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 3 (type FNDP) for ShieldPPPt-PT-010B-ReachabilityCardinality-2024-01 (obsolete)
lola: CANCELED task # 4 (type EQUN) for ShieldPPPt-PT-010B-ReachabilityCardinality-2024-01 (obsolete)
lola: CANCELED task # 7 (type EXCL) for ShieldPPPt-PT-010B-ReachabilityCardinality-2024-01 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPt-PT-010B-ReachabilityCardinality-2024-01: EF true 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="ShieldPPPt-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 ShieldPPPt-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-171683789200389"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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