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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 5.3K Feb 25 16:11 CTLCardinality.txt
-rw-r--r-- 1 mcc users 50K Feb 25 16:11 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 25 16:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K Feb 25 16:02 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.6K Feb 25 16:55 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:55 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 16:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 25 16:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 16:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 25 16:19 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 253K 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-030A-ReachabilityFireability-00
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-01
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-02
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-03
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-04
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-05
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-06
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-07
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-08
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-09
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-10
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-11
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-12
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-13
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-14
FORMULA_NAME ShieldIIPs-PT-030A-ReachabilityFireability-15

=== Now, execution of the tool begins

BK_START 1679266244427

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-030A
Applying reductions before tool lola
Invoking reducer
Running Version 202303021504
[2023-03-19 22:50:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2023-03-19 22:50:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 22:50:47] [INFO ] Load time of PNML (sax parser for PT used): 185 ms
[2023-03-19 22:50:47] [INFO ] Transformed 753 places.
[2023-03-19 22:50:47] [INFO ] Transformed 723 transitions.
[2023-03-19 22:50:47] [INFO ] Found NUPN structural information;
[2023-03-19 22:50:47] [INFO ] Parsed PT model containing 753 places and 723 transitions and 3246 arcs in 385 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Incomplete random walk after 10000 steps, including 6 resets, run finished after 408 ms. (steps per millisecond=24 ) properties (out of 16) seen :10
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 134 ms. (steps per millisecond=74 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 723 rows 753 cols
[2023-03-19 22:50:48] [INFO ] Computed 271 place invariants in 15 ms
[2023-03-19 22:50:49] [INFO ] After 652ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 22:50:49] [INFO ] [Nat]Absence check using 271 positive place invariants in 63 ms returned sat
[2023-03-19 22:50:51] [INFO ] After 1994ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 22:50:52] [INFO ] Deduced a trap composed of 19 places in 223 ms of which 22 ms to minimize.
[2023-03-19 22:50:52] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 2 ms to minimize.
[2023-03-19 22:50:52] [INFO ] Deduced a trap composed of 17 places in 132 ms of which 2 ms to minimize.
[2023-03-19 22:50:52] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 1 ms to minimize.
[2023-03-19 22:50:52] [INFO ] Deduced a trap composed of 27 places in 164 ms of which 1 ms to minimize.
[2023-03-19 22:50:53] [INFO ] Deduced a trap composed of 24 places in 133 ms of which 1 ms to minimize.
[2023-03-19 22:50:53] [INFO ] Deduced a trap composed of 11 places in 127 ms of which 1 ms to minimize.
[2023-03-19 22:50:53] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 1 ms to minimize.
[2023-03-19 22:50:53] [INFO ] Deduced a trap composed of 18 places in 122 ms of which 1 ms to minimize.
[2023-03-19 22:50:53] [INFO ] Deduced a trap composed of 17 places in 107 ms of which 0 ms to minimize.
[2023-03-19 22:50:54] [INFO ] Deduced a trap composed of 19 places in 125 ms of which 1 ms to minimize.
[2023-03-19 22:50:54] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 0 ms to minimize.
[2023-03-19 22:50:54] [INFO ] Deduced a trap composed of 13 places in 81 ms of which 0 ms to minimize.
[2023-03-19 22:50:54] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 0 ms to minimize.
[2023-03-19 22:50:54] [INFO ] Trap strengthening (SAT) tested/added 15/14 trap constraints in 2734 ms
[2023-03-19 22:50:54] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 0 ms to minimize.
[2023-03-19 22:50:55] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 0 ms to minimize.
[2023-03-19 22:50:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 327 ms
[2023-03-19 22:50:55] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
[2023-03-19 22:50:55] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 1 ms to minimize.
[2023-03-19 22:50:55] [INFO ] Deduced a trap composed of 11 places in 65 ms of which 1 ms to minimize.
[2023-03-19 22:50:55] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 476 ms
[2023-03-19 22:50:56] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
[2023-03-19 22:50:56] [INFO ] Deduced a trap composed of 19 places in 137 ms of which 26 ms to minimize.
[2023-03-19 22:50:56] [INFO ] Deduced a trap composed of 19 places in 126 ms of which 2 ms to minimize.
[2023-03-19 22:50:56] [INFO ] Deduced a trap composed of 11 places in 121 ms of which 0 ms to minimize.
[2023-03-19 22:50:56] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 740 ms
[2023-03-19 22:50:57] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 0 ms to minimize.
[2023-03-19 22:50:57] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2023-03-19 22:50:57] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 0 ms to minimize.
[2023-03-19 22:50:57] [INFO ] Deduced a trap composed of 19 places in 50 ms of which 0 ms to minimize.
[2023-03-19 22:50:57] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 299 ms
[2023-03-19 22:50:57] [INFO ] After 8304ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2179 ms.
[2023-03-19 22:51:00] [INFO ] After 10908ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 373 ms.
Support contains 190 out of 753 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 753/753 places, 723/723 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 753 transition count 722
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 752 transition count 722
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 751 transition count 721
Partial Free-agglomeration rule applied 110 times.
Drop transitions removed 110 transitions
Iterating global reduction 0 with 110 rules applied. Total rules applied 114 place count 751 transition count 721
Applied a total of 114 rules in 146 ms. Remains 751 /753 variables (removed 2) and now considering 721/723 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 751/753 places, 721/723 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 311 ms. (steps per millisecond=32 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 6) seen :0
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 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 87906 steps, run timeout after 3010 ms. (steps per millisecond=29 ) properties seen :{}
Probabilistic random walk after 87906 steps, saw 53521 distinct states, run finished after 3013 ms. (steps per millisecond=29 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 721 rows 751 cols
[2023-03-19 22:51:04] [INFO ] Computed 271 place invariants in 7 ms
[2023-03-19 22:51:04] [INFO ] After 356ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 22:51:05] [INFO ] [Nat]Absence check using 271 positive place invariants in 134 ms returned sat
[2023-03-19 22:51:07] [INFO ] After 2589ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 22:51:07] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-19 22:51:09] [INFO ] After 1667ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-19 22:51:10] [INFO ] Deduced a trap composed of 12 places in 176 ms of which 1 ms to minimize.
[2023-03-19 22:51:10] [INFO ] Deduced a trap composed of 10 places in 150 ms of which 0 ms to minimize.
[2023-03-19 22:51:10] [INFO ] Deduced a trap composed of 9 places in 119 ms of which 1 ms to minimize.
[2023-03-19 22:51:10] [INFO ] Deduced a trap composed of 10 places in 120 ms of which 1 ms to minimize.
[2023-03-19 22:51:10] [INFO ] Deduced a trap composed of 10 places in 107 ms of which 0 ms to minimize.
[2023-03-19 22:51:11] [INFO ] Deduced a trap composed of 15 places in 103 ms of which 1 ms to minimize.
[2023-03-19 22:51:11] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 1140 ms
[2023-03-19 22:51:11] [INFO ] Deduced a trap composed of 6 places in 144 ms of which 2 ms to minimize.
[2023-03-19 22:51:12] [INFO ] Deduced a trap composed of 9 places in 86 ms of which 1 ms to minimize.
[2023-03-19 22:51:12] [INFO ] Deduced a trap composed of 15 places in 296 ms of which 1 ms to minimize.
[2023-03-19 22:51:12] [INFO ] Deduced a trap composed of 9 places in 107 ms of which 1 ms to minimize.
[2023-03-19 22:51:12] [INFO ] Deduced a trap composed of 6 places in 216 ms of which 1 ms to minimize.
[2023-03-19 22:51:13] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 1 ms to minimize.
[2023-03-19 22:51:13] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
[2023-03-19 22:51:13] [INFO ] Trap strengthening (SAT) tested/added 8/7 trap constraints in 1677 ms
[2023-03-19 22:51:13] [INFO ] Deduced a trap composed of 10 places in 115 ms of which 1 ms to minimize.
[2023-03-19 22:51:14] [INFO ] Deduced a trap composed of 19 places in 94 ms of which 1 ms to minimize.
[2023-03-19 22:51:14] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 2 ms to minimize.
[2023-03-19 22:51:14] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 582 ms
[2023-03-19 22:51:14] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 0 ms to minimize.
[2023-03-19 22:51:15] [INFO ] Deduced a trap composed of 9 places in 63 ms of which 0 ms to minimize.
[2023-03-19 22:51:15] [INFO ] Deduced a trap composed of 15 places in 67 ms of which 1 ms to minimize.
[2023-03-19 22:51:15] [INFO ] Deduced a trap composed of 9 places in 61 ms of which 1 ms to minimize.
[2023-03-19 22:51:15] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
[2023-03-19 22:51:15] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 810 ms
[2023-03-19 22:51:15] [INFO ] After 7604ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1917 ms.
[2023-03-19 22:51:17] [INFO ] After 12689ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 519 ms.
Support contains 190 out of 751 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 721/721 transitions.
Applied a total of 0 rules in 30 ms. Remains 751 /751 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 30 ms. Remains : 751/751 places, 721/721 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 751/751 places, 721/721 transitions.
Applied a total of 0 rules in 21 ms. Remains 751 /751 variables (removed 0) and now considering 721/721 (removed 0) transitions.
[2023-03-19 22:51:18] [INFO ] Invariant cache hit.
[2023-03-19 22:51:18] [INFO ] Implicit Places using invariants in 794 ms returned [737]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 814 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 750/751 places, 721/721 transitions.
Applied a total of 0 rules in 42 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 877 ms. Remains : 750/751 places, 721/721 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 225 ms. (steps per millisecond=44 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) 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 178 ms. (steps per millisecond=56 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 101939 steps, run timeout after 3001 ms. (steps per millisecond=33 ) properties seen :{}
Probabilistic random walk after 101939 steps, saw 55886 distinct states, run finished after 3001 ms. (steps per millisecond=33 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 721 rows 750 cols
[2023-03-19 22:51:22] [INFO ] Computed 270 place invariants in 5 ms
[2023-03-19 22:51:23] [INFO ] After 438ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 22:51:23] [INFO ] [Nat]Absence check using 270 positive place invariants in 471 ms returned sat
[2023-03-19 22:51:26] [INFO ] After 2010ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 22:51:26] [INFO ] Deduced a trap composed of 10 places in 229 ms of which 1 ms to minimize.
[2023-03-19 22:51:26] [INFO ] Deduced a trap composed of 6 places in 273 ms of which 13 ms to minimize.
[2023-03-19 22:51:27] [INFO ] Deduced a trap composed of 9 places in 111 ms of which 0 ms to minimize.
[2023-03-19 22:51:27] [INFO ] Deduced a trap composed of 10 places in 210 ms of which 0 ms to minimize.
[2023-03-19 22:51:27] [INFO ] Deduced a trap composed of 12 places in 307 ms of which 2 ms to minimize.
[2023-03-19 22:51:27] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2023-03-19 22:51:28] [INFO ] Deduced a trap composed of 9 places in 173 ms of which 14 ms to minimize.
[2023-03-19 22:51:28] [INFO ] Deduced a trap composed of 11 places in 77 ms of which 1 ms to minimize.
[2023-03-19 22:51:28] [INFO ] Deduced a trap composed of 18 places in 66 ms of which 1 ms to minimize.
[2023-03-19 22:51:28] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 0 ms to minimize.
[2023-03-19 22:51:28] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 2318 ms
[2023-03-19 22:51:29] [INFO ] Deduced a trap composed of 11 places in 126 ms of which 0 ms to minimize.
[2023-03-19 22:51:29] [INFO ] Deduced a trap composed of 10 places in 186 ms of which 10 ms to minimize.
[2023-03-19 22:51:29] [INFO ] Deduced a trap composed of 12 places in 134 ms of which 1 ms to minimize.
[2023-03-19 22:51:30] [INFO ] Deduced a trap composed of 26 places in 210 ms of which 0 ms to minimize.
[2023-03-19 22:51:30] [INFO ] Deduced a trap composed of 15 places in 100 ms of which 1 ms to minimize.
[2023-03-19 22:51:30] [INFO ] Deduced a trap composed of 9 places in 138 ms of which 0 ms to minimize.
[2023-03-19 22:51:30] [INFO ] Deduced a trap composed of 5 places in 108 ms of which 0 ms to minimize.
[2023-03-19 22:51:30] [INFO ] Deduced a trap composed of 9 places in 27 ms of which 1 ms to minimize.
[2023-03-19 22:51:30] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 4 ms to minimize.
[2023-03-19 22:51:30] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 1932 ms
[2023-03-19 22:51:31] [INFO ] Deduced a trap composed of 20 places in 97 ms of which 21 ms to minimize.
[2023-03-19 22:51:31] [INFO ] Deduced a trap composed of 21 places in 114 ms of which 15 ms to minimize.
[2023-03-19 22:51:31] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 1 ms to minimize.
[2023-03-19 22:51:31] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 604 ms
[2023-03-19 22:51:32] [INFO ] Deduced a trap composed of 10 places in 105 ms of which 0 ms to minimize.
[2023-03-19 22:51:32] [INFO ] Deduced a trap composed of 9 places in 181 ms of which 1 ms to minimize.
[2023-03-19 22:51:32] [INFO ] Deduced a trap composed of 9 places in 161 ms of which 0 ms to minimize.
[2023-03-19 22:51:32] [INFO ] Deduced a trap composed of 16 places in 138 ms of which 0 ms to minimize.
[2023-03-19 22:51:33] [INFO ] Deduced a trap composed of 10 places in 153 ms of which 0 ms to minimize.
[2023-03-19 22:51:33] [INFO ] Deduced a trap composed of 10 places in 197 ms of which 0 ms to minimize.
[2023-03-19 22:51:33] [INFO ] Deduced a trap composed of 16 places in 202 ms of which 1 ms to minimize.
[2023-03-19 22:51:33] [INFO ] Deduced a trap composed of 22 places in 168 ms of which 0 ms to minimize.
[2023-03-19 22:51:33] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 1875 ms
[2023-03-19 22:51:34] [INFO ] Deduced a trap composed of 5 places in 126 ms of which 1 ms to minimize.
[2023-03-19 22:51:34] [INFO ] Deduced a trap composed of 5 places in 148 ms of which 13 ms to minimize.
[2023-03-19 22:51:34] [INFO ] Deduced a trap composed of 5 places in 169 ms of which 1 ms to minimize.
[2023-03-19 22:51:35] [INFO ] Deduced a trap composed of 8 places in 83 ms of which 1 ms to minimize.
[2023-03-19 22:51:35] [INFO ] Deduced a trap composed of 15 places in 101 ms of which 1 ms to minimize.
[2023-03-19 22:51:35] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1103 ms
[2023-03-19 22:51:35] [INFO ] Deduced a trap composed of 11 places in 130 ms of which 0 ms to minimize.
[2023-03-19 22:51:35] [INFO ] Deduced a trap composed of 10 places in 66 ms of which 0 ms to minimize.
[2023-03-19 22:51:36] [INFO ] Deduced a trap composed of 10 places in 91 ms of which 0 ms to minimize.
[2023-03-19 22:51:36] [INFO ] Deduced a trap composed of 10 places in 57 ms of which 0 ms to minimize.
[2023-03-19 22:51:36] [INFO ] Deduced a trap composed of 15 places in 212 ms of which 0 ms to minimize.
[2023-03-19 22:51:36] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 0 ms to minimize.
[2023-03-19 22:51:36] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 965 ms
[2023-03-19 22:51:36] [INFO ] After 12559ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2143 ms.
[2023-03-19 22:51:38] [INFO ] After 15581ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 508 ms.
Support contains 190 out of 750 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 721/721 transitions.
Applied a total of 0 rules in 17 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 750/750 places, 721/721 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 750/750 places, 721/721 transitions.
Applied a total of 0 rules in 14 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
[2023-03-19 22:51:39] [INFO ] Invariant cache hit.
[2023-03-19 22:51:39] [INFO ] Implicit Places using invariants in 532 ms returned []
[2023-03-19 22:51:39] [INFO ] Invariant cache hit.
[2023-03-19 22:51:42] [INFO ] Implicit Places using invariants and state equation in 2920 ms returned []
Implicit Place search using SMT with State Equation took 3467 ms to find 0 implicit places.
[2023-03-19 22:51:43] [INFO ] Redundant transitions in 184 ms returned []
[2023-03-19 22:51:43] [INFO ] Invariant cache hit.
[2023-03-19 22:51:43] [INFO ] Dead Transitions using invariants and state equation in 548 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4243 ms. Remains : 750/750 places, 721/721 transitions.
Applied a total of 0 rules in 23 ms. Remains 750 /750 variables (removed 0) and now considering 721/721 (removed 0) transitions.
Running SMT prover for 6 properties.
[2023-03-19 22:51:43] [INFO ] Invariant cache hit.
[2023-03-19 22:51:43] [INFO ] After 175ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-19 22:51:44] [INFO ] [Nat]Absence check using 270 positive place invariants in 127 ms returned sat
[2023-03-19 22:51:46] [INFO ] After 2162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-19 22:51:46] [INFO ] Deduced a trap composed of 9 places in 175 ms of which 0 ms to minimize.
[2023-03-19 22:51:47] [INFO ] Deduced a trap composed of 14 places in 213 ms of which 0 ms to minimize.
[2023-03-19 22:51:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 592 ms
[2023-03-19 22:51:47] [INFO ] Deduced a trap composed of 9 places in 171 ms of which 0 ms to minimize.
[2023-03-19 22:51:47] [INFO ] Deduced a trap composed of 12 places in 58 ms of which 0 ms to minimize.
[2023-03-19 22:51:48] [INFO ] Deduced a trap composed of 9 places in 66 ms of which 1 ms to minimize.
[2023-03-19 22:51:48] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 0 ms to minimize.
[2023-03-19 22:51:48] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 0 ms to minimize.
[2023-03-19 22:51:48] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 801 ms
[2023-03-19 22:51:48] [INFO ] Deduced a trap composed of 9 places in 136 ms of which 1 ms to minimize.
[2023-03-19 22:51:49] [INFO ] Deduced a trap composed of 9 places in 235 ms of which 1 ms to minimize.
[2023-03-19 22:51:49] [INFO ] Deduced a trap composed of 19 places in 133 ms of which 0 ms to minimize.
[2023-03-19 22:51:49] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 895 ms
[2023-03-19 22:51:50] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 0 ms to minimize.
[2023-03-19 22:51:50] [INFO ] Deduced a trap composed of 10 places in 95 ms of which 0 ms to minimize.
[2023-03-19 22:51:50] [INFO ] Deduced a trap composed of 11 places in 669 ms of which 1 ms to minimize.
[2023-03-19 22:51:51] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 1175 ms
[2023-03-19 22:51:51] [INFO ] Deduced a trap composed of 5 places in 294 ms of which 0 ms to minimize.
[2023-03-19 22:51:52] [INFO ] Deduced a trap composed of 10 places in 233 ms of which 1 ms to minimize.
[2023-03-19 22:51:52] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 0 ms to minimize.
[2023-03-19 22:51:52] [INFO ] Deduced a trap composed of 10 places in 54 ms of which 12 ms to minimize.
[2023-03-19 22:51:52] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 0 ms to minimize.
[2023-03-19 22:51:52] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1109 ms
[2023-03-19 22:51:52] [INFO ] Deduced a trap composed of 9 places in 174 ms of which 1 ms to minimize.
[2023-03-19 22:51:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 357 ms
[2023-03-19 22:51:53] [INFO ] After 8698ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 2006 ms.
[2023-03-19 22:51:55] [INFO ] After 11324ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
[2023-03-19 22:51:55] [INFO ] Export to MCC of 6 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 37 ms.
[2023-03-19 22:51:55] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 750 places, 721 transitions and 3473 arcs took 4 ms.
[2023-03-19 22:51:55] [INFO ] Flatten gal took : 143 ms
Total runtime 68758 ms.
There are residual formulas that ITS could not solve within timeout
starting LoLA
BK_INPUT ShieldIIPs-PT-030A
BK_EXAMINATION: ReachabilityFireability
bin directory: /home/mcc/BenchKit/bin//../reducer/bin//../../lola/bin/
current directory: /home/mcc/execution/379
ReachabilityFireability

FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-03 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-05 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

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

FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-07 FALSE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-01 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

FORMULA ShieldIIPs-PT-030A-ReachabilityFireability-00 TRUE TECHNIQUES COLLATERAL_PROCESSING EXPLICIT TOPOLOGICAL STATE_COMPRESSION STUBBORN_SETS USE_NUPN UNFOLDING_TO_PT

BK_STOP 1679266317735
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 15805092 kB
After kill :
MemTotal: 16393220 kB
MemFree: 15804336 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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/379/model.pnml
lola: reading pnml
lola: PNML file contains place/transition net
lola: finished parsing
lola: closed net file /home/mcc/execution/379/model.pnml
lola: Reading formula.
lola: Using XML format (--xmlformula)
lola: reading XML formula
lola: reading formula from /home/mcc/execution/379/ReachabilityFireability.xml
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
lola: Created skeleton in 0.000000 secs.
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 # 23 (type EXCL) for 6 ShieldIIPs-PT-030A-ReachabilityFireability-03
lola: time limit : 599 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 19 (type FNDP) for 6 ShieldIIPs-PT-030A-ReachabilityFireability-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 20 (type EQUN) for 6 ShieldIIPs-PT-030A-ReachabilityFireability-03
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 22 (type SRCH) for 6 ShieldIIPs-PT-030A-ReachabilityFireability-03
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 # 22 (type SRCH) for ShieldIIPs-PT-030A-ReachabilityFireability-03
lola: result : true
lola: markings : 95
lola: fired transitions : 94
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 19 (type FNDP) for ShieldIIPs-PT-030A-ReachabilityFireability-03 (obsolete)
lola: CANCELED task # 20 (type EQUN) for ShieldIIPs-PT-030A-ReachabilityFireability-03 (obsolete)
lola: CANCELED task # 23 (type EXCL) for ShieldIIPs-PT-030A-ReachabilityFireability-03 (obsolete)
lola: FINISHED task # 23 (type EXCL) for ShieldIIPs-PT-030A-ReachabilityFireability-03
lola: result : true
lola: markings : 256
lola: fired transitions : 255
lola: time used : 0.000000
lola: memory pages used : 1
lola: FINISHED task # 19 (type FNDP) for ShieldIIPs-PT-030A-ReachabilityFireability-03
lola: result : true
lola: fired transitions : 93
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: LAUNCH task # 29 (type EXCL) for 9 ShieldIIPs-PT-030A-ReachabilityFireability-05
lola: time limit : 719 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 25 (type FNDP) for 9 ShieldIIPs-PT-030A-ReachabilityFireability-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 26 (type EQUN) for 9 ShieldIIPs-PT-030A-ReachabilityFireability-05
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 28 (type SRCH) for 9 ShieldIIPs-PT-030A-ReachabilityFireability-05
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: 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 # 28 (type SRCH) for ShieldIIPs-PT-030A-ReachabilityFireability-05
lola: result : true
lola: markings : 53
lola: fired transitions : 52
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 25 (type FNDP) for ShieldIIPs-PT-030A-ReachabilityFireability-05 (obsolete)
lola: CANCELED task # 26 (type EQUN) for ShieldIIPs-PT-030A-ReachabilityFireability-05 (obsolete)
lola: CANCELED task # 29 (type EXCL) for ShieldIIPs-PT-030A-ReachabilityFireability-05 (obsolete)
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: LAUNCH task # 36 (type EXCL) for 15 ShieldIIPs-PT-030A-ReachabilityFireability-08
lola: time limit : 899 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 32 (type FNDP) for 15 ShieldIIPs-PT-030A-ReachabilityFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 33 (type EQUN) for 15 ShieldIIPs-PT-030A-ReachabilityFireability-08
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 35 (type SRCH) for 15 ShieldIIPs-PT-030A-ReachabilityFireability-08
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 # 25 (type FNDP) for ShieldIIPs-PT-030A-ReachabilityFireability-05
lola: result : true
lola: fired transitions : 51
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
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 # 32 (type FNDP) for ShieldIIPs-PT-030A-ReachabilityFireability-08
lola: result : true
lola: fired transitions : 73
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 33 (type EQUN) for ShieldIIPs-PT-030A-ReachabilityFireability-08 (obsolete)
lola: CANCELED task # 35 (type SRCH) for ShieldIIPs-PT-030A-ReachabilityFireability-08 (obsolete)
lola: CANCELED task # 36 (type EXCL) for ShieldIIPs-PT-030A-ReachabilityFireability-08 (obsolete)
lola: LAUNCH task # 42 (type EXCL) for 3 ShieldIIPs-PT-030A-ReachabilityFireability-01
lola: time limit : 1199 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 45 (type FNDP) for 12 ShieldIIPs-PT-030A-ReachabilityFireability-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 46 (type EQUN) for 12 ShieldIIPs-PT-030A-ReachabilityFireability-07
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 # 48 (type SRCH) for 12 ShieldIIPs-PT-030A-ReachabilityFireability-07
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: FINISHED task # 48 (type SRCH) for ShieldIIPs-PT-030A-ReachabilityFireability-07
lola: result : true
lola: markings : 98
lola: fired transitions : 97
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 45 (type FNDP) for ShieldIIPs-PT-030A-ReachabilityFireability-07 (obsolete)
lola: CANCELED task # 46 (type EQUN) for ShieldIIPs-PT-030A-ReachabilityFireability-07 (obsolete)
lola: LAUNCH task # 37 (type FNDP) for 3 ShieldIIPs-PT-030A-ReachabilityFireability-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 39 (type EQUN) for 3 ShieldIIPs-PT-030A-ReachabilityFireability-01
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: LAUNCH task # 41 (type SRCH) for 3 ShieldIIPs-PT-030A-ReachabilityFireability-01
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 # 41 (type SRCH) for ShieldIIPs-PT-030A-ReachabilityFireability-01
lola: result : true
lola: markings : 106
lola: fired transitions : 105
lola: time used : 0.000000
lola: memory pages used : 1
lola: CANCELED task # 37 (type FNDP) for ShieldIIPs-PT-030A-ReachabilityFireability-01 (obsolete)
lola: CANCELED task # 39 (type EQUN) for ShieldIIPs-PT-030A-ReachabilityFireability-01 (obsolete)
lola: CANCELED task # 42 (type EXCL) for ShieldIIPs-PT-030A-ReachabilityFireability-01 (obsolete)
lola: LAUNCH task # 55 (type EXCL) for 0 ShieldIIPs-PT-030A-ReachabilityFireability-00
lola: time limit : 3598 sec
lola: memory limit: 32 pages
lola: LAUNCH task # 51 (type FNDP) for 0 ShieldIIPs-PT-030A-ReachabilityFireability-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 52 (type EQUN) for 0 ShieldIIPs-PT-030A-ReachabilityFireability-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: LAUNCH task # 54 (type SRCH) for 0 ShieldIIPs-PT-030A-ReachabilityFireability-00
lola: time limit : 32000000 sec
lola: memory limit: 5 pages
lola: rewrite Frontend/Parser/formula_rewrite.k:711
lola: FINISHED task # 45 (type FNDP) for ShieldIIPs-PT-030A-ReachabilityFireability-07
lola: result : true
lola: fired transitions : 96
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
sara: try reading problem file /home/mcc/execution/379/ReachabilityFireability-26.sara.
sara: try reading problem file /home/mcc/execution/379/ReachabilityFireability-33.sara.
lola: FINISHED task # 51 (type FNDP) for ShieldIIPs-PT-030A-ReachabilityFireability-00
lola: result : true
lola: fired transitions : 76
lola: tried executions : 1
lola: time used : 0.000000
lola: memory pages used : 0
lola: CANCELED task # 52 (type EQUN) for ShieldIIPs-PT-030A-ReachabilityFireability-00 (obsolete)
lola: CANCELED task # 54 (type SRCH) for ShieldIIPs-PT-030A-ReachabilityFireability-00 (obsolete)
lola: CANCELED task # 55 (type EXCL) for ShieldIIPs-PT-030A-ReachabilityFireability-00 (obsolete)
lola: Portfolio finished: no open formulas

FINAL RESULTS
FINISHED FORMULA: CATEGORY VALUE PRODUCED BY
ShieldIIPs-PT-030A-ReachabilityFireability-00: EF true findpath
ShieldIIPs-PT-030A-ReachabilityFireability-01: EF true tandem / insertion
ShieldIIPs-PT-030A-ReachabilityFireability-03: AG false tandem / insertion
ShieldIIPs-PT-030A-ReachabilityFireability-05: EF true tandem / insertion
ShieldIIPs-PT-030A-ReachabilityFireability-07: AG false tandem / insertion
ShieldIIPs-PT-030A-ReachabilityFireability-08: AG false findpath


Time elapsed: 2 secs. Pages in use: 2
sara: place or transition ordering is non-deterministic
sara: warning, failure of lp_solve (at job 1723)

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-030A"
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-030A, 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-167903714900119"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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