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.r394-oct2-167903717600218.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 marciexred
Input is ShieldIIPt-PT-003B, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r394-oct2-167903717600218
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 5.8K Feb 25 16:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Feb 25 16:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 25 16:59 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 16:59 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:56 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 16:56 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 25 17:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 118K Feb 25 17:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 25 17:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 25 17:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:56 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 50K 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 ShieldIIPt-PT-003B-CTLFireability-00
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-01
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-02
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-03
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-04
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-05
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-06
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-07
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-08
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-09
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-10
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-11
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-12
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-13
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-14
FORMULA_NAME ShieldIIPt-PT-003B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679498101458

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=marciexred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldIIPt-PT-003B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 15:15:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 15:15:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 15:15:04] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2023-03-22 15:15:04] [INFO ] Transformed 213 places.
[2023-03-22 15:15:04] [INFO ] Transformed 198 transitions.
[2023-03-22 15:15:04] [INFO ] Found NUPN structural information;
[2023-03-22 15:15:04] [INFO ] Parsed PT model containing 213 places and 198 transitions and 492 arcs in 258 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 14 ms.
Support contains 123 out of 213 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 213/213 places, 198/198 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 205 transition count 190
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 205 transition count 190
Applied a total of 16 rules in 34 ms. Remains 205 /213 variables (removed 8) and now considering 190/198 (removed 8) transitions.
// Phase 1: matrix 190 rows 205 cols
[2023-03-22 15:15:04] [INFO ] Computed 28 place invariants in 12 ms
[2023-03-22 15:15:05] [INFO ] Implicit Places using invariants in 629 ms returned []
[2023-03-22 15:15:05] [INFO ] Invariant cache hit.
[2023-03-22 15:15:06] [INFO ] Implicit Places using invariants and state equation in 508 ms returned []
Implicit Place search using SMT with State Equation took 1193 ms to find 0 implicit places.
[2023-03-22 15:15:06] [INFO ] Invariant cache hit.
[2023-03-22 15:15:06] [INFO ] Dead Transitions using invariants and state equation in 224 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 205/213 places, 190/198 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1453 ms. Remains : 205/213 places, 190/198 transitions.
Support contains 123 out of 205 places after structural reductions.
[2023-03-22 15:15:06] [INFO ] Flatten gal took : 85 ms
[2023-03-22 15:15:06] [INFO ] Flatten gal took : 23 ms
[2023-03-22 15:15:06] [INFO ] Input system was already deterministic with 190 transitions.
Support contains 122 out of 205 places (down from 123) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 514 ms. (steps per millisecond=19 ) properties (out of 100) seen :91
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-22 15:15:07] [INFO ] Invariant cache hit.
[2023-03-22 15:15:08] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-22 15:15:08] [INFO ] [Nat]Absence check using 28 positive place invariants in 7 ms returned sat
[2023-03-22 15:15:08] [INFO ] After 150ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :5
[2023-03-22 15:15:08] [INFO ] Deduced a trap composed of 17 places in 92 ms of which 4 ms to minimize.
[2023-03-22 15:15:08] [INFO ] Deduced a trap composed of 19 places in 64 ms of which 0 ms to minimize.
[2023-03-22 15:15:08] [INFO ] Deduced a trap composed of 18 places in 101 ms of which 0 ms to minimize.
[2023-03-22 15:15:08] [INFO ] Deduced a trap composed of 19 places in 344 ms of which 3 ms to minimize.
[2023-03-22 15:15:09] [INFO ] Deduced a trap composed of 13 places in 242 ms of which 0 ms to minimize.
[2023-03-22 15:15:09] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 1 ms to minimize.
[2023-03-22 15:15:09] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 0 ms to minimize.
[2023-03-22 15:15:09] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 13 ms to minimize.
[2023-03-22 15:15:09] [INFO ] Deduced a trap composed of 20 places in 109 ms of which 17 ms to minimize.
[2023-03-22 15:15:09] [INFO ] Deduced a trap composed of 20 places in 145 ms of which 1 ms to minimize.
[2023-03-22 15:15:09] [INFO ] Deduced a trap composed of 21 places in 87 ms of which 1 ms to minimize.
[2023-03-22 15:15:09] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 1587 ms
[2023-03-22 15:15:09] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 1 ms to minimize.
[2023-03-22 15:15:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 106 ms
[2023-03-22 15:15:10] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 0 ms to minimize.
[2023-03-22 15:15:10] [INFO ] Deduced a trap composed of 24 places in 59 ms of which 1 ms to minimize.
[2023-03-22 15:15:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 182 ms
[2023-03-22 15:15:10] [INFO ] Deduced a trap composed of 18 places in 60 ms of which 1 ms to minimize.
[2023-03-22 15:15:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 109 ms
[2023-03-22 15:15:10] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 0 ms to minimize.
[2023-03-22 15:15:10] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 42 ms
[2023-03-22 15:15:10] [INFO ] After 2243ms SMT Verify possible using trap constraints in natural domain returned unsat :3 sat :4
Attempting to minimize the solution found.
Minimization took 78 ms.
[2023-03-22 15:15:10] [INFO ] After 2414ms SMT Verify possible using all constraints in natural domain returned unsat :3 sat :4
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 14 out of 205 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 205/205 places, 190/190 transitions.
Drop transitions removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 34 place count 205 transition count 156
Reduce places removed 34 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 37 rules applied. Total rules applied 71 place count 171 transition count 153
Reduce places removed 2 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 2 with 6 rules applied. Total rules applied 77 place count 169 transition count 149
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 81 place count 165 transition count 149
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 81 place count 165 transition count 136
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 107 place count 152 transition count 136
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 123 place count 136 transition count 120
Iterating global reduction 4 with 16 rules applied. Total rules applied 139 place count 136 transition count 120
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 139 place count 136 transition count 112
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 155 place count 128 transition count 112
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 4 with 86 rules applied. Total rules applied 241 place count 85 transition count 69
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -4
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 255 place count 78 transition count 73
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 256 place count 78 transition count 72
Partial Free-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 5 with 2 rules applied. Total rules applied 258 place count 78 transition count 72
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 259 place count 77 transition count 71
Applied a total of 259 rules in 71 ms. Remains 77 /205 variables (removed 128) and now considering 71/190 (removed 119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 77/205 places, 71/190 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 404155 steps, run timeout after 3001 ms. (steps per millisecond=134 ) properties seen :{}
Probabilistic random walk after 404155 steps, saw 242906 distinct states, run finished after 3005 ms. (steps per millisecond=134 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 71 rows 77 cols
[2023-03-22 15:15:13] [INFO ] Computed 28 place invariants in 1 ms
[2023-03-22 15:15:13] [INFO ] After 30ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-22 15:15:13] [INFO ] [Nat]Absence check using 28 positive place invariants in 5 ms returned sat
[2023-03-22 15:15:13] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-22 15:15:13] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-22 15:15:13] [INFO ] After 18ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-22 15:15:13] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
[2023-03-22 15:15:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2023-03-22 15:15:13] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 1 ms to minimize.
[2023-03-22 15:15:13] [INFO ] Deduced a trap composed of 9 places in 26 ms of which 0 ms to minimize.
[2023-03-22 15:15:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 61 ms
[2023-03-22 15:15:14] [INFO ] Deduced a trap composed of 10 places in 32 ms of which 1 ms to minimize.
[2023-03-22 15:15:14] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 1 ms to minimize.
[2023-03-22 15:15:14] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2023-03-22 15:15:14] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 103 ms
[2023-03-22 15:15:14] [INFO ] After 248ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-03-22 15:15:14] [INFO ] After 371ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 9 out of 77 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 77/77 places, 71/71 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 77 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 75 transition count 69
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 75 transition count 68
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 74 transition count 68
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 2 with 6 rules applied. Total rules applied 12 place count 71 transition count 65
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 70 transition count 66
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 15 place count 69 transition count 65
Applied a total of 15 rules in 9 ms. Remains 69 /77 variables (removed 8) and now considering 65/71 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 69/77 places, 65/71 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 167 ms. (steps per millisecond=59 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 279907 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :{}
Probabilistic random walk after 279907 steps, saw 160233 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 65 rows 69 cols
[2023-03-22 15:15:17] [INFO ] Computed 28 place invariants in 1 ms
[2023-03-22 15:15:17] [INFO ] After 28ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 15:15:17] [INFO ] [Nat]Absence check using 28 positive place invariants in 4 ms returned sat
[2023-03-22 15:15:17] [INFO ] After 58ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 15:15:17] [INFO ] State equation strengthened by 8 read => feed constraints.
[2023-03-22 15:15:17] [INFO ] After 61ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-22 15:15:17] [INFO ] Deduced a trap composed of 7 places in 103 ms of which 2 ms to minimize.
[2023-03-22 15:15:17] [INFO ] Deduced a trap composed of 8 places in 37 ms of which 0 ms to minimize.
[2023-03-22 15:15:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 153 ms
[2023-03-22 15:15:17] [INFO ] After 265ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-03-22 15:15:17] [INFO ] After 408ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 3 ms.
Support contains 9 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 65/65 transitions.
Applied a total of 0 rules in 2 ms. Remains 69 /69 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 69/69 places, 65/65 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 65/65 transitions.
Applied a total of 0 rules in 2 ms. Remains 69 /69 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2023-03-22 15:15:17] [INFO ] Invariant cache hit.
[2023-03-22 15:15:17] [INFO ] Implicit Places using invariants in 121 ms returned [60]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 126 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 68/69 places, 65/65 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 68 transition count 64
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 67 transition count 64
Applied a total of 2 rules in 5 ms. Remains 67 /68 variables (removed 1) and now considering 64/65 (removed 1) transitions.
// Phase 1: matrix 64 rows 67 cols
[2023-03-22 15:15:17] [INFO ] Computed 27 place invariants in 1 ms
[2023-03-22 15:15:18] [INFO ] Implicit Places using invariants in 125 ms returned [53]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 126 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 66/69 places, 64/65 transitions.
Applied a total of 0 rules in 17 ms. Remains 66 /66 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 276 ms. Remains : 66/69 places, 64/65 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 99 ms. (steps per millisecond=101 ) properties (out of 3) 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 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 291659 steps, run timeout after 3001 ms. (steps per millisecond=97 ) properties seen :{}
Probabilistic random walk after 291659 steps, saw 172588 distinct states, run finished after 3003 ms. (steps per millisecond=97 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 64 rows 66 cols
[2023-03-22 15:15:21] [INFO ] Computed 26 place invariants in 1 ms
[2023-03-22 15:15:21] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 15:15:21] [INFO ] [Nat]Absence check using 26 positive place invariants in 7 ms returned sat
[2023-03-22 15:15:21] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 15:15:21] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-22 15:15:21] [INFO ] After 13ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-22 15:15:21] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2023-03-22 15:15:21] [INFO ] Deduced a trap composed of 7 places in 23 ms of which 0 ms to minimize.
[2023-03-22 15:15:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 66 ms
[2023-03-22 15:15:21] [INFO ] After 135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-22 15:15:21] [INFO ] After 222ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 3 ms.
Support contains 9 out of 66 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 64/64 transitions.
Applied a total of 0 rules in 2 ms. Remains 66 /66 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 66/66 places, 64/64 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 66/66 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2023-03-22 15:15:21] [INFO ] Invariant cache hit.
[2023-03-22 15:15:21] [INFO ] Implicit Places using invariants in 76 ms returned []
[2023-03-22 15:15:21] [INFO ] Invariant cache hit.
[2023-03-22 15:15:21] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-22 15:15:21] [INFO ] Implicit Places using invariants and state equation in 159 ms returned []
Implicit Place search using SMT with State Equation took 250 ms to find 0 implicit places.
[2023-03-22 15:15:21] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-22 15:15:21] [INFO ] Invariant cache hit.
[2023-03-22 15:15:21] [INFO ] Dead Transitions using invariants and state equation in 82 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 356 ms. Remains : 66/66 places, 64/64 transitions.
Graph (complete) has 165 edges and 66 vertex of which 65 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 8 times.
Drop transitions removed 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 9 place count 65 transition count 64
Applied a total of 9 rules in 6 ms. Remains 65 /66 variables (removed 1) and now considering 64/64 (removed 0) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 64 rows 65 cols
[2023-03-22 15:15:21] [INFO ] Computed 25 place invariants in 5 ms
[2023-03-22 15:15:22] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-22 15:15:22] [INFO ] [Nat]Absence check using 25 positive place invariants in 41 ms returned sat
[2023-03-22 15:15:22] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-22 15:15:22] [INFO ] State equation strengthened by 7 read => feed constraints.
[2023-03-22 15:15:22] [INFO ] After 37ms SMT Verify possible using 7 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2023-03-22 15:15:22] [INFO ] Deduced a trap composed of 7 places in 66 ms of which 0 ms to minimize.
[2023-03-22 15:15:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2023-03-22 15:15:22] [INFO ] After 134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-22 15:15:22] [INFO ] After 271ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Successfully simplified 4 atomic propositions for a total of 16 simplifications.
FORMULA ShieldIIPt-PT-003B-CTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 15:15:22] [INFO ] Flatten gal took : 9 ms
[2023-03-22 15:15:22] [INFO ] Flatten gal took : 21 ms
[2023-03-22 15:15:22] [INFO ] Input system was already deterministic with 190 transitions.
Computed a total of 55 stabilizing places and 55 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 190/190 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 183 transition count 168
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 183 transition count 168
Applied a total of 44 rules in 6 ms. Remains 183 /205 variables (removed 22) and now considering 168/190 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 183/205 places, 168/190 transitions.
[2023-03-22 15:15:22] [INFO ] Flatten gal took : 25 ms
[2023-03-22 15:15:22] [INFO ] Flatten gal took : 7 ms
[2023-03-22 15:15:22] [INFO ] Input system was already deterministic with 168 transitions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 190/190 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 180 transition count 165
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 180 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 179 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 179 transition count 164
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 178 transition count 163
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 178 transition count 163
Applied a total of 54 rules in 28 ms. Remains 178 /205 variables (removed 27) and now considering 163/190 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 178/205 places, 163/190 transitions.
[2023-03-22 15:15:22] [INFO ] Flatten gal took : 6 ms
[2023-03-22 15:15:22] [INFO ] Flatten gal took : 6 ms
[2023-03-22 15:15:22] [INFO ] Input system was already deterministic with 163 transitions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 190/190 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 182 transition count 167
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 182 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 181 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 181 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 180 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 180 transition count 165
Applied a total of 50 rules in 11 ms. Remains 180 /205 variables (removed 25) and now considering 165/190 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 180/205 places, 165/190 transitions.
[2023-03-22 15:15:22] [INFO ] Flatten gal took : 6 ms
[2023-03-22 15:15:22] [INFO ] Flatten gal took : 6 ms
[2023-03-22 15:15:22] [INFO ] Input system was already deterministic with 165 transitions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 190/190 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 181 transition count 166
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 181 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 180 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 180 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 179 transition count 164
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 179 transition count 164
Applied a total of 52 rules in 10 ms. Remains 179 /205 variables (removed 26) and now considering 164/190 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 179/205 places, 164/190 transitions.
[2023-03-22 15:15:22] [INFO ] Flatten gal took : 6 ms
[2023-03-22 15:15:22] [INFO ] Flatten gal took : 6 ms
[2023-03-22 15:15:22] [INFO ] Input system was already deterministic with 164 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 205/205 places, 190/190 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 204 transition count 151
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 41 rules applied. Total rules applied 79 place count 166 transition count 148
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 82 place count 164 transition count 147
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 83 place count 163 transition count 147
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 83 place count 163 transition count 134
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 109 place count 150 transition count 134
Discarding 18 places :
Symmetric choice reduction at 4 with 18 rule applications. Total rules 127 place count 132 transition count 116
Iterating global reduction 4 with 18 rules applied. Total rules applied 145 place count 132 transition count 116
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 11 Pre rules applied. Total rules applied 145 place count 132 transition count 105
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 4 with 22 rules applied. Total rules applied 167 place count 121 transition count 105
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 243 place count 83 transition count 67
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 245 place count 81 transition count 65
Applied a total of 245 rules in 22 ms. Remains 81 /205 variables (removed 124) and now considering 65/190 (removed 125) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 81/205 places, 65/190 transitions.
[2023-03-22 15:15:22] [INFO ] Flatten gal took : 3 ms
[2023-03-22 15:15:22] [INFO ] Flatten gal took : 3 ms
[2023-03-22 15:15:22] [INFO ] Input system was already deterministic with 65 transitions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 190/190 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 182 transition count 167
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 182 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 181 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 181 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 180 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 180 transition count 165
Applied a total of 50 rules in 10 ms. Remains 180 /205 variables (removed 25) and now considering 165/190 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 180/205 places, 165/190 transitions.
[2023-03-22 15:15:22] [INFO ] Flatten gal took : 6 ms
[2023-03-22 15:15:22] [INFO ] Flatten gal took : 6 ms
[2023-03-22 15:15:22] [INFO ] Input system was already deterministic with 165 transitions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 190/190 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 183 transition count 168
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 183 transition count 168
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 45 place count 182 transition count 167
Iterating global reduction 0 with 1 rules applied. Total rules applied 46 place count 182 transition count 167
Applied a total of 46 rules in 8 ms. Remains 182 /205 variables (removed 23) and now considering 167/190 (removed 23) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 182/205 places, 167/190 transitions.
[2023-03-22 15:15:22] [INFO ] Flatten gal took : 5 ms
[2023-03-22 15:15:22] [INFO ] Flatten gal took : 5 ms
[2023-03-22 15:15:22] [INFO ] Input system was already deterministic with 167 transitions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 190/190 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 182 transition count 167
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 182 transition count 167
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 181 transition count 166
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 181 transition count 166
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 180 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 180 transition count 165
Applied a total of 50 rules in 18 ms. Remains 180 /205 variables (removed 25) and now considering 165/190 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 180/205 places, 165/190 transitions.
[2023-03-22 15:15:22] [INFO ] Flatten gal took : 8 ms
[2023-03-22 15:15:22] [INFO ] Flatten gal took : 7 ms
[2023-03-22 15:15:22] [INFO ] Input system was already deterministic with 165 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 205/205 places, 190/190 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 204 transition count 147
Reduce places removed 42 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 45 rules applied. Total rules applied 87 place count 162 transition count 144
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 89 place count 160 transition count 144
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 14 Pre rules applied. Total rules applied 89 place count 160 transition count 130
Deduced a syphon composed of 14 places in 1 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 3 with 28 rules applied. Total rules applied 117 place count 146 transition count 130
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 135 place count 128 transition count 112
Iterating global reduction 3 with 18 rules applied. Total rules applied 153 place count 128 transition count 112
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 153 place count 128 transition count 101
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 175 place count 117 transition count 101
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 3 with 92 rules applied. Total rules applied 267 place count 71 transition count 55
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 269 place count 69 transition count 53
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 271 place count 67 transition count 53
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 271 place count 67 transition count 52
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 273 place count 66 transition count 52
Applied a total of 273 rules in 26 ms. Remains 66 /205 variables (removed 139) and now considering 52/190 (removed 138) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 66/205 places, 52/190 transitions.
[2023-03-22 15:15:22] [INFO ] Flatten gal took : 3 ms
[2023-03-22 15:15:22] [INFO ] Flatten gal took : 3 ms
[2023-03-22 15:15:22] [INFO ] Input system was already deterministic with 52 transitions.
Finished random walk after 22 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=11 )
FORMULA ShieldIIPt-PT-003B-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 205/205 places, 190/190 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 204 transition count 145
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 47 rules applied. Total rules applied 91 place count 160 transition count 142
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 93 place count 158 transition count 142
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 93 place count 158 transition count 129
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 119 place count 145 transition count 129
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 135 place count 129 transition count 113
Iterating global reduction 3 with 16 rules applied. Total rules applied 151 place count 129 transition count 113
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 151 place count 129 transition count 102
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 173 place count 118 transition count 102
Performed 47 Post agglomeration using F-continuation condition.Transition count delta: 47
Deduced a syphon composed of 47 places in 0 ms
Reduce places removed 47 places and 0 transitions.
Iterating global reduction 3 with 94 rules applied. Total rules applied 267 place count 71 transition count 55
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 269 place count 69 transition count 53
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 271 place count 67 transition count 53
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 271 place count 67 transition count 52
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 273 place count 66 transition count 52
Applied a total of 273 rules in 20 ms. Remains 66 /205 variables (removed 139) and now considering 52/190 (removed 138) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 20 ms. Remains : 66/205 places, 52/190 transitions.
[2023-03-22 15:15:22] [INFO ] Flatten gal took : 3 ms
[2023-03-22 15:15:22] [INFO ] Flatten gal took : 3 ms
[2023-03-22 15:15:22] [INFO ] Input system was already deterministic with 52 transitions.
Finished random walk after 135 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=67 )
FORMULA ShieldIIPt-PT-003B-CTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in SI_CTL mode, iteration 0 : 205/205 places, 190/190 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 0 with 39 rules applied. Total rules applied 39 place count 204 transition count 150
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 42 rules applied. Total rules applied 81 place count 165 transition count 147
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 85 place count 163 transition count 145
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 87 place count 161 transition count 145
Performed 14 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 14 Pre rules applied. Total rules applied 87 place count 161 transition count 131
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 115 place count 147 transition count 131
Discarding 16 places :
Symmetric choice reduction at 4 with 16 rule applications. Total rules 131 place count 131 transition count 115
Iterating global reduction 4 with 16 rules applied. Total rules applied 147 place count 131 transition count 115
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 9 Pre rules applied. Total rules applied 147 place count 131 transition count 106
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 165 place count 122 transition count 106
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 0 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 249 place count 80 transition count 64
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 250 place count 80 transition count 64
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 252 place count 78 transition count 62
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 254 place count 76 transition count 62
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 254 place count 76 transition count 61
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 256 place count 75 transition count 61
Applied a total of 256 rules in 21 ms. Remains 75 /205 variables (removed 130) and now considering 61/190 (removed 129) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 75/205 places, 61/190 transitions.
[2023-03-22 15:15:22] [INFO ] Flatten gal took : 3 ms
[2023-03-22 15:15:22] [INFO ] Flatten gal took : 3 ms
[2023-03-22 15:15:22] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 190/190 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 183 transition count 168
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 183 transition count 168
Applied a total of 44 rules in 5 ms. Remains 183 /205 variables (removed 22) and now considering 168/190 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 183/205 places, 168/190 transitions.
[2023-03-22 15:15:22] [INFO ] Flatten gal took : 6 ms
[2023-03-22 15:15:22] [INFO ] Flatten gal took : 6 ms
[2023-03-22 15:15:22] [INFO ] Input system was already deterministic with 168 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 205/205 places, 190/190 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 204 transition count 152
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 40 rules applied. Total rules applied 77 place count 167 transition count 149
Reduce places removed 2 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 2 with 5 rules applied. Total rules applied 82 place count 165 transition count 146
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 85 place count 162 transition count 146
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 13 Pre rules applied. Total rules applied 85 place count 162 transition count 133
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 4 with 26 rules applied. Total rules applied 111 place count 149 transition count 133
Discarding 15 places :
Symmetric choice reduction at 4 with 15 rule applications. Total rules 126 place count 134 transition count 118
Iterating global reduction 4 with 15 rules applied. Total rules applied 141 place count 134 transition count 118
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 141 place count 134 transition count 108
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 161 place count 124 transition count 108
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 249 place count 80 transition count 64
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 250 place count 80 transition count 64
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 252 place count 78 transition count 62
Applied a total of 252 rules in 24 ms. Remains 78 /205 variables (removed 127) and now considering 62/190 (removed 128) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 78/205 places, 62/190 transitions.
[2023-03-22 15:15:22] [INFO ] Flatten gal took : 3 ms
[2023-03-22 15:15:22] [INFO ] Flatten gal took : 2 ms
[2023-03-22 15:15:22] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 190/190 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 190 transition count 175
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 190 transition count 175
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 189 transition count 174
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 189 transition count 174
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 188 transition count 173
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 188 transition count 173
Applied a total of 34 rules in 9 ms. Remains 188 /205 variables (removed 17) and now considering 173/190 (removed 17) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9 ms. Remains : 188/205 places, 173/190 transitions.
[2023-03-22 15:15:22] [INFO ] Flatten gal took : 6 ms
[2023-03-22 15:15:23] [INFO ] Flatten gal took : 6 ms
[2023-03-22 15:15:23] [INFO ] Input system was already deterministic with 173 transitions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 190/190 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 183 transition count 168
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 183 transition count 168
Applied a total of 44 rules in 5 ms. Remains 183 /205 variables (removed 22) and now considering 168/190 (removed 22) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 183/205 places, 168/190 transitions.
[2023-03-22 15:15:23] [INFO ] Flatten gal took : 6 ms
[2023-03-22 15:15:23] [INFO ] Flatten gal took : 6 ms
[2023-03-22 15:15:23] [INFO ] Input system was already deterministic with 168 transitions.
[2023-03-22 15:15:23] [INFO ] Flatten gal took : 6 ms
[2023-03-22 15:15:23] [INFO ] Flatten gal took : 7 ms
[2023-03-22 15:15:23] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-22 15:15:23] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 205 places, 190 transitions and 476 arcs took 2 ms.
Total runtime 18561 ms.
There are residual formulas that ITS could not solve within timeout
timeout --kill-after=10s --signal=SIGINT 1m for testing only

