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-171683788500095.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 ShieldIIPs-PT-050A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r373-tall-171683788500095
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 868K
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:15 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 16:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 19:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Apr 11 15:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 100K Apr 11 15:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Apr 11 15:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 15:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:52 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 426K 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 ShieldIIPs-PT-050A-ReachabilityFireability-2024-00
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-2024-01
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-2024-02
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-2024-03
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-2024-04
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-2024-05
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-2024-06
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-2024-07
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-2024-08
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-2024-09
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-2024-10
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-2024-11
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-2024-12
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-2024-13
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-2024-14
FORMULA_NAME ShieldIIPs-PT-050A-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716945459257

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-050A
Applying reductions before tool lola
Invoking reducer
Running Version 202304061127
[2024-05-29 01:17:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-29 01:17:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-29 01:17:41] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2024-05-29 01:17:41] [INFO ] Transformed 1253 places.
[2024-05-29 01:17:41] [INFO ] Transformed 1203 transitions.
[2024-05-29 01:17:41] [INFO ] Found NUPN structural information;
[2024-05-29 01:17:41] [INFO ] Parsed PT model containing 1253 places and 1203 transitions and 5406 arcs in 268 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 3 resets, run finished after 434 ms. (steps per millisecond=23 ) properties (out of 16) seen :13
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1203 rows 1253 cols
[2024-05-29 01:17:42] [INFO ] Computed 451 invariants in 26 ms
[2024-05-29 01:17:43] [INFO ] After 522ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-29 01:17:43] [INFO ] [Nat]Absence check using 451 positive place invariants in 87 ms returned sat
[2024-05-29 01:17:46] [INFO ] After 2775ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-29 01:17:47] [INFO ] Deduced a trap composed of 17 places in 168 ms of which 6 ms to minimize.
[2024-05-29 01:17:47] [INFO ] Deduced a trap composed of 11 places in 99 ms of which 1 ms to minimize.
[2024-05-29 01:17:48] [INFO ] Deduced a trap composed of 11 places in 116 ms of which 1 ms to minimize.
[2024-05-29 01:17:48] [INFO ] Deduced a trap composed of 15 places in 105 ms of which 1 ms to minimize.
[2024-05-29 01:17:48] [INFO ] Deduced a trap composed of 17 places in 110 ms of which 1 ms to minimize.
[2024-05-29 01:17:48] [INFO ] Deduced a trap composed of 19 places in 87 ms of which 0 ms to minimize.
[2024-05-29 01:17:48] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-05-29 01:17:48] [INFO ] Deduced a trap composed of 17 places in 89 ms of which 1 ms to minimize.
[2024-05-29 01:17:48] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2024-05-29 01:17:49] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 1 ms to minimize.
[2024-05-29 01:17:49] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 1 ms to minimize.
[2024-05-29 01:17:49] [INFO ] Deduced a trap composed of 17 places in 82 ms of which 0 ms to minimize.
[2024-05-29 01:17:49] [INFO ] Deduced a trap composed of 19 places in 63 ms of which 1 ms to minimize.
[2024-05-29 01:17:49] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 0 ms to minimize.
[2024-05-29 01:17:49] [INFO ] Deduced a trap composed of 11 places in 50 ms of which 0 ms to minimize.
[2024-05-29 01:17:49] [INFO ] Deduced a trap composed of 13 places in 45 ms of which 0 ms to minimize.
[2024-05-29 01:17:49] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 3043 ms
[2024-05-29 01:17:50] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 0 ms to minimize.
[2024-05-29 01:17:50] [INFO ] Deduced a trap composed of 19 places in 42 ms of which 1 ms to minimize.
[2024-05-29 01:17:50] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 315 ms
[2024-05-29 01:17:51] [INFO ] Deduced a trap composed of 11 places in 48 ms of which 1 ms to minimize.
[2024-05-29 01:17:51] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 0 ms to minimize.
[2024-05-29 01:17:52] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 294 ms
[2024-05-29 01:17:52] [INFO ] After 8538ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 2405 ms.
[2024-05-29 01:17:54] [INFO ] After 11426ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 255 ms.
Support contains 133 out of 1253 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1253/1253 places, 1203/1203 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 1253 transition count 1202
Deduced a syphon composed of 1 places in 7 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1252 transition count 1202
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 1251 transition count 1201
Partial Free-agglomeration rule applied 289 times.
Drop transitions removed 289 transitions
Iterating global reduction 0 with 289 rules applied. Total rules applied 293 place count 1251 transition count 1201
Applied a total of 293 rules in 304 ms. Remains 1251 /1253 variables (removed 2) and now considering 1201/1203 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 305 ms. Remains : 1251/1253 places, 1201/1203 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 213 ms. (steps per millisecond=46 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 173922 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{0=1, 2=1}
Probabilistic random walk after 173922 steps, saw 168686 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :2
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 1 properties.
// Phase 1: matrix 1201 rows 1251 cols
[2024-05-29 01:17:58] [INFO ] Computed 451 invariants in 49 ms
[2024-05-29 01:17:58] [INFO ] After 330ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 01:17:59] [INFO ] [Nat]Absence check using 441 positive place invariants in 83 ms returned sat
[2024-05-29 01:17:59] [INFO ] [Nat]Absence check using 441 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-29 01:18:00] [INFO ] After 1276ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 01:18:00] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 01:18:01] [INFO ] After 634ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 01:18:02] [INFO ] Deduced a trap composed of 6 places in 139 ms of which 1 ms to minimize.
[2024-05-29 01:18:02] [INFO ] Deduced a trap composed of 9 places in 145 ms of which 1 ms to minimize.
[2024-05-29 01:18:02] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 1 ms to minimize.
[2024-05-29 01:18:02] [INFO ] Deduced a trap composed of 5 places in 123 ms of which 0 ms to minimize.
[2024-05-29 01:18:03] [INFO ] Deduced a trap composed of 24 places in 132 ms of which 0 ms to minimize.
[2024-05-29 01:18:03] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 1 ms to minimize.
[2024-05-29 01:18:03] [INFO ] Deduced a trap composed of 9 places in 95 ms of which 1 ms to minimize.
[2024-05-29 01:18:03] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 1 ms to minimize.
[2024-05-29 01:18:03] [INFO ] Deduced a trap composed of 15 places in 94 ms of which 1 ms to minimize.
[2024-05-29 01:18:03] [INFO ] Deduced a trap composed of 5 places in 71 ms of which 1 ms to minimize.
[2024-05-29 01:18:04] [INFO ] Deduced a trap composed of 9 places in 65 ms of which 0 ms to minimize.
[2024-05-29 01:18:04] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2024-05-29 01:18:04] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2024-05-29 01:18:04] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2475 ms
[2024-05-29 01:18:04] [INFO ] After 4029ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 568 ms.
[2024-05-29 01:18:05] [INFO ] After 6220ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 84 ms.
Support contains 53 out of 1251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1251/1251 places, 1201/1201 transitions.
Partial Free-agglomeration rule applied 33 times.
Drop transitions removed 33 transitions
Iterating global reduction 0 with 33 rules applied. Total rules applied 33 place count 1251 transition count 1201
Applied a total of 33 rules in 110 ms. Remains 1251 /1251 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 1251/1251 places, 1201/1201 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 81 ms. (steps per millisecond=123 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 181493 steps, run timeout after 3001 ms. (steps per millisecond=60 ) properties seen :{}
Probabilistic random walk after 181493 steps, saw 168739 distinct states, run finished after 3002 ms. (steps per millisecond=60 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1201 rows 1251 cols
[2024-05-29 01:18:08] [INFO ] Computed 451 invariants in 47 ms
[2024-05-29 01:18:08] [INFO ] After 235ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 01:18:09] [INFO ] [Nat]Absence check using 440 positive place invariants in 79 ms returned sat
[2024-05-29 01:18:09] [INFO ] [Nat]Absence check using 440 positive and 11 generalized place invariants in 2 ms returned sat
[2024-05-29 01:18:10] [INFO ] After 1399ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 01:18:10] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-29 01:18:11] [INFO ] After 700ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-29 01:18:12] [INFO ] Deduced a trap composed of 5 places in 124 ms of which 1 ms to minimize.
[2024-05-29 01:18:12] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 0 ms to minimize.
[2024-05-29 01:18:12] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 0 ms to minimize.
[2024-05-29 01:18:12] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
[2024-05-29 01:18:13] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 1 ms to minimize.
[2024-05-29 01:18:13] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 0 ms to minimize.
[2024-05-29 01:18:13] [INFO ] Deduced a trap composed of 13 places in 66 ms of which 1 ms to minimize.
[2024-05-29 01:18:13] [INFO ] Deduced a trap composed of 9 places in 52 ms of which 1 ms to minimize.
[2024-05-29 01:18:13] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 0 ms to minimize.
[2024-05-29 01:18:14] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 0 ms to minimize.
[2024-05-29 01:18:14] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2025 ms
[2024-05-29 01:18:14] [INFO ] After 3680ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 711 ms.
[2024-05-29 01:18:14] [INFO ] After 6121ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 80 ms.
Support contains 53 out of 1251 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1251/1251 places, 1201/1201 transitions.
Applied a total of 0 rules in 40 ms. Remains 1251 /1251 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 1251/1251 places, 1201/1201 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1251/1251 places, 1201/1201 transitions.
Applied a total of 0 rules in 32 ms. Remains 1251 /1251 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
[2024-05-29 01:18:15] [INFO ] Invariant cache hit.
[2024-05-29 01:18:16] [INFO ] Implicit Places using invariants in 951 ms returned [1237]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 955 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 1250/1251 places, 1201/1201 transitions.
Applied a total of 0 rules in 33 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1022 ms. Remains : 1250/1251 places, 1201/1201 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 187340 steps, run timeout after 3001 ms. (steps per millisecond=62 ) properties seen :{}
Probabilistic random walk after 187340 steps, saw 173199 distinct states, run finished after 3001 ms. (steps per millisecond=62 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1201 rows 1250 cols
[2024-05-29 01:18:19] [INFO ] Computed 450 invariants in 42 ms
[2024-05-29 01:18:19] [INFO ] After 278ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 01:18:19] [INFO ] [Nat]Absence check using 439 positive place invariants in 74 ms returned sat
[2024-05-29 01:18:19] [INFO ] [Nat]Absence check using 439 positive and 11 generalized place invariants in 2 ms returned sat
[2024-05-29 01:18:21] [INFO ] After 1368ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 01:18:22] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 1 ms to minimize.
[2024-05-29 01:18:22] [INFO ] Deduced a trap composed of 9 places in 58 ms of which 1 ms to minimize.
[2024-05-29 01:18:23] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 0 ms to minimize.
[2024-05-29 01:18:23] [INFO ] Deduced a trap composed of 9 places in 48 ms of which 0 ms to minimize.
[2024-05-29 01:18:23] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 2 ms to minimize.
[2024-05-29 01:18:23] [INFO ] Deduced a trap composed of 9 places in 45 ms of which 0 ms to minimize.
[2024-05-29 01:18:23] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 0 ms to minimize.
[2024-05-29 01:18:24] [INFO ] Deduced a trap composed of 5 places in 39 ms of which 0 ms to minimize.
[2024-05-29 01:18:24] [INFO ] Deduced a trap composed of 6 places in 72 ms of which 1 ms to minimize.
[2024-05-29 01:18:24] [INFO ] Deduced a trap composed of 9 places in 70 ms of which 5 ms to minimize.
[2024-05-29 01:18:24] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2024-05-29 01:18:25] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 0 ms to minimize.
[2024-05-29 01:18:25] [INFO ] Deduced a trap composed of 15 places in 51 ms of which 1 ms to minimize.
[2024-05-29 01:18:25] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 2904 ms
[2024-05-29 01:18:25] [INFO ] After 5603ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 1300 ms.
[2024-05-29 01:18:26] [INFO ] After 7235ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 73 ms.
Support contains 53 out of 1250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 31 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 1250/1250 places, 1201/1201 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 47 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
[2024-05-29 01:18:27] [INFO ] Invariant cache hit.
[2024-05-29 01:18:28] [INFO ] Implicit Places using invariants in 1037 ms returned []
[2024-05-29 01:18:28] [INFO ] Invariant cache hit.
[2024-05-29 01:18:30] [INFO ] Implicit Places using invariants and state equation in 2118 ms returned []
Implicit Place search using SMT with State Equation took 3168 ms to find 0 implicit places.
[2024-05-29 01:18:30] [INFO ] Redundant transitions in 104 ms returned []
[2024-05-29 01:18:30] [INFO ] Invariant cache hit.
[2024-05-29 01:18:31] [INFO ] Dead Transitions using invariants and state equation in 833 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4159 ms. Remains : 1250/1250 places, 1201/1201 transitions.
Applied a total of 0 rules in 30 ms. Remains 1250 /1250 variables (removed 0) and now considering 1201/1201 (removed 0) transitions.
Running SMT prover for 1 properties.
[2024-05-29 01:18:31] [INFO ] Invariant cache hit.
[2024-05-29 01:18:31] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-29 01:18:31] [INFO ] [Nat]Absence check using 439 positive place invariants in 81 ms returned sat
[2024-05-29 01:18:31] [INFO ] [Nat]Absence check using 439 positive and 11 generalized place invariants in 3 ms returned sat
[2024-05-29 01:18:33] [INFO ] After 1423ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-29 01:18:34] [INFO ] Deduced a trap composed of 13 places in 137 ms of which 0 ms to minimize.
[2024-05-29 01:18:35] [INFO ] Deduced a trap composed of 5 places in 100 ms of which 0 ms to minimize.
[2024-05-29 01:18:35] [INFO ] Deduced a trap composed of 9 places in 92 ms of which 1 ms to minimize.
[2024-05-29 01:18:35] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2024-05-29 01:18:36] [INFO ] Deduced a trap composed of 6 places in 96 ms of which 0 ms to minimize.
[2024-05-29 01:18:36] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 0 ms to minimize.
[2024-05-29 01:18:36] [INFO ] Deduced a trap composed of 9 places in 83 ms of which 0 ms to minimize.
[2024-05-29 01:18:36] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 2 ms to minimize.
[2024-05-29 01:18:37] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 5 ms to minimize.
[2024-05-29 01:18:37] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2914 ms
[2024-05-29 01:18:37] [INFO ] After 5920ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 534 ms.
[2024-05-29 01:18:38] [INFO ] After 6778ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2024-05-29 01:18:38] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-05-29 01:18:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1250 places, 1201 transitions and 6082 arcs took 7 ms.
[2024-05-29 01:18:38] [INFO ] Flatten gal took : 234 ms
Total runtime 57329 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPs-PT-050A
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/367
ReachabilityFireability

