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-167903717200554.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-002B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r393-oct2-167903717200554
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.1K Feb 25 20:48 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 25 20:48 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 20:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 20:48 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.6K Feb 25 16:59 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:59 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:59 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:59 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Feb 25 20:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 167K Feb 25 20:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 25 20:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Feb 25 20:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:59 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:59 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 37K 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-002B-CTLFireability-00
FORMULA_NAME ShieldPPPt-PT-002B-CTLFireability-01
FORMULA_NAME ShieldPPPt-PT-002B-CTLFireability-02
FORMULA_NAME ShieldPPPt-PT-002B-CTLFireability-03
FORMULA_NAME ShieldPPPt-PT-002B-CTLFireability-04
FORMULA_NAME ShieldPPPt-PT-002B-CTLFireability-05
FORMULA_NAME ShieldPPPt-PT-002B-CTLFireability-06
FORMULA_NAME ShieldPPPt-PT-002B-CTLFireability-07
FORMULA_NAME ShieldPPPt-PT-002B-CTLFireability-08
FORMULA_NAME ShieldPPPt-PT-002B-CTLFireability-09
FORMULA_NAME ShieldPPPt-PT-002B-CTLFireability-10
FORMULA_NAME ShieldPPPt-PT-002B-CTLFireability-11
FORMULA_NAME ShieldPPPt-PT-002B-CTLFireability-12
FORMULA_NAME ShieldPPPt-PT-002B-CTLFireability-13
FORMULA_NAME ShieldPPPt-PT-002B-CTLFireability-14
FORMULA_NAME ShieldPPPt-PT-002B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679459738478

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-002B
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-22 04:35:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 04:35:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 04:35:41] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2023-03-22 04:35:41] [INFO ] Transformed 159 places.
[2023-03-22 04:35:41] [INFO ] Transformed 145 transitions.
[2023-03-22 04:35:41] [INFO ] Found NUPN structural information;
[2023-03-22 04:35:41] [INFO ] Parsed PT model containing 159 places and 145 transitions and 362 arcs in 144 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Support contains 110 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 145/145 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 158 transition count 144
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 158 transition count 144
Applied a total of 2 rules in 16 ms. Remains 158 /159 variables (removed 1) and now considering 144/145 (removed 1) transitions.
// Phase 1: matrix 144 rows 158 cols
[2023-03-22 04:35:41] [INFO ] Computed 23 place invariants in 6 ms
[2023-03-22 04:35:42] [INFO ] Implicit Places using invariants in 851 ms returned []
[2023-03-22 04:35:42] [INFO ] Invariant cache hit.
[2023-03-22 04:35:42] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 1162 ms to find 0 implicit places.
[2023-03-22 04:35:42] [INFO ] Invariant cache hit.
[2023-03-22 04:35:42] [INFO ] Dead Transitions using invariants and state equation in 415 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 158/159 places, 144/145 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1598 ms. Remains : 158/159 places, 144/145 transitions.
Support contains 110 out of 158 places after structural reductions.
[2023-03-22 04:35:43] [INFO ] Flatten gal took : 32 ms
[2023-03-22 04:35:43] [INFO ] Flatten gal took : 13 ms
[2023-03-22 04:35:43] [INFO ] Input system was already deterministic with 144 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 387 ms. (steps per millisecond=25 ) properties (out of 99) seen :93
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 5) seen :1
Running SMT prover for 4 properties.
[2023-03-22 04:35:43] [INFO ] Invariant cache hit.
[2023-03-22 04:35:43] [INFO ] [Real]Absence check using 23 positive place invariants in 5 ms returned sat
[2023-03-22 04:35:43] [INFO ] After 160ms SMT Verify possible using state equation in real domain returned unsat :2 sat :2
[2023-03-22 04:35:44] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 9 ms to minimize.
[2023-03-22 04:35:44] [INFO ] Deduced a trap composed of 17 places in 102 ms of which 1 ms to minimize.
[2023-03-22 04:35:44] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
[2023-03-22 04:35:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 297 ms
[2023-03-22 04:35:44] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 1 ms to minimize.
[2023-03-22 04:35:44] [INFO ] Deduced a trap composed of 15 places in 53 ms of which 1 ms to minimize.
[2023-03-22 04:35:44] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2023-03-22 04:35:44] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 0 ms to minimize.
[2023-03-22 04:35:44] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 0 ms to minimize.
[2023-03-22 04:35:44] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 307 ms
[2023-03-22 04:35:44] [INFO ] After 807ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :0 real:2
[2023-03-22 04:35:44] [INFO ] After 892ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:2
[2023-03-22 04:35:44] [INFO ] [Nat]Absence check using 23 positive place invariants in 5 ms returned sat
[2023-03-22 04:35:44] [INFO ] After 110ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2023-03-22 04:35:44] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2023-03-22 04:35:44] [INFO ] Deduced a trap composed of 12 places in 33 ms of which 0 ms to minimize.
[2023-03-22 04:35:44] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 0 ms to minimize.
[2023-03-22 04:35:44] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 145 ms
[2023-03-22 04:35:45] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2023-03-22 04:35:45] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 0 ms to minimize.
[2023-03-22 04:35:45] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2023-03-22 04:35:45] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 207 ms
[2023-03-22 04:35:45] [INFO ] After 481ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-22 04:35:45] [INFO ] After 568ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 7 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 144/144 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 158 transition count 108
Reduce places removed 36 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 38 rules applied. Total rules applied 74 place count 122 transition count 106
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 77 place count 121 transition count 104
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 79 place count 119 transition count 104
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 79 place count 119 transition count 97
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 93 place count 112 transition count 97
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 106 place count 99 transition count 84
Iterating global reduction 4 with 13 rules applied. Total rules applied 119 place count 99 transition count 84
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 119 place count 99 transition count 77
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 133 place count 92 transition count 77
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 4 with 54 rules applied. Total rules applied 187 place count 65 transition count 50
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 197 place count 60 transition count 50
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 202 place count 60 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 203 place count 59 transition count 49
Applied a total of 203 rules in 28 ms. Remains 59 /158 variables (removed 99) and now considering 49/144 (removed 95) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 28 ms. Remains : 59/158 places, 49/144 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 49 rows 59 cols
[2023-03-22 04:35:45] [INFO ] Computed 23 place invariants in 1 ms
[2023-03-22 04:35:45] [INFO ] [Real]Absence check using 23 positive place invariants in 15 ms returned sat
[2023-03-22 04:35:45] [INFO ] After 84ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 04:35:45] [INFO ] [Nat]Absence check using 23 positive place invariants in 4 ms returned sat
[2023-03-22 04:35:45] [INFO ] After 41ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 04:35:45] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-22 04:35:45] [INFO ] After 5ms SMT Verify possible using 5 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 04:35:45] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2023-03-22 04:35:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2023-03-22 04:35:45] [INFO ] After 47ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-22 04:35:45] [INFO ] After 151ms 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 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 49/49 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 56 transition count 46
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 7 place count 56 transition count 46
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 54 transition count 44
Applied a total of 9 rules in 7 ms. Remains 54 /59 variables (removed 5) and now considering 44/49 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 54/59 places, 44/49 transitions.
Incomplete random walk after 10000 steps, including 6 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1612648 steps, run timeout after 3033 ms. (steps per millisecond=531 ) properties seen :{}
Probabilistic random walk after 1612648 steps, saw 744165 distinct states, run finished after 3036 ms. (steps per millisecond=531 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 44 rows 54 cols
[2023-03-22 04:35:48] [INFO ] Computed 23 place invariants in 2 ms
[2023-03-22 04:35:48] [INFO ] [Real]Absence check using 23 positive place invariants in 4 ms returned sat
[2023-03-22 04:35:48] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 04:35:48] [INFO ] [Nat]Absence check using 23 positive place invariants in 4 ms returned sat
[2023-03-22 04:35:48] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 04:35:48] [INFO ] State equation strengthened by 3 read => feed constraints.
[2023-03-22 04:35:48] [INFO ] After 5ms SMT Verify possible using 3 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 04:35:48] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 0 ms to minimize.
[2023-03-22 04:35:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2023-03-22 04:35:48] [INFO ] After 62ms 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-22 04:35:48] [INFO ] After 163ms 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 54 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 44/44 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 44/44 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 54/54 places, 44/44 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 54/54 places, 44/44 transitions.
Applied a total of 0 rules in 2 ms. Remains 54 /54 variables (removed 0) and now considering 44/44 (removed 0) transitions.
[2023-03-22 04:35:48] [INFO ] Invariant cache hit.
[2023-03-22 04:35:49] [INFO ] Implicit Places using invariants in 97 ms returned [47]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 102 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 53/54 places, 44/44 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 53 transition count 42
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 51 transition count 42
Applied a total of 4 rules in 2 ms. Remains 51 /53 variables (removed 2) and now considering 42/44 (removed 2) transitions.
// Phase 1: matrix 42 rows 51 cols
[2023-03-22 04:35:49] [INFO ] Computed 22 place invariants in 1 ms
[2023-03-22 04:35:49] [INFO ] Implicit Places using invariants in 75 ms returned [34, 38]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 77 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 49/54 places, 42/44 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 47 transition count 40
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 47 transition count 40
Applied a total of 4 rules in 2 ms. Remains 47 /49 variables (removed 2) and now considering 40/42 (removed 2) transitions.
// Phase 1: matrix 40 rows 47 cols
[2023-03-22 04:35:49] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-22 04:35:49] [INFO ] Implicit Places using invariants in 73 ms returned []
[2023-03-22 04:35:49] [INFO ] Invariant cache hit.
[2023-03-22 04:35:49] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 04:35:49] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 47/54 places, 40/44 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 423 ms. Remains : 47/54 places, 40/44 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1916146 steps, run timeout after 3001 ms. (steps per millisecond=638 ) properties seen :{}
Probabilistic random walk after 1916146 steps, saw 793155 distinct states, run finished after 3001 ms. (steps per millisecond=638 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-22 04:35:52] [INFO ] Invariant cache hit.
[2023-03-22 04:35:52] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned sat
[2023-03-22 04:35:52] [INFO ] After 30ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-22 04:35:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 04:35:52] [INFO ] After 3ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2023-03-22 04:35:52] [INFO ] After 21ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 6 ms.
[2023-03-22 04:35:52] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 47 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 40/40 transitions.
Applied a total of 0 rules in 3 ms. Remains 47 /47 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 47/47 places, 40/40 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 47/47 places, 40/40 transitions.
Applied a total of 0 rules in 2 ms. Remains 47 /47 variables (removed 0) and now considering 40/40 (removed 0) transitions.
[2023-03-22 04:35:52] [INFO ] Invariant cache hit.
[2023-03-22 04:35:52] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-22 04:35:52] [INFO ] Invariant cache hit.
[2023-03-22 04:35:52] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-22 04:35:52] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 198 ms to find 0 implicit places.
[2023-03-22 04:35:52] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-22 04:35:52] [INFO ] Invariant cache hit.
[2023-03-22 04:35:52] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 273 ms. Remains : 47/47 places, 40/40 transitions.
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 0 with 11 rules applied. Total rules applied 11 place count 47 transition count 40
Applied a total of 11 rules in 5 ms. Remains 47 /47 variables (removed 0) and now considering 40/40 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 40 rows 47 cols
[2023-03-22 04:35:52] [INFO ] Computed 20 place invariants in 1 ms
[2023-03-22 04:35:52] [INFO ] [Real]Absence check using 20 positive place invariants in 4 ms returned sat
[2023-03-22 04:35:52] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 04:35:52] [INFO ] [Nat]Absence check using 20 positive place invariants in 26 ms returned sat
[2023-03-22 04:35:52] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 04:35:52] [INFO ] State equation strengthened by 11 read => feed constraints.
[2023-03-22 04:35:52] [INFO ] After 4ms SMT Verify possible using 11 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-22 04:35:52] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 0 ms to minimize.
[2023-03-22 04:35:52] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2023-03-22 04:35:52] [INFO ] After 35ms 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:35:52] [INFO ] After 119ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2023-03-22 04:35:52] [INFO ] Flatten gal took : 10 ms
[2023-03-22 04:35:53] [INFO ] Flatten gal took : 9 ms
[2023-03-22 04:35:53] [INFO ] Input system was already deterministic with 144 transitions.
Support contains 105 out of 158 places (down from 107) after GAL structural reductions.
Computed a total of 39 stabilizing places and 39 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 144/144 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 143 transition count 129
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 143 transition count 129
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 142 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 142 transition count 128
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 141 transition count 127
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 141 transition count 127
Applied a total of 34 rules in 10 ms. Remains 141 /158 variables (removed 17) and now considering 127/144 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 141/158 places, 127/144 transitions.
[2023-03-22 04:35:53] [INFO ] Flatten gal took : 5 ms
[2023-03-22 04:35:53] [INFO ] Flatten gal took : 5 ms
[2023-03-22 04:35:53] [INFO ] Input system was already deterministic with 127 transitions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 144/144 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 143 transition count 129
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 143 transition count 129
Applied a total of 30 rules in 4 ms. Remains 143 /158 variables (removed 15) and now considering 129/144 (removed 15) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 143/158 places, 129/144 transitions.
[2023-03-22 04:35:53] [INFO ] Flatten gal took : 5 ms
[2023-03-22 04:35:53] [INFO ] Flatten gal took : 6 ms
[2023-03-22 04:35:53] [INFO ] Input system was already deterministic with 129 transitions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 144/144 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 137 transition count 123
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 137 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 136 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 136 transition count 122
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 135 transition count 121
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 135 transition count 121
Applied a total of 46 rules in 9 ms. Remains 135 /158 variables (removed 23) and now considering 121/144 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 135/158 places, 121/144 transitions.
[2023-03-22 04:35:53] [INFO ] Flatten gal took : 5 ms
[2023-03-22 04:35:53] [INFO ] Flatten gal took : 5 ms
[2023-03-22 04:35:53] [INFO ] Input system was already deterministic with 121 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 158/158 places, 144/144 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 157 transition count 110
Reduce places removed 33 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 35 rules applied. Total rules applied 68 place count 124 transition count 108
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 70 place count 123 transition count 107
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 71 place count 122 transition count 107
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 71 place count 122 transition count 97
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 91 place count 112 transition count 97
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 106 place count 97 transition count 82
Iterating global reduction 4 with 15 rules applied. Total rules applied 121 place count 97 transition count 82
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 121 place count 97 transition count 76
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 133 place count 91 transition count 76
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 181 place count 67 transition count 52
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 183 place count 65 transition count 50
Applied a total of 183 rules in 30 ms. Remains 65 /158 variables (removed 93) and now considering 50/144 (removed 94) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 65/158 places, 50/144 transitions.
[2023-03-22 04:35:53] [INFO ] Flatten gal took : 2 ms
[2023-03-22 04:35:53] [INFO ] Flatten gal took : 3 ms
[2023-03-22 04:35:53] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 144/144 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 139 transition count 125
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 139 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 138 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 138 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 137 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 137 transition count 123
Applied a total of 42 rules in 9 ms. Remains 137 /158 variables (removed 21) and now considering 123/144 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 137/158 places, 123/144 transitions.
[2023-03-22 04:35:53] [INFO ] Flatten gal took : 5 ms
[2023-03-22 04:35:53] [INFO ] Flatten gal took : 10 ms
[2023-03-22 04:35:53] [INFO ] Input system was already deterministic with 123 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 158/158 places, 144/144 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 157 transition count 107
Reduce places removed 36 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 38 rules applied. Total rules applied 74 place count 121 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 75 place count 120 transition count 105
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 75 place count 120 transition count 96
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 93 place count 111 transition count 96
Discarding 15 places :
Symmetric choice reduction at 3 with 15 rule applications. Total rules 108 place count 96 transition count 81
Iterating global reduction 3 with 15 rules applied. Total rules applied 123 place count 96 transition count 81
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 123 place count 96 transition count 74
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 137 place count 89 transition count 74
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 191 place count 62 transition count 47
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 193 place count 60 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 194 place count 59 transition count 45
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 194 place count 59 transition count 43
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 198 place count 57 transition count 43
Applied a total of 198 rules in 22 ms. Remains 57 /158 variables (removed 101) and now considering 43/144 (removed 101) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 57/158 places, 43/144 transitions.
[2023-03-22 04:35:53] [INFO ] Flatten gal took : 5 ms
[2023-03-22 04:35:53] [INFO ] Flatten gal took : 3 ms
[2023-03-22 04:35:53] [INFO ] Input system was already deterministic with 43 transitions.
Finished random walk after 294 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=147 )
FORMULA ShieldPPPt-PT-002B-CTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 144/144 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 140 transition count 126
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 140 transition count 126
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 139 transition count 125
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 139 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 138 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 138 transition count 124
Applied a total of 40 rules in 8 ms. Remains 138 /158 variables (removed 20) and now considering 124/144 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 138/158 places, 124/144 transitions.
[2023-03-22 04:35:53] [INFO ] Flatten gal took : 4 ms
[2023-03-22 04:35:53] [INFO ] Flatten gal took : 5 ms
[2023-03-22 04:35:53] [INFO ] Input system was already deterministic with 124 transitions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 144/144 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 138 transition count 124
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 138 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 137 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 137 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 136 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 136 transition count 122
Applied a total of 44 rules in 7 ms. Remains 136 /158 variables (removed 22) and now considering 122/144 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 136/158 places, 122/144 transitions.
[2023-03-22 04:35:53] [INFO ] Flatten gal took : 4 ms
[2023-03-22 04:35:53] [INFO ] Flatten gal took : 4 ms
[2023-03-22 04:35:53] [INFO ] Input system was already deterministic with 122 transitions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 144/144 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 144 transition count 130
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 144 transition count 130
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 143 transition count 129
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 143 transition count 129
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 142 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 142 transition count 128
Applied a total of 32 rules in 6 ms. Remains 142 /158 variables (removed 16) and now considering 128/144 (removed 16) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 142/158 places, 128/144 transitions.
[2023-03-22 04:35:53] [INFO ] Flatten gal took : 4 ms
[2023-03-22 04:35:53] [INFO ] Flatten gal took : 4 ms
[2023-03-22 04:35:53] [INFO ] Input system was already deterministic with 128 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 158/158 places, 144/144 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 38 place count 157 transition count 105
Reduce places removed 38 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 40 rules applied. Total rules applied 78 place count 119 transition count 103
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 79 place count 118 transition count 103
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 79 place count 118 transition count 95
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 95 place count 110 transition count 95
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 109 place count 96 transition count 81
Iterating global reduction 3 with 14 rules applied. Total rules applied 123 place count 96 transition count 81
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 123 place count 96 transition count 74
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 137 place count 89 transition count 74
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 195 place count 60 transition count 45
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 196 place count 60 transition count 45
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 198 place count 58 transition count 43
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 199 place count 57 transition count 43
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 199 place count 57 transition count 41
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 203 place count 55 transition count 41
Applied a total of 203 rules in 14 ms. Remains 55 /158 variables (removed 103) and now considering 41/144 (removed 103) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 55/158 places, 41/144 transitions.
[2023-03-22 04:35:53] [INFO ] Flatten gal took : 2 ms
[2023-03-22 04:35:53] [INFO ] Flatten gal took : 2 ms
[2023-03-22 04:35:53] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 144/144 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 139 transition count 125
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 139 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 138 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 138 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 137 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 137 transition count 123
Applied a total of 42 rules in 8 ms. Remains 137 /158 variables (removed 21) and now considering 123/144 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 137/158 places, 123/144 transitions.
[2023-03-22 04:35:53] [INFO ] Flatten gal took : 4 ms
[2023-03-22 04:35:53] [INFO ] Flatten gal took : 5 ms
[2023-03-22 04:35:53] [INFO ] Input system was already deterministic with 123 transitions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 144/144 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 141 transition count 127
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 141 transition count 127
Applied a total of 34 rules in 4 ms. Remains 141 /158 variables (removed 17) and now considering 127/144 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 141/158 places, 127/144 transitions.
[2023-03-22 04:35:53] [INFO ] Flatten gal took : 5 ms
[2023-03-22 04:35:53] [INFO ] Flatten gal took : 5 ms
[2023-03-22 04:35:53] [INFO ] Input system was already deterministic with 127 transitions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 144/144 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 139 transition count 125
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 139 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 138 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 138 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 137 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 137 transition count 123
Applied a total of 42 rules in 18 ms. Remains 137 /158 variables (removed 21) and now considering 123/144 (removed 21) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 137/158 places, 123/144 transitions.
[2023-03-22 04:35:53] [INFO ] Flatten gal took : 5 ms
[2023-03-22 04:35:53] [INFO ] Flatten gal took : 4 ms
[2023-03-22 04:35:53] [INFO ] Input system was already deterministic with 123 transitions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 144/144 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 139 transition count 125
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 139 transition count 125
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 138 transition count 124
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 138 transition count 124
Applied a total of 40 rules in 7 ms. Remains 138 /158 variables (removed 20) and now considering 124/144 (removed 20) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 138/158 places, 124/144 transitions.
[2023-03-22 04:35:53] [INFO ] Flatten gal took : 5 ms
[2023-03-22 04:35:53] [INFO ] Flatten gal took : 4 ms
[2023-03-22 04:35:53] [INFO ] Input system was already deterministic with 124 transitions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 144/144 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 139 transition count 125
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 139 transition count 125
Applied a total of 38 rules in 5 ms. Remains 139 /158 variables (removed 19) and now considering 125/144 (removed 19) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 139/158 places, 125/144 transitions.
[2023-03-22 04:35:53] [INFO ] Flatten gal took : 5 ms
[2023-03-22 04:35:53] [INFO ] Flatten gal took : 4 ms
[2023-03-22 04:35:53] [INFO ] Input system was already deterministic with 125 transitions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 144/144 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 138 transition count 124
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 138 transition count 124
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 137 transition count 123
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 137 transition count 123
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 136 transition count 122
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 136 transition count 122
Applied a total of 44 rules in 9 ms. Remains 136 /158 variables (removed 22) and now considering 122/144 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 136/158 places, 122/144 transitions.
[2023-03-22 04:35:53] [INFO ] Flatten gal took : 3 ms
[2023-03-22 04:35:53] [INFO ] Flatten gal took : 4 ms
[2023-03-22 04:35:53] [INFO ] Input system was already deterministic with 122 transitions.
[2023-03-22 04:35:53] [INFO ] Flatten gal took : 5 ms
[2023-03-22 04:35:53] [INFO ] Flatten gal took : 5 ms
[2023-03-22 04:35:53] [INFO ] Export to MCC of 15 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-22 04:35:53] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 158 places, 144 transitions and 360 arcs took 1 ms.
Total runtime 12694 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/594/ctl_0_ --ctl=/tmp/594/ctl_1_ --ctl=/tmp/594/ctl_2_ --ctl=/tmp/594/ctl_3_ --ctl=/tmp/594/ctl_4_ --ctl=/tmp/594/ctl_5_ --ctl=/tmp/594/ctl_6_ --ctl=/tmp/594/ctl_7_ --ctl=/tmp/594/ctl_8_ --ctl=/tmp/594/ctl_9_ --ctl=/tmp/594/ctl_10_ --ctl=/tmp/594/ctl_11_ --ctl=/tmp/594/ctl_12_ --ctl=/tmp/594/ctl_13_ --ctl=/tmp/594/ctl_14_ --mu-par --mu-opt
TIME LIMIT: Killed by timeout after 3570 seconds
MemTotal: 16393220 kB
MemFree: 282640 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16094776 kB
FORMULA ShieldPPPt-PT-002B-CTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : ShieldPPPt-PT-002B-CTLFireability-01
FORMULA ShieldPPPt-PT-002B-CTLFireability-02 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldPPPt-PT-002B-CTLFireability-03 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldPPPt-PT-002B-CTLFireability-04 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldPPPt-PT-002B-CTLFireability-06 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldPPPt-PT-002B-CTLFireability-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : ShieldPPPt-PT-002B-CTLFireability-08
Could not compute solution for formula : ShieldPPPt-PT-002B-CTLFireability-09
Could not compute solution for formula : ShieldPPPt-PT-002B-CTLFireability-10
Could not compute solution for formula : ShieldPPPt-PT-002B-CTLFireability-11
FORMULA ShieldPPPt-PT-002B-CTLFireability-12 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldPPPt-PT-002B-CTLFireability-13 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldPPPt-PT-002B-CTLFireability-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN
FORMULA ShieldPPPt-PT-002B-CTLFireability-15 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING USE_NUPN