Marcie built on Linux at 2019-11-18.
A model checker for Generalized Stochastic Petri nets

authors: Alex Tovchigrechko (IDD package and CTL model checking)

Martin Schwarick (Symbolic numerical analysis and CSL model checking)

Christian Rohr (Simulative and approximative numerical model checking)

marcie@informatik.tu-cottbus.de

called as: /home/mcc/BenchKit/bin//../reducer/bin//../../marcie/bin/marcie --net-file=model.pnml --mcc-file=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 205 NrTr: 190 NrArc: 476)

parse formulas
formulas created successfully
place and transition orderings generation:0m 0.003sec

net check time: 0m 0.000sec

init dd package: 0m 2.877sec


RS generation: 0m42.468sec


-> reachability set: #nodes 1134532 (1.1e+06) #states 2,511,874,462,780,791,843 (18)



starting MCC model checker
--------------------------

checking: AX [EG [[AX [EG [[p8<=0 & 0<=p8]]] | [[p139<=1 & 1<=p139] & AG [[p191<=0 & 0<=p191]]]]]]
normalized: ~ [EX [~ [EG [[[[p139<=1 & 1<=p139] & ~ [E [true U ~ [[p191<=0 & 0<=p191]]]]] | ~ [EX [~ [EG [[p8<=0 & 0<=p8]]]]]]]]]]