FORMULA ShieldIIPs-PT-050A-ReachabilityFireability-2024-02 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1716945520808

--------------------
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 ReachabilityFireability -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/367/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/367/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/367/ReachabilityFireability.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 ShieldIIPs-PT-050A-ReachabilityFireability-2024-02
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 3 (type FNDP) for 0 ShieldIIPs-PT-050A-ReachabilityFireability-2024-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 4 (type EQUN) for 0 ShieldIIPs-PT-050A-ReachabilityFireability-2024-02
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 ShieldIIPs-PT-050A-ReachabilityFireability-2024-02
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 6 (type SRCH) for ShieldIIPs-PT-050A-ReachabilityFireability-2024-02
lola: result : true
lola: markings : 100
lola: fired transitions : 99
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 3 (type FNDP) for ShieldIIPs-PT-050A-ReachabilityFireability-2024-02 (obsolete)
lola: CANCELED task # 4 (type EQUN) for ShieldIIPs-PT-050A-ReachabilityFireability-2024-02 (obsolete)
lola: CANCELED task # 7 (type EXCL) for ShieldIIPs-PT-050A-ReachabilityFireability-2024-02 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPs-PT-050A-ReachabilityFireability-2024-02: EF true 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="ShieldIIPs-PT-050A"
export BK_EXAMINATION="ReachabilityFireability"
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 ShieldIIPs-PT-050A, examination is ReachabilityFireability"
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-171683788500095"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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