About the Execution of LTSMin+red for ShieldRVt-PT-010B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15877.668 | 3582502.00 | 14304618.00 | 70.70 | ?F?????????????? | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2023-input.r425-tajo-167905978000266.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
..................
=====================================================================
Generated by BenchKit 2-5348
Executing tool ltsminxred
Input is ShieldRVt-PT-010B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r425-tajo-167905978000266
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.2K Feb 25 22:52 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Feb 25 22:52 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 22:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 22:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 22:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 25 22:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 25 22:52 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Feb 25 22:52 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 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 119K 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 ShieldRVt-PT-010B-CTLFireability-00
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-01
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-02
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-03
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-04
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-05
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-06
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-07
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-08
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-09
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-10
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-11
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-12
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-13
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-14
FORMULA_NAME ShieldRVt-PT-010B-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679306210567
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=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-010B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-20 09:56:52] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-20 09:56:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 09:56:52] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2023-03-20 09:56:52] [INFO ] Transformed 503 places.
[2023-03-20 09:56:52] [INFO ] Transformed 503 transitions.
[2023-03-20 09:56:52] [INFO ] Found NUPN structural information;
[2023-03-20 09:56:52] [INFO ] Parsed PT model containing 503 places and 503 transitions and 1186 arcs in 141 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 8 ms.
Support contains 110 out of 503 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 503/503 places, 503/503 transitions.
Discarding 73 places :
Symmetric choice reduction at 0 with 73 rule applications. Total rules 73 place count 430 transition count 430
Iterating global reduction 0 with 73 rules applied. Total rules applied 146 place count 430 transition count 430
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 147 place count 429 transition count 429
Iterating global reduction 0 with 1 rules applied. Total rules applied 148 place count 429 transition count 429
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 149 place count 428 transition count 428
Iterating global reduction 0 with 1 rules applied. Total rules applied 150 place count 428 transition count 428
Applied a total of 150 rules in 82 ms. Remains 428 /503 variables (removed 75) and now considering 428/503 (removed 75) transitions.
// Phase 1: matrix 428 rows 428 cols
[2023-03-20 09:56:52] [INFO ] Computed 41 place invariants in 39 ms
[2023-03-20 09:56:52] [INFO ] Implicit Places using invariants in 386 ms returned []
[2023-03-20 09:56:52] [INFO ] Invariant cache hit.
[2023-03-20 09:56:53] [INFO ] Implicit Places using invariants and state equation in 341 ms returned []
Implicit Place search using SMT with State Equation took 778 ms to find 0 implicit places.
[2023-03-20 09:56:53] [INFO ] Invariant cache hit.
[2023-03-20 09:56:53] [INFO ] Dead Transitions using invariants and state equation in 216 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 428/503 places, 428/503 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1079 ms. Remains : 428/503 places, 428/503 transitions.
Support contains 110 out of 428 places after structural reductions.
[2023-03-20 09:56:53] [INFO ] Flatten gal took : 63 ms
[2023-03-20 09:56:53] [INFO ] Flatten gal took : 26 ms
[2023-03-20 09:56:53] [INFO ] Input system was already deterministic with 428 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 361 ms. (steps per millisecond=27 ) properties (out of 82) seen :80
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-20 09:56:54] [INFO ] Invariant cache hit.
[2023-03-20 09:56:54] [INFO ] [Real]Absence check using 41 positive place invariants in 9 ms returned sat
[2023-03-20 09:56:54] [INFO ] After 149ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-20 09:56:54] [INFO ] Deduced a trap composed of 32 places in 113 ms of which 4 ms to minimize.
[2023-03-20 09:56:54] [INFO ] Deduced a trap composed of 25 places in 97 ms of which 1 ms to minimize.
[2023-03-20 09:56:54] [INFO ] Deduced a trap composed of 21 places in 82 ms of which 1 ms to minimize.
[2023-03-20 09:56:54] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 1 ms to minimize.
[2023-03-20 09:56:54] [INFO ] Deduced a trap composed of 27 places in 69 ms of which 1 ms to minimize.
[2023-03-20 09:56:55] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 0 ms to minimize.
[2023-03-20 09:56:55] [INFO ] Deduced a trap composed of 23 places in 62 ms of which 1 ms to minimize.
[2023-03-20 09:56:55] [INFO ] Deduced a trap composed of 32 places in 57 ms of which 0 ms to minimize.
[2023-03-20 09:56:55] [INFO ] Deduced a trap composed of 29 places in 50 ms of which 0 ms to minimize.
[2023-03-20 09:56:55] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 826 ms
[2023-03-20 09:56:55] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 0 ms to minimize.
[2023-03-20 09:56:55] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 0 ms to minimize.
[2023-03-20 09:56:55] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2023-03-20 09:56:55] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 0 ms to minimize.
[2023-03-20 09:56:55] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 287 ms
[2023-03-20 09:56:55] [INFO ] After 1289ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 09:56:55] [INFO ] After 1429ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-20 09:56:55] [INFO ] [Nat]Absence check using 41 positive place invariants in 15 ms returned sat
[2023-03-20 09:56:55] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-20 09:56:55] [INFO ] Deduced a trap composed of 25 places in 76 ms of which 1 ms to minimize.
[2023-03-20 09:56:56] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2023-03-20 09:56:56] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 0 ms to minimize.
[2023-03-20 09:56:56] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 1 ms to minimize.
[2023-03-20 09:56:56] [INFO ] Deduced a trap composed of 27 places in 53 ms of which 0 ms to minimize.
[2023-03-20 09:56:56] [INFO ] Deduced a trap composed of 29 places in 54 ms of which 1 ms to minimize.
[2023-03-20 09:56:56] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 498 ms
[2023-03-20 09:56:56] [INFO ] Deduced a trap composed of 22 places in 46 ms of which 1 ms to minimize.
[2023-03-20 09:56:56] [INFO ] Deduced a trap composed of 25 places in 41 ms of which 1 ms to minimize.
[2023-03-20 09:56:56] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 127 ms
[2023-03-20 09:56:56] [INFO ] After 795ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-20 09:56:56] [INFO ] After 953ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 22 ms.
Support contains 5 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 428/428 transitions.
Drop transitions removed 110 transitions
Trivial Post-agglo rules discarded 110 transitions
Performed 110 trivial Post agglomeration. Transition count delta: 110
Iterating post reduction 0 with 110 rules applied. Total rules applied 110 place count 428 transition count 318
Reduce places removed 110 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 111 rules applied. Total rules applied 221 place count 318 transition count 317
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 222 place count 317 transition count 317
Performed 61 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 61 Pre rules applied. Total rules applied 222 place count 317 transition count 256
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 344 place count 256 transition count 256
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 374 place count 226 transition count 226
Iterating global reduction 3 with 30 rules applied. Total rules applied 404 place count 226 transition count 226
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 404 place count 226 transition count 202
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 452 place count 202 transition count 202
Performed 82 Post agglomeration using F-continuation condition.Transition count delta: 82
Deduced a syphon composed of 82 places in 0 ms
Reduce places removed 82 places and 0 transitions.
Iterating global reduction 3 with 164 rules applied. Total rules applied 616 place count 120 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 617 place count 120 transition count 119
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 619 place count 119 transition count 118
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 58 rules applied. Total rules applied 677 place count 90 transition count 146
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 678 place count 90 transition count 145
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 679 place count 90 transition count 145
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 680 place count 89 transition count 144
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 681 place count 88 transition count 144
Applied a total of 681 rules in 59 ms. Remains 88 /428 variables (removed 340) and now considering 144/428 (removed 284) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 88/428 places, 144/428 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 144 rows 88 cols
[2023-03-20 09:56:56] [INFO ] Computed 40 place invariants in 0 ms
[2023-03-20 09:56:56] [INFO ] [Real]Absence check using 40 positive place invariants in 5 ms returned sat
[2023-03-20 09:56:56] [INFO ] After 34ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 09:56:56] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-20 09:56:56] [INFO ] After 9ms SMT Verify possible using 9 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 09:56:56] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 09:56:56] [INFO ] [Nat]Absence check using 40 positive place invariants in 5 ms returned sat
[2023-03-20 09:56:56] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 09:56:56] [INFO ] After 5ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 09:56:56] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-20 09:56:56] [INFO ] After 87ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 88 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 88/88 places, 144/144 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 88 transition count 143
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 87 transition count 143
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 87 transition count 142
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 86 transition count 142
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 85 transition count 141
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 7 place count 85 transition count 140
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 84 transition count 140
Applied a total of 8 rules in 13 ms. Remains 84 /88 variables (removed 4) and now considering 140/144 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 84/88 places, 140/144 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1345263 steps, run timeout after 3001 ms. (steps per millisecond=448 ) properties seen :{}
Probabilistic random walk after 1345263 steps, saw 892401 distinct states, run finished after 3002 ms. (steps per millisecond=448 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 140 rows 84 cols
[2023-03-20 09:56:59] [INFO ] Computed 40 place invariants in 2 ms
[2023-03-20 09:56:59] [INFO ] [Real]Absence check using 40 positive place invariants in 4 ms returned sat
[2023-03-20 09:56:59] [INFO ] After 63ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 09:56:59] [INFO ] [Nat]Absence check using 40 positive place invariants in 4 ms returned sat
[2023-03-20 09:57:00] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 09:57:00] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-20 09:57:00] [INFO ] After 10ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 09:57:00] [INFO ] After 19ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-20 09:57:00] [INFO ] After 85ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 3 out of 84 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 140/140 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 84/84 places, 140/140 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 84/84 places, 140/140 transitions.
Applied a total of 0 rules in 4 ms. Remains 84 /84 variables (removed 0) and now considering 140/140 (removed 0) transitions.
[2023-03-20 09:57:00] [INFO ] Invariant cache hit.
[2023-03-20 09:57:00] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-20 09:57:00] [INFO ] Invariant cache hit.
[2023-03-20 09:57:00] [INFO ] State equation strengthened by 9 read => feed constraints.
[2023-03-20 09:57:00] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
[2023-03-20 09:57:00] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-20 09:57:00] [INFO ] Invariant cache hit.
[2023-03-20 09:57:00] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 238 ms. Remains : 84/84 places, 140/140 transitions.
Graph (trivial) has 40 edges and 84 vertex of which 4 / 84 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 267 edges and 82 vertex of which 80 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 37 edges and 78 vertex of which 4 / 78 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 76 transition count 131
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 36 edges and 74 vertex of which 6 / 74 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 71 transition count 122
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 32 edges and 69 vertex of which 4 / 69 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 2 with 12 rules applied. Total rules applied 32 place count 67 transition count 113
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 39 place count 66 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 41 place count 65 transition count 106
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 207 edges and 65 vertex of which 64 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 4 with 3 rules applied. Total rules applied 44 place count 64 transition count 104
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 46 place count 64 transition count 102
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 47 place count 63 transition count 102
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 3 rules applied. Total rules applied 50 place count 61 transition count 101
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 54 place count 61 transition count 97
Applied a total of 54 rules in 17 ms. Remains 61 /84 variables (removed 23) and now considering 97/140 (removed 43) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 97 rows 61 cols
[2023-03-20 09:57:00] [INFO ] Computed 29 place invariants in 2 ms
[2023-03-20 09:57:00] [INFO ] [Real]Absence check using 29 positive place invariants in 3 ms returned sat
[2023-03-20 09:57:00] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 09:57:00] [INFO ] [Nat]Absence check using 29 positive place invariants in 3 ms returned sat
[2023-03-20 09:57:00] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 09:57:00] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-20 09:57:00] [INFO ] After 4ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 09:57:00] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2023-03-20 09:57:00] [INFO ] After 58ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-20 09:57:00] [INFO ] Flatten gal took : 17 ms
[2023-03-20 09:57:00] [INFO ] Flatten gal took : 18 ms
[2023-03-20 09:57:00] [INFO ] Input system was already deterministic with 428 transitions.
Computed a total of 129 stabilizing places and 129 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 428/428 places, 428/428 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 393 transition count 393
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 393 transition count 393
Applied a total of 70 rules in 14 ms. Remains 393 /428 variables (removed 35) and now considering 393/428 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 393/428 places, 393/428 transitions.
[2023-03-20 09:57:00] [INFO ] Flatten gal took : 14 ms
[2023-03-20 09:57:00] [INFO ] Flatten gal took : 14 ms
[2023-03-20 09:57:00] [INFO ] Input system was already deterministic with 393 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 428/428 places, 428/428 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 111 rules applied. Total rules applied 111 place count 427 transition count 316
Reduce places removed 111 places and 0 transitions.
Iterating post reduction 1 with 111 rules applied. Total rules applied 222 place count 316 transition count 316
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 222 place count 316 transition count 253
Deduced a syphon composed of 63 places in 1 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 348 place count 253 transition count 253
Discarding 29 places :
Symmetric choice reduction at 2 with 29 rule applications. Total rules 377 place count 224 transition count 224
Iterating global reduction 2 with 29 rules applied. Total rules applied 406 place count 224 transition count 224
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 406 place count 224 transition count 200
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 454 place count 200 transition count 200
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 604 place count 125 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 605 place count 125 transition count 124
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 607 place count 124 transition count 123
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 609 place count 122 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 610 place count 121 transition count 121
Applied a total of 610 rules in 35 ms. Remains 121 /428 variables (removed 307) and now considering 121/428 (removed 307) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35 ms. Remains : 121/428 places, 121/428 transitions.
[2023-03-20 09:57:00] [INFO ] Flatten gal took : 5 ms
[2023-03-20 09:57:00] [INFO ] Flatten gal took : 6 ms
[2023-03-20 09:57:00] [INFO ] Input system was already deterministic with 121 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
FORMULA ShieldRVt-PT-010B-CTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 428/428 places, 428/428 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 396 transition count 396
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 396 transition count 396
Applied a total of 64 rules in 13 ms. Remains 396 /428 variables (removed 32) and now considering 396/428 (removed 32) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 396/428 places, 396/428 transitions.
[2023-03-20 09:57:00] [INFO ] Flatten gal took : 12 ms
[2023-03-20 09:57:00] [INFO ] Flatten gal took : 13 ms
[2023-03-20 09:57:00] [INFO ] Input system was already deterministic with 396 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 428/428 places, 428/428 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 112 rules applied. Total rules applied 112 place count 427 transition count 315
Reduce places removed 112 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 113 rules applied. Total rules applied 225 place count 315 transition count 314
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 226 place count 314 transition count 314
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 226 place count 314 transition count 251
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 352 place count 251 transition count 251
Discarding 29 places :
Symmetric choice reduction at 3 with 29 rule applications. Total rules 381 place count 222 transition count 222
Iterating global reduction 3 with 29 rules applied. Total rules applied 410 place count 222 transition count 222
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 22 Pre rules applied. Total rules applied 410 place count 222 transition count 200
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 454 place count 200 transition count 200
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 604 place count 125 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 605 place count 125 transition count 124
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 607 place count 124 transition count 123
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 609 place count 122 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 610 place count 121 transition count 121
Applied a total of 610 rules in 33 ms. Remains 121 /428 variables (removed 307) and now considering 121/428 (removed 307) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 121/428 places, 121/428 transitions.
[2023-03-20 09:57:00] [INFO ] Flatten gal took : 42 ms
[2023-03-20 09:57:00] [INFO ] Flatten gal took : 5 ms
[2023-03-20 09:57:00] [INFO ] Input system was already deterministic with 121 transitions.
Starting structural reductions in LTL mode, iteration 0 : 428/428 places, 428/428 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 395 transition count 395
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 395 transition count 395
Applied a total of 66 rules in 12 ms. Remains 395 /428 variables (removed 33) and now considering 395/428 (removed 33) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 395/428 places, 395/428 transitions.
[2023-03-20 09:57:00] [INFO ] Flatten gal took : 12 ms
[2023-03-20 09:57:00] [INFO ] Flatten gal took : 13 ms
[2023-03-20 09:57:00] [INFO ] Input system was already deterministic with 395 transitions.
Starting structural reductions in LTL mode, iteration 0 : 428/428 places, 428/428 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 393 transition count 393
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 393 transition count 393
Applied a total of 70 rules in 13 ms. Remains 393 /428 variables (removed 35) and now considering 393/428 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 393/428 places, 393/428 transitions.
[2023-03-20 09:57:00] [INFO ] Flatten gal took : 10 ms
[2023-03-20 09:57:00] [INFO ] Flatten gal took : 10 ms
[2023-03-20 09:57:00] [INFO ] Input system was already deterministic with 393 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 428/428 places, 428/428 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 112 rules applied. Total rules applied 112 place count 427 transition count 315
Reduce places removed 112 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 113 rules applied. Total rules applied 225 place count 315 transition count 314
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 226 place count 314 transition count 314
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 62 Pre rules applied. Total rules applied 226 place count 314 transition count 252
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 350 place count 252 transition count 252
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 380 place count 222 transition count 222
Iterating global reduction 3 with 30 rules applied. Total rules applied 410 place count 222 transition count 222
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 410 place count 222 transition count 198
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 458 place count 198 transition count 198
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 606 place count 124 transition count 124
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 607 place count 124 transition count 123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 609 place count 123 transition count 122
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 611 place count 121 transition count 120
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 612 place count 120 transition count 120
Applied a total of 612 rules in 29 ms. Remains 120 /428 variables (removed 308) and now considering 120/428 (removed 308) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 29 ms. Remains : 120/428 places, 120/428 transitions.
[2023-03-20 09:57:00] [INFO ] Flatten gal took : 4 ms
[2023-03-20 09:57:00] [INFO ] Flatten gal took : 4 ms
[2023-03-20 09:57:00] [INFO ] Input system was already deterministic with 120 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 428/428 places, 428/428 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 111 transitions
Trivial Post-agglo rules discarded 111 transitions
Performed 111 trivial Post agglomeration. Transition count delta: 111
Iterating post reduction 0 with 111 rules applied. Total rules applied 111 place count 427 transition count 316
Reduce places removed 111 places and 0 transitions.
Iterating post reduction 1 with 111 rules applied. Total rules applied 222 place count 316 transition count 316
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 63 Pre rules applied. Total rules applied 222 place count 316 transition count 253
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 2 with 126 rules applied. Total rules applied 348 place count 253 transition count 253
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 378 place count 223 transition count 223
Iterating global reduction 2 with 30 rules applied. Total rules applied 408 place count 223 transition count 223
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 408 place count 223 transition count 199
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 2 with 48 rules applied. Total rules applied 456 place count 199 transition count 199
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 604 place count 125 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 605 place count 125 transition count 124
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 607 place count 124 transition count 123
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 609 place count 122 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 610 place count 121 transition count 121
Applied a total of 610 rules in 27 ms. Remains 121 /428 variables (removed 307) and now considering 121/428 (removed 307) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 28 ms. Remains : 121/428 places, 121/428 transitions.
[2023-03-20 09:57:01] [INFO ] Flatten gal took : 4 ms
[2023-03-20 09:57:01] [INFO ] Flatten gal took : 4 ms
[2023-03-20 09:57:01] [INFO ] Input system was already deterministic with 121 transitions.
Starting structural reductions in LTL mode, iteration 0 : 428/428 places, 428/428 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 394 transition count 394
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 394 transition count 394
Applied a total of 68 rules in 13 ms. Remains 394 /428 variables (removed 34) and now considering 394/428 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 394/428 places, 394/428 transitions.
[2023-03-20 09:57:01] [INFO ] Flatten gal took : 9 ms
[2023-03-20 09:57:01] [INFO ] Flatten gal took : 9 ms
[2023-03-20 09:57:01] [INFO ] Input system was already deterministic with 394 transitions.
Starting structural reductions in LTL mode, iteration 0 : 428/428 places, 428/428 transitions.
Discarding 34 places :
Symmetric choice reduction at 0 with 34 rule applications. Total rules 34 place count 394 transition count 394
Iterating global reduction 0 with 34 rules applied. Total rules applied 68 place count 394 transition count 394
Applied a total of 68 rules in 13 ms. Remains 394 /428 variables (removed 34) and now considering 394/428 (removed 34) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 394/428 places, 394/428 transitions.
[2023-03-20 09:57:01] [INFO ] Flatten gal took : 10 ms
[2023-03-20 09:57:01] [INFO ] Flatten gal took : 10 ms
[2023-03-20 09:57:01] [INFO ] Input system was already deterministic with 394 transitions.
Starting structural reductions in LTL mode, iteration 0 : 428/428 places, 428/428 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 393 transition count 393
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 393 transition count 393
Applied a total of 70 rules in 11 ms. Remains 393 /428 variables (removed 35) and now considering 393/428 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 393/428 places, 393/428 transitions.
[2023-03-20 09:57:01] [INFO ] Flatten gal took : 10 ms
[2023-03-20 09:57:01] [INFO ] Flatten gal took : 10 ms
[2023-03-20 09:57:01] [INFO ] Input system was already deterministic with 393 transitions.
Starting structural reductions in LTL mode, iteration 0 : 428/428 places, 428/428 transitions.
Discarding 35 places :
Symmetric choice reduction at 0 with 35 rule applications. Total rules 35 place count 393 transition count 393
Iterating global reduction 0 with 35 rules applied. Total rules applied 70 place count 393 transition count 393
Applied a total of 70 rules in 11 ms. Remains 393 /428 variables (removed 35) and now considering 393/428 (removed 35) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 393/428 places, 393/428 transitions.
[2023-03-20 09:57:01] [INFO ] Flatten gal took : 9 ms
[2023-03-20 09:57:01] [INFO ] Flatten gal took : 10 ms
[2023-03-20 09:57:01] [INFO ] Input system was already deterministic with 393 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 428/428 places, 428/428 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 112 transitions
Trivial Post-agglo rules discarded 112 transitions
Performed 112 trivial Post agglomeration. Transition count delta: 112
Iterating post reduction 0 with 112 rules applied. Total rules applied 112 place count 427 transition count 315
Reduce places removed 112 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 113 rules applied. Total rules applied 225 place count 315 transition count 314
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 226 place count 314 transition count 314
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 63 Pre rules applied. Total rules applied 226 place count 314 transition count 251
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 3 with 126 rules applied. Total rules applied 352 place count 251 transition count 251
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 382 place count 221 transition count 221
Iterating global reduction 3 with 30 rules applied. Total rules applied 412 place count 221 transition count 221
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 412 place count 221 transition count 197
Deduced a syphon composed of 24 places in 1 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 48 rules applied. Total rules applied 460 place count 197 transition count 197
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 3 with 144 rules applied. Total rules applied 604 place count 125 transition count 125
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 605 place count 125 transition count 124
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 607 place count 124 transition count 123
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 609 place count 122 transition count 121
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 610 place count 121 transition count 121
Applied a total of 610 rules in 29 ms. Remains 121 /428 variables (removed 307) and now considering 121/428 (removed 307) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 121/428 places, 121/428 transitions.
[2023-03-20 09:57:01] [INFO ] Flatten gal took : 4 ms
[2023-03-20 09:57:01] [INFO ] Flatten gal took : 4 ms
[2023-03-20 09:57:01] [INFO ] Input system was already deterministic with 121 transitions.
Starting structural reductions in LTL mode, iteration 0 : 428/428 places, 428/428 transitions.
Discarding 37 places :
Symmetric choice reduction at 0 with 37 rule applications. Total rules 37 place count 391 transition count 391
Iterating global reduction 0 with 37 rules applied. Total rules applied 74 place count 391 transition count 391
Applied a total of 74 rules in 11 ms. Remains 391 /428 variables (removed 37) and now considering 391/428 (removed 37) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 391/428 places, 391/428 transitions.
[2023-03-20 09:57:01] [INFO ] Flatten gal took : 9 ms
[2023-03-20 09:57:01] [INFO ] Flatten gal took : 8 ms
[2023-03-20 09:57:01] [INFO ] Input system was already deterministic with 391 transitions.
Starting structural reductions in LTL mode, iteration 0 : 428/428 places, 428/428 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 398 transition count 398
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 398 transition count 398
Applied a total of 60 rules in 10 ms. Remains 398 /428 variables (removed 30) and now considering 398/428 (removed 30) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 398/428 places, 398/428 transitions.
[2023-03-20 09:57:01] [INFO ] Flatten gal took : 9 ms
[2023-03-20 09:57:01] [INFO ] Flatten gal took : 9 ms
[2023-03-20 09:57:01] [INFO ] Input system was already deterministic with 398 transitions.
Starting structural reductions in LTL mode, iteration 0 : 428/428 places, 428/428 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 399 transition count 399
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 399 transition count 399
Applied a total of 58 rules in 10 ms. Remains 399 /428 variables (removed 29) and now considering 399/428 (removed 29) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 13 ms. Remains : 399/428 places, 399/428 transitions.
[2023-03-20 09:57:01] [INFO ] Flatten gal took : 9 ms
[2023-03-20 09:57:01] [INFO ] Flatten gal took : 9 ms
[2023-03-20 09:57:01] [INFO ] Input system was already deterministic with 399 transitions.
[2023-03-20 09:57:01] [INFO ] Flatten gal took : 10 ms
[2023-03-20 09:57:01] [INFO ] Flatten gal took : 10 ms
[2023-03-20 09:57:01] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-20 09:57:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 428 places, 428 transitions and 1036 arcs took 2 ms.
Total runtime 9487 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-sym model.pnml --lace-workers=4 --vset=lddmc --saturation=sat -rbs,w2W,ru,hf --sylvan-sizes=20,28,20,28 --ctl=/tmp/577/ctl_0_ --ctl=/tmp/577/ctl_1_ --ctl=/tmp/577/ctl_2_ --ctl=/tmp/577/ctl_3_ --ctl=/tmp/577/ctl_4_ --ctl=/tmp/577/ctl_5_ --ctl=/tmp/577/ctl_6_ --ctl=/tmp/577/ctl_7_ --ctl=/tmp/577/ctl_8_ --ctl=/tmp/577/ctl_9_ --ctl=/tmp/577/ctl_10_ --ctl=/tmp/577/ctl_11_ --ctl=/tmp/577/ctl_12_ --ctl=/tmp/577/ctl_13_ --ctl=/tmp/577/ctl_14_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393340 kB
MemFree: 278468 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16097132 kB
Could not compute solution for formula : ShieldRVt-PT-010B-CTLFireability-00
Could not compute solution for formula : ShieldRVt-PT-010B-CTLFireability-02
Could not compute solution for formula : ShieldRVt-PT-010B-CTLFireability-03
Could not compute solution for formula : ShieldRVt-PT-010B-CTLFireability-04
Could not compute solution for formula : ShieldRVt-PT-010B-CTLFireability-05
Could not compute solution for formula : ShieldRVt-PT-010B-CTLFireability-06
Could not compute solution for formula : ShieldRVt-PT-010B-CTLFireability-07
Could not compute solution for formula : ShieldRVt-PT-010B-CTLFireability-08
Could not compute solution for formula : ShieldRVt-PT-010B-CTLFireability-09
Could not compute solution for formula : ShieldRVt-PT-010B-CTLFireability-10
Could not compute solution for formula : ShieldRVt-PT-010B-CTLFireability-11
Could not compute solution for formula : ShieldRVt-PT-010B-CTLFireability-12
Could not compute solution for formula : ShieldRVt-PT-010B-CTLFireability-13
Could not compute solution for formula : ShieldRVt-PT-010B-CTLFireability-14
Could not compute solution for formula : ShieldRVt-PT-010B-CTLFireability-15
BK_STOP 1679309793069
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
mcc2023
ctl formula name ShieldRVt-PT-010B-CTLFireability-00
ctl formula formula --ctl=/tmp/577/ctl_0_
ctl formula name ShieldRVt-PT-010B-CTLFireability-02
ctl formula formula --ctl=/tmp/577/ctl_1_
ctl formula name ShieldRVt-PT-010B-CTLFireability-03
ctl formula formula --ctl=/tmp/577/ctl_2_
ctl formula name ShieldRVt-PT-010B-CTLFireability-04
ctl formula formula --ctl=/tmp/577/ctl_3_
ctl formula name ShieldRVt-PT-010B-CTLFireability-05
ctl formula formula --ctl=/tmp/577/ctl_4_
ctl formula name ShieldRVt-PT-010B-CTLFireability-06
ctl formula formula --ctl=/tmp/577/ctl_5_
ctl formula name ShieldRVt-PT-010B-CTLFireability-07
ctl formula formula --ctl=/tmp/577/ctl_6_
ctl formula name ShieldRVt-PT-010B-CTLFireability-08
ctl formula formula --ctl=/tmp/577/ctl_7_
ctl formula name ShieldRVt-PT-010B-CTLFireability-09
ctl formula formula --ctl=/tmp/577/ctl_8_
ctl formula name ShieldRVt-PT-010B-CTLFireability-10
ctl formula formula --ctl=/tmp/577/ctl_9_
ctl formula name ShieldRVt-PT-010B-CTLFireability-11
ctl formula formula --ctl=/tmp/577/ctl_10_
ctl formula name ShieldRVt-PT-010B-CTLFireability-12
ctl formula formula --ctl=/tmp/577/ctl_11_
ctl formula name ShieldRVt-PT-010B-CTLFireability-13
ctl formula formula --ctl=/tmp/577/ctl_12_
ctl formula name ShieldRVt-PT-010B-CTLFireability-14
ctl formula formula --ctl=/tmp/577/ctl_13_
ctl formula name ShieldRVt-PT-010B-CTLFireability-15
ctl formula formula --ctl=/tmp/577/ctl_14_
pnml2lts-sym: Exploration order is bfs-prev
pnml2lts-sym: Saturation strategy is sat
pnml2lts-sym: Guided search strategy is unguided
pnml2lts-sym: Attractor strategy is default
pnml2lts-sym: opening model.pnml
pnml2lts-sym: Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-sym: Petri net has 428 places, 428 transitions and 1036 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.010 real 0.000 user 0.000 sys
pnml2lts-sym: Initializing regrouping layer
pnml2lts-sym: Regroup specification: bs,w2W,ru,hf
pnml2lts-sym: Regroup Boost's Sloan
pnml2lts-sym: Regroup over-approximate must-write to may-write
pnml2lts-sym: Regroup Row sUbsume
pnml2lts-sym: Reqroup Horizontal Flip
pnml2lts-sym: Regrouping: 428->428 groups
pnml2lts-sym: Regrouping took 0.050 real 0.050 user 0.000 sys
pnml2lts-sym: state vector length is 428; there are 428 groups
pnml2lts-sym: Creating a multi-core ListDD domain.
pnml2lts-sym: Sylvan allocates 15.000 GB virtual memory for nodes table and operation cache.
pnml2lts-sym: Initial nodes table and operation cache requires 60.00 MB.
pnml2lts-sym: Using GBgetTransitionsShortR2W as next-state function
pnml2lts-sym: got initial state
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: Exploration took 866613 group checks and 0 next state calls
pnml2lts-sym: reachability took 5.800 real 23.090 user 0.050 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.010 real 0.020 user 0.000 sys
pnml2lts-sym: state space has 8.87928071886101e+36 states, 9421 nodes
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
Killing (15) : 585
Killing (9) : 585
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="ShieldRVt-PT-010B"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is ShieldRVt-PT-010B, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r425-tajo-167905978000266"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-010B.tgz
mv ShieldRVt-PT-010B execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;