abstracting: (0<=p8)
states: 2,511,874,462,780,791,843 (18)
abstracting: (p8<=0)
states: 2,511,873,756,950,012,517 (18)
................................................
before gc: list nodes free: 68341

after gc: idd nodes used:2653895, unused:61346105; list nodes free:277310808
...........................................
before gc: list nodes free: 1898998

after gc: idd nodes used:2664472, unused:61335528; list nodes free:279377104
.................................................................................
EG iterations: 172
.abstracting: (0<=p191)
states: 2,511,874,462,780,791,843 (18)
abstracting: (p191<=0)
states: 2,229,890,271,734,954,724 (18)

before gc: list nodes free: 3705626

after gc: idd nodes used:1425429, unused:62574571; list nodes free:285370702
MC time: 4m34.000sec

checking: EX [AF [AG [[~ [E [[p143<=1 & 1<=p143] U [p182<=1 & 1<=p182]]] | [[p151<=0 & 0<=p151] | [p78<=0 & 0<=p78]]]]]]
normalized: EX [~ [EG [E [true U ~ [[[[p78<=0 & 0<=p78] | [p151<=0 & 0<=p151]] | ~ [E [[p143<=1 & 1<=p143] U [p182<=1 & 1<=p182]]]]]]]]]

abstracting: (1<=p182)
states: 40,546,909,522,167,864 (16)
abstracting: (p182<=1)
states: 2,511,874,462,780,791,843 (18)
abstracting: (1<=p143)
states: 33,346,704 (7)
abstracting: (p143<=1)
states: 2,511,874,462,780,791,843 (18)
abstracting: (0<=p151)
states: 2,511,874,462,780,791,843 (18)
abstracting: (p151<=0)
states: 2,202,512,773,189,631,781 (18)
abstracting: (0<=p78)
states: 2,511,874,462,780,791,843 (18)
abstracting: (p78<=0)
states: 2,511,874,423,179,536,163 (18)
.
EG iterations: 1
.-> the formula is TRUE

