About the Execution of LoLa+red for ShieldIIPs-PT-040A
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 1182.787 | 95531.00 | 133046.00 | 50.50 | FTTFTFTTFFFFTTTT | 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-167903714900134.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r391-oct2-167903714900134
=====================================================================
--------------------
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-ReachabilityCardinality-00
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-01
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-02
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-03
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-04
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-05
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-06
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-07
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-08
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-09
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-10
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-11
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-12
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-13
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-14
FORMULA_NAME ShieldIIPs-PT-040A-ReachabilityCardinality-15
=== Now, execution of the tool begins
BK_START 1679266971173
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=lolaxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPs-PT-040A
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 23:02:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 23:02:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 23:02:54] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2023-03-19 23:02:54] [INFO ] Transformed 1003 places.
[2023-03-19 23:02:54] [INFO ] Transformed 963 transitions.
[2023-03-19 23:02:54] [INFO ] Found NUPN structural information;
[2023-03-19 23:02:54] [INFO ] Parsed PT model containing 1003 places and 963 transitions and 4326 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 4 resets, run finished after 466 ms. (steps per millisecond=21 ) properties (out of 13) seen :8
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 963 rows 1003 cols
[2023-03-19 23:02:55] [INFO ] Computed 361 place invariants in 29 ms
[2023-03-19 23:02:56] [INFO ] After 522ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2023-03-19 23:02:56] [INFO ] [Nat]Absence check using 361 positive place invariants in 92 ms returned sat
[2023-03-19 23:02:59] [INFO ] After 2861ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2023-03-19 23:03:00] [INFO ] Deduced a trap composed of 9 places in 166 ms of which 14 ms to minimize.
[2023-03-19 23:03:00] [INFO ] Deduced a trap composed of 9 places in 96 ms of which 1 ms to minimize.
[2023-03-19 23:03:00] [INFO ] Deduced a trap composed of 9 places in 73 ms of which 1 ms to minimize.
[2023-03-19 23:03:00] [INFO ] Deduced a trap composed of 18 places in 99 ms of which 2 ms to minimize.
[2023-03-19 23:03:00] [INFO ] Deduced a trap composed of 18 places in 146 ms of which 14 ms to minimize.
[2023-03-19 23:03:01] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1155 ms
[2023-03-19 23:03:02] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 0 ms to minimize.
[2023-03-19 23:03:02] [INFO ] Deduced a trap composed of 17 places in 108 ms of which 1 ms to minimize.
[2023-03-19 23:03:02] [INFO ] Deduced a trap composed of 11 places in 94 ms of which 1 ms to minimize.
[2023-03-19 23:03:02] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 645 ms
[2023-03-19 23:03:04] [INFO ] Deduced a trap composed of 11 places in 87 ms of which 2 ms to minimize.
[2023-03-19 23:03:04] [INFO ] Deduced a trap composed of 11 places in 106 ms of which 30 ms to minimize.
[2023-03-19 23:03:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 380 ms
[2023-03-19 23:03:04] [INFO ] After 8281ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 2722 ms.
[2023-03-19 23:03:07] [INFO ] After 11529ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 639 ms.
Support contains 128 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Partial Free-agglomeration rule applied 203 times.
Drop transitions removed 203 transitions
Iterating global reduction 0 with 203 rules applied. Total rules applied 203 place count 1003 transition count 963
Applied a total of 203 rules in 125 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 125 ms. Remains : 1003/1003 places, 963/963 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 363 ms. (steps per millisecond=27 ) properties (out of 5) seen :1
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) 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
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 4) 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 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 963 rows 1003 cols
[2023-03-19 23:03:09] [INFO ] Computed 361 place invariants in 16 ms
[2023-03-19 23:03:09] [INFO ] After 236ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-19 23:03:09] [INFO ] [Nat]Absence check using 353 positive place invariants in 80 ms returned sat
[2023-03-19 23:03:09] [INFO ] [Nat]Absence check using 353 positive and 8 generalized place invariants in 3 ms returned sat
[2023-03-19 23:03:12] [INFO ] After 2586ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-19 23:03:13] [INFO ] Deduced a trap composed of 12 places in 236 ms of which 1 ms to minimize.
[2023-03-19 23:03:13] [INFO ] Deduced a trap composed of 9 places in 260 ms of which 1 ms to minimize.
[2023-03-19 23:03:13] [INFO ] Deduced a trap composed of 9 places in 156 ms of which 0 ms to minimize.
[2023-03-19 23:03:14] [INFO ] Deduced a trap composed of 9 places in 209 ms of which 1 ms to minimize.
[2023-03-19 23:03:14] [INFO ] Deduced a trap composed of 16 places in 264 ms of which 1 ms to minimize.
[2023-03-19 23:03:14] [INFO ] Deduced a trap composed of 13 places in 204 ms of which 1 ms to minimize.
[2023-03-19 23:03:15] [INFO ] Deduced a trap composed of 10 places in 574 ms of which 1 ms to minimize.
[2023-03-19 23:03:15] [INFO ] Deduced a trap composed of 10 places in 124 ms of which 1 ms to minimize.
[2023-03-19 23:03:15] [INFO ] Deduced a trap composed of 10 places in 183 ms of which 0 ms to minimize.
[2023-03-19 23:03:16] [INFO ] Deduced a trap composed of 10 places in 114 ms of which 1 ms to minimize.
[2023-03-19 23:03:16] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 14 ms to minimize.
[2023-03-19 23:03:16] [INFO ] Deduced a trap composed of 13 places in 159 ms of which 0 ms to minimize.
[2023-03-19 23:03:16] [INFO ] Deduced a trap composed of 15 places in 115 ms of which 1 ms to minimize.
[2023-03-19 23:03:16] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3964 ms
[2023-03-19 23:03:17] [INFO ] Deduced a trap composed of 5 places in 149 ms of which 0 ms to minimize.
[2023-03-19 23:03:17] [INFO ] Deduced a trap composed of 8 places in 158 ms of which 1 ms to minimize.
[2023-03-19 23:03:18] [INFO ] Deduced a trap composed of 6 places in 143 ms of which 1 ms to minimize.
[2023-03-19 23:03:18] [INFO ] Deduced a trap composed of 5 places in 286 ms of which 1 ms to minimize.
[2023-03-19 23:03:18] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 26 ms to minimize.
[2023-03-19 23:03:18] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2023-03-19 23:03:19] [INFO ] Deduced a trap composed of 13 places in 100 ms of which 1 ms to minimize.
[2023-03-19 23:03:19] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1762 ms
[2023-03-19 23:03:20] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 0 ms to minimize.
[2023-03-19 23:03:20] [INFO ] Deduced a trap composed of 10 places in 109 ms of which 1 ms to minimize.
[2023-03-19 23:03:20] [INFO ] Deduced a trap composed of 9 places in 123 ms of which 20 ms to minimize.
[2023-03-19 23:03:20] [INFO ] Deduced a trap composed of 10 places in 81 ms of which 1 ms to minimize.
[2023-03-19 23:03:20] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 916 ms
[2023-03-19 23:03:22] [INFO ] Deduced a trap composed of 10 places in 255 ms of which 1 ms to minimize.
[2023-03-19 23:03:25] [INFO ] Deduced a trap composed of 10 places in 263 ms of which 1 ms to minimize.
[2023-03-19 23:03:25] [INFO ] Deduced a trap composed of 9 places in 118 ms of which 0 ms to minimize.
[2023-03-19 23:03:25] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
[2023-03-19 23:03:25] [INFO ] Deduced a trap composed of 15 places in 193 ms of which 13 ms to minimize.
[2023-03-19 23:03:25] [INFO ] Deduced a trap composed of 15 places in 131 ms of which 1 ms to minimize.
[2023-03-19 23:03:26] [INFO ] Deduced a trap composed of 10 places in 224 ms of which 1 ms to minimize.
[2023-03-19 23:03:26] [INFO ] Deduced a trap composed of 16 places in 131 ms of which 2 ms to minimize.
[2023-03-19 23:03:26] [INFO ] Deduced a trap composed of 10 places in 181 ms of which 0 ms to minimize.
[2023-03-19 23:03:26] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 1 ms to minimize.
[2023-03-19 23:03:27] [INFO ] Deduced a trap composed of 14 places in 176 ms of which 1 ms to minimize.
[2023-03-19 23:03:27] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 0 ms to minimize.
[2023-03-19 23:03:27] [INFO ] Trap strengthening (SAT) tested/added 13/12 trap constraints in 5706 ms
[2023-03-19 23:03:27] [INFO ] After 17543ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 2532 ms.
[2023-03-19 23:03:30] [INFO ] After 20626ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 403 ms.
Support contains 127 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 45 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 1003/1003 places, 963/963 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 359 ms. (steps per millisecond=27 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 90927 steps, run timeout after 3001 ms. (steps per millisecond=30 ) properties seen :{2=1}
Probabilistic random walk after 90927 steps, saw 84678 distinct states, run finished after 3003 ms. (steps per millisecond=30 ) properties seen :1
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-03 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Running SMT prover for 3 properties.
[2023-03-19 23:03:34] [INFO ] Invariant cache hit.
[2023-03-19 23:03:34] [INFO ] After 278ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 23:03:34] [INFO ] [Nat]Absence check using 353 positive place invariants in 166 ms returned sat
[2023-03-19 23:03:34] [INFO ] [Nat]Absence check using 353 positive and 8 generalized place invariants in 2 ms returned sat
[2023-03-19 23:03:37] [INFO ] After 2836ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 23:03:38] [INFO ] Deduced a trap composed of 9 places in 117 ms of which 1 ms to minimize.
[2023-03-19 23:03:38] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 1 ms to minimize.
[2023-03-19 23:03:39] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 1 ms to minimize.
[2023-03-19 23:03:39] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 837 ms
[2023-03-19 23:03:39] [INFO ] Deduced a trap composed of 6 places in 117 ms of which 1 ms to minimize.
[2023-03-19 23:03:40] [INFO ] Deduced a trap composed of 13 places in 211 ms of which 1 ms to minimize.
[2023-03-19 23:03:40] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 0 ms to minimize.
[2023-03-19 23:03:40] [INFO ] Deduced a trap composed of 10 places in 299 ms of which 1 ms to minimize.
[2023-03-19 23:03:40] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1185 ms
[2023-03-19 23:03:41] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 13 ms to minimize.
[2023-03-19 23:03:41] [INFO ] Deduced a trap composed of 9 places in 57 ms of which 1 ms to minimize.
[2023-03-19 23:03:42] [INFO ] Deduced a trap composed of 10 places in 44 ms of which 1 ms to minimize.
[2023-03-19 23:03:42] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 542 ms
[2023-03-19 23:03:42] [INFO ] After 7089ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1612 ms.
[2023-03-19 23:03:43] [INFO ] After 9244ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 262 ms.
Support contains 93 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Partial Free-agglomeration rule applied 20 times.
Drop transitions removed 20 transitions
Iterating global reduction 0 with 20 rules applied. Total rules applied 20 place count 1003 transition count 963
Applied a total of 20 rules in 66 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 1003/1003 places, 963/963 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 207 ms. (steps per millisecond=48 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 119 ms. (steps per millisecond=84 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 3) 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 3) seen :0
Interrupted probabilistic random walk after 110549 steps, run timeout after 3001 ms. (steps per millisecond=36 ) properties seen :{}
Probabilistic random walk after 110549 steps, saw 98022 distinct states, run finished after 3002 ms. (steps per millisecond=36 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 963 rows 1003 cols
[2023-03-19 23:03:47] [INFO ] Computed 361 place invariants in 26 ms
[2023-03-19 23:03:47] [INFO ] After 227ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 23:03:48] [INFO ] [Nat]Absence check using 349 positive place invariants in 76 ms returned sat
[2023-03-19 23:03:48] [INFO ] [Nat]Absence check using 349 positive and 12 generalized place invariants in 31 ms returned sat
[2023-03-19 23:03:51] [INFO ] After 3358ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 23:03:52] [INFO ] Deduced a trap composed of 5 places in 166 ms of which 13 ms to minimize.
[2023-03-19 23:03:52] [INFO ] Deduced a trap composed of 5 places in 133 ms of which 0 ms to minimize.
[2023-03-19 23:03:52] [INFO ] Deduced a trap composed of 9 places in 163 ms of which 0 ms to minimize.
[2023-03-19 23:03:52] [INFO ] Deduced a trap composed of 8 places in 104 ms of which 1 ms to minimize.
[2023-03-19 23:03:53] [INFO ] Deduced a trap composed of 9 places in 168 ms of which 26 ms to minimize.
[2023-03-19 23:03:53] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 0 ms to minimize.
[2023-03-19 23:03:53] [INFO ] Deduced a trap composed of 9 places in 158 ms of which 3 ms to minimize.
[2023-03-19 23:03:53] [INFO ] Deduced a trap composed of 15 places in 57 ms of which 0 ms to minimize.
[2023-03-19 23:03:53] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1822 ms
[2023-03-19 23:03:54] [INFO ] Deduced a trap composed of 5 places in 202 ms of which 19 ms to minimize.
[2023-03-19 23:03:54] [INFO ] Deduced a trap composed of 9 places in 148 ms of which 0 ms to minimize.
[2023-03-19 23:03:55] [INFO ] Deduced a trap composed of 12 places in 458 ms of which 14 ms to minimize.
[2023-03-19 23:03:55] [INFO ] Deduced a trap composed of 18 places in 133 ms of which 0 ms to minimize.
[2023-03-19 23:03:56] [INFO ] Deduced a trap composed of 9 places in 239 ms of which 0 ms to minimize.
[2023-03-19 23:03:56] [INFO ] Deduced a trap composed of 9 places in 179 ms of which 1 ms to minimize.
[2023-03-19 23:03:56] [INFO ] Deduced a trap composed of 18 places in 151 ms of which 1 ms to minimize.
[2023-03-19 23:03:56] [INFO ] Deduced a trap composed of 6 places in 145 ms of which 0 ms to minimize.
[2023-03-19 23:03:57] [INFO ] Deduced a trap composed of 9 places in 115 ms of which 1 ms to minimize.
[2023-03-19 23:03:57] [INFO ] Deduced a trap composed of 8 places in 130 ms of which 0 ms to minimize.
[2023-03-19 23:03:57] [INFO ] Deduced a trap composed of 12 places in 169 ms of which 0 ms to minimize.
[2023-03-19 23:03:57] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 1 ms to minimize.
[2023-03-19 23:03:58] [INFO ] Deduced a trap composed of 12 places in 121 ms of which 1 ms to minimize.
[2023-03-19 23:03:58] [INFO ] Deduced a trap composed of 5 places in 165 ms of which 1 ms to minimize.
[2023-03-19 23:03:58] [INFO ] Deduced a trap composed of 18 places in 142 ms of which 1 ms to minimize.
[2023-03-19 23:03:58] [INFO ] Deduced a trap composed of 15 places in 124 ms of which 1 ms to minimize.
[2023-03-19 23:03:58] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 4483 ms
[2023-03-19 23:03:59] [INFO ] Deduced a trap composed of 9 places in 153 ms of which 0 ms to minimize.
[2023-03-19 23:04:00] [INFO ] Deduced a trap composed of 9 places in 678 ms of which 26 ms to minimize.
[2023-03-19 23:04:00] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 0 ms to minimize.
[2023-03-19 23:04:01] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 1 ms to minimize.
[2023-03-19 23:04:01] [INFO ] Deduced a trap composed of 15 places in 563 ms of which 0 ms to minimize.
[2023-03-19 23:04:01] [INFO ] Deduced a trap composed of 15 places in 134 ms of which 0 ms to minimize.
[2023-03-19 23:04:02] [INFO ] Deduced a trap composed of 9 places in 128 ms of which 1 ms to minimize.
[2023-03-19 23:04:02] [INFO ] Deduced a trap composed of 9 places in 126 ms of which 1 ms to minimize.
[2023-03-19 23:04:02] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 1 ms to minimize.
[2023-03-19 23:04:02] [INFO ] Deduced a trap composed of 16 places in 71 ms of which 0 ms to minimize.
[2023-03-19 23:04:02] [INFO ] Deduced a trap composed of 10 places in 59 ms of which 1 ms to minimize.
[2023-03-19 23:04:02] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3208 ms
[2023-03-19 23:04:02] [INFO ] After 14547ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1182 ms.
[2023-03-19 23:04:04] [INFO ] After 16190ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 301 ms.
Support contains 93 out of 1003 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 25 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 1003/1003 places, 963/963 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 22 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
[2023-03-19 23:04:04] [INFO ] Invariant cache hit.
[2023-03-19 23:04:05] [INFO ] Implicit Places using invariants in 805 ms returned []
[2023-03-19 23:04:05] [INFO ] Invariant cache hit.
[2023-03-19 23:04:07] [INFO ] Implicit Places using invariants and state equation in 2045 ms returned []
Implicit Place search using SMT with State Equation took 2889 ms to find 0 implicit places.
[2023-03-19 23:04:07] [INFO ] Redundant transitions in 108 ms returned []
[2023-03-19 23:04:07] [INFO ] Invariant cache hit.
[2023-03-19 23:04:08] [INFO ] Dead Transitions using invariants and state equation in 1161 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4192 ms. Remains : 1003/1003 places, 963/963 transitions.
Applied a total of 0 rules in 36 ms. Remains 1003 /1003 variables (removed 0) and now considering 963/963 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-19 23:04:08] [INFO ] Invariant cache hit.
[2023-03-19 23:04:08] [INFO ] After 241ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-19 23:04:09] [INFO ] [Nat]Absence check using 349 positive place invariants in 245 ms returned sat
[2023-03-19 23:04:09] [INFO ] [Nat]Absence check using 349 positive and 12 generalized place invariants in 5 ms returned sat
[2023-03-19 23:04:11] [INFO ] After 2390ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-19 23:04:12] [INFO ] Deduced a trap composed of 15 places in 226 ms of which 1 ms to minimize.
[2023-03-19 23:04:13] [INFO ] Deduced a trap composed of 14 places in 200 ms of which 0 ms to minimize.
[2023-03-19 23:04:13] [INFO ] Deduced a trap composed of 12 places in 231 ms of which 1 ms to minimize.
[2023-03-19 23:04:13] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 0 ms to minimize.
[2023-03-19 23:04:14] [INFO ] Deduced a trap composed of 10 places in 202 ms of which 0 ms to minimize.
[2023-03-19 23:04:14] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 1 ms to minimize.
[2023-03-19 23:04:14] [INFO ] Deduced a trap composed of 10 places in 117 ms of which 1 ms to minimize.
[2023-03-19 23:04:14] [INFO ] Deduced a trap composed of 9 places in 211 ms of which 1 ms to minimize.
[2023-03-19 23:04:15] [INFO ] Deduced a trap composed of 9 places in 133 ms of which 0 ms to minimize.
[2023-03-19 23:04:15] [INFO ] Deduced a trap composed of 10 places in 97 ms of which 1 ms to minimize.
[2023-03-19 23:04:15] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 1 ms to minimize.
[2023-03-19 23:04:15] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 1 ms to minimize.
[2023-03-19 23:04:15] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 1 ms to minimize.
[2023-03-19 23:04:15] [INFO ] Trap strengthening (SAT) tested/added 14/13 trap constraints in 3307 ms
[2023-03-19 23:04:16] [INFO ] Deduced a trap composed of 6 places in 239 ms of which 0 ms to minimize.
[2023-03-19 23:04:17] [INFO ] Deduced a trap composed of 5 places in 116 ms of which 0 ms to minimize.
[2023-03-19 23:04:17] [INFO ] Deduced a trap composed of 5 places in 147 ms of which 1 ms to minimize.
[2023-03-19 23:04:17] [INFO ] Deduced a trap composed of 6 places in 152 ms of which 0 ms to minimize.
[2023-03-19 23:04:17] [INFO ] Deduced a trap composed of 19 places in 106 ms of which 1 ms to minimize.
[2023-03-19 23:04:18] [INFO ] Deduced a trap composed of 19 places in 175 ms of which 1 ms to minimize.
[2023-03-19 23:04:18] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 0 ms to minimize.
[2023-03-19 23:04:18] [INFO ] Deduced a trap composed of 18 places in 96 ms of which 1 ms to minimize.
[2023-03-19 23:04:18] [INFO ] Deduced a trap composed of 12 places in 95 ms of which 1 ms to minimize.
[2023-03-19 23:04:19] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 2442 ms
[2023-03-19 23:04:19] [INFO ] Deduced a trap composed of 9 places in 221 ms of which 0 ms to minimize.
[2023-03-19 23:04:19] [INFO ] Deduced a trap composed of 9 places in 152 ms of which 0 ms to minimize.
[2023-03-19 23:04:20] [INFO ] Deduced a trap composed of 13 places in 250 ms of which 1 ms to minimize.
[2023-03-19 23:04:20] [INFO ] Deduced a trap composed of 9 places in 135 ms of which 0 ms to minimize.
[2023-03-19 23:04:20] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 1 ms to minimize.
[2023-03-19 23:04:20] [INFO ] Deduced a trap composed of 17 places in 182 ms of which 13 ms to minimize.
[2023-03-19 23:04:21] [INFO ] Deduced a trap composed of 9 places in 97 ms of which 1 ms to minimize.
[2023-03-19 23:04:21] [INFO ] Deduced a trap composed of 16 places in 366 ms of which 24 ms to minimize.
[2023-03-19 23:04:21] [INFO ] Deduced a trap composed of 15 places in 87 ms of which 1 ms to minimize.
[2023-03-19 23:04:22] [INFO ] Deduced a trap composed of 19 places in 220 ms of which 1 ms to minimize.
[2023-03-19 23:04:22] [INFO ] Deduced a trap composed of 19 places in 83 ms of which 0 ms to minimize.
[2023-03-19 23:04:22] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 2759 ms
[2023-03-19 23:04:22] [INFO ] After 12821ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 1823 ms.
[2023-03-19 23:04:24] [INFO ] After 15213ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2023-03-19 23:04:24] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 8 ms.
[2023-03-19 23:04:24] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 1003 places, 963 transitions and 4802 arcs took 13 ms.
[2023-03-19 23:04:24] [INFO ] Flatten gal took : 187 ms
Total runtime 90340 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPs-PT-040A
BK_EXAMINATION: ReachabilityCardinality
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/369
ReachabilityCardinality
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-00 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-04 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
FORMULA ShieldIIPs-PT-040A-ReachabilityCardinality-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT
BK_STOP 1679267066704
--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityCardinality -timeout 360 -rebuildPNML
lola: MEM LIMIT 32
lola: MEM LIMIT 5
lola: NET
lola: input: PNML file (--pnmlnet)
lola: reading net from /home/mcc/execution/369/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/369/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/369/ReachabilityCardinality.xml
lola: 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: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: rewrite Frontend/Parser/formula_rewrite.k:721
lola: rewrite Frontend/Parser/formula_rewrite.k:787
lola: LAUNCH task # 14 (type EXCL) for 0 ShieldIIPs-PT-040A-ReachabilityCardinality-00
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 10 (type FNDP) for 0 ShieldIIPs-PT-040A-ReachabilityCardinality-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 11 (type EQUN) for 0 ShieldIIPs-PT-040A-ReachabilityCardinality-00
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: LAUNCH task # 13 (type SRCH) for 0 ShieldIIPs-PT-040A-ReachabilityCardinality-00
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 # 13 (type SRCH) for ShieldIIPs-PT-040A-ReachabilityCardinality-00
lola: result : true
lola: markings : 68
lola: fired transitions : 67
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 10 (type FNDP) for ShieldIIPs-PT-040A-ReachabilityCardinality-00 (obsolete)
lola: CANCELED task # 11 (type EQUN) for ShieldIIPs-PT-040A-ReachabilityCardinality-00 (obsolete)
lola: CANCELED task # 14 (type EXCL) for ShieldIIPs-PT-040A-ReachabilityCardinality-00 (obsolete)
lola: LAUNCH task # 20 (type EXCL) for 6 ShieldIIPs-PT-040A-ReachabilityCardinality-04
lola: time limit : 1799 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 16 (type FNDP) for 6 ShieldIIPs-PT-040A-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 17 (type EQUN) for 6 ShieldIIPs-PT-040A-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 19 (type SRCH) for 6 ShieldIIPs-PT-040A-ReachabilityCardinality-04
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 10 (type FNDP) for ShieldIIPs-PT-040A-ReachabilityCardinality-00
lola: result : true
lola: fired transitions : 66
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:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 16 (type FNDP) for ShieldIIPs-PT-040A-ReachabilityCardinality-04
lola: result : true
lola: fired transitions : 55
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 17 (type EQUN) for ShieldIIPs-PT-040A-ReachabilityCardinality-04 (obsolete)
lola: CANCELED task # 19 (type SRCH) for ShieldIIPs-PT-040A-ReachabilityCardinality-04 (obsolete)
lola: CANCELED task # 20 (type EXCL) for ShieldIIPs-PT-040A-ReachabilityCardinality-04 (obsolete)
lola: LAUNCH task # 26 (type EXCL) for 3 ShieldIIPs-PT-040A-ReachabilityCardinality-01
lola: time limit : 3598 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 22 (type FNDP) for 3 ShieldIIPs-PT-040A-ReachabilityCardinality-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 23 (type EQUN) for 3 ShieldIIPs-PT-040A-ReachabilityCardinality-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 25 (type SRCH) for 3 ShieldIIPs-PT-040A-ReachabilityCardinality-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
sara: try reading problem file /home/mcc/execution/369/ReachabilityCardinality-17.sara.
lola: FINISHED task # 22 (type FNDP) for ShieldIIPs-PT-040A-ReachabilityCardinality-01
lola: result : true
lola: fired transitions : 91
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 23 (type EQUN) for ShieldIIPs-PT-040A-ReachabilityCardinality-01 (obsolete)
lola: CANCELED task # 25 (type SRCH) for ShieldIIPs-PT-040A-ReachabilityCardinality-01 (obsolete)
lola: CANCELED task # 26 (type EXCL) for ShieldIIPs-PT-040A-ReachabilityCardinality-01 (obsolete)
lola: Portfolio finished: no open formulas
FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPs-PT-040A-ReachabilityCardinality-00: AG false tandem / insertion
ShieldIIPs-PT-040A-ReachabilityCardinality-01: EF true findpath
ShieldIIPs-PT-040A-ReachabilityCardinality-04: EF true findpath
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="ReachabilityCardinality"
export BK_TOOL="lolaxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool lolaxred"
echo " Input is ShieldIIPs-PT-040A, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r391-oct2-167903714900134"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;