BK_STOP 1679463325384

--------------------
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 ShieldPPPt-PT-002B-CTLFireability-00
ctl formula formula --ctl=/tmp/594/ctl_0_
ctl formula name ShieldPPPt-PT-002B-CTLFireability-01
ctl formula formula --ctl=/tmp/594/ctl_1_
ctl formula name ShieldPPPt-PT-002B-CTLFireability-02
ctl formula formula --ctl=/tmp/594/ctl_2_
ctl formula name ShieldPPPt-PT-002B-CTLFireability-03
ctl formula formula --ctl=/tmp/594/ctl_3_
ctl formula name ShieldPPPt-PT-002B-CTLFireability-04
ctl formula formula --ctl=/tmp/594/ctl_4_
ctl formula name ShieldPPPt-PT-002B-CTLFireability-06
ctl formula formula --ctl=/tmp/594/ctl_5_
ctl formula name ShieldPPPt-PT-002B-CTLFireability-07
ctl formula formula --ctl=/tmp/594/ctl_6_
ctl formula name ShieldPPPt-PT-002B-CTLFireability-08
ctl formula formula --ctl=/tmp/594/ctl_7_
ctl formula name ShieldPPPt-PT-002B-CTLFireability-09
ctl formula formula --ctl=/tmp/594/ctl_8_
ctl formula name ShieldPPPt-PT-002B-CTLFireability-10
ctl formula formula --ctl=/tmp/594/ctl_9_
ctl formula name ShieldPPPt-PT-002B-CTLFireability-11
ctl formula formula --ctl=/tmp/594/ctl_10_
ctl formula name ShieldPPPt-PT-002B-CTLFireability-12
ctl formula formula --ctl=/tmp/594/ctl_11_
ctl formula name ShieldPPPt-PT-002B-CTLFireability-13
ctl formula formula --ctl=/tmp/594/ctl_12_
ctl formula name ShieldPPPt-PT-002B-CTLFireability-14
ctl formula formula --ctl=/tmp/594/ctl_13_
ctl formula name ShieldPPPt-PT-002B-CTLFireability-15
ctl formula formula --ctl=/tmp/594/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 158 places, 144 transitions and 360 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: 144->144 groups
pnml2lts-sym: Regrouping took 0.010 real 0.010 user 0.010 sys
pnml2lts-sym: state vector length is 158; there are 144 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 83377 group checks and 0 next state calls
pnml2lts-sym: reachability took 0.470 real 1.850 user 0.010 sys
pnml2lts-sym: counting visited states...
pnml2lts-sym: counting took 0.010 real 0.020 user 0.000 sys
pnml2lts-sym: state space has 100165007865845 states, 13742 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: Formula /tmp/594/ctl_14_ does not hold for the initial state
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: Formula /tmp/594/ctl_2_ does not hold for the initial state
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: Formula /tmp/594/ctl_0_ does not hold for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/594/ctl_13_ holds for the initial state
pnml2lts-sym: vset_sylvan: starting garbage collection
pnml2lts-sym: vset_sylvan: garbage collection done
pnml2lts-sym: Formula /tmp/594/ctl_12_ does not hold for the initial state
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: Formula /tmp/594/ctl_11_ holds for the initial state
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: Formula /tmp/594/ctl_3_ does not hold for the initial state
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: Formula /tmp/594/ctl_4_ does not hold for the initial state
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: Formula /tmp/594/ctl_6_ holds for the initial state
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: Formula /tmp/594/ctl_5_ holds for the initial state
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) : 600
Killing (9) : 600

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

tar xzf /home/mcc/BenchKit/INPUTS/ShieldPPPt-PT-002B.tgz
mv ShieldPPPt-PT-002B 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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;