FORMULA ShieldIIPt-PT-003B-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m56.941sec

checking: A [EG [~ [[EX [[[p143<=1 & 1<=p143] | [p188<=1 & 1<=p188]]] & [p103<=1 & 1<=p103]]]] U ~ [EX [EF [[[[p169<=1 & 1<=p169] | [p99<=1 & 1<=p99]] & EG [[p133<=1 & 1<=p133]]]]]]]
normalized: [~ [EG [EX [E [true U [EG [[p133<=1 & 1<=p133]] & [[p99<=1 & 1<=p99] | [p169<=1 & 1<=p169]]]]]]] & ~ [E [EX [E [true U [EG [[p133<=1 & 1<=p133]] & [[p99<=1 & 1<=p99] | [p169<=1 & 1<=p169]]]]] U [~ [EG [~ [[[p103<=1 & 1<=p103] & EX [[[p188<=1 & 1<=p188] | [p143<=1 & 1<=p143]]]]]]] & EX [E [true U [EG [[p133<=1 & 1<=p133]] & [[p99<=1 & 1<=p99] | [p169<=1 & 1<=p169]]]]]]]]]

abstracting: (1<=p169)
states: 283,587,793,697,134,650 (17)
abstracting: (p169<=1)
states: 2,511,874,462,780,791,843 (18)
abstracting: (1<=p99)
states: 274,177,371,218,914,332 (17)
abstracting: (p99<=1)
states: 2,511,874,462,780,791,843 (18)
abstracting: (1<=p133)
states: 301,068,971,367,080,256 (17)
abstracting: (p133<=1)
states: 2,511,874,462,780,791,843 (18)
..................
before gc: list nodes free: 3613605

after gc: idd nodes used:3974515, unused:60025485; list nodes free:273872232
.............
before gc: list nodes free: 47752

after gc: idd nodes used:5197352, unused:58802648; list nodes free:268449637
.MC time: 4m29.007sec

