fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r391-oct2-167903714800079
Last Updated
May 14, 2023

About the Execution of LoLa+red for ShieldIIPs-PT-005B

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
472.560 24043.00 51786.00 71.20 FTTTTTTTFFTFTFFF normal

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-167903714800079.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-005B, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903714800079
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 504K
-rw-r--r-- 1 mcc users 6.2K Feb 25 15:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Feb 25 15:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Feb 25 15:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 25 15:52 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.8K Feb 25 16:54 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:54 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 16:54 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 15:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Feb 25 15:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 25 15:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 25 15:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:54 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:54 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 82K 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-005B-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-005B-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679265573043

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-005B
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 22:39:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 22:39:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 22:39:35] [INFO ] Load time of PNML (sax parser for PT used): 76 ms
[2023-03-19 22:39:35] [INFO ] Transformed 303 places.
[2023-03-19 22:39:35] [INFO ] Transformed 298 transitions.
[2023-03-19 22:39:35] [INFO ] Found NUPN structural information;
[2023-03-19 22:39:35] [INFO ] Parsed PT model containing 303 places and 298 transitions and 896 arcs in 190 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 14 resets, run finished after 279 ms. (steps per millisecond=35 ) properties (out of 16) seen :12
FORMULA ShieldIIPs-PT-005B-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-005B-ReachabilityFireability-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-005B-ReachabilityFireability-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-005B-ReachabilityFireability-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-005B-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-005B-ReachabilityFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-005B-ReachabilityFireability-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-005B-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-005B-ReachabilityFireability-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-005B-ReachabilityFireability-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-005B-ReachabilityFireability-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-005B-ReachabilityFireability-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 298 rows 303 cols
[2023-03-19 22:39:36] [INFO ] Computed 46 place invariants in 13 ms
[2023-03-19 22:39:36] [INFO ] After 327ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 22:39:36] [INFO ] [Nat]Absence check using 46 positive place invariants in 14 ms returned sat
[2023-03-19 22:39:37] [INFO ] After 1016ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2023-03-19 22:39:38] [INFO ] Deduced a trap composed of 16 places in 266 ms of which 14 ms to minimize.
[2023-03-19 22:39:38] [INFO ] Deduced a trap composed of 17 places in 285 ms of which 1 ms to minimize.
[2023-03-19 22:39:38] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 2 ms to minimize.
[2023-03-19 22:39:38] [INFO ] Deduced a trap composed of 20 places in 174 ms of which 2 ms to minimize.
[2023-03-19 22:39:39] [INFO ] Deduced a trap composed of 20 places in 193 ms of which 1 ms to minimize.
[2023-03-19 22:39:39] [INFO ] Deduced a trap composed of 21 places in 137 ms of which 1 ms to minimize.
[2023-03-19 22:39:39] [INFO ] Deduced a trap composed of 22 places in 117 ms of which 0 ms to minimize.
[2023-03-19 22:39:39] [INFO ] Deduced a trap composed of 23 places in 46 ms of which 5 ms to minimize.
[2023-03-19 22:39:39] [INFO ] Deduced a trap composed of 26 places in 47 ms of which 1 ms to minimize.
[2023-03-19 22:39:39] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1607 ms
[2023-03-19 22:39:39] [INFO ] Deduced a trap composed of 21 places in 149 ms of which 1 ms to minimize.
[2023-03-19 22:39:40] [INFO ] Deduced a trap composed of 29 places in 146 ms of which 1 ms to minimize.
[2023-03-19 22:39:40] [INFO ] Deduced a trap composed of 28 places in 124 ms of which 1 ms to minimize.
[2023-03-19 22:39:40] [INFO ] Deduced a trap composed of 19 places in 89 ms of which 1 ms to minimize.
[2023-03-19 22:39:40] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 1 ms to minimize.
[2023-03-19 22:39:40] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 0 ms to minimize.
[2023-03-19 22:39:40] [INFO ] Deduced a trap composed of 25 places in 65 ms of which 0 ms to minimize.
[2023-03-19 22:39:40] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 0 ms to minimize.
[2023-03-19 22:39:40] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 0 ms to minimize.
[2023-03-19 22:39:41] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 0 ms to minimize.
[2023-03-19 22:39:41] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1329 ms
[2023-03-19 22:39:41] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 1 ms to minimize.
[2023-03-19 22:39:41] [INFO ] Deduced a trap composed of 20 places in 124 ms of which 0 ms to minimize.
[2023-03-19 22:39:41] [INFO ] Deduced a trap composed of 42 places in 87 ms of which 1 ms to minimize.
[2023-03-19 22:39:41] [INFO ] Deduced a trap composed of 18 places in 191 ms of which 1 ms to minimize.
[2023-03-19 22:39:41] [INFO ] Deduced a trap composed of 31 places in 145 ms of which 0 ms to minimize.
[2023-03-19 22:39:42] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 0 ms to minimize.
[2023-03-19 22:39:42] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 0 ms to minimize.
[2023-03-19 22:39:42] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 0 ms to minimize.
[2023-03-19 22:39:42] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1033 ms
[2023-03-19 22:39:42] [INFO ] After 5376ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 342 ms.
[2023-03-19 22:39:42] [INFO ] After 5957ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
FORMULA ShieldIIPs-PT-005B-ReachabilityFireability-15 FALSE TECHNIQUES STRUCTURAL_REDUCTION TOPOLOGICAL SAT_SMT
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 69 ms.
Support contains 132 out of 303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 298/298 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 303 transition count 293
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 7 rules applied. Total rules applied 12 place count 298 transition count 291
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 296 transition count 291
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 14 place count 296 transition count 277
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 42 place count 282 transition count 277
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 55 place count 269 transition count 264
Iterating global reduction 3 with 13 rules applied. Total rules applied 68 place count 269 transition count 264
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 3 with 50 rules applied. Total rules applied 118 place count 244 transition count 239
Partial Free-agglomeration rule applied 9 times.
Drop transitions removed 9 transitions
Iterating global reduction 3 with 9 rules applied. Total rules applied 127 place count 244 transition count 239
Applied a total of 127 rules in 62 ms. Remains 244 /303 variables (removed 59) and now considering 239/298 (removed 59) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62 ms. Remains : 244/303 places, 239/298 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 229 ms. (steps per millisecond=43 ) properties (out of 3) seen :1
FORMULA ShieldIIPs-PT-005B-ReachabilityFireability-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 239 rows 244 cols
[2023-03-19 22:39:43] [INFO ] Computed 46 place invariants in 5 ms
[2023-03-19 22:39:43] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 22:39:43] [INFO ] [Nat]Absence check using 46 positive place invariants in 16 ms returned sat
[2023-03-19 22:39:43] [INFO ] After 332ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 22:39:43] [INFO ] Deduced a trap composed of 17 places in 183 ms of which 24 ms to minimize.
[2023-03-19 22:39:44] [INFO ] Deduced a trap composed of 18 places in 71 ms of which 1 ms to minimize.
[2023-03-19 22:39:44] [INFO ] Deduced a trap composed of 19 places in 75 ms of which 0 ms to minimize.
[2023-03-19 22:39:44] [INFO ] Deduced a trap composed of 12 places in 102 ms of which 1 ms to minimize.
[2023-03-19 22:39:44] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 0 ms to minimize.
[2023-03-19 22:39:44] [INFO ] Deduced a trap composed of 8 places in 100 ms of which 1 ms to minimize.
[2023-03-19 22:39:44] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 1 ms to minimize.
[2023-03-19 22:39:44] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2023-03-19 22:39:44] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2023-03-19 22:39:44] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 1 ms to minimize.
[2023-03-19 22:39:45] [INFO ] Deduced a trap composed of 27 places in 105 ms of which 1 ms to minimize.
[2023-03-19 22:39:45] [INFO ] Deduced a trap composed of 21 places in 97 ms of which 1 ms to minimize.
[2023-03-19 22:39:45] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 1 ms to minimize.
[2023-03-19 22:39:45] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 1617 ms
[2023-03-19 22:39:45] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 1 ms to minimize.
[2023-03-19 22:39:45] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 0 ms to minimize.
[2023-03-19 22:39:45] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 25 ms to minimize.
[2023-03-19 22:39:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 401 ms
[2023-03-19 22:39:45] [INFO ] After 2636ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 338 ms.
[2023-03-19 22:39:46] [INFO ] After 3090ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 13 ms.
Support contains 108 out of 244 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 244/244 places, 239/239 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 244 transition count 237
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 242 transition count 237
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 4 place count 242 transition count 233
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 12 place count 238 transition count 233
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 16 place count 234 transition count 229
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 234 transition count 229
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 20 place count 234 transition count 228
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 22 place count 233 transition count 228
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 42 place count 223 transition count 218
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 45 place count 223 transition count 218
Applied a total of 45 rules in 52 ms. Remains 223 /244 variables (removed 21) and now considering 218/239 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 223/244 places, 218/239 transitions.
Incomplete random walk after 10000 steps, including 17 resets, run finished after 122 ms. (steps per millisecond=81 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 783419 steps, run timeout after 3001 ms. (steps per millisecond=261 ) properties seen :{}
Probabilistic random walk after 783419 steps, saw 149230 distinct states, run finished after 3005 ms. (steps per millisecond=260 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 218 rows 223 cols
[2023-03-19 22:39:49] [INFO ] Computed 46 place invariants in 2 ms
[2023-03-19 22:39:49] [INFO ] After 89ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 22:39:49] [INFO ] [Nat]Absence check using 46 positive place invariants in 9 ms returned sat
[2023-03-19 22:39:49] [INFO ] After 222ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 22:39:50] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 1 ms to minimize.
[2023-03-19 22:39:50] [INFO ] Deduced a trap composed of 16 places in 96 ms of which 1 ms to minimize.
[2023-03-19 22:39:50] [INFO ] Deduced a trap composed of 19 places in 60 ms of which 0 ms to minimize.
[2023-03-19 22:39:50] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 299 ms
[2023-03-19 22:39:50] [INFO ] After 712ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 255 ms.
[2023-03-19 22:39:50] [INFO ] After 1079ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 13 ms.
Support contains 108 out of 223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 218/218 transitions.
Applied a total of 0 rules in 6 ms. Remains 223 /223 variables (removed 0) and now considering 218/218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 223/223 places, 218/218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 218/218 transitions.
Applied a total of 0 rules in 5 ms. Remains 223 /223 variables (removed 0) and now considering 218/218 (removed 0) transitions.
[2023-03-19 22:39:50] [INFO ] Invariant cache hit.
[2023-03-19 22:39:50] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-19 22:39:50] [INFO ] Invariant cache hit.
[2023-03-19 22:39:51] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 291 ms to find 0 implicit places.
[2023-03-19 22:39:51] [INFO ] Redundant transitions in 177 ms returned []
[2023-03-19 22:39:51] [INFO ] Invariant cache hit.
[2023-03-19 22:39:51] [INFO ] Dead Transitions using invariants and state equation in 228 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 711 ms. Remains : 223/223 places, 218/218 transitions.
Applied a total of 0 rules in 6 ms. Remains 223 /223 variables (removed 0) and now considering 218/218 (removed 0) transitions.
Running SMT prover for 2 properties.
[2023-03-19 22:39:51] [INFO ] Invariant cache hit.
[2023-03-19 22:39:51] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-19 22:39:51] [INFO ] [Nat]Absence check using 46 positive place invariants in 7 ms returned sat
[2023-03-19 22:39:51] [INFO ] After 204ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-19 22:39:52] [INFO ] Deduced a trap composed of 10 places in 126 ms of which 1 ms to minimize.
[2023-03-19 22:39:52] [INFO ] Deduced a trap composed of 20 places in 81 ms of which 1 ms to minimize.
[2023-03-19 22:39:52] [INFO ] Deduced a trap composed of 16 places in 76 ms of which 0 ms to minimize.
[2023-03-19 22:39:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 382 ms
[2023-03-19 22:39:52] [INFO ] Deduced a trap composed of 12 places in 91 ms of which 1 ms to minimize.
[2023-03-19 22:39:52] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 1 ms to minimize.
[2023-03-19 22:39:52] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 1 ms to minimize.
[2023-03-19 22:39:52] [INFO ] Deduced a trap composed of 16 places in 104 ms of which 1 ms to minimize.
[2023-03-19 22:39:52] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 3 ms to minimize.
[2023-03-19 22:39:52] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 590 ms
[2023-03-19 22:39:52] [INFO ] After 1353ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 216 ms.
[2023-03-19 22:39:53] [INFO ] After 1647ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
[2023-03-19 22:39:53] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 27 ms.
[2023-03-19 22:39:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 223 places, 218 transitions and 758 arcs took 10 ms.
[2023-03-19 22:39:53] [INFO ] Flatten gal took : 80 ms
Total runtime 18183 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPs-PT-005B
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/374
ReachabilityFireability

FORMULA ShieldIIPs-PT-005B-ReachabilityFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-005B-ReachabilityFireability-08 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679265597086

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination 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/374/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/374/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/374/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: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 10 (type EXCL) for 0 ShieldIIPs-PT-005B-ReachabilityFireability-05
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 6 (type FNDP) for 0 ShieldIIPs-PT-005B-ReachabilityFireability-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 7 (type EQUN) for 0 ShieldIIPs-PT-005B-ReachabilityFireability-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 9 (type SRCH) for 0 ShieldIIPs-PT-005B-ReachabilityFireability-05
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: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 6 (type FNDP) for ShieldIIPs-PT-005B-ReachabilityFireability-05
lola: result : true
lola: fired transitions : 178801
lola: tried executions : 9487
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 7 (type EQUN) for ShieldIIPs-PT-005B-ReachabilityFireability-05 (obsolete)
lola: CANCELED task # 9 (type SRCH) for ShieldIIPs-PT-005B-ReachabilityFireability-05 (obsolete)
lola: CANCELED task # 10 (type EXCL) for ShieldIIPs-PT-005B-ReachabilityFireability-05 (obsolete)
lola: LAUNCH task # 16 (type EXCL) for 3 ShieldIIPs-PT-005B-ReachabilityFireability-08
lola: time limit : 3599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 12 (type FNDP) for 3 ShieldIIPs-PT-005B-ReachabilityFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 13 (type EQUN) for 3 ShieldIIPs-PT-005B-ReachabilityFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 15 (type SRCH) for 3 ShieldIIPs-PT-005B-ReachabilityFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 7 (type EQUN) for ShieldIIPs-PT-005B-ReachabilityFireability-05
lola: result : unknown
lola: FINISHED task # 15 (type SRCH) for ShieldIIPs-PT-005B-ReachabilityFireability-08
lola: result : false
lola: markings : 734691
lola: fired transitions : 1860183
lola: time used : 3.000000
lola: memory pages used : 3
lola: CANCELED task # 12 (type FNDP) for ShieldIIPs-PT-005B-ReachabilityFireability-08 (obsolete)
lola: CANCELED task # 13 (type EQUN) for ShieldIIPs-PT-005B-ReachabilityFireability-08 (obsolete)
lola: CANCELED task # 16 (type EXCL) for ShieldIIPs-PT-005B-ReachabilityFireability-08 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPs-PT-005B-ReachabilityFireability-05: EF true findpath
ShieldIIPs-PT-005B-ReachabilityFireability-08: EF false tandem / insertion


Time elapsed: 4 secs. Pages in use: 5

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-005B"
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-005B, 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-167903714800079"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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