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-167903714900135.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 ShieldIIPs-PT-040A, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903714900135
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 816K
-rw-r--r-- 1 mcc users 6.0K Feb 25 16:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 16:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 16:00 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 3.7K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:21 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Feb 25 16:21 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 25 16:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Feb 25 16:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:55 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:55 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 338K 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 ShieldIIPs-PT-040A-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679267084050

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=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-040A
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 23:04:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 23:04:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 23:04:46] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2023-03-19 23:04:46] [INFO ] Transformed 1003 places.
[2023-03-19 23:04:46] [INFO ] Transformed 963 transitions.
[2023-03-19 23:04:46] [INFO ] Found NUPN structural information;
[2023-03-19 23:04:46] [INFO ] Parsed PT model containing 1003 places and 963 transitions and 4326 arcs in 308 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 4 resets, run finished after 483 ms. (steps per millisecond=20 ) properties (out of 16) seen :10
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 963 rows 1003 cols
[2023-03-19 23:04:47] [INFO ] Computed 361 place invariants in 14 ms
[2023-03-19 23:04:48] [INFO ] After 695ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 23:04:49] [INFO ] [Nat]Absence check using 361 positive place invariants in 138 ms returned sat
[2023-03-19 23:04:53] [INFO ] After 4095ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-19 23:04:53] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 13 ms to minimize.
[2023-03-19 23:04:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2023-03-19 23:04:54] [INFO ] Deduced a trap composed of 11 places in 139 ms of which 1 ms to minimize.
[2023-03-19 23:04:54] [INFO ] Deduced a trap composed of 13 places in 116 ms of which 1 ms to minimize.
[2023-03-19 23:04:54] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 1 ms to minimize.
[2023-03-19 23:04:55] [INFO ] Deduced a trap composed of 13 places in 102 ms of which 0 ms to minimize.
[2023-03-19 23:04:55] [INFO ] Deduced a trap composed of 11 places in 128 ms of which 1 ms to minimize.
[2023-03-19 23:04:55] [INFO ] Deduced a trap composed of 20 places in 89 ms of which 1 ms to minimize.
[2023-03-19 23:04:55] [INFO ] Deduced a trap composed of 26 places in 66 ms of which 1 ms to minimize.
[2023-03-19 23:04:55] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1674 ms
[2023-03-19 23:04:56] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 0 ms to minimize.
[2023-03-19 23:04:56] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 1 ms to minimize.
[2023-03-19 23:04:57] [INFO ] Deduced a trap composed of 18 places in 102 ms of which 1 ms to minimize.
[2023-03-19 23:04:57] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 747 ms
[2023-03-19 23:04:57] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 2 ms to minimize.
[2023-03-19 23:04:57] [INFO ] Deduced a trap composed of 11 places in 85 ms of which 1 ms to minimize.
[2023-03-19 23:04:58] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 2 ms to minimize.
[2023-03-19 23:04:58] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 12 ms to minimize.
[2023-03-19 23:04:58] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 864 ms
[2023-03-19 23:04:59] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 1 ms to minimize.
[2023-03-19 23:04:59] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 0 ms to minimize.
[2023-03-19 23:04:59] [INFO ] Deduced a trap composed of 9 places in 77 ms of which 1 ms to minimize.
[2023-03-19 23:04:59] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 641 ms
[2023-03-19 23:04:59] [INFO ] After 10449ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 2378 ms.
[2023-03-19 23:05:02] [INFO ] After 13463ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-03 TRUE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 633 ms.
Support contains 194 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 1002 transition count 962
Partial Free-agglomeration rule applied 191 times.
Drop transitions removed 191 transitions
Iterating global reduction 0 with 191 rules applied. Total rules applied 193 place count 1002 transition count 962
Applied a total of 193 rules in 159 ms. Remains 1002 /1003 variables (removed 1) and now considering 962/963 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 1002/1003 places, 962/963 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 282 ms. (steps per millisecond=35 ) properties (out of 5) seen :1
FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 111 ms. (steps per millisecond=90 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 962 rows 1002 cols
[2023-03-19 23:05:03] [INFO ] Computed 361 place invariants in 9 ms
[2023-03-19 23:05:04] [INFO ] [Real]Absence check using 357 positive place invariants in 51 ms returned sat
[2023-03-19 23:05:04] [INFO ] [Real]Absence check using 357 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-19 23:05:04] [INFO ] After 367ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 23:05:04] [INFO ] [Nat]Absence check using 357 positive place invariants in 107 ms returned sat
[2023-03-19 23:05:04] [INFO ] [Nat]Absence check using 357 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-19 23:05:07] [INFO ] After 2465ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 23:05:07] [INFO ] Deduced a trap composed of 9 places in 239 ms of which 1 ms to minimize.
[2023-03-19 23:05:07] [INFO ] Deduced a trap composed of 9 places in 124 ms of which 0 ms to minimize.
[2023-03-19 23:05:08] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 1 ms to minimize.
[2023-03-19 23:05:08] [INFO ] Deduced a trap composed of 16 places in 210 ms of which 1 ms to minimize.
[2023-03-19 23:05:08] [INFO ] Deduced a trap composed of 17 places in 207 ms of which 0 ms to minimize.
[2023-03-19 23:05:08] [INFO ] Deduced a trap composed of 9 places in 132 ms of which 0 ms to minimize.
[2023-03-19 23:05:09] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 0 ms to minimize.
[2023-03-19 23:05:09] [INFO ] Deduced a trap composed of 17 places in 112 ms of which 1 ms to minimize.
[2023-03-19 23:05:09] [INFO ] Deduced a trap composed of 9 places in 106 ms of which 0 ms to minimize.
[2023-03-19 23:05:09] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
[2023-03-19 23:05:09] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 0 ms to minimize.
[2023-03-19 23:05:09] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2507 ms
[2023-03-19 23:05:10] [INFO ] Deduced a trap composed of 5 places in 114 ms of which 0 ms to minimize.
[2023-03-19 23:05:10] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 1 ms to minimize.
[2023-03-19 23:05:11] [INFO ] Deduced a trap composed of 8 places in 91 ms of which 1 ms to minimize.
[2023-03-19 23:05:11] [INFO ] Deduced a trap composed of 5 places in 95 ms of which 0 ms to minimize.
[2023-03-19 23:05:11] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 965 ms
[2023-03-19 23:05:12] [INFO ] Deduced a trap composed of 17 places in 160 ms of which 1 ms to minimize.
[2023-03-19 23:05:13] [INFO ] Deduced a trap composed of 14 places in 213 ms of which 1 ms to minimize.
[2023-03-19 23:05:13] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 0 ms to minimize.
[2023-03-19 23:05:14] [INFO ] Deduced a trap composed of 10 places in 134 ms of which 1 ms to minimize.
[2023-03-19 23:05:14] [INFO ] Deduced a trap composed of 18 places in 230 ms of which 1 ms to minimize.
[2023-03-19 23:05:14] [INFO ] Deduced a trap composed of 16 places in 99 ms of which 1 ms to minimize.
[2023-03-19 23:05:15] [INFO ] Deduced a trap composed of 9 places in 212 ms of which 1 ms to minimize.
[2023-03-19 23:05:15] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 0 ms to minimize.
[2023-03-19 23:05:15] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 2719 ms
[2023-03-19 23:05:16] [INFO ] Deduced a trap composed of 5 places in 107 ms of which 0 ms to minimize.
[2023-03-19 23:05:16] [INFO ] Deduced a trap composed of 10 places in 73 ms of which 1 ms to minimize.
[2023-03-19 23:05:16] [INFO ] Deduced a trap composed of 6 places in 58 ms of which 0 ms to minimize.
[2023-03-19 23:05:16] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 0 ms to minimize.
[2023-03-19 23:05:16] [INFO ] Deduced a trap composed of 13 places in 49 ms of which 1 ms to minimize.
[2023-03-19 23:05:17] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 904 ms
[2023-03-19 23:05:17] [INFO ] After 12213ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2692 ms.
[2023-03-19 23:05:19] [INFO ] After 15625ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 466 ms.
Support contains 191 out of 1002 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1002/1002 places, 962/962 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 1002 transition count 962
Applied a total of 1 rules in 62 ms. Remains 1002 /1002 variables (removed 0) and now considering 962/962 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 1002/1002 places, 962/962 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) 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 4) seen :0
Interrupted probabilistic random walk after 95037 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :{}
Probabilistic random walk after 95037 steps, saw 87572 distinct states, run finished after 3003 ms. (steps per millisecond=31 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 962 rows 1002 cols
[2023-03-19 23:05:23] [INFO ] Computed 361 place invariants in 7 ms
[2023-03-19 23:05:24] [INFO ] [Real]Absence check using 357 positive place invariants in 74 ms returned sat
[2023-03-19 23:05:24] [INFO ] [Real]Absence check using 357 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-19 23:05:24] [INFO ] After 362ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 23:05:24] [INFO ] [Nat]Absence check using 357 positive place invariants in 52 ms returned sat
[2023-03-19 23:05:24] [INFO ] [Nat]Absence check using 357 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-19 23:05:27] [INFO ] After 2830ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 23:05:28] [INFO ] Deduced a trap composed of 9 places in 193 ms of which 1 ms to minimize.
[2023-03-19 23:05:28] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 1 ms to minimize.
[2023-03-19 23:05:28] [INFO ] Deduced a trap composed of 10 places in 452 ms of which 1 ms to minimize.
[2023-03-19 23:05:29] [INFO ] Deduced a trap composed of 10 places in 56 ms of which 1 ms to minimize.
[2023-03-19 23:05:29] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1088 ms
[2023-03-19 23:05:30] [INFO ] Deduced a trap composed of 5 places in 159 ms of which 0 ms to minimize.
[2023-03-19 23:05:30] [INFO ] Deduced a trap composed of 5 places in 152 ms of which 1 ms to minimize.
[2023-03-19 23:05:30] [INFO ] Deduced a trap composed of 5 places in 138 ms of which 1 ms to minimize.
[2023-03-19 23:05:30] [INFO ] Deduced a trap composed of 9 places in 141 ms of which 1 ms to minimize.
[2023-03-19 23:05:31] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 0 ms to minimize.
[2023-03-19 23:05:31] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 1 ms to minimize.
[2023-03-19 23:05:31] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 1 ms to minimize.
[2023-03-19 23:05:32] [INFO ] Deduced a trap composed of 9 places in 143 ms of which 1 ms to minimize.
[2023-03-19 23:05:32] [INFO ] Deduced a trap composed of 17 places in 131 ms of which 0 ms to minimize.
[2023-03-19 23:05:32] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 0 ms to minimize.
[2023-03-19 23:05:32] [INFO ] Deduced a trap composed of 20 places in 199 ms of which 1 ms to minimize.
[2023-03-19 23:05:33] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 1 ms to minimize.
[2023-03-19 23:05:33] [INFO ] Deduced a trap composed of 18 places in 93 ms of which 1 ms to minimize.
[2023-03-19 23:05:33] [INFO ] Deduced a trap composed of 11 places in 172 ms of which 16 ms to minimize.
[2023-03-19 23:05:33] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 0 ms to minimize.
[2023-03-19 23:05:33] [INFO ] Deduced a trap composed of 18 places in 91 ms of which 1 ms to minimize.
[2023-03-19 23:05:34] [INFO ] Deduced a trap composed of 9 places in 94 ms of which 0 ms to minimize.
[2023-03-19 23:05:34] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 0 ms to minimize.
[2023-03-19 23:05:34] [INFO ] Deduced a trap composed of 10 places in 108 ms of which 1 ms to minimize.
[2023-03-19 23:05:34] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 1 ms to minimize.
[2023-03-19 23:05:34] [INFO ] Deduced a trap composed of 21 places in 109 ms of which 0 ms to minimize.
[2023-03-19 23:05:34] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 5007 ms
[2023-03-19 23:05:35] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 0 ms to minimize.
[2023-03-19 23:05:35] [INFO ] Deduced a trap composed of 5 places in 86 ms of which 0 ms to minimize.
[2023-03-19 23:05:35] [INFO ] Deduced a trap composed of 10 places in 98 ms of which 0 ms to minimize.
[2023-03-19 23:05:36] [INFO ] Deduced a trap composed of 5 places in 173 ms of which 1 ms to minimize.
[2023-03-19 23:05:36] [INFO ] Deduced a trap composed of 10 places in 70 ms of which 1 ms to minimize.
[2023-03-19 23:05:36] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 986 ms
[2023-03-19 23:05:37] [INFO ] Deduced a trap composed of 8 places in 115 ms of which 0 ms to minimize.
[2023-03-19 23:05:37] [INFO ] Deduced a trap composed of 5 places in 135 ms of which 0 ms to minimize.
[2023-03-19 23:05:37] [INFO ] Deduced a trap composed of 6 places in 97 ms of which 1 ms to minimize.
[2023-03-19 23:05:38] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
[2023-03-19 23:05:38] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 0 ms to minimize.
[2023-03-19 23:05:38] [INFO ] Deduced a trap composed of 11 places in 98 ms of which 0 ms to minimize.
[2023-03-19 23:05:39] [INFO ] Deduced a trap composed of 9 places in 1320 ms of which 1 ms to minimize.
[2023-03-19 23:05:40] [INFO ] Deduced a trap composed of 5 places in 128 ms of which 1 ms to minimize.
[2023-03-19 23:05:40] [INFO ] Deduced a trap composed of 6 places in 80 ms of which 1 ms to minimize.
[2023-03-19 23:05:40] [INFO ] Deduced a trap composed of 6 places in 101 ms of which 1 ms to minimize.
[2023-03-19 23:05:41] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 1 ms to minimize.
[2023-03-19 23:05:41] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 0 ms to minimize.
[2023-03-19 23:05:41] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 1 ms to minimize.
[2023-03-19 23:05:41] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 4410 ms
[2023-03-19 23:05:41] [INFO ] After 17053ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 1571 ms.
[2023-03-19 23:05:43] [INFO ] After 19071ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 672 ms.
Support contains 191 out of 1002 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1002/1002 places, 962/962 transitions.
Applied a total of 0 rules in 44 ms. Remains 1002 /1002 variables (removed 0) and now considering 962/962 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 1002/1002 places, 962/962 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1002/1002 places, 962/962 transitions.
Applied a total of 0 rules in 29 ms. Remains 1002 /1002 variables (removed 0) and now considering 962/962 (removed 0) transitions.
[2023-03-19 23:05:44] [INFO ] Invariant cache hit.
[2023-03-19 23:05:44] [INFO ] Implicit Places using invariants in 699 ms returned []
[2023-03-19 23:05:44] [INFO ] Invariant cache hit.
[2023-03-19 23:05:46] [INFO ] Implicit Places using invariants and state equation in 1571 ms returned []
Implicit Place search using SMT with State Equation took 2288 ms to find 0 implicit places.
[2023-03-19 23:05:46] [INFO ] Redundant transitions in 140 ms returned []
[2023-03-19 23:05:46] [INFO ] Invariant cache hit.
[2023-03-19 23:05:47] [INFO ] Dead Transitions using invariants and state equation in 513 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2982 ms. Remains : 1002/1002 places, 962/962 transitions.
Applied a total of 0 rules in 23 ms. Remains 1002 /1002 variables (removed 0) and now considering 962/962 (removed 0) transitions.
Running SMT prover for 4 properties.
[2023-03-19 23:05:47] [INFO ] Invariant cache hit.
[2023-03-19 23:05:47] [INFO ] [Real]Absence check using 357 positive place invariants in 51 ms returned sat
[2023-03-19 23:05:47] [INFO ] [Real]Absence check using 357 positive and 4 generalized place invariants in 21 ms returned sat
[2023-03-19 23:05:47] [INFO ] After 263ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 23:05:47] [INFO ] [Nat]Absence check using 357 positive place invariants in 131 ms returned sat
[2023-03-19 23:05:47] [INFO ] [Nat]Absence check using 357 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-19 23:05:50] [INFO ] After 2538ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 23:05:51] [INFO ] Deduced a trap composed of 9 places in 384 ms of which 1 ms to minimize.
[2023-03-19 23:05:51] [INFO ] Deduced a trap composed of 10 places in 203 ms of which 1 ms to minimize.
[2023-03-19 23:05:52] [INFO ] Deduced a trap composed of 9 places in 945 ms of which 1 ms to minimize.
[2023-03-19 23:05:52] [INFO ] Deduced a trap composed of 12 places in 222 ms of which 0 ms to minimize.
[2023-03-19 23:05:52] [INFO ] Deduced a trap composed of 9 places in 216 ms of which 1 ms to minimize.
[2023-03-19 23:05:53] [INFO ] Deduced a trap composed of 9 places in 175 ms of which 0 ms to minimize.
[2023-03-19 23:05:53] [INFO ] Deduced a trap composed of 10 places in 176 ms of which 1 ms to minimize.
[2023-03-19 23:05:53] [INFO ] Deduced a trap composed of 16 places in 174 ms of which 1 ms to minimize.
[2023-03-19 23:05:53] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 1 ms to minimize.
[2023-03-19 23:05:54] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 1 ms to minimize.
[2023-03-19 23:05:54] [INFO ] Deduced a trap composed of 15 places in 154 ms of which 1 ms to minimize.
[2023-03-19 23:05:54] [INFO ] Deduced a trap composed of 17 places in 193 ms of which 0 ms to minimize.
[2023-03-19 23:05:54] [INFO ] Deduced a trap composed of 15 places in 159 ms of which 0 ms to minimize.
[2023-03-19 23:05:55] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 0 ms to minimize.
[2023-03-19 23:05:55] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 1 ms to minimize.
[2023-03-19 23:05:55] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 1 ms to minimize.
[2023-03-19 23:05:55] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 4957 ms
[2023-03-19 23:05:56] [INFO ] Deduced a trap composed of 17 places in 97 ms of which 1 ms to minimize.
[2023-03-19 23:05:56] [INFO ] Deduced a trap composed of 10 places in 86 ms of which 1 ms to minimize.
[2023-03-19 23:05:56] [INFO ] Deduced a trap composed of 10 places in 61 ms of which 0 ms to minimize.
[2023-03-19 23:05:56] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 651 ms
[2023-03-19 23:05:57] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 1 ms to minimize.
[2023-03-19 23:05:57] [INFO ] Deduced a trap composed of 15 places in 175 ms of which 0 ms to minimize.
[2023-03-19 23:05:57] [INFO ] Deduced a trap composed of 10 places in 194 ms of which 1 ms to minimize.
[2023-03-19 23:05:58] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 0 ms to minimize.
[2023-03-19 23:05:58] [INFO ] Deduced a trap composed of 10 places in 64 ms of which 1 ms to minimize.
[2023-03-19 23:05:58] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1291 ms
[2023-03-19 23:05:59] [INFO ] Deduced a trap composed of 5 places in 222 ms of which 1 ms to minimize.
[2023-03-19 23:05:59] [INFO ] Deduced a trap composed of 6 places in 131 ms of which 1 ms to minimize.
[2023-03-19 23:05:59] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 0 ms to minimize.
[2023-03-19 23:05:59] [INFO ] Deduced a trap composed of 5 places in 129 ms of which 1 ms to minimize.
[2023-03-19 23:06:00] [INFO ] Deduced a trap composed of 9 places in 159 ms of which 0 ms to minimize.
[2023-03-19 23:06:00] [INFO ] Deduced a trap composed of 5 places in 132 ms of which 0 ms to minimize.
[2023-03-19 23:06:00] [INFO ] Deduced a trap composed of 6 places in 121 ms of which 1 ms to minimize.
[2023-03-19 23:06:00] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 1 ms to minimize.
[2023-03-19 23:06:01] [INFO ] Deduced a trap composed of 9 places in 80 ms of which 1 ms to minimize.
[2023-03-19 23:06:01] [INFO ] Deduced a trap composed of 8 places in 74 ms of which 0 ms to minimize.
[2023-03-19 23:06:01] [INFO ] Deduced a trap composed of 9 places in 147 ms of which 0 ms to minimize.
[2023-03-19 23:06:01] [INFO ] Deduced a trap composed of 6 places in 75 ms of which 0 ms to minimize.
[2023-03-19 23:06:01] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 2781 ms
[2023-03-19 23:06:01] [INFO ] After 13928ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2355 ms.
[2023-03-19 23:06:04] [INFO ] After 16898ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
[2023-03-19 23:06:04] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 23 ms.
[2023-03-19 23:06:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1002 places, 962 transitions and 4741 arcs took 9 ms.
[2023-03-19 23:06:04] [INFO ] Flatten gal took : 242 ms
Total runtime 78408 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPs-PT-040A
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/381
ReachabilityFireability

FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-07 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-15 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-040A-ReachabilityFireability-13 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679267167833

--------------------
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:
++ 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
++ sed s/.jar//
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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/381/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/381/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/381/ReachabilityFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Rule S: 0 transitions removed,0 places removed
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 16 (type EXCL) for 0 ShieldIIPs-PT-040A-ReachabilityFireability-07
lola: time limit : 899 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 12 (type FNDP) for 0 ShieldIIPs-PT-040A-ReachabilityFireability-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 13 (type EQUN) for 0 ShieldIIPs-PT-040A-ReachabilityFireability-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 15 (type SRCH) for 0 ShieldIIPs-PT-040A-ReachabilityFireability-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 15 (type SRCH) for ShieldIIPs-PT-040A-ReachabilityFireability-07
lola: result : true
lola: markings : 90
lola: fired transitions : 89
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 12 (type FNDP) for ShieldIIPs-PT-040A-ReachabilityFireability-07 (obsolete)
lola: CANCELED task # 13 (type EQUN) for ShieldIIPs-PT-040A-ReachabilityFireability-07 (obsolete)
lola: CANCELED task # 16 (type EXCL) for ShieldIIPs-PT-040A-ReachabilityFireability-07 (obsolete)
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 22 (type EXCL) for 9 ShieldIIPs-PT-040A-ReachabilityFireability-15
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 18 (type FNDP) for 9 ShieldIIPs-PT-040A-ReachabilityFireability-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 19 (type EQUN) for 9 ShieldIIPs-PT-040A-ReachabilityFireability-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 21 (type SRCH) for 9 ShieldIIPs-PT-040A-ReachabilityFireability-15
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 12 (type FNDP) for ShieldIIPs-PT-040A-ReachabilityFireability-07
lola: result : true
lola: fired transitions : 88
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:711
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: 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: FINISHED task # 21 (type SRCH) for ShieldIIPs-PT-040A-ReachabilityFireability-15
lola: result : true
lola: markings : 125
lola: fired transitions : 124
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 18 (type FNDP) for ShieldIIPs-PT-040A-ReachabilityFireability-15 (obsolete)
lola: CANCELED task # 19 (type EQUN) for ShieldIIPs-PT-040A-ReachabilityFireability-15 (obsolete)
lola: CANCELED task # 22 (type EXCL) for ShieldIIPs-PT-040A-ReachabilityFireability-15 (obsolete)
lola: LAUNCH task # 36 (type EXCL) for 6 ShieldIIPs-PT-040A-ReachabilityFireability-13
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 25 (type FNDP) for 3 ShieldIIPs-PT-040A-ReachabilityFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 26 (type EQUN) for 3 ShieldIIPs-PT-040A-ReachabilityFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 28 (type SRCH) for 3 ShieldIIPs-PT-040A-ReachabilityFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
sara: try reading problem file /home/mcc/execution/381/ReachabilityFireability-13.sara.
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: FINISHED task # 18 (type FNDP) for ShieldIIPs-PT-040A-ReachabilityFireability-15
lola: result : unknown
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: FINISHED task # 28 (type SRCH) for ShieldIIPs-PT-040A-ReachabilityFireability-08
lola: result : true
lola: markings : 59
lola: fired transitions : 58
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 25 (type FNDP) for ShieldIIPs-PT-040A-ReachabilityFireability-08 (obsolete)
lola: CANCELED task # 26 (type EQUN) for ShieldIIPs-PT-040A-ReachabilityFireability-08 (obsolete)
lola: LAUNCH task # 32 (type FNDP) for 6 ShieldIIPs-PT-040A-ReachabilityFireability-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 33 (type EQUN) for 6 ShieldIIPs-PT-040A-ReachabilityFireability-13
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 35 (type SRCH) for 6 ShieldIIPs-PT-040A-ReachabilityFireability-13
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 # 25 (type FNDP) for ShieldIIPs-PT-040A-ReachabilityFireability-08
lola: result : true
lola: fired transitions : 57
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: FINISHED task # 35 (type SRCH) for ShieldIIPs-PT-040A-ReachabilityFireability-13
lola: result : true
lola: markings : 51
lola: fired transitions : 50
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 32 (type FNDP) for ShieldIIPs-PT-040A-ReachabilityFireability-13 (obsolete)
lola: CANCELED task # 33 (type EQUN) for ShieldIIPs-PT-040A-ReachabilityFireability-13 (obsolete)
lola: CANCELED task # 36 (type EXCL) for ShieldIIPs-PT-040A-ReachabilityFireability-13 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPs-PT-040A-ReachabilityFireability-07: EF true tandem / insertion
ShieldIIPs-PT-040A-ReachabilityFireability-08: AG false tandem / insertion
ShieldIIPs-PT-040A-ReachabilityFireability-13: AG false tandem / insertion
ShieldIIPs-PT-040A-ReachabilityFireability-15: EF true tandem / insertion


Time elapsed: 2 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-040A"
export BK_EXAMINATION="ReachabilityFireability"
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 ShieldIIPs-PT-040A, 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 r391-oct2-167903714900135"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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