checking: AG [EF [[[~ [E [[p163<=1 & 1<=p163] U [p54<=1 & 1<=p54]]] & AX [[p50<=0 & 0<=p50]]] & [EG [[p202<=0 & 0<=p202]] & [A [[p98<=1 & 1<=p98] U [p9<=1 & 1<=p9]] | [EG [[p12<=0 & 0<=p12]] | [p139<=1 & 1<=p139]]]]]]]
normalized: ~ [E [true U ~ [E [true U [[[[[p139<=1 & 1<=p139] | EG [[p12<=0 & 0<=p12]]] | [~ [EG [~ [[p9<=1 & 1<=p9]]]] & ~ [E [~ [[p9<=1 & 1<=p9]] U [~ [[p98<=1 & 1<=p98]] & ~ [[p9<=1 & 1<=p9]]]]]]] & EG [[p202<=0 & 0<=p202]]] & [~ [EX [~ [[p50<=0 & 0<=p50]]]] & ~ [E [[p163<=1 & 1<=p163] U [p54<=1 & 1<=p54]]]]]]]]]

abstracting: (1<=p54)
states: 266,603,264,577,738,360 (17)
abstracting: (p54<=1)
states: 2,511,874,462,780,791,843 (18)
abstracting: (1<=p163)
states: 89,541,238,828,318,017 (16)
abstracting: (p163<=1)
states: 2,511,874,462,780,791,843 (18)

before gc: list nodes free: 293237

after gc: idd nodes used:2973798, unused:61026202; list nodes free:278666851
abstracting: (0<=p50)
states: 2,511,874,462,780,791,843 (18)
abstracting: (p50<=0)
states: 2,475,275,434,908,918,795 (18)
.abstracting: (0<=p202)
states: 2,511,874,462,780,791,843 (18)
abstracting: (p202<=0)
states: 2,228,705,407,029,813,774 (18)
.........
before gc: list nodes free: 6500411

after gc: idd nodes used:6307042, unused:57692958; list nodes free:263919813
..MC time: 4m 7.122sec

checking: AG [E [[EF [[[[p95<=1 & 1<=p95] | [p71<=1 & 1<=p71]] & EG [[p146<=1 & 1<=p146]]]] & EF [[[[p178<=1 & 1<=p178] & [p130<=1 & 1<=p130]] | E [[p57<=1 & 1<=p57] U [p102<=1 & 1<=p102]]]]] U [p92<=1 & 1<=p92]]]
normalized: ~ [E [true U ~ [E [[E [true U [E [[p57<=1 & 1<=p57] U [p102<=1 & 1<=p102]] | [[p130<=1 & 1<=p130] & [p178<=1 & 1<=p178]]]] & E [true U [EG [[p146<=1 & 1<=p146]] & [[p71<=1 & 1<=p71] | [p95<=1 & 1<=p95]]]]] U [p92<=1 & 1<=p92]]]]]

abstracting: (1<=p92)
states: 786,827,553,985,444,320 (17)
abstracting: (p92<=1)
states: 2,511,874,462,780,791,843 (18)
abstracting: (1<=p95)
states: 837,309,644,961,707,952 (17)
abstracting: (p95<=1)
states: 2,511,874,462,780,791,843 (18)
abstracting: (1<=p71)
states: 268,131,735,927,616,680 (17)
abstracting: (p71<=1)
states: 2,511,874,462,780,791,843 (18)
abstracting: (1<=p146)
states: 49,705,495,209,045,232 (16)
abstracting: (p146<=1)
states: 2,511,874,462,780,791,843 (18)
...........
before gc: list nodes free: 4287168

after gc: idd nodes used:5634802, unused:58365198; list nodes free:267074244
...
before gc: list nodes free: 1322082

after gc: idd nodes used:6980166, unused:57019834; list nodes free:260936869
MC time: 3m46.288sec

checking: A [[[1<=p127 & p127<=1] & [A [[AG [[p167<=1 & 1<=p167]] | AX [[p196<=1 & 1<=p196]]] U ~ [[[p178<=1 & 1<=p178] | [p166<=1 & 1<=p166]]]] | [[p77<=1 & 1<=p77] | [p141<=1 & 1<=p141]]]] U AF [[~ [[AF [[p98<=1 & 1<=p98]] & ~ [AG [[p151<=1 & 1<=p151]]]]] & EX [[p105<=1 & 1<=p105]]]]]
normalized: [~ [EG [EG [~ [[EX [[p105<=1 & 1<=p105]] & ~ [[E [true U ~ [[p151<=1 & 1<=p151]]] & ~ [EG [~ [[p98<=1 & 1<=p98]]]]]]]]]]] & ~ [E [EG [~ [[EX [[p105<=1 & 1<=p105]] & ~ [[E [true U ~ [[p151<=1 & 1<=p151]]] & ~ [EG [~ [[p98<=1 & 1<=p98]]]]]]]]] U [~ [[[[[p141<=1 & 1<=p141] | [p77<=1 & 1<=p77]] | [~ [EG [[[p166<=1 & 1<=p166] | [p178<=1 & 1<=p178]]]] & ~ [E [[[p166<=1 & 1<=p166] | [p178<=1 & 1<=p178]] U [~ [[~ [EX [~ [[p196<=1 & 1<=p196]]]] | ~ [E [true U ~ [[p167<=1 & 1<=p167]]]]]] & [[p166<=1 & 1<=p166] | [p178<=1 & 1<=p178]]]]]]] & [1<=p127 & p127<=1]]] & EG [~ [[EX [[p105<=1 & 1<=p105]] & ~ [[E [true U ~ [[p151<=1 & 1<=p151]]] & ~ [EG [~ [[p98<=1 & 1<=p98]]]]]]]]]]]]]

abstracting: (1<=p98)
states: 258,781,853,197,259,640 (17)
abstracting: (p98<=1)
states: 2,511,874,462,780,791,843 (18)
..............
before gc: list nodes free: 2734196

after gc: idd nodes used:5125252, unused:58874748; list nodes free:269457177
.............
before gc: list nodes free: 2322264

after gc: idd nodes used:7640728, unused:56359272; list nodes free:257098529
MC time: 3m30.376sec

checking: AG [[[EF [[[p183<=0 & 0<=p183] | [p115<=0 & 0<=p115]]] | [[p82<=0 & 0<=p82] | [AF [[[p94<=1 & 1<=p94] & [p187<=1 & 1<=p187]]] & [[p53<=1 & 1<=p53] | [[p87<=1 & 1<=p87] & [p106<=1 & 1<=p106]]]]]] & [[p14<=0 & 0<=p14] | [p67<=0 & 0<=p67]]]]
normalized: ~ [E [true U ~ [[[[p67<=0 & 0<=p67] | [p14<=0 & 0<=p14]] & [[[[[[p106<=1 & 1<=p106] & [p87<=1 & 1<=p87]] | [p53<=1 & 1<=p53]] & ~ [EG [~ [[[p187<=1 & 1<=p187] & [p94<=1 & 1<=p94]]]]]] | [p82<=0 & 0<=p82]] | E [true U [[p115<=0 & 0<=p115] | [p183<=0 & 0<=p183]]]]]]]]

abstracting: (0<=p183)
states: 2,511,874,462,780,791,843 (18)
abstracting: (p183<=0)
states: 2,511,874,462,536,944,070 (18)
abstracting: (0<=p115)
states: 2,511,874,462,780,791,843 (18)
abstracting: (p115<=0)
states: 2,169,574,545,007,531,167 (18)
abstracting: (0<=p82)
states: 2,511,874,462,780,791,843 (18)
abstracting: (p82<=0)
states: 1,714,751,879,581,034,877 (18)
abstracting: (1<=p94)
states: 837,309,724,359,095,088 (17)
abstracting: (p94<=1)
states: 2,511,874,462,780,791,843 (18)
abstracting: (1<=p187)
states: 283,784,557,989,671,457 (17)
abstracting: (p187<=1)
states: 2,511,874,462,780,791,843 (18)
..............
before gc: list nodes free: 3912894

