About the Execution of LTSMin+red for ShieldPPPt-PT-003B
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15865.279 | 3587272.00 | 14312745.00 | 56.10 | [undef] | Cannot compute |
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.r393-oct2-167903717200570.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 ltsminxred
Input is ShieldPPPt-PT-003B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903717200570
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 4.9K Feb 25 21:07 CTLCardinality.txt
-rw-r--r-- 1 mcc users 44K Feb 25 21:07 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Feb 25 21:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 25 21:06 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.9K Feb 25 17:00 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 17:00 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 17:00 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:00 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 21:07 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Feb 25 21:07 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 25 21:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 21:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:00 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:00 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 56K 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 ShieldPPPt-PT-003B-CTLFireability-00
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-01
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-02
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-03
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-04
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-05
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-06
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-07
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-08
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-09
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-10
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-11
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-12
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-13
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-14
FORMULA_NAME ShieldPPPt-PT-003B-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679459956861
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=ShieldPPPt-PT-003B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 04:39:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 04:39:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 04:39:20] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2023-03-22 04:39:20] [INFO ] Transformed 237 places.
[2023-03-22 04:39:20] [INFO ] Transformed 216 transitions.
[2023-03-22 04:39:20] [INFO ] Found NUPN structural information;
[2023-03-22 04:39:20] [INFO ] Parsed PT model containing 237 places and 216 transitions and 540 arcs in 145 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Support contains 91 out of 237 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 237/237 places, 216/216 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 225 transition count 204
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 225 transition count 204
Applied a total of 24 rules in 27 ms. Remains 225 /237 variables (removed 12) and now considering 204/216 (removed 12) transitions.
// Phase 1: matrix 204 rows 225 cols
[2023-03-22 04:39:20] [INFO ] Computed 34 place invariants in 26 ms
[2023-03-22 04:39:20] [INFO ] Implicit Places using invariants in 417 ms returned []
[2023-03-22 04:39:20] [INFO ] Invariant cache hit.
[2023-03-22 04:39:20] [INFO ] Implicit Places using invariants and state equation in 435 ms returned []
Implicit Place search using SMT with State Equation took 888 ms to find 0 implicit places.
[2023-03-22 04:39:20] [INFO ] Invariant cache hit.
[2023-03-22 04:39:21] [INFO ] Dead Transitions using invariants and state equation in 281 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 225/237 places, 204/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1212 ms. Remains : 225/237 places, 204/216 transitions.
Support contains 91 out of 225 places after structural reductions.
[2023-03-22 04:39:21] [INFO ] Flatten gal took : 51 ms
[2023-03-22 04:39:21] [INFO ] Flatten gal took : 20 ms
[2023-03-22 04:39:21] [INFO ] Input system was already deterministic with 204 transitions.
Support contains 90 out of 225 places (down from 91) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 359 ms. (steps per millisecond=27 ) properties (out of 70) seen :68
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 04:39:22] [INFO ] Invariant cache hit.
[2023-03-22 04:39:22] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 04:39:22] [INFO ] [Nat]Absence check using 34 positive place invariants in 13 ms returned sat
[2023-03-22 04:39:22] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 04:39:22] [INFO ] Deduced a trap composed of 19 places in 122 ms of which 17 ms to minimize.
[2023-03-22 04:39:22] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2023-03-22 04:39:22] [INFO ] Deduced a trap composed of 18 places in 59 ms of which 1 ms to minimize.
[2023-03-22 04:39:23] [INFO ] Deduced a trap composed of 12 places in 196 ms of which 3 ms to minimize.
[2023-03-22 04:39:23] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2023-03-22 04:39:23] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 0 ms to minimize.
[2023-03-22 04:39:23] [INFO ] Deduced a trap composed of 17 places in 98 ms of which 1 ms to minimize.
[2023-03-22 04:39:23] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 11 ms to minimize.
[2023-03-22 04:39:23] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 0 ms to minimize.
[2023-03-22 04:39:23] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 922 ms
[2023-03-22 04:39:23] [INFO ] After 1128ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-22 04:39:23] [INFO ] After 1291ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 225 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 204/204 transitions.
Drop transitions removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 51 place count 225 transition count 153
Reduce places removed 51 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 53 rules applied. Total rules applied 104 place count 174 transition count 151
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 106 place count 173 transition count 150
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 107 place count 172 transition count 150
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 15 Pre rules applied. Total rules applied 107 place count 172 transition count 135
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 4 with 30 rules applied. Total rules applied 137 place count 157 transition count 135
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 150 place count 144 transition count 122
Iterating global reduction 4 with 13 rules applied. Total rules applied 163 place count 144 transition count 122
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 163 place count 144 transition count 115
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 177 place count 137 transition count 115
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 0 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 4 with 100 rules applied. Total rules applied 277 place count 87 transition count 65
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 293 place count 79 transition count 65
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 301 place count 79 transition count 65
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 302 place count 78 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 303 place count 77 transition count 64
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 303 place count 77 transition count 62
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 307 place count 75 transition count 62
Applied a total of 307 rules in 59 ms. Remains 75 /225 variables (removed 150) and now considering 62/204 (removed 142) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59 ms. Remains : 75/225 places, 62/204 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1286504 steps, run timeout after 3001 ms. (steps per millisecond=428 ) properties seen :{}
Probabilistic random walk after 1286504 steps, saw 782812 distinct states, run finished after 3004 ms. (steps per millisecond=428 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 62 rows 75 cols
[2023-03-22 04:39:26] [INFO ] Computed 33 place invariants in 2 ms
[2023-03-22 04:39:26] [INFO ] After 68ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 04:39:26] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-22 04:39:26] [INFO ] After 82ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 04:39:26] [INFO ] State equation strengthened by 4 read => feed constraints.
[2023-03-22 04:39:26] [INFO ] After 4ms SMT Verify possible using 4 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 04:39:26] [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 4 ms.
[2023-03-22 04:39:26] [INFO ] After 172ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 75 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 62/62 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 62/62 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 75/75 places, 62/62 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 75/75 places, 62/62 transitions.
Applied a total of 0 rules in 2 ms. Remains 75 /75 variables (removed 0) and now considering 62/62 (removed 0) transitions.
[2023-03-22 04:39:26] [INFO ] Invariant cache hit.
[2023-03-22 04:39:27] [INFO ] Implicit Places using invariants in 125 ms returned [58, 62]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 145 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 73/75 places, 62/62 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 71 transition count 60
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 71 transition count 60
Applied a total of 4 rules in 3 ms. Remains 71 /73 variables (removed 2) and now considering 60/62 (removed 2) transitions.
// Phase 1: matrix 60 rows 71 cols
[2023-03-22 04:39:27] [INFO ] Computed 31 place invariants in 2 ms
[2023-03-22 04:39:27] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-22 04:39:27] [INFO ] Invariant cache hit.
[2023-03-22 04:39:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 04:39:27] [INFO ] Implicit Places using invariants and state equation in 221 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 71/75 places, 60/62 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 446 ms. Remains : 71/75 places, 60/62 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1600248 steps, run timeout after 3001 ms. (steps per millisecond=533 ) properties seen :{}
Probabilistic random walk after 1600248 steps, saw 981001 distinct states, run finished after 3001 ms. (steps per millisecond=533 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 04:39:30] [INFO ] Invariant cache hit.
[2023-03-22 04:39:30] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 04:39:30] [INFO ] [Nat]Absence check using 31 positive place invariants in 7 ms returned sat
[2023-03-22 04:39:30] [INFO ] After 55ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 04:39:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 04:39:30] [INFO ] After 10ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 04:39:30] [INFO ] After 24ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-22 04:39:30] [INFO ] After 150ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 71 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 60/60 transitions.
Applied a total of 0 rules in 4 ms. Remains 71 /71 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 71/71 places, 60/60 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 71/71 places, 60/60 transitions.
Applied a total of 0 rules in 3 ms. Remains 71 /71 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-22 04:39:30] [INFO ] Invariant cache hit.
[2023-03-22 04:39:30] [INFO ] Implicit Places using invariants in 153 ms returned []
[2023-03-22 04:39:30] [INFO ] Invariant cache hit.
[2023-03-22 04:39:30] [INFO ] State equation strengthened by 2 read => feed constraints.
[2023-03-22 04:39:30] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 275 ms to find 0 implicit places.
[2023-03-22 04:39:30] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 04:39:30] [INFO ] Invariant cache hit.
[2023-03-22 04:39:30] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 338 ms. Remains : 71/71 places, 60/60 transitions.
Partial Free-agglomeration rule applied 13 times.
Drop transitions removed 13 transitions
Iterating global reduction 0 with 13 rules applied. Total rules applied 13 place count 71 transition count 60
Applied a total of 13 rules in 4 ms. Remains 71 /71 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 60 rows 71 cols
[2023-03-22 04:39:30] [INFO ] Computed 31 place invariants in 1 ms
[2023-03-22 04:39:31] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 04:39:31] [INFO ] [Nat]Absence check using 31 positive place invariants in 10 ms returned sat
[2023-03-22 04:39:31] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 04:39:31] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-22 04:39:31] [INFO ] After 6ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 04:39:31] [INFO ] After 16ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2023-03-22 04:39:31] [INFO ] After 106ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2023-03-22 04:39:31] [INFO ] Flatten gal took : 21 ms
[2023-03-22 04:39:31] [INFO ] Flatten gal took : 16 ms
[2023-03-22 04:39:31] [INFO ] Input system was already deterministic with 204 transitions.
Computed a total of 55 stabilizing places and 55 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 204/204 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 207 transition count 186
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 207 transition count 186
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 206 transition count 185
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 206 transition count 185
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 205 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 205 transition count 184
Applied a total of 40 rules in 15 ms. Remains 205 /225 variables (removed 20) and now considering 184/204 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15 ms. Remains : 205/225 places, 184/204 transitions.
[2023-03-22 04:39:31] [INFO ] Flatten gal took : 7 ms
[2023-03-22 04:39:31] [INFO ] Flatten gal took : 7 ms
[2023-03-22 04:39:31] [INFO ] Input system was already deterministic with 184 transitions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 204/204 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 205 transition count 184
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 205 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 204 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 204 transition count 183
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 203 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 203 transition count 182
Applied a total of 44 rules in 14 ms. Remains 203 /225 variables (removed 22) and now considering 182/204 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 203/225 places, 182/204 transitions.
[2023-03-22 04:39:31] [INFO ] Flatten gal took : 7 ms
[2023-03-22 04:39:31] [INFO ] Flatten gal took : 7 ms
[2023-03-22 04:39:31] [INFO ] Input system was already deterministic with 182 transitions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 204/204 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 206 transition count 185
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 206 transition count 185
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 205 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 205 transition count 184
Applied a total of 40 rules in 10 ms. Remains 205 /225 variables (removed 20) and now considering 184/204 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 205/225 places, 184/204 transitions.
[2023-03-22 04:39:31] [INFO ] Flatten gal took : 7 ms
[2023-03-22 04:39:31] [INFO ] Flatten gal took : 7 ms
[2023-03-22 04:39:31] [INFO ] Input system was already deterministic with 184 transitions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 204/204 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 208 transition count 187
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 208 transition count 187
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 207 transition count 186
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 207 transition count 186
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 206 transition count 185
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 206 transition count 185
Applied a total of 38 rules in 13 ms. Remains 206 /225 variables (removed 19) and now considering 185/204 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 206/225 places, 185/204 transitions.
[2023-03-22 04:39:31] [INFO ] Flatten gal took : 6 ms
[2023-03-22 04:39:31] [INFO ] Flatten gal took : 7 ms
[2023-03-22 04:39:31] [INFO ] Input system was already deterministic with 185 transitions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 204/204 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 205 transition count 184
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 205 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 204 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 204 transition count 183
Applied a total of 42 rules in 10 ms. Remains 204 /225 variables (removed 21) and now considering 183/204 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 204/225 places, 183/204 transitions.
[2023-03-22 04:39:31] [INFO ] Flatten gal took : 6 ms
[2023-03-22 04:39:31] [INFO ] Flatten gal took : 6 ms
[2023-03-22 04:39:31] [INFO ] Input system was already deterministic with 183 transitions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 204/204 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 207 transition count 186
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 207 transition count 186
Applied a total of 36 rules in 6 ms. Remains 207 /225 variables (removed 18) and now considering 186/204 (removed 18) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 207/225 places, 186/204 transitions.
[2023-03-22 04:39:31] [INFO ] Flatten gal took : 6 ms
[2023-03-22 04:39:31] [INFO ] Flatten gal took : 6 ms
[2023-03-22 04:39:31] [INFO ] Input system was already deterministic with 186 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 225/225 places, 204/204 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 44 place count 224 transition count 159
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 46 rules applied. Total rules applied 90 place count 180 transition count 157
Reduce places removed 1 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 5 rules applied. Total rules applied 95 place count 179 transition count 153
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 99 place count 175 transition count 153
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 99 place count 175 transition count 139
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 127 place count 161 transition count 139
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 140 place count 148 transition count 126
Iterating global reduction 4 with 13 rules applied. Total rules applied 153 place count 148 transition count 126
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 153 place count 148 transition count 120
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 165 place count 142 transition count 120
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 239 place count 105 transition count 83
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 240 place count 105 transition count 83
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 242 place count 103 transition count 81
Applied a total of 242 rules in 68 ms. Remains 103 /225 variables (removed 122) and now considering 81/204 (removed 123) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 82 ms. Remains : 103/225 places, 81/204 transitions.
[2023-03-22 04:39:31] [INFO ] Flatten gal took : 3 ms
[2023-03-22 04:39:31] [INFO ] Flatten gal took : 4 ms
[2023-03-22 04:39:31] [INFO ] Input system was already deterministic with 81 transitions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 204/204 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 209 transition count 188
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 209 transition count 188
Applied a total of 32 rules in 6 ms. Remains 209 /225 variables (removed 16) and now considering 188/204 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 209/225 places, 188/204 transitions.
[2023-03-22 04:39:31] [INFO ] Flatten gal took : 7 ms
[2023-03-22 04:39:31] [INFO ] Flatten gal took : 7 ms
[2023-03-22 04:39:31] [INFO ] Input system was already deterministic with 188 transitions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 204/204 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 204 transition count 183
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 204 transition count 183
Applied a total of 42 rules in 7 ms. Remains 204 /225 variables (removed 21) and now considering 183/204 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 204/225 places, 183/204 transitions.
[2023-03-22 04:39:31] [INFO ] Flatten gal took : 6 ms
[2023-03-22 04:39:31] [INFO ] Flatten gal took : 7 ms
[2023-03-22 04:39:31] [INFO ] Input system was already deterministic with 183 transitions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 204/204 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 205 transition count 184
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 205 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 204 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 204 transition count 183
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 203 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 203 transition count 182
Applied a total of 44 rules in 55 ms. Remains 203 /225 variables (removed 22) and now considering 182/204 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 56 ms. Remains : 203/225 places, 182/204 transitions.
[2023-03-22 04:39:31] [INFO ] Flatten gal took : 7 ms
[2023-03-22 04:39:31] [INFO ] Flatten gal took : 8 ms
[2023-03-22 04:39:31] [INFO ] Input system was already deterministic with 182 transitions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 204/204 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 204 transition count 183
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 204 transition count 183
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 203 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 203 transition count 182
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 202 transition count 181
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 202 transition count 181
Applied a total of 46 rules in 12 ms. Remains 202 /225 variables (removed 23) and now considering 181/204 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 202/225 places, 181/204 transitions.
[2023-03-22 04:39:31] [INFO ] Flatten gal took : 6 ms
[2023-03-22 04:39:31] [INFO ] Flatten gal took : 6 ms
[2023-03-22 04:39:31] [INFO ] Input system was already deterministic with 181 transitions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 204/204 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 209 transition count 188
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 209 transition count 188
Applied a total of 32 rules in 6 ms. Remains 209 /225 variables (removed 16) and now considering 188/204 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 209/225 places, 188/204 transitions.
[2023-03-22 04:39:31] [INFO ] Flatten gal took : 6 ms
[2023-03-22 04:39:31] [INFO ] Flatten gal took : 6 ms
[2023-03-22 04:39:31] [INFO ] Input system was already deterministic with 188 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 225/225 places, 204/204 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 52 transitions
Trivial Post-agglo rules discarded 52 transitions
Performed 52 trivial Post agglomeration. Transition count delta: 52
Iterating post reduction 0 with 52 rules applied. Total rules applied 52 place count 224 transition count 151
Reduce places removed 52 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 54 rules applied. Total rules applied 106 place count 172 transition count 149
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 107 place count 171 transition count 149
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 107 place count 171 transition count 133
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 139 place count 155 transition count 133
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 154 place count 140 transition count 118
Iterating global reduction 3 with 15 rules applied. Total rules applied 169 place count 140 transition count 118
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 169 place count 140 transition count 110
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 185 place count 132 transition count 110
Performed 43 Post agglomeration using F-continuation condition.Transition count delta: 43
Deduced a syphon composed of 43 places in 0 ms
Reduce places removed 43 places and 0 transitions.
Iterating global reduction 3 with 86 rules applied. Total rules applied 271 place count 89 transition count 67
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 272 place count 88 transition count 66
Applied a total of 272 rules in 18 ms. Remains 88 /225 variables (removed 137) and now considering 66/204 (removed 138) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 88/225 places, 66/204 transitions.
[2023-03-22 04:39:31] [INFO ] Flatten gal took : 2 ms
[2023-03-22 04:39:31] [INFO ] Flatten gal took : 3 ms
[2023-03-22 04:39:31] [INFO ] Input system was already deterministic with 66 transitions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 204/204 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 206 transition count 185
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 206 transition count 185
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 205 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 205 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 204 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 204 transition count 183
Applied a total of 42 rules in 14 ms. Remains 204 /225 variables (removed 21) and now considering 183/204 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 204/225 places, 183/204 transitions.
[2023-03-22 04:39:31] [INFO ] Flatten gal took : 6 ms
[2023-03-22 04:39:31] [INFO ] Flatten gal took : 6 ms
[2023-03-22 04:39:31] [INFO ] Input system was already deterministic with 183 transitions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 204/204 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 205 transition count 184
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 205 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 204 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 204 transition count 183
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 203 transition count 182
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 203 transition count 182
Applied a total of 44 rules in 11 ms. Remains 203 /225 variables (removed 22) and now considering 182/204 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 203/225 places, 182/204 transitions.
[2023-03-22 04:39:31] [INFO ] Flatten gal took : 6 ms
[2023-03-22 04:39:31] [INFO ] Flatten gal took : 6 ms
[2023-03-22 04:39:31] [INFO ] Input system was already deterministic with 182 transitions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 204/204 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 206 transition count 185
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 206 transition count 185
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 205 transition count 184
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 205 transition count 184
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 204 transition count 183
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 204 transition count 183
Applied a total of 42 rules in 11 ms. Remains 204 /225 variables (removed 21) and now considering 183/204 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 204/225 places, 183/204 transitions.
[2023-03-22 04:39:32] [INFO ] Flatten gal took : 6 ms
[2023-03-22 04:39:32] [INFO ] Flatten gal took : 6 ms
[2023-03-22 04:39:32] [INFO ] Input system was already deterministic with 183 transitions.
[2023-03-22 04:39:32] [INFO ] Flatten gal took : 7 ms
[2023-03-22 04:39:32] [INFO ] Flatten gal took : 7 ms
[2023-03-22 04:39:32] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2023-03-22 04:39:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 225 places, 204 transitions and 516 arcs took 2 ms.
Total runtime 12211 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/560/ctl_0_ --ctl=/tmp/560/ctl_1_ --ctl=/tmp/560/ctl_2_ --ctl=/tmp/560/ctl_3_ --ctl=/tmp/560/ctl_4_ --ctl=/tmp/560/ctl_5_ --ctl=/tmp/560/ctl_6_ --ctl=/tmp/560/ctl_7_ --ctl=/tmp/560/ctl_8_ --ctl=/tmp/560/ctl_9_ --ctl=/tmp/560/ctl_10_ --ctl=/tmp/560/ctl_11_ --ctl=/tmp/560/ctl_12_ --ctl=/tmp/560/ctl_13_ --ctl=/tmp/560/ctl_14_ --ctl=/tmp/560/ctl_15_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393220 kB
MemFree: 285476 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16092828 kB
Could not compute solution for formula : ShieldPPPt-PT-003B-CTLFireability-00
Could not compute solution for formula : ShieldPPPt-PT-003B-CTLFireability-01
Could not compute solution for formula : ShieldPPPt-PT-003B-CTLFireability-02
Could not compute solution for formula : ShieldPPPt-PT-003B-CTLFireability-03
Could not compute solution for formula : ShieldPPPt-PT-003B-CTLFireability-04
Could not compute solution for formula : ShieldPPPt-PT-003B-CTLFireability-05
Could not compute solution for formula : ShieldPPPt-PT-003B-CTLFireability-06
Could not compute solution for formula : ShieldPPPt-PT-003B-CTLFireability-07
Could not compute solution for formula : ShieldPPPt-PT-003B-CTLFireability-08
Could not compute solution for formula : ShieldPPPt-PT-003B-CTLFireability-09
Could not compute solution for formula : ShieldPPPt-PT-003B-CTLFireability-10
Could not compute solution for formula : ShieldPPPt-PT-003B-CTLFireability-11
Could not compute solution for formula : ShieldPPPt-PT-003B-CTLFireability-12
Could not compute solution for formula : ShieldPPPt-PT-003B-CTLFireability-13
Could not compute solution for formula : ShieldPPPt-PT-003B-CTLFireability-14
Could not compute solution for formula : ShieldPPPt-PT-003B-CTLFireability-15
BK_STOP 1679463544133
--------------------
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'
++ sed s/.jar//
++ 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 ShieldPPPt-PT-003B-CTLFireability-00
ctl formula formula --ctl=/tmp/560/ctl_0_
ctl formula name ShieldPPPt-PT-003B-CTLFireability-01
ctl formula formula --ctl=/tmp/560/ctl_1_
ctl formula name ShieldPPPt-PT-003B-CTLFireability-02
ctl formula formula --ctl=/tmp/560/ctl_2_
ctl formula name ShieldPPPt-PT-003B-CTLFireability-03
ctl formula formula --ctl=/tmp/560/ctl_3_
ctl formula name ShieldPPPt-PT-003B-CTLFireability-04
ctl formula formula --ctl=/tmp/560/ctl_4_
ctl formula name ShieldPPPt-PT-003B-CTLFireability-05
ctl formula formula --ctl=/tmp/560/ctl_5_
ctl formula name ShieldPPPt-PT-003B-CTLFireability-06
ctl formula formula --ctl=/tmp/560/ctl_6_
ctl formula name ShieldPPPt-PT-003B-CTLFireability-07
ctl formula formula --ctl=/tmp/560/ctl_7_
ctl formula name ShieldPPPt-PT-003B-CTLFireability-08
ctl formula formula --ctl=/tmp/560/ctl_8_
ctl formula name ShieldPPPt-PT-003B-CTLFireability-09
ctl formula formula --ctl=/tmp/560/ctl_9_
ctl formula name ShieldPPPt-PT-003B-CTLFireability-10
ctl formula formula --ctl=/tmp/560/ctl_10_
ctl formula name ShieldPPPt-PT-003B-CTLFireability-11
ctl formula formula --ctl=/tmp/560/ctl_11_
ctl formula name ShieldPPPt-PT-003B-CTLFireability-12
ctl formula formula --ctl=/tmp/560/ctl_12_
ctl formula name ShieldPPPt-PT-003B-CTLFireability-13
ctl formula formula --ctl=/tmp/560/ctl_13_
ctl formula name ShieldPPPt-PT-003B-CTLFireability-14
ctl formula formula --ctl=/tmp/560/ctl_14_
ctl formula name ShieldPPPt-PT-003B-CTLFireability-15
ctl formula formula --ctl=/tmp/560/ctl_15_
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 225 places, 204 transitions and 516 arcs
pnml2lts-sym: Petri net Petri analyzed
pnml2lts-sym: There are no safe places
pnml2lts-sym: Loading Petri net took 0.000 real 0.010 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: 204->204 groups
pnml2lts-sym: Regrouping took 0.020 real 0.020 user 0.000 sys
pnml2lts-sym: state vector length is 225; there are 204 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: parsing CTL formula
pnml2lts-sym: converting CTL to mu-calculus...
pnml2lts-sym: Exploration took 217441 group checks and 0 next state calls
pnml2lts-sym: reachability took 1.640 real 6.460 user 0.100 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.010 real 0.050 user 0.000 sys
pnml2lts-sym: state space has 2.40012530563605e+20 states, 24941 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
Killing (15) : 566
Killing (9) : 566
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="ShieldPPPt-PT-003B"
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 ShieldPPPt-PT-003B, 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 r393-oct2-167903717200570"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-003B.tgz
mv ShieldPPPt-PT-003B 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 ;