Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r391-oct2-167903715300470.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool lolaxred
Input is ShieldPPPs-PT-030A, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903715300470
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 744K
-rw-r--r-- 1 mcc users 7.4K Feb 26 01:56 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 26 01:56 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 01:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 01:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 02:04 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 26 02:04 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 26 02:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 02:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 265K Mar 5 18:23 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679275864046

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=lolaxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldPPPs-PT-030A
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-20 01:31:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 01:31:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 01:31:06] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2023-03-20 01:31:06] [INFO ] Transformed 933 places.
[2023-03-20 01:31:06] [INFO ] Transformed 783 transitions.
[2023-03-20 01:31:06] [INFO ] Found NUPN structural information;
[2023-03-20 01:31:06] [INFO ] Parsed PT model containing 933 places and 783 transitions and 3006 arcs in 283 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldPPPs-PT-030A-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldPPPs-PT-030A-ReachabilityCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 4 resets, run finished after 326 ms. (steps per millisecond=30 ) properties (out of 14) seen :11
FORMULA ShieldPPPs-PT-030A-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityCardinality-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityCardinality-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityCardinality-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldPPPs-PT-030A-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 783 rows 933 cols
[2023-03-20 01:31:07] [INFO ] Computed 331 place invariants in 12 ms
[2023-03-20 01:31:07] [INFO ] After 448ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-20 01:31:07] [INFO ] [Nat]Absence check using 331 positive place invariants in 51 ms returned sat
[2023-03-20 01:31:08] [INFO ] After 948ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-20 01:31:09] [INFO ] Deduced a trap composed of 14 places in 116 ms of which 35 ms to minimize.
[2023-03-20 01:31:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 307 ms
[2023-03-20 01:31:10] [INFO ] Deduced a trap composed of 11 places in 45 ms of which 1 ms to minimize.
[2023-03-20 01:31:10] [INFO ] Deduced a trap composed of 11 places in 47 ms of which 1 ms to minimize.
[2023-03-20 01:31:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 303 ms
[2023-03-20 01:31:10] [INFO ] After 2573ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 433 ms.
[2023-03-20 01:31:10] [INFO ] After 3306ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 180 ms.
Support contains 54 out of 933 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 933/933 places, 783/783 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 931 transition count 781
Partial Free-agglomeration rule applied 235 times.
Drop transitions removed 235 transitions
Iterating global reduction 0 with 235 rules applied. Total rules applied 239 place count 931 transition count 781
Applied a total of 239 rules in 254 ms. Remains 931 /933 variables (removed 2) and now considering 781/783 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 255 ms. Remains : 931/933 places, 781/783 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 191 ms. (steps per millisecond=52 ) properties (out of 3) seen :1
FORMULA ShieldPPPs-PT-030A-ReachabilityCardinality-01 FALSE 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 781 rows 931 cols
[2023-03-20 01:31:11] [INFO ] Computed 331 place invariants in 21 ms
[2023-03-20 01:31:11] [INFO ] After 157ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 01:31:12] [INFO ] [Nat]Absence check using 314 positive place invariants in 38 ms returned sat
[2023-03-20 01:31:12] [INFO ] [Nat]Absence check using 314 positive and 17 generalized place invariants in 2 ms returned sat
[2023-03-20 01:31:15] [INFO ] After 3048ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 01:31:15] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 2 ms to minimize.
[2023-03-20 01:31:15] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
[2023-03-20 01:31:16] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 0 ms to minimize.
[2023-03-20 01:31:16] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 765 ms
[2023-03-20 01:31:16] [INFO ] Deduced a trap composed of 5 places in 67 ms of which 0 ms to minimize.
[2023-03-20 01:31:16] [INFO ] Deduced a trap composed of 7 places in 84 ms of which 1 ms to minimize.
[2023-03-20 01:31:17] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 3 ms to minimize.
[2023-03-20 01:31:17] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 1 ms to minimize.
[2023-03-20 01:31:17] [INFO ] Deduced a trap composed of 7 places in 133 ms of which 0 ms to minimize.
[2023-03-20 01:31:17] [INFO ] Deduced a trap composed of 6 places in 122 ms of which 1 ms to minimize.
[2023-03-20 01:31:17] [INFO ] Deduced a trap composed of 7 places in 85 ms of which 0 ms to minimize.
[2023-03-20 01:31:17] [INFO ] Deduced a trap composed of 7 places in 94 ms of which 0 ms to minimize.
[2023-03-20 01:31:18] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 1 ms to minimize.
[2023-03-20 01:31:18] [INFO ] Deduced a trap composed of 6 places in 123 ms of which 44 ms to minimize.
[2023-03-20 01:31:18] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 8 ms to minimize.
[2023-03-20 01:31:18] [INFO ] Deduced a trap composed of 5 places in 51 ms of which 0 ms to minimize.
[2023-03-20 01:31:18] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 1828 ms
[2023-03-20 01:31:18] [INFO ] After 6409ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2628 ms.
[2023-03-20 01:31:21] [INFO ] After 9243ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 34 ms.
Support contains 50 out of 931 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 931/931 places, 781/781 transitions.
Applied a total of 0 rules in 144 ms. Remains 931 /931 variables (removed 0) and now considering 781/781 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 931/931 places, 781/781 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 2) seen :1
FORMULA ShieldPPPs-PT-030A-ReachabilityCardinality-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-20 01:31:21] [INFO ] Invariant cache hit.
[2023-03-20 01:31:21] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:31:21] [INFO ] [Nat]Absence check using 314 positive place invariants in 38 ms returned sat
[2023-03-20 01:31:21] [INFO ] [Nat]Absence check using 314 positive and 17 generalized place invariants in 3 ms returned sat
[2023-03-20 01:31:22] [INFO ] After 423ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:31:23] [INFO ] Deduced a trap composed of 7 places in 251 ms of which 1 ms to minimize.
[2023-03-20 01:31:23] [INFO ] Deduced a trap composed of 5 places in 120 ms of which 1 ms to minimize.
[2023-03-20 01:31:23] [INFO ] Deduced a trap composed of 5 places in 89 ms of which 0 ms to minimize.
[2023-03-20 01:31:23] [INFO ] Deduced a trap composed of 8 places in 110 ms of which 0 ms to minimize.
[2023-03-20 01:31:24] [INFO ] Deduced a trap composed of 7 places in 141 ms of which 0 ms to minimize.
[2023-03-20 01:31:24] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 1 ms to minimize.
[2023-03-20 01:31:24] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 1 ms to minimize.
[2023-03-20 01:31:24] [INFO ] Deduced a trap composed of 5 places in 158 ms of which 1 ms to minimize.
[2023-03-20 01:31:24] [INFO ] Deduced a trap composed of 5 places in 121 ms of which 1 ms to minimize.
[2023-03-20 01:31:25] [INFO ] Deduced a trap composed of 5 places in 206 ms of which 0 ms to minimize.
[2023-03-20 01:31:25] [INFO ] Deduced a trap composed of 6 places in 66 ms of which 1 ms to minimize.
[2023-03-20 01:31:25] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 13 ms to minimize.
[2023-03-20 01:31:25] [INFO ] Deduced a trap composed of 7 places in 132 ms of which 1 ms to minimize.
[2023-03-20 01:31:25] [INFO ] Deduced a trap composed of 5 places in 209 ms of which 13 ms to minimize.
[2023-03-20 01:31:25] [INFO ] Deduced a trap composed of 5 places in 102 ms of which 1 ms to minimize.
[2023-03-20 01:31:26] [INFO ] Deduced a trap composed of 7 places in 115 ms of which 0 ms to minimize.
[2023-03-20 01:31:26] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 1 ms to minimize.
[2023-03-20 01:31:26] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 0 ms to minimize.
[2023-03-20 01:31:26] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 1 ms to minimize.
[2023-03-20 01:31:26] [INFO ] Deduced a trap composed of 7 places in 83 ms of which 0 ms to minimize.
[2023-03-20 01:31:27] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 1 ms to minimize.
[2023-03-20 01:31:27] [INFO ] Deduced a trap composed of 5 places in 77 ms of which 1 ms to minimize.
[2023-03-20 01:31:27] [INFO ] Deduced a trap composed of 5 places in 110 ms of which 13 ms to minimize.
[2023-03-20 01:31:27] [INFO ] Deduced a trap composed of 7 places in 135 ms of which 1 ms to minimize.
[2023-03-20 01:31:27] [INFO ] Trap strengthening (SAT) tested/added 25/24 trap constraints in 4790 ms
[2023-03-20 01:31:27] [INFO ] After 5726ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 131 ms.
[2023-03-20 01:31:27] [INFO ] After 6059ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 11 ms.
Support contains 28 out of 931 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 931/931 places, 781/781 transitions.
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 931 transition count 781
Applied a total of 6 rules in 186 ms. Remains 931 /931 variables (removed 0) and now considering 781/781 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 186 ms. Remains : 931/931 places, 781/781 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 239351 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 239351 steps, saw 210910 distinct states, run finished after 3002 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 781 rows 931 cols
[2023-03-20 01:31:31] [INFO ] Computed 331 place invariants in 61 ms
[2023-03-20 01:31:31] [INFO ] After 226ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:31:31] [INFO ] [Nat]Absence check using 313 positive place invariants in 87 ms returned sat
[2023-03-20 01:31:31] [INFO ] [Nat]Absence check using 313 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-20 01:31:32] [INFO ] After 389ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:31:32] [INFO ] Deduced a trap composed of 7 places in 158 ms of which 1 ms to minimize.
[2023-03-20 01:31:32] [INFO ] Deduced a trap composed of 7 places in 230 ms of which 0 ms to minimize.
[2023-03-20 01:31:33] [INFO ] Deduced a trap composed of 5 places in 234 ms of which 0 ms to minimize.
[2023-03-20 01:31:40] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 1 ms to minimize.
[2023-03-20 01:31:41] [INFO ] Deduced a trap composed of 5 places in 208 ms of which 0 ms to minimize.
[2023-03-20 01:31:41] [INFO ] Deduced a trap composed of 5 places in 205 ms of which 15 ms to minimize.
[2023-03-20 01:31:41] [INFO ] Deduced a trap composed of 6 places in 178 ms of which 0 ms to minimize.
[2023-03-20 01:31:42] [INFO ] Deduced a trap composed of 7 places in 198 ms of which 0 ms to minimize.
[2023-03-20 01:31:42] [INFO ] Deduced a trap composed of 5 places in 279 ms of which 1 ms to minimize.
[2023-03-20 01:31:42] [INFO ] Deduced a trap composed of 6 places in 225 ms of which 1 ms to minimize.
[2023-03-20 01:31:43] [INFO ] Deduced a trap composed of 7 places in 183 ms of which 17 ms to minimize.
[2023-03-20 01:31:43] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 0 ms to minimize.
[2023-03-20 01:31:43] [INFO ] Deduced a trap composed of 7 places in 107 ms of which 0 ms to minimize.
[2023-03-20 01:31:43] [INFO ] Deduced a trap composed of 7 places in 121 ms of which 1 ms to minimize.
[2023-03-20 01:31:43] [INFO ] Deduced a trap composed of 5 places in 141 ms of which 0 ms to minimize.
[2023-03-20 01:31:44] [INFO ] Deduced a trap composed of 12 places in 155 ms of which 0 ms to minimize.
[2023-03-20 01:31:44] [INFO ] Deduced a trap composed of 5 places in 153 ms of which 1 ms to minimize.
[2023-03-20 01:31:44] [INFO ] Deduced a trap composed of 7 places in 168 ms of which 1 ms to minimize.
[2023-03-20 01:31:45] [INFO ] Deduced a trap composed of 5 places in 170 ms of which 1 ms to minimize.
[2023-03-20 01:31:45] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 0 ms to minimize.
[2023-03-20 01:31:45] [INFO ] Deduced a trap composed of 7 places in 177 ms of which 4 ms to minimize.
[2023-03-20 01:31:46] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 0 ms to minimize.
[2023-03-20 01:31:46] [INFO ] Deduced a trap composed of 6 places in 135 ms of which 27 ms to minimize.
[2023-03-20 01:31:46] [INFO ] Deduced a trap composed of 7 places in 105 ms of which 15 ms to minimize.
[2023-03-20 01:31:47] [INFO ] Deduced a trap composed of 9 places in 164 ms of which 12 ms to minimize.
[2023-03-20 01:31:48] [INFO ] Deduced a trap composed of 9 places in 160 ms of which 1 ms to minimize.
[2023-03-20 01:31:48] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 1 ms to minimize.
[2023-03-20 01:31:48] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 0 ms to minimize.
[2023-03-20 01:31:49] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 0 ms to minimize.
[2023-03-20 01:31:49] [INFO ] Deduced a trap composed of 5 places in 105 ms of which 1 ms to minimize.
[2023-03-20 01:31:49] [INFO ] Deduced a trap composed of 9 places in 120 ms of which 1 ms to minimize.
[2023-03-20 01:31:49] [INFO ] Deduced a trap composed of 24 places in 120 ms of which 0 ms to minimize.
[2023-03-20 01:31:50] [INFO ] Deduced a trap composed of 53 places in 121 ms of which 0 ms to minimize.
[2023-03-20 01:31:50] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 17919 ms
[2023-03-20 01:31:50] [INFO ] After 18417ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 129 ms.
[2023-03-20 01:31:50] [INFO ] After 18848ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 20 ms.
Support contains 28 out of 931 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 931/931 places, 781/781 transitions.
Applied a total of 0 rules in 44 ms. Remains 931 /931 variables (removed 0) and now considering 781/781 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 931/931 places, 781/781 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 931/931 places, 781/781 transitions.
Applied a total of 0 rules in 25 ms. Remains 931 /931 variables (removed 0) and now considering 781/781 (removed 0) transitions.
[2023-03-20 01:31:50] [INFO ] Invariant cache hit.
[2023-03-20 01:31:50] [INFO ] Implicit Places using invariants in 562 ms returned []
[2023-03-20 01:31:50] [INFO ] Invariant cache hit.
[2023-03-20 01:31:52] [INFO ] Implicit Places using invariants and state equation in 1418 ms returned []
Implicit Place search using SMT with State Equation took 1982 ms to find 0 implicit places.
[2023-03-20 01:31:52] [INFO ] Redundant transitions in 41 ms returned []
[2023-03-20 01:31:52] [INFO ] Invariant cache hit.
[2023-03-20 01:31:52] [INFO ] Dead Transitions using invariants and state equation in 497 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2552 ms. Remains : 931/931 places, 781/781 transitions.
Applied a total of 0 rules in 21 ms. Remains 931 /931 variables (removed 0) and now considering 781/781 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-20 01:31:52] [INFO ] Invariant cache hit.
[2023-03-20 01:31:53] [INFO ] After 180ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 01:31:53] [INFO ] [Nat]Absence check using 313 positive place invariants in 45 ms returned sat
[2023-03-20 01:31:53] [INFO ] [Nat]Absence check using 313 positive and 18 generalized place invariants in 6 ms returned sat
[2023-03-20 01:31:53] [INFO ] After 388ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 01:31:53] [INFO ] Deduced a trap composed of 5 places in 136 ms of which 1 ms to minimize.
[2023-03-20 01:31:54] [INFO ] Deduced a trap composed of 9 places in 162 ms of which 0 ms to minimize.
[2023-03-20 01:31:54] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 0 ms to minimize.
[2023-03-20 01:31:54] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 1 ms to minimize.
[2023-03-20 01:31:54] [INFO ] Deduced a trap composed of 7 places in 145 ms of which 0 ms to minimize.
[2023-03-20 01:31:54] [INFO ] Deduced a trap composed of 7 places in 143 ms of which 0 ms to minimize.
[2023-03-20 01:31:55] [INFO ] Deduced a trap composed of 7 places in 148 ms of which 0 ms to minimize.
[2023-03-20 01:31:55] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 0 ms to minimize.
[2023-03-20 01:31:55] [INFO ] Deduced a trap composed of 5 places in 204 ms of which 1 ms to minimize.
[2023-03-20 01:31:55] [INFO ] Deduced a trap composed of 7 places in 156 ms of which 2 ms to minimize.
[2023-03-20 01:31:55] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 0 ms to minimize.
[2023-03-20 01:31:56] [INFO ] Deduced a trap composed of 7 places in 157 ms of which 0 ms to minimize.
[2023-03-20 01:31:56] [INFO ] Deduced a trap composed of 9 places in 319 ms of which 2 ms to minimize.
[2023-03-20 01:31:56] [INFO ] Deduced a trap composed of 12 places in 139 ms of which 0 ms to minimize.
[2023-03-20 01:32:02] [INFO ] Deduced a trap composed of 6 places in 179 ms of which 0 ms to minimize.
[2023-03-20 01:32:03] [INFO ] Deduced a trap composed of 6 places in 256 ms of which 14 ms to minimize.
[2023-03-20 01:32:03] [INFO ] Deduced a trap composed of 6 places in 246 ms of which 0 ms to minimize.
[2023-03-20 01:32:03] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 0 ms to minimize.
[2023-03-20 01:32:03] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 1 ms to minimize.
[2023-03-20 01:32:04] [INFO ] Deduced a trap composed of 5 places in 182 ms of which 1 ms to minimize.
[2023-03-20 01:32:04] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 0 ms to minimize.
[2023-03-20 01:32:04] [INFO ] Deduced a trap composed of 7 places in 818 ms of which 1 ms to minimize.
[2023-03-20 01:32:05] [INFO ] Deduced a trap composed of 5 places in 397 ms of which 1 ms to minimize.
[2023-03-20 01:32:05] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 0 ms to minimize.
[2023-03-20 01:32:06] [INFO ] Deduced a trap composed of 7 places in 701 ms of which 0 ms to minimize.
[2023-03-20 01:32:06] [INFO ] Deduced a trap composed of 10 places in 93 ms of which 0 ms to minimize.
[2023-03-20 01:32:06] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 1 ms to minimize.
[2023-03-20 01:32:07] [INFO ] Deduced a trap composed of 5 places in 405 ms of which 0 ms to minimize.
[2023-03-20 01:32:07] [INFO ] Deduced a trap composed of 5 places in 195 ms of which 1 ms to minimize.
[2023-03-20 01:32:07] [INFO ] Deduced a trap composed of 10 places in 113 ms of which 0 ms to minimize.
[2023-03-20 01:32:07] [INFO ] Deduced a trap composed of 7 places in 59 ms of which 0 ms to minimize.
[2023-03-20 01:32:07] [INFO ] Deduced a trap composed of 5 places in 92 ms of which 0 ms to minimize.
[2023-03-20 01:32:08] [INFO ] Deduced a trap composed of 10 places in 131 ms of which 0 ms to minimize.
[2023-03-20 01:32:08] [INFO ] Trap strengthening (SAT) tested/added 34/33 trap constraints in 14460 ms
[2023-03-20 01:32:08] [INFO ] After 14947ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 933 ms.
[2023-03-20 01:32:09] [INFO ] After 16099ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-20 01:32:09] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 10 ms.
[2023-03-20 01:32:09] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 931 places, 781 transitions and 3668 arcs took 10 ms.
[2023-03-20 01:32:09] [INFO ] Flatten gal took : 119 ms
Total runtime 63436 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldPPPs-PT-030A
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/369
ReachabilityCardinality