after gc: idd nodes used:7200849, unused:56799151; list nodes free:259861609
MC time: 3m10.326sec

checking: EX [[[p57<=1 & 1<=p57] | [AF [[[p87<=1 & 1<=p87] & [p106<=1 & 1<=p106]]] & [[A [[[p166<=1 & 1<=p166] & [p178<=1 & 1<=p178]] U AX [[p122<=1 & 1<=p122]]] | EF [[p35<=1 & 1<=p35]]] | [AX [EF [[p146<=1 & 1<=p146]]] | [EG [[p99<=0 & 0<=p99]] & [p197<=0 & 0<=p197]]]]]]]
normalized: EX [[[[[[[p197<=0 & 0<=p197] & EG [[p99<=0 & 0<=p99]]] | ~ [EX [~ [E [true U [p146<=1 & 1<=p146]]]]]] | [E [true U [p35<=1 & 1<=p35]] | [~ [EG [EX [~ [[p122<=1 & 1<=p122]]]]] & ~ [E [EX [~ [[p122<=1 & 1<=p122]]] U [~ [[[p178<=1 & 1<=p178] & [p166<=1 & 1<=p166]]] & EX [~ [[p122<=1 & 1<=p122]]]]]]]]] & ~ [EG [~ [[[p106<=1 & 1<=p106] & [p87<=1 & 1<=p87]]]]]] | [p57<=1 & 1<=p57]]]

abstracting: (1<=p57)
states: 284,565,244,663,776,168 (17)
abstracting: (p57<=1)
states: 2,511,874,462,780,791,843 (18)
abstracting: (1<=p87)
states: 701,763,304,047,555,060 (17)
abstracting: (p87<=1)
states: 2,511,874,462,780,791,843 (18)
abstracting: (1<=p106)
states: 274,855,281,803,860,410 (17)
abstracting: (p106<=1)
states: 2,511,874,462,780,791,843 (18)
..................
before gc: list nodes free: 2278951

after gc: idd nodes used:6580249, unused:57419751; list nodes free:263016752
MC time: 2m54.253sec

checking: [AX [EF [[[AG [[p56<=0 & 0<=p56]] & [[p117<=0 & 0<=p117] & [p119<=0 & 0<=p119]]] | [E [[p95<=1 & 1<=p95] U [p65<=1 & 1<=p65]] & [A [[p75<=1 & 1<=p75] U [p151<=1 & 1<=p151]] | [p178<=0 & 0<=p178]]]]]] | AF [AX [EG [[[p137<=0 & 0<=p137] | [[p20<=0 & 0<=p20] | [p38<=0 & 0<=p38]]]]]]]
normalized: [~ [EG [EX [~ [EG [[[[p38<=0 & 0<=p38] | [p20<=0 & 0<=p20]] | [p137<=0 & 0<=p137]]]]]]] | ~ [EX [~ [E [true U [[[[p178<=0 & 0<=p178] | [~ [EG [~ [[p151<=1 & 1<=p151]]]] & ~ [E [~ [[p151<=1 & 1<=p151]] U [~ [[p75<=1 & 1<=p75]] & ~ [[p151<=1 & 1<=p151]]]]]]] & E [[p95<=1 & 1<=p95] U [p65<=1 & 1<=p65]]] | [[[p119<=0 & 0<=p119] & [p117<=0 & 0<=p117]] & ~ [E [true U ~ [[p56<=0 & 0<=p56]]]]]]]]]]]

abstracting: (0<=p56)
states: 2,511,874,462,780,791,843 (18)
abstracting: (p56<=0)
states: 2,227,309,218,117,015,675 (18)

before gc: list nodes free: 1861235

after gc: idd nodes used:4483152, unused:59516848; list nodes free:274323211
MC time: 2m39.143sec

checking: E [EF [[[~ [E [[p170<=1 & 1<=p170] U [p183<=1 & 1<=p183]]] & AG [[[p154<=1 & 1<=p154] & [p156<=1 & 1<=p156]]]] & [[p61<=1 & 1<=p61] & [[p183<=1 & 1<=p183] | AF [[p35<=1 & 1<=p35]]]]]] U ~ [AG [~ [[AG [[[p27<=1 & 1<=p27] & [p123<=1 & 1<=p123]]] & E [[p183<=1 & 1<=p183] U [p42<=1 & 1<=p42]]]]]]]
normalized: E [E [true U [[[~ [EG [~ [[p35<=1 & 1<=p35]]]] | [p183<=1 & 1<=p183]] & [p61<=1 & 1<=p61]] & [~ [E [true U ~ [[[p156<=1 & 1<=p156] & [p154<=1 & 1<=p154]]]]] & ~ [E [[p170<=1 & 1<=p170] U [p183<=1 & 1<=p183]]]]]] U E [true U [E [[p183<=1 & 1<=p183] U [p42<=1 & 1<=p42]] & ~ [E [true U ~ [[[p123<=1 & 1<=p123] & [p27<=1 & 1<=p27]]]]]]]]

abstracting: (1<=p27)
states: 837,336,445,227,174,192 (17)
abstracting: (p27<=1)
states: 2,511,874,462,780,791,843 (18)
abstracting: (1<=p123)
states: 281,941,958,556,497,100 (17)
abstracting: (p123<=1)
states: 2,511,874,462,780,791,843 (18)
abstracting: (1<=p42)
states: 341,683,551,071,601,552 (17)
abstracting: (p42<=1)
states: 2,511,874,462,780,791,843 (18)
abstracting: (1<=p183)
states: 243,847,773 (8)
abstracting: (p183<=1)
states: 2,511,874,462,780,791,843 (18)
abstracting: (1<=p183)
states: 243,847,773 (8)
abstracting: (p183<=1)
states: 2,511,874,462,780,791,843 (18)
abstracting: (1<=p170)
states: 272,132,204,257,134,936 (17)
abstracting: (p170<=1)
states: 2,511,874,462,780,791,843 (18)
abstracting: (1<=p154)
states: 617,599,373,739,898,944 (17)
abstracting: (p154<=1)
states: 2,511,874,462,780,791,843 (18)
abstracting: (1<=p156)
states: 684,807,468,619,223,058 (17)
abstracting: (p156<=1)
states: 2,511,874,462,780,791,843 (18)
abstracting: (1<=p61)
states: 86,843,911,426,614 (13)
abstracting: (p61<=1)
states: 2,511,874,462,780,791,843 (18)
abstracting: (1<=p183)
states: 243,847,773 (8)
abstracting: (p183<=1)
states: 2,511,874,462,780,791,843 (18)
abstracting: (1<=p35)
states: 308,364,284,956,289,472 (17)
abstracting: (p35<=1)
states: 2,511,874,462,780,791,843 (18)
............
before gc: list nodes free: 5552182

after gc: idd nodes used:7856850, unused:56143150; list nodes free:258874202
MC time: 2m26.049sec

checking: EG [[[AG [[[p140<=0 & 0<=p140] | [[p174<=0 & 0<=p174] & [[p93<=0 & 0<=p93] | [[p106<=0 & 0<=p106] | [p138<=0 & 0<=p138]]]]]] | ~ [E [AF [[p172<=1 & 1<=p172]] U A [[p102<=1 & 1<=p102] U [p172<=1 & 1<=p172]]]]] | [EG [[AX [[p39<=0 & 0<=p39]] & [p61<=0 & 0<=p61]]] | AG [[p78<=1 & 1<=p78]]]]]
normalized: EG [[[~ [E [true U ~ [[p78<=1 & 1<=p78]]]] | EG [[[p61<=0 & 0<=p61] & ~ [EX [~ [[p39<=0 & 0<=p39]]]]]]] | [~ [E [~ [EG [~ [[p172<=1 & 1<=p172]]]] U [~ [EG [~ [[p172<=1 & 1<=p172]]]] & ~ [E [~ [[p172<=1 & 1<=p172]] U [~ [[p102<=1 & 1<=p102]] & ~ [[p172<=1 & 1<=p172]]]]]]]] | ~ [E [true U ~ [[[[[[p138<=0 & 0<=p138] | [p106<=0 & 0<=p106]] | [p93<=0 & 0<=p93]] & [p174<=0 & 0<=p174]] | [p140<=0 & 0<=p140]]]]]]]]

abstracting: (0<=p140)
states: 2,511,874,462,780,791,843 (18)
abstracting: (p140<=0)
states: 2,511,874,462,780,097,120 (18)
abstracting: (0<=p174)
states: 2,511,874,462,780,791,843 (18)
abstracting: (p174<=0)
states: 2,471,327,553,258,623,979 (18)
abstracting: (0<=p93)
states: 2,511,874,462,780,791,843 (18)
abstracting: (p93<=0)
states: 1,685,720,674,716,962,307 (18)
abstracting: (0<=p106)
states: 2,511,874,462,780,791,843 (18)
abstracting: (p106<=0)
states: 2,237,019,180,976,931,433 (18)
abstracting: (0<=p138)
states: 2,511,874,462,780,791,843 (18)
abstracting: (p138<=0)
states: 2,195,739,663,467,686,203 (18)
abstracting: (1<=p172)
states: 89,541,238,828,318,017 (16)
abstracting: (p172<=1)
states: 2,511,874,462,780,791,843 (18)
abstracting: (1<=p102)
states: 274,177,371,218,914,332 (17)
abstracting: (p102<=1)
states: 2,511,874,462,780,791,843 (18)
abstracting: (1<=p172)
states: 89,541,238,828,318,017 (16)
abstracting: (p172<=1)
states: 2,511,874,462,780,791,843 (18)
abstracting: (1<=p172)
states: 89,541,238,828,318,017 (16)
abstracting: (p172<=1)
states: 2,511,874,462,780,791,843 (18)
...........MC time: 2m14.020sec

checking: EF [[[EX [[[~ [A [[p169<=1 & 1<=p169] U [[p162<=1 & 1<=p162] & [[p192<=1 & 1<=p192] & [p203<=1 & 1<=p203]]]]] & [p87<=1 & 1<=p87]] & [[p106<=1 & 1<=p106] & [[p196<=1 & 1<=p196] & [p4<=0 & 0<=p4]]]]] & [p151<=0 & 0<=p151]] & [EG [[p92<=1 & 1<=p92]] & EX [E [EG [[p9<=1 & 1<=p9]] U [p185<=1 & 1<=p185]]]]]]
normalized: E [true U [[EX [E [EG [[p9<=1 & 1<=p9]] U [p185<=1 & 1<=p185]]] & EG [[p92<=1 & 1<=p92]]] & [[p151<=0 & 0<=p151] & EX [[[[[p4<=0 & 0<=p4] & [p196<=1 & 1<=p196]] & [p106<=1 & 1<=p106]] & [[p87<=1 & 1<=p87] & ~ [[~ [EG [~ [[[[p203<=1 & 1<=p203] & [p192<=1 & 1<=p192]] & [p162<=1 & 1<=p162]]]]] & ~ [E [~ [[[[p203<=1 & 1<=p203] & [p192<=1 & 1<=p192]] & [p162<=1 & 1<=p162]]] U [~ [[p169<=1 & 1<=p169]] & ~ [[[[p203<=1 & 1<=p203] & [p192<=1 & 1<=p192]] & [p162<=1 & 1<=p162]]]]]]]]]]]]]]

abstracting: (1<=p162)
states: 837,291,487,653,791,877 (17)
abstracting: (p162<=1)
states: 2,511,874,462,780,791,843 (18)
abstracting: (1<=p192)
states: 283,789,323,810,433,638 (17)
abstracting: (p192<=1)
states: 2,511,874,462,780,791,843 (18)
abstracting: (1<=p203)
states: 286,301,445,486,813,727 (17)
abstracting: (p203<=1)
states: 2,511,874,462,780,791,843 (18)
abstracting: (1<=p169)
states: 283,587,793,697,134,650 (17)
abstracting: (p169<=1)
states: 2,511,874,462,780,791,843 (18)
abstracting: (1<=p162)
states: 837,291,487,653,791,877 (17)
abstracting: (p162<=1)
states: 2,511,874,462,780,791,843 (18)
abstracting: (1<=p192)
states: 283,789,323,810,433,638 (17)
abstracting: (p192<=1)
states: 2,511,874,462,780,791,843 (18)
abstracting: (1<=p203)
states: 286,301,445,486,813,727 (17)
abstracting: (p203<=1)
states: 2,511,874,462,780,791,843 (18)
abstracting: (1<=p162)
states: 837,291,487,653,791,877 (17)
abstracting: (p162<=1)
states: 2,511,874,462,780,791,843 (18)
abstracting: (1<=p192)
states: 283,789,323,810,433,638 (17)
abstracting: (p192<=1)
states: 2,511,874,462,780,791,843 (18)
abstracting: (1<=p203)
states: 286,301,445,486,813,727 (17)
abstracting: (p203<=1)
states: 2,511,874,462,780,791,843 (18)

before gc: list nodes free: 5154823

after gc: idd nodes used:6633935, unused:57366065; list nodes free:265100782
.......MC time: 2m 3.006sec