FORMULA ShieldPPPs-PT-030A-ReachabilityCardinality-14 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679275930284

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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/369/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/369/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/369/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:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 8 (type EXCL) for 0 ShieldPPPs-PT-030A-ReachabilityCardinality-14
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 4 (type FNDP) for 0 ShieldPPPs-PT-030A-ReachabilityCardinality-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 5 (type EQUN) for 0 ShieldPPPs-PT-030A-ReachabilityCardinality-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 7 (type SRCH) for 0 ShieldPPPs-PT-030A-ReachabilityCardinality-14
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 7 (type SRCH) for ShieldPPPs-PT-030A-ReachabilityCardinality-14
lola: result : true
lola: markings : 113
lola: fired transitions : 112
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 4 (type FNDP) for ShieldPPPs-PT-030A-ReachabilityCardinality-14 (obsolete)
lola: CANCELED task # 5 (type EQUN) for ShieldPPPs-PT-030A-ReachabilityCardinality-14 (obsolete)
lola: CANCELED task # 8 (type EXCL) for ShieldPPPs-PT-030A-ReachabilityCardinality-14 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldPPPs-PT-030A-ReachabilityCardinality-14: AG false tandem / insertion


Time elapsed: 1 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-030A"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is ShieldPPPs-PT-030A, 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 r391-oct2-167903715300470"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPs-PT-030A.tgz
mv ShieldPPPs-PT-030A 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 ;