checking: E [[~ [[AX [[[p189<=1 & 1<=p189] & [p59<=1 & 1<=p59]]] & [AG [[[p108<=1 & 1<=p108] & [p114<=1 & 1<=p114]]] & [A [[p34<=1 & 1<=p34] U [p109<=1 & 1<=p109]] | [[p183<=1 & 1<=p183] | [~ [[[p169<=1 & 1<=p169] & [p19<=1 & 1<=p19]]] & AX [[p73<=1 & 1<=p73]]]]]]]] | [[p158<=1 & 1<=p158] & [A [[AX [[p31<=1 & 1<=p31]] & E [[p49<=1 & 1<=p49] U [p195<=1 & 1<=p195]]] U [p185<=1 & 1<=p185]] & [A [[p125<=1 & 1<=p125] U [[[p89<=1 & 1<=p89] & [p128<=1 & 1<=p128]] | [[p81<=1 & 1<=p81] & [p134<=1 & 1<=p134]]]] | [~ [[[p150<=1 & 1<=p150] & [p177<=1 & 1<=p177]]] | [EX [[p12<=1 & 1<=p12]] & [p127<=1 & 1<=p127]]]]]]] U [~ [[~ [AG [[p139<=1 & 1<=p139]]] & ~ [[A [[p175<=1 & 1<=p175] U [[p26<=1 & 1<=p26] & [[p38<=1 & 1<=p38] & [p72<=1 & 1<=p72]]]] & [~ [[p0<=1 & 1<=p0]] & E [[[p147<=1 & 1<=p147] & [p198<=1 & 1<=p198]] U [p39<=1 & 1<=p39]]]]]]] & AX [~ [[[p98<=1 & 1<=p98] | [p184<=1 & 1<=p184]]]]]]
normalized: E [[[[[[[[p127<=1 & 1<=p127] & EX [[p12<=1 & 1<=p12]]] | ~ [[[p177<=1 & 1<=p177] & [p150<=1 & 1<=p150]]]] | [~ [EG [~ [[[[p134<=1 & 1<=p134] & [p81<=1 & 1<=p81]] | [[p128<=1 & 1<=p128] & [p89<=1 & 1<=p89]]]]]] & ~ [E [~ [[[[p134<=1 & 1<=p134] & [p81<=1 & 1<=p81]] | [[p128<=1 & 1<=p128] & [p89<=1 & 1<=p89]]]] U [~ [[p125<=1 & 1<=p125]] & ~ [[[[p134<=1 & 1<=p134] & [p81<=1 & 1<=p81]] | [[p128<=1 & 1<=p128] & [p89<=1 & 1<=p89]]]]]]]]] & [~ [EG [~ [[p185<=1 & 1<=p185]]]] & ~ [E [~ [[p185<=1 & 1<=p185]] U [~ [[E [[p49<=1 & 1<=p49] U [p195<=1 & 1<=p195]] & ~ [EX [~ [[p31<=1 & 1<=p31]]]]]] & ~ [[p185<=1 & 1<=p185]]]]]]] & [p158<=1 & 1<=p158]] | ~ [[[[[[~ [EX [~ [[p73<=1 & 1<=p73]]]] & ~ [[[p19<=1 & 1<=p19] & [p169<=1 & 1<=p169]]]] | [p183<=1 & 1<=p183]] | [~ [EG [~ [[p109<=1 & 1<=p109]]]] & ~ [E [~ [[p109<=1 & 1<=p109]] U [~ [[p34<=1 & 1<=p34]] & ~ [[p109<=1 & 1<=p109]]]]]]] & ~ [E [true U ~ [[[p114<=1 & 1<=p114] & [p108<=1 & 1<=p108]]]]]] & ~ [EX [~ [[[p59<=1 & 1<=p59] & [p189<=1 & 1<=p189]]]]]]]] U [~ [EX [[[p184<=1 & 1<=p184] | [p98<=1 & 1<=p98]]]] & ~ [[~ [[[E [[[p198<=1 & 1<=p198] & [p147<=1 & 1<=p147]] U [p39<=1 & 1<=p39]] & ~ [[p0<=1 & 1<=p0]]] & [~ [EG [~ [[[[p72<=1 & 1<=p72] & [p38<=1 & 1<=p38]] & [p26<=1 & 1<=p26]]]]] & ~ [E [~ [[[[p72<=1 & 1<=p72] & [p38<=1 & 1<=p38]] & [p26<=1 & 1<=p26]]] U [~ [[p175<=1 & 1<=p175]] & ~ [[[[p72<=1 & 1<=p72] & [p38<=1 & 1<=p38]] & [p26<=1 & 1<=p26]]]]]]]]] & E [true U ~ [[p139<=1 & 1<=p139]]]]]]]

abstracting: (1<=p139)
states: 694,723 (5)
abstracting: (p139<=1)
states: 2,511,874,462,780,791,843 (18)
abstracting: (1<=p26)
states: 856,233,060,422,579,280 (17)
abstracting: (p26<=1)
states: 2,511,874,462,780,791,843 (18)
abstracting: (1<=p38)
states: 308,782,151,998,619,124 (17)
abstracting: (p38<=1)
states: 2,511,874,462,780,791,843 (18)
abstracting: (1<=p72)
states: 285,095,289,653,228,794 (17)
abstracting: (p72<=1)
states: 2,511,874,462,780,791,843 (18)
abstracting: (1<=p175)
states: 343,707,296,994,334,602 (17)
abstracting: (p175<=1)
states: 2,511,874,462,780,791,843 (18)
abstracting: (1<=p26)
states: 856,233,060,422,579,280 (17)
abstracting: (p26<=1)
states: 2,511,874,462,780,791,843 (18)
abstracting: (1<=p38)
states: 308,782,151,998,619,124 (17)
abstracting: (p38<=1)
states: 2,511,874,462,780,791,843 (18)
abstracting: (1<=p72)
states: 285,095,289,653,228,794 (17)
abstracting: (p72<=1)
states: 2,511,874,462,780,791,843 (18)
abstracting: (1<=p26)
states: 856,233,060,422,579,280 (17)
abstracting: (p26<=1)
states: 2,511,874,462,780,791,843 (18)
abstracting: (1<=p38)
states: 308,782,151,998,619,124 (17)
abstracting: (p38<=1)
states: 2,511,874,462,780,791,843 (18)
abstracting: (1<=p72)
states: 285,095,289,653,228,794 (17)
abstracting: (p72<=1)
states: 2,511,874,462,780,791,843 (18)
..........
before gc: list nodes free: 4676102

after gc: idd nodes used:8892420, unused:55107580; list nodes free:254086307
MC time: 1m53.123sec

checking: AX [EG [[AX [EG [[p8<=0 & 0<=p8]]] | [[p139<=1 & 1<=p139] & AG [[p191<=0 & 0<=p191]]]]]]
normalized: ~ [EX [~ [EG [[[~ [E [true U ~ [[p191<=0 & 0<=p191]]]] & [p139<=1 & 1<=p139]] | ~ [EX [~ [EG [[p8<=0 & 0<=p8]]]]]]]]]]

abstracting: (0<=p8)
states: 2,511,874,462,780,791,843 (18)
abstracting: (p8<=0)
states: 2,511,873,756,950,012,517 (18)
.................................................
before gc: list nodes free: 4316840

after gc: idd nodes used:8185964, unused:55814036; list nodes free:257990467
................................
before gc: list nodes free: 5302348

after gc: idd nodes used:9193323, unused:54806677; list nodes free:252731542
................................................
before gc: list nodes free: 6158798

after gc: idd nodes used:8844227, unused:55155773; list nodes free:254411772
...........................................
EG iterations: 172
.abstracting: (1<=p139)
states: 694,723 (5)
abstracting: (p139<=1)
states: 2,511,874,462,780,791,843 (18)
abstracting: (0<=p191)
states: 2,511,874,462,780,791,843 (18)
abstracting: (p191<=0)
states: 2,229,890,271,734,954,724 (18)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393236 kB
MemFree: 5979472 kB
After kill :
MemTotal: 16393236 kB
MemFree: 16096260 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
content from stderr:

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -timeout 360 -rebuildPNML
check for maximal unmarked siphon
ok
check for constant places
ok
check if there are places and transitions
ok
check if there are transitions without pre-places
ok
check if at least one transition is enabled in m0
ok
check if there are transitions that can never fire
ok


initing FirstDep: 0m 0.000sec

1135455
iterations count:123464 (649), effective:15491 (81)

initing FirstDep: 0m 0.000sec


sat_reach.icc:155: Timeout: after 273 sec


iterations count:192 (1), effective:1 (0)

net_ddint.h:600: Timeout: after 268 sec


iterations count:4907 (25), effective:364 (1)

net_ddint.h:600: Timeout: after 246 sec


net_ddint.h:600: Timeout: after 225 sec


net_ddint.h:600: Timeout: after 206 sec


iterations count:190 (1), effective:0 (0)

net_ddint.h:600: Timeout: after 189 sec


net_ddint.h:600: Timeout: after 173 sec


sat_reach.icc:155: Timeout: after 158 sec


iterations count:193 (1), effective:1 (0)

iterations count:190 (1), effective:0 (0)

iterations count:190 (1), effective:0 (0)

iterations count:221 (1), effective:1 (0)

net_ddint.h:600: Timeout: after 145 sec


iterations count:192 (1), effective:1 (0)

net_ddint.h:600: Timeout: after 133 sec


iterations count:194 (1), effective:1 (0)

net_ddint.h:600: Timeout: after 122 sec


iterations count:214 (1), effective:1 (0)

iterations count:194 (1), effective:1 (0)

net_ddint.h:600: Timeout: after 112 sec


iterations count:8080 (42), effective:701 (3)

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="ShieldIIPt-PT-003B"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="marciexred"
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 marciexred"
echo " Input is ShieldIIPt-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 r394-oct2-167903717600218"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldIIPt-PT-003B.tgz
mv ShieldIIPt-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 '' 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 ;