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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 5.1K Feb 26 01:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 48K Feb 26 01:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 01:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K Feb 26 01:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 16:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 16:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 26 01:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Feb 26 01:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:58 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 35K 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 ShieldPPPs-PT-002B-CTLFireability-00
FORMULA_NAME ShieldPPPs-PT-002B-CTLFireability-01
FORMULA_NAME ShieldPPPs-PT-002B-CTLFireability-02
FORMULA_NAME ShieldPPPs-PT-002B-CTLFireability-03
FORMULA_NAME ShieldPPPs-PT-002B-CTLFireability-04
FORMULA_NAME ShieldPPPs-PT-002B-CTLFireability-05
FORMULA_NAME ShieldPPPs-PT-002B-CTLFireability-06
FORMULA_NAME ShieldPPPs-PT-002B-CTLFireability-07
FORMULA_NAME ShieldPPPs-PT-002B-CTLFireability-08
FORMULA_NAME ShieldPPPs-PT-002B-CTLFireability-09
FORMULA_NAME ShieldPPPs-PT-002B-CTLFireability-10
FORMULA_NAME ShieldPPPs-PT-002B-CTLFireability-11
FORMULA_NAME ShieldPPPs-PT-002B-CTLFireability-12
FORMULA_NAME ShieldPPPs-PT-002B-CTLFireability-13
FORMULA_NAME ShieldPPPs-PT-002B-CTLFireability-14
FORMULA_NAME ShieldPPPs-PT-002B-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679508291621

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=ShieldPPPs-PT-002B
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 18:04:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 18:04:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 18:04:54] [INFO ] Load time of PNML (sax parser for PT used): 46 ms
[2023-03-22 18:04:54] [INFO ] Transformed 139 places.
[2023-03-22 18:04:54] [INFO ] Transformed 129 transitions.
[2023-03-22 18:04:54] [INFO ] Found NUPN structural information;
[2023-03-22 18:04:54] [INFO ] Parsed PT model containing 139 places and 129 transitions and 354 arcs in 272 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Support contains 87 out of 139 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 139/139 places, 129/129 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 138 transition count 128
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 138 transition count 128
Applied a total of 2 rules in 22 ms. Remains 138 /139 variables (removed 1) and now considering 128/129 (removed 1) transitions.
// Phase 1: matrix 128 rows 138 cols
[2023-03-22 18:04:55] [INFO ] Computed 23 place invariants in 21 ms
[2023-03-22 18:04:55] [INFO ] Implicit Places using invariants in 463 ms returned []
[2023-03-22 18:04:55] [INFO ] Invariant cache hit.
[2023-03-22 18:04:55] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 790 ms to find 0 implicit places.
[2023-03-22 18:04:55] [INFO ] Invariant cache hit.
[2023-03-22 18:04:56] [INFO ] Dead Transitions using invariants and state equation in 318 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 138/139 places, 128/129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1137 ms. Remains : 138/139 places, 128/129 transitions.
Support contains 87 out of 138 places after structural reductions.
[2023-03-22 18:04:56] [INFO ] Flatten gal took : 44 ms
[2023-03-22 18:04:56] [INFO ] Flatten gal took : 12 ms
[2023-03-22 18:04:56] [INFO ] Input system was already deterministic with 128 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 378 ms. (steps per millisecond=26 ) properties (out of 83) seen :78
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 2) seen :1
Running SMT prover for 1 properties.
[2023-03-22 18:04:57] [INFO ] Invariant cache hit.
[2023-03-22 18:04:57] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-22 18:04:57] [INFO ] [Nat]Absence check using 23 positive place invariants in 7 ms returned sat
[2023-03-22 18:04:57] [INFO ] After 257ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-22 18:04:57] [INFO ] Deduced a trap composed of 19 places in 128 ms of which 6 ms to minimize.
[2023-03-22 18:04:57] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 148 ms
[2023-03-22 18:04:57] [INFO ] After 409ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :0
[2023-03-22 18:04:57] [INFO ] After 504ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 16 simplifications.
FORMULA ShieldPPPs-PT-002B-CTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 18:04:57] [INFO ] Flatten gal took : 12 ms
[2023-03-22 18:04:57] [INFO ] Flatten gal took : 10 ms
[2023-03-22 18:04:57] [INFO ] Input system was already deterministic with 128 transitions.
Computed a total of 32 stabilizing places and 32 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 128/128 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 126 transition count 116
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 126 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 125 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 125 transition count 115
Applied a total of 26 rules in 11 ms. Remains 125 /138 variables (removed 13) and now considering 115/128 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 125/138 places, 115/128 transitions.
[2023-03-22 18:04:57] [INFO ] Flatten gal took : 5 ms
[2023-03-22 18:04:57] [INFO ] Flatten gal took : 5 ms
[2023-03-22 18:04:57] [INFO ] Input system was already deterministic with 115 transitions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 128/128 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 128 transition count 118
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 128 transition count 118
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 127 transition count 117
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 127 transition count 117
Applied a total of 22 rules in 10 ms. Remains 127 /138 variables (removed 11) and now considering 117/128 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 127/138 places, 117/128 transitions.
[2023-03-22 18:04:57] [INFO ] Flatten gal took : 5 ms
[2023-03-22 18:04:57] [INFO ] Flatten gal took : 5 ms
[2023-03-22 18:04:57] [INFO ] Input system was already deterministic with 117 transitions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 128/128 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 125 transition count 115
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 125 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 124 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 124 transition count 114
Applied a total of 28 rules in 7 ms. Remains 124 /138 variables (removed 14) and now considering 114/128 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 124/138 places, 114/128 transitions.
[2023-03-22 18:04:57] [INFO ] Flatten gal took : 5 ms
[2023-03-22 18:04:57] [INFO ] Flatten gal took : 5 ms
[2023-03-22 18:04:57] [INFO ] Input system was already deterministic with 114 transitions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 128/128 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 126 transition count 116
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 126 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 125 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 125 transition count 115
Applied a total of 26 rules in 5 ms. Remains 125 /138 variables (removed 13) and now considering 115/128 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 125/138 places, 115/128 transitions.
[2023-03-22 18:04:57] [INFO ] Flatten gal took : 5 ms
[2023-03-22 18:04:57] [INFO ] Flatten gal took : 5 ms
[2023-03-22 18:04:57] [INFO ] Input system was already deterministic with 115 transitions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 128/128 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 127 transition count 117
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 127 transition count 117
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 126 transition count 116
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 126 transition count 116
Applied a total of 24 rules in 5 ms. Remains 126 /138 variables (removed 12) and now considering 116/128 (removed 12) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 126/138 places, 116/128 transitions.
[2023-03-22 18:04:57] [INFO ] Flatten gal took : 5 ms
[2023-03-22 18:04:57] [INFO ] Flatten gal took : 5 ms
[2023-03-22 18:04:57] [INFO ] Input system was already deterministic with 116 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 138/138 places, 128/128 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 137 transition count 111
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 121 transition count 111
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 32 place count 121 transition count 101
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 52 place count 111 transition count 101
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 65 place count 98 transition count 88
Iterating global reduction 2 with 13 rules applied. Total rules applied 78 place count 98 transition count 88
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 78 place count 98 transition count 82
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 90 place count 92 transition count 82
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 142 place count 66 transition count 56
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 144 place count 64 transition count 54
Applied a total of 144 rules in 22 ms. Remains 64 /138 variables (removed 74) and now considering 54/128 (removed 74) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 64/138 places, 54/128 transitions.
[2023-03-22 18:04:57] [INFO ] Flatten gal took : 3 ms
[2023-03-22 18:04:57] [INFO ] Flatten gal took : 2 ms
[2023-03-22 18:04:57] [INFO ] Input system was already deterministic with 54 transitions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 128/128 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 128 transition count 118
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 128 transition count 118
Applied a total of 20 rules in 4 ms. Remains 128 /138 variables (removed 10) and now considering 118/128 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 128/138 places, 118/128 transitions.
[2023-03-22 18:04:57] [INFO ] Flatten gal took : 4 ms
[2023-03-22 18:04:57] [INFO ] Flatten gal took : 5 ms
[2023-03-22 18:04:57] [INFO ] Input system was already deterministic with 118 transitions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 128/128 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 126 transition count 116
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 126 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 125 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 125 transition count 115
Applied a total of 26 rules in 4 ms. Remains 125 /138 variables (removed 13) and now considering 115/128 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 125/138 places, 115/128 transitions.
[2023-03-22 18:04:58] [INFO ] Flatten gal took : 4 ms
[2023-03-22 18:04:58] [INFO ] Flatten gal took : 4 ms
[2023-03-22 18:04:58] [INFO ] Input system was already deterministic with 115 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 138/138 places, 128/128 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 137 transition count 111
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 121 transition count 111
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 32 place count 121 transition count 102
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 50 place count 112 transition count 102
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 63 place count 99 transition count 89
Iterating global reduction 2 with 13 rules applied. Total rules applied 76 place count 99 transition count 89
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 76 place count 99 transition count 83
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 88 place count 93 transition count 83
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 2 with 54 rules applied. Total rules applied 142 place count 66 transition count 56
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 144 place count 64 transition count 54
Applied a total of 144 rules in 12 ms. Remains 64 /138 variables (removed 74) and now considering 54/128 (removed 74) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 12 ms. Remains : 64/138 places, 54/128 transitions.
[2023-03-22 18:04:58] [INFO ] Flatten gal took : 2 ms
[2023-03-22 18:04:58] [INFO ] Flatten gal took : 3 ms
[2023-03-22 18:04:58] [INFO ] Input system was already deterministic with 54 transitions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 128/128 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 126 transition count 116
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 126 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 125 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 125 transition count 115
Applied a total of 26 rules in 4 ms. Remains 125 /138 variables (removed 13) and now considering 115/128 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 125/138 places, 115/128 transitions.
[2023-03-22 18:04:58] [INFO ] Flatten gal took : 5 ms
[2023-03-22 18:04:58] [INFO ] Flatten gal took : 5 ms
[2023-03-22 18:04:58] [INFO ] Input system was already deterministic with 115 transitions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 128/128 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 126 transition count 116
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 126 transition count 116
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 125 transition count 115
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 125 transition count 115
Applied a total of 26 rules in 5 ms. Remains 125 /138 variables (removed 13) and now considering 115/128 (removed 13) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 125/138 places, 115/128 transitions.
[2023-03-22 18:04:58] [INFO ] Flatten gal took : 4 ms
[2023-03-22 18:04:58] [INFO ] Flatten gal took : 5 ms
[2023-03-22 18:04:58] [INFO ] Input system was already deterministic with 115 transitions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 128/128 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 125 transition count 115
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 125 transition count 115
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 124 transition count 114
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 124 transition count 114
Applied a total of 28 rules in 5 ms. Remains 124 /138 variables (removed 14) and now considering 114/128 (removed 14) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 124/138 places, 114/128 transitions.
[2023-03-22 18:04:58] [INFO ] Flatten gal took : 4 ms
[2023-03-22 18:04:58] [INFO ] Flatten gal took : 4 ms
[2023-03-22 18:04:58] [INFO ] Input system was already deterministic with 114 transitions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 128/128 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 131 transition count 121
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 131 transition count 121
Applied a total of 14 rules in 3 ms. Remains 131 /138 variables (removed 7) and now considering 121/128 (removed 7) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 131/138 places, 121/128 transitions.
[2023-03-22 18:04:58] [INFO ] Flatten gal took : 4 ms
[2023-03-22 18:04:58] [INFO ] Flatten gal took : 5 ms
[2023-03-22 18:04:58] [INFO ] Input system was already deterministic with 121 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 138/138 places, 128/128 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 137 transition count 111
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 121 transition count 111
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 32 place count 121 transition count 101
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 52 place count 111 transition count 101
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 64 place count 99 transition count 89
Iterating global reduction 2 with 12 rules applied. Total rules applied 76 place count 99 transition count 89
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 76 place count 99 transition count 83
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 88 place count 93 transition count 83
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 144 place count 65 transition count 55
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 146 place count 63 transition count 53
Applied a total of 146 rules in 15 ms. Remains 63 /138 variables (removed 75) and now considering 53/128 (removed 75) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 63/138 places, 53/128 transitions.
[2023-03-22 18:04:58] [INFO ] Flatten gal took : 3 ms
[2023-03-22 18:04:58] [INFO ] Flatten gal took : 3 ms
[2023-03-22 18:04:58] [INFO ] Input system was already deterministic with 53 transitions.
Finished random walk after 121 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=60 )
FORMULA ShieldPPPs-PT-002B-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 128/128 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 131 transition count 121
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 131 transition count 121
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 130 transition count 120
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 130 transition count 120
Applied a total of 16 rules in 4 ms. Remains 130 /138 variables (removed 8) and now considering 120/128 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 130/138 places, 120/128 transitions.
[2023-03-22 18:04:58] [INFO ] Flatten gal took : 5 ms
[2023-03-22 18:04:58] [INFO ] Flatten gal took : 4 ms
[2023-03-22 18:04:58] [INFO ] Input system was already deterministic with 120 transitions.
[2023-03-22 18:04:58] [INFO ] Flatten gal took : 5 ms
[2023-03-22 18:04:58] [INFO ] Flatten gal took : 5 ms
[2023-03-22 18:04:58] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-22 18:04:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 138 places, 128 transitions and 352 arcs took 1 ms.
Total runtime 3642 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: 138 NrTr: 128 NrArc: 352)

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

net check time: 0m 0.000sec

init dd package: 0m 2.955sec


RS generation: 4m17.414sec


-> reachability set: #nodes 1169272 (1.2e+06) #states 7,985,180,862,975 (12)



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

checking: EX [EG [EF [[p117<=0 & 0<=p117]]]]
normalized: EX [EG [E [true U [p117<=0 & 0<=p117]]]]

abstracting: (0<=p117)
states: 7,985,180,862,975 (12)
abstracting: (p117<=0)
states: 7,985,180,518,239 (12)

EG iterations: 0

before gc: list nodes free: 29816

after gc: idd nodes used:2802006, unused:61197994; list nodes free:282423524
.-> the formula is TRUE

FORMULA ShieldPPPs-PT-002B-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m 2.081sec

checking: EG [[p76<=0 & 0<=p76]]
normalized: EG [[p76<=0 & 0<=p76]]

abstracting: (0<=p76)
states: 7,985,180,862,975 (12)
abstracting: (p76<=0)
states: 7,985,180,844,831 (12)
...............................
EG iterations: 31
-> the formula is FALSE

FORMULA ShieldPPPs-PT-002B-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m38.462sec

checking: AG [AF [EG [[p64<=1 & 1<=p64]]]]
normalized: ~ [E [true U EG [~ [EG [[p64<=1 & 1<=p64]]]]]]

abstracting: (1<=p64)
states: 923,246,359,564 (11)
abstracting: (p64<=1)
states: 7,985,180,862,975 (12)
....................
before gc: list nodes free: 1791668

after gc: idd nodes used:5017906, unused:58982094; list nodes free:273207962
............
before gc: list nodes free: 6014006

after gc: idd nodes used:6827073, unused:57172927; list nodes free:265205456
.MC time: 4m25.736sec

checking: ~ [A [EF [EG [AX [[p126<=1 & 1<=p126]]]] U [[p26<=1 & 1<=p26] & [[p41<=1 & 1<=p41] & ~ [[p126<=1 & 1<=p126]]]]]]
normalized: ~ [[~ [EG [~ [[[~ [[p126<=1 & 1<=p126]] & [p41<=1 & 1<=p41]] & [p26<=1 & 1<=p26]]]]] & ~ [E [~ [[[~ [[p126<=1 & 1<=p126]] & [p41<=1 & 1<=p41]] & [p26<=1 & 1<=p26]]] U [~ [E [true U EG [~ [EX [~ [[p126<=1 & 1<=p126]]]]]]] & ~ [[[~ [[p126<=1 & 1<=p126]] & [p41<=1 & 1<=p41]] & [p26<=1 & 1<=p26]]]]]]]]

abstracting: (1<=p26)
states: 2,288,464,229,161 (12)
abstracting: (p26<=1)
states: 7,985,180,862,975 (12)
abstracting: (1<=p41)
states: 977,865,497,934 (11)
abstracting: (p41<=1)
states: 7,985,180,862,975 (12)
abstracting: (1<=p126)
states: 344,736 (5)
abstracting: (p126<=1)
states: 7,985,180,862,975 (12)
abstracting: (1<=p126)
states: 344,736 (5)
abstracting: (p126<=1)
states: 7,985,180,862,975 (12)

before gc: list nodes free: 5058250

after gc: idd nodes used:5033296, unused:58966704; list nodes free:272512075
...
EG iterations: 2
MC time: 4m 3.016sec

checking: AF [EX [[[p81<=1 & 1<=p81] | ~ [E [~ [[[p80<=1 & 1<=p80] & [p129<=1 & 1<=p129]]] U [[p86<=1 & 1<=p86] & [p109<=1 & 1<=p109]]]]]]]
normalized: ~ [EG [~ [EX [[~ [E [~ [[[p129<=1 & 1<=p129] & [p80<=1 & 1<=p80]]] U [[p109<=1 & 1<=p109] & [p86<=1 & 1<=p86]]]] | [p81<=1 & 1<=p81]]]]]]

abstracting: (1<=p81)
states: 2,641,148,550,427 (12)
abstracting: (p81<=1)
states: 7,985,180,862,975 (12)
abstracting: (1<=p86)
states: 2,318,329,916,029 (12)
abstracting: (p86<=1)
states: 7,985,180,862,975 (12)
abstracting: (1<=p109)
states: 1,111,583,429,883 (12)
abstracting: (p109<=1)
states: 7,985,180,862,975 (12)
abstracting: (1<=p80)
states: 2,644,179,003,811 (12)
abstracting: (p80<=1)
states: 7,985,180,862,975 (12)
abstracting: (1<=p129)
states: 905,318,075,328 (11)
abstracting: (p129<=1)
states: 7,985,180,862,975 (12)

before gc: list nodes free: 130975

after gc: idd nodes used:2857431, unused:61142569; list nodes free:282844841
.......
before gc: list nodes free: 1603365

after gc: idd nodes used:4186112, unused:59813888; list nodes free:278911939
MC time: 3m43.605sec

checking: AF [[EX [[[[p86<=0 & 0<=p86] | [p110<=0 & 0<=p110]] & [EG [[p17<=1 & 1<=p17]] | EF [[p122<=1 & 1<=p122]]]]] & EG [AX [[[p26<=1 & 1<=p26] & [p44<=1 & 1<=p44]]]]]]
normalized: ~ [EG [~ [[EX [[[E [true U [p122<=1 & 1<=p122]] | EG [[p17<=1 & 1<=p17]]] & [[p110<=0 & 0<=p110] | [p86<=0 & 0<=p86]]]] & EG [~ [EX [~ [[[p44<=1 & 1<=p44] & [p26<=1 & 1<=p26]]]]]]]]]]

abstracting: (1<=p26)
states: 2,288,464,229,161 (12)
abstracting: (p26<=1)
states: 7,985,180,862,975 (12)
abstracting: (1<=p44)
states: 1,004,443,199,594 (12)
abstracting: (p44<=1)
states: 7,985,180,862,975 (12)
...
EG iterations: 2
abstracting: (0<=p86)
states: 7,985,180,862,975 (12)
abstracting: (p86<=0)
states: 5,666,850,946,946 (12)
abstracting: (0<=p110)
states: 7,985,180,862,975 (12)
abstracting: (p110<=0)
states: 6,853,037,950,702 (12)
abstracting: (1<=p17)
states: 1,126,357,326,503 (12)
abstracting: (p17<=1)
states: 7,985,180,862,975 (12)
.................................
before gc: list nodes free: 3206591

after gc: idd nodes used:4217076, unused:59782924; list nodes free:278799512
........................MC time: 3m24.036sec

checking: A [[p59<=1 & 1<=p59] U [AF [[p126<=1 & 1<=p126]] | [AG [E [~ [[p40<=1 & 1<=p40]] U [[p88<=1 & 1<=p88] & [p124<=1 & 1<=p124]]]] & [~ [AG [[[p8<=1 & 1<=p8] & [p111<=1 & 1<=p111]]]] | AF [AX [[p60<=1 & 1<=p60]]]]]]]
normalized: [~ [EG [~ [[[[~ [EG [EX [~ [[p60<=1 & 1<=p60]]]]] | E [true U ~ [[[p111<=1 & 1<=p111] & [p8<=1 & 1<=p8]]]]] & ~ [E [true U ~ [E [~ [[p40<=1 & 1<=p40]] U [[p124<=1 & 1<=p124] & [p88<=1 & 1<=p88]]]]]]] | ~ [EG [~ [[p126<=1 & 1<=p126]]]]]]]] & ~ [E [~ [[[[~ [EG [EX [~ [[p60<=1 & 1<=p60]]]]] | E [true U ~ [[[p111<=1 & 1<=p111] & [p8<=1 & 1<=p8]]]]] & ~ [E [true U ~ [E [~ [[p40<=1 & 1<=p40]] U [[p124<=1 & 1<=p124] & [p88<=1 & 1<=p88]]]]]]] | ~ [EG [~ [[p126<=1 & 1<=p126]]]]]] U [~ [[p59<=1 & 1<=p59]] & ~ [[[[~ [EG [EX [~ [[p60<=1 & 1<=p60]]]]] | E [true U ~ [[[p111<=1 & 1<=p111] & [p8<=1 & 1<=p8]]]]] & ~ [E [true U ~ [E [~ [[p40<=1 & 1<=p40]] U [[p124<=1 & 1<=p124] & [p88<=1 & 1<=p88]]]]]]] | ~ [EG [~ [[p126<=1 & 1<=p126]]]]]]]]]]

abstracting: (1<=p126)
states: 344,736 (5)
abstracting: (p126<=1)
states: 7,985,180,862,975 (12)

before gc: list nodes free: 5176915

after gc: idd nodes used:4940673, unused:59059327; list nodes free:275114542
.......................................................
EG iterations: 55
abstracting: (1<=p88)
states: 2,282,292,214,237 (12)
abstracting: (p88<=1)
states: 7,985,180,862,975 (12)
abstracting: (1<=p124)
states: 1,010,510,338,294 (12)
abstracting: (p124<=1)
states: 7,985,180,862,975 (12)
abstracting: (1<=p40)
states: 994,350,117,328 (11)
abstracting: (p40<=1)
states: 7,985,180,862,975 (12)
MC time: 3m 7.002sec

checking: E [EX [~ [[p51<=1 & 1<=p51]]] U A [[~ [[p72<=1 & 1<=p72]] & ~ [[[~ [[[p26<=1 & 1<=p26] & [p44<=1 & 1<=p44]]] | [[p28<=1 & 1<=p28] & [p68<=1 & 1<=p68]]] & EF [[[p93<=1 & 1<=p93] & [p110<=1 & 1<=p110]]]]]] U [p48<=1 & 1<=p48]]]
normalized: E [EX [~ [[p51<=1 & 1<=p51]]] U [~ [EG [~ [[p48<=1 & 1<=p48]]]] & ~ [E [~ [[p48<=1 & 1<=p48]] U [~ [[~ [[E [true U [[p110<=1 & 1<=p110] & [p93<=1 & 1<=p93]]] & [[[p68<=1 & 1<=p68] & [p28<=1 & 1<=p28]] | ~ [[[p44<=1 & 1<=p44] & [p26<=1 & 1<=p26]]]]]] & ~ [[p72<=1 & 1<=p72]]]] & ~ [[p48<=1 & 1<=p48]]]]]]]

abstracting: (1<=p48)
states: 2,627,296,861,716 (12)
abstracting: (p48<=1)
states: 7,985,180,862,975 (12)
abstracting: (1<=p72)
states: 567
abstracting: (p72<=1)
states: 7,985,180,862,975 (12)
abstracting: (1<=p26)
states: 2,288,464,229,161 (12)
abstracting: (p26<=1)
states: 7,985,180,862,975 (12)
abstracting: (1<=p44)
states: 1,004,443,199,594 (12)
abstracting: (p44<=1)
states: 7,985,180,862,975 (12)
abstracting: (1<=p28)
states: 2,329,301,276,956 (12)
abstracting: (p28<=1)
states: 7,985,180,862,975 (12)
abstracting: (1<=p68)
states: 851,048,680,148 (11)
abstracting: (p68<=1)
states: 7,985,180,862,975 (12)
abstracting: (1<=p93)
states: 2,306,692,471,959 (12)
abstracting: (p93<=1)
states: 7,985,180,862,975 (12)
abstracting: (1<=p110)
states: 1,132,142,912,273 (12)
abstracting: (p110<=1)
states: 7,985,180,862,975 (12)

before gc: list nodes free: 3262454

after gc: idd nodes used:6644809, unused:57355191; list nodes free:266994212
MC time: 2m52.024sec

checking: [E [[p77<=1 & 1<=p77] U EG [~ [EX [~ [[p40<=1 & 1<=p40]]]]]] | EG [[[EX [EF [[p43<=1 & 1<=p43]]] | EG [[[p59<=0 & 0<=p59] | [[p128<=0 & 0<=p128] | [[[p86<=0 & 0<=p86] | [p110<=0 & 0<=p110]] & [[p100<=0 & 0<=p100] | [p132<=0 & 0<=p132]]]]]]] | [[p11<=0 & 0<=p11] | [p6<=1 & 1<=p6]]]]]
normalized: [EG [[[[p6<=1 & 1<=p6] | [p11<=0 & 0<=p11]] | [EG [[[[[[p132<=0 & 0<=p132] | [p100<=0 & 0<=p100]] & [[p110<=0 & 0<=p110] | [p86<=0 & 0<=p86]]] | [p128<=0 & 0<=p128]] | [p59<=0 & 0<=p59]]] | EX [E [true U [p43<=1 & 1<=p43]]]]]] | E [[p77<=1 & 1<=p77] U EG [~ [EX [~ [[p40<=1 & 1<=p40]]]]]]]

abstracting: (1<=p40)
states: 994,350,117,328 (11)
abstracting: (p40<=1)
states: 7,985,180,862,975 (12)

before gc: list nodes free: 2467513

after gc: idd nodes used:9266815, unused:54733185; list nodes free:254959929
..
EG iterations: 1
abstracting: (1<=p77)
states: 72,576 (4)
abstracting: (p77<=1)
states: 7,985,180,862,975 (12)
abstracting: (1<=p43)
states: 988,482,591,999 (11)
abstracting: (p43<=1)
states: 7,985,180,862,975 (12)
MC time: 2m37.105sec

checking: [AF [[[p70<=1 & 1<=p70] & [A [~ [[[[p93<=1 & 1<=p93] & [p110<=1 & 1<=p110]] | [p128<=1 & 1<=p128]]] U [EF [[[p35<=1 & 1<=p35] & [p58<=1 & 1<=p58]]] | [p5<=1 & 1<=p5]]] | [EX [[[p35<=0 & 0<=p35] | [p55<=0 & 0<=p55]]] & [p9<=1 & 1<=p9]]]]] & AF [[[p102<=1 & 1<=p102] & [p124<=1 & 1<=p124]]]]
normalized: [~ [EG [~ [[[p124<=1 & 1<=p124] & [p102<=1 & 1<=p102]]]]] & ~ [EG [~ [[[[[p9<=1 & 1<=p9] & EX [[[p55<=0 & 0<=p55] | [p35<=0 & 0<=p35]]]] | [~ [EG [~ [[[p5<=1 & 1<=p5] | E [true U [[p58<=1 & 1<=p58] & [p35<=1 & 1<=p35]]]]]]] & ~ [E [~ [[[p5<=1 & 1<=p5] | E [true U [[p58<=1 & 1<=p58] & [p35<=1 & 1<=p35]]]]] U [[[p128<=1 & 1<=p128] | [[p110<=1 & 1<=p110] & [p93<=1 & 1<=p93]]] & ~ [[[p5<=1 & 1<=p5] | E [true U [[p58<=1 & 1<=p58] & [p35<=1 & 1<=p35]]]]]]]]]] & [p70<=1 & 1<=p70]]]]]]

abstracting: (1<=p70)
states: 867,074,868,284 (11)
abstracting: (p70<=1)
states: 7,985,180,862,975 (12)
abstracting: (1<=p35)
states: 2,263,828,236,751 (12)
abstracting: (p35<=1)
states: 7,985,180,862,975 (12)
abstracting: (1<=p58)
states: 979,392,782,672 (11)
abstracting: (p58<=1)
states: 7,985,180,862,975 (12)
MC time: 2m24.692sec

checking: AF [[[p34<=1 & 1<=p34] & [[p36<=1 & 1<=p36] & [[EX [[p14<=0 & 0<=p14]] | [~ [A [[p79<=1 & 1<=p79] U [[p20<=1 & 1<=p20] & [p22<=1 & 1<=p22]]]] | [p132<=0 & 0<=p132]]] | [[AG [[p67<=0 & 0<=p67]] & [[p76<=0 & 0<=p76] & [[p88<=0 & 0<=p88] | [p123<=0 & 0<=p123]]]] | [[[p39<=1 & 1<=p39] & [p90<=1 & 1<=p90]] | [[p7<=1 & 1<=p7] & [[p86<=0 & 0<=p86] | [p109<=0 & 0<=p109]]]]]]]]]
normalized: ~ [EG [~ [[[[[[[[[p109<=0 & 0<=p109] | [p86<=0 & 0<=p86]] & [p7<=1 & 1<=p7]] | [[p90<=1 & 1<=p90] & [p39<=1 & 1<=p39]]] | [[[[p123<=0 & 0<=p123] | [p88<=0 & 0<=p88]] & [p76<=0 & 0<=p76]] & ~ [E [true U ~ [[p67<=0 & 0<=p67]]]]]] | [[[p132<=0 & 0<=p132] | ~ [[~ [EG [~ [[[p22<=1 & 1<=p22] & [p20<=1 & 1<=p20]]]]] & ~ [E [~ [[[p22<=1 & 1<=p22] & [p20<=1 & 1<=p20]]] U [~ [[p79<=1 & 1<=p79]] & ~ [[[p22<=1 & 1<=p22] & [p20<=1 & 1<=p20]]]]]]]]] | EX [[p14<=0 & 0<=p14]]]] & [p36<=1 & 1<=p36]] & [p34<=1 & 1<=p34]]]]]

abstracting: (1<=p34)
states: 2,265,754,071,805 (12)
abstracting: (p34<=1)
states: 7,985,180,862,975 (12)
abstracting: (1<=p36)
states: 2,259,368,344,030 (12)
abstracting: (p36<=1)
states: 7,985,180,862,975 (12)
abstracting: (0<=p14)
states: 7,985,180,862,975 (12)
abstracting: (p14<=0)
states: 5,357,594,525,469 (12)

before gc: list nodes free: 6371682

after gc: idd nodes used:7289890, unused:56710110; list nodes free:264384726
.abstracting: (1<=p20)
states: 2,271,489,474,744 (12)
abstracting: (p20<=1)
states: 7,985,180,862,975 (12)
abstracting: (1<=p22)
states: 2,216,064,232,554 (12)
abstracting: (p22<=1)
states: 7,985,180,862,975 (12)
abstracting: (1<=p79)
states: 5,269,577,034 (9)
abstracting: (p79<=1)
states: 7,985,180,862,975 (12)
abstracting: (1<=p20)
states: 2,271,489,474,744 (12)
abstracting: (p20<=1)
states: 7,985,180,862,975 (12)
abstracting: (1<=p22)
states: 2,216,064,232,554 (12)
abstracting: (p22<=1)
states: 7,985,180,862,975 (12)
MC time: 2m12.757sec

checking: EX [[A [[p11<=1 & 1<=p11] U [AF [AG [[p118<=1 & 1<=p118]]] | [p132<=1 & 1<=p132]]] & [[A [[[p65<=1 & 1<=p65] | [p85<=1 & 1<=p85]] U [[p106<=1 & 1<=p106] & [p9<=1 & 1<=p9]]] | [AG [[[p100<=1 & 1<=p100] & [p132<=1 & 1<=p132]]] | AF [[p10<=1 & 1<=p10]]]] | [[p111<=1 & 1<=p111] | [[AG [EF [[p79<=0 & 0<=p79]]] & [[p32<=1 & 1<=p32] & [[p52<=1 & 1<=p52] | [p59<=1 & 1<=p59]]]] | [[p39<=1 & 1<=p39] & [p90<=1 & 1<=p90]]]]]]]
normalized: EX [[[[[[[p90<=1 & 1<=p90] & [p39<=1 & 1<=p39]] | [[[[p59<=1 & 1<=p59] | [p52<=1 & 1<=p52]] & [p32<=1 & 1<=p32]] & ~ [E [true U ~ [E [true U [p79<=0 & 0<=p79]]]]]]] | [p111<=1 & 1<=p111]] | [[~ [EG [~ [[p10<=1 & 1<=p10]]]] | ~ [E [true U ~ [[[p132<=1 & 1<=p132] & [p100<=1 & 1<=p100]]]]]] | [~ [EG [~ [[[p9<=1 & 1<=p9] & [p106<=1 & 1<=p106]]]]] & ~ [E [~ [[[p9<=1 & 1<=p9] & [p106<=1 & 1<=p106]]] U [~ [[[p85<=1 & 1<=p85] | [p65<=1 & 1<=p65]]] & ~ [[[p9<=1 & 1<=p9] & [p106<=1 & 1<=p106]]]]]]]]] & [~ [EG [~ [[[p132<=1 & 1<=p132] | ~ [EG [E [true U ~ [[p118<=1 & 1<=p118]]]]]]]]] & ~ [E [~ [[[p132<=1 & 1<=p132] | ~ [EG [E [true U ~ [[p118<=1 & 1<=p118]]]]]]] U [~ [[p11<=1 & 1<=p11]] & ~ [[[p132<=1 & 1<=p132] | ~ [EG [E [true U ~ [[p118<=1 & 1<=p118]]]]]]]]]]]]]

abstracting: (1<=p118)
states: 1,010,509,993,558 (12)
abstracting: (p118<=1)
states: 7,985,180,862,975 (12)

EG iterations: 0
abstracting: (1<=p132)
states: 876,983,922,908 (11)
abstracting: (p132<=1)
states: 7,985,180,862,975 (12)
abstracting: (1<=p11)
states: 60,714,928 (7)
abstracting: (p11<=1)
states: 7,985,180,862,975 (12)
abstracting: (1<=p118)
states: 1,010,509,993,558 (12)
abstracting: (p118<=1)
states: 7,985,180,862,975 (12)

EG iterations: 0
abstracting: (1<=p132)
states: 876,983,922,908 (11)
abstracting: (p132<=1)
states: 7,985,180,862,975 (12)
abstracting: (1<=p118)
states: 1,010,509,993,558 (12)
abstracting: (p118<=1)
states: 7,985,180,862,975 (12)

EG iterations: 0
abstracting: (1<=p132)
states: 876,983,922,908 (11)
abstracting: (p132<=1)
states: 7,985,180,862,975 (12)
MC time: 2m 1.732sec

checking: EF [[A [[A [EX [[p112<=1 & 1<=p112]] U [[p26<=1 & 1<=p26] & [[p41<=1 & 1<=p41] & [p112<=1 & 1<=p112]]]] | EG [[p131<=1 & 1<=p131]]] U [p64<=1 & 1<=p64]] | [[EX [EX [[p134<=1 & 1<=p134]]] & [EF [[[p102<=1 & 1<=p102] & [p121<=1 & 1<=p121]]] | [[p56<=1 & 1<=p56] | [p122<=1 & 1<=p122]]]] | [[AG [[p43<=1 & 1<=p43]] | A [[[p113<=1 & 1<=p113] & [p118<=1 & 1<=p118]] U AG [[p17<=1 & 1<=p17]]]] & [[[p21<=1 & 1<=p21] & [p57<=1 & 1<=p57]] | [~ [A [[p104<=1 & 1<=p104] U [[p34<=1 & 1<=p34] & [p36<=1 & 1<=p36]]]] & [A [[p55<=1 & 1<=p55] U [p24<=1 & 1<=p24]] & [[p88<=0 & 0<=p88] | [p124<=0 & 0<=p124]]]]]]]]]
normalized: E [true U [[[[[[[[p124<=0 & 0<=p124] | [p88<=0 & 0<=p88]] & [~ [EG [~ [[p24<=1 & 1<=p24]]]] & ~ [E [~ [[p24<=1 & 1<=p24]] U [~ [[p55<=1 & 1<=p55]] & ~ [[p24<=1 & 1<=p24]]]]]]] & ~ [[~ [EG [~ [[[p36<=1 & 1<=p36] & [p34<=1 & 1<=p34]]]]] & ~ [E [~ [[[p36<=1 & 1<=p36] & [p34<=1 & 1<=p34]]] U [~ [[p104<=1 & 1<=p104]] & ~ [[[p36<=1 & 1<=p36] & [p34<=1 & 1<=p34]]]]]]]]] | [[p57<=1 & 1<=p57] & [p21<=1 & 1<=p21]]] & [[~ [EG [E [true U ~ [[p17<=1 & 1<=p17]]]]] & ~ [E [E [true U ~ [[p17<=1 & 1<=p17]]] U [~ [[[p118<=1 & 1<=p118] & [p113<=1 & 1<=p113]]] & E [true U ~ [[p17<=1 & 1<=p17]]]]]]] | ~ [E [true U ~ [[p43<=1 & 1<=p43]]]]]] | [[[[p122<=1 & 1<=p122] | [p56<=1 & 1<=p56]] | E [true U [[p121<=1 & 1<=p121] & [p102<=1 & 1<=p102]]]] & EX [EX [[p134<=1 & 1<=p134]]]]] | [~ [EG [~ [[p64<=1 & 1<=p64]]]] & ~ [E [~ [[p64<=1 & 1<=p64]] U [~ [[EG [[p131<=1 & 1<=p131]] | [~ [EG [~ [[[[p112<=1 & 1<=p112] & [p41<=1 & 1<=p41]] & [p26<=1 & 1<=p26]]]]] & ~ [E [~ [[[[p112<=1 & 1<=p112] & [p41<=1 & 1<=p41]] & [p26<=1 & 1<=p26]]] U [~ [EX [[p112<=1 & 1<=p112]]] & ~ [[[[p112<=1 & 1<=p112] & [p41<=1 & 1<=p41]] & [p26<=1 & 1<=p26]]]]]]]]] & ~ [[p64<=1 & 1<=p64]]]]]]]]

abstracting: (1<=p64)
states: 923,246,359,564 (11)
abstracting: (p64<=1)
states: 7,985,180,862,975 (12)
abstracting: (1<=p26)
states: 2,288,464,229,161 (12)
abstracting: (p26<=1)
states: 7,985,180,862,975 (12)
abstracting: (1<=p41)
states: 977,865,497,934 (11)
abstracting: (p41<=1)
states: 7,985,180,862,975 (12)
abstracting: (1<=p112)
states: 49,928,753,725 (10)
abstracting: (p112<=1)
states: 7,985,180,862,975 (12)
abstracting: (1<=p112)
states: 49,928,753,725 (10)
abstracting: (p112<=1)
states: 7,985,180,862,975 (12)

before gc: list nodes free: 3948530

after gc: idd nodes used:9236358, unused:54763642; list nodes free:255271335
.abstracting: (1<=p26)
states: 2,288,464,229,161 (12)
abstracting: (p26<=1)
states: 7,985,180,862,975 (12)
abstracting: (1<=p41)
states: 977,865,497,934 (11)
abstracting: (p41<=1)
states: 7,985,180,862,975 (12)
abstracting: (1<=p112)
states: 49,928,753,725 (10)
abstracting: (p112<=1)
states: 7,985,180,862,975 (12)
MC time: 1m51.000sec

checking: [AX [AF [[[[AF [[[p21<=1 & 1<=p21] & [p57<=1 & 1<=p57]]] | E [[p46<=1 & 1<=p46] U [[p30<=1 & 1<=p30] & [p119<=1 & 1<=p119]]]] | [[p46<=1 & 1<=p46] | [p109<=1 & 1<=p109]]] & E [[[p127<=1 & 1<=p127] | [p61<=1 & 1<=p61]] U [[p35<=1 & 1<=p35] & [p55<=1 & 1<=p55]]]]]] & A [[~ [AX [[[p38<=1 & 1<=p38] | [[p82<=1 & 1<=p82] & [p116<=1 & 1<=p116]]]]] & [A [[p9<=1 & 1<=p9] U [p0<=1 & 1<=p0]] & [EX [[[p85<=1 & 1<=p85] & [[p66<=1 & 1<=p66] | [p76<=1 & 1<=p76]]]] | [EX [[p62<=1 & 1<=p62]] | EX [~ [[p75<=1 & 1<=p75]]]]]]] U [E [~ [[[p108<=1 & 1<=p108] & [[p55<=1 & 1<=p55] & ~ [[[p100<=1 & 1<=p100] & [p132<=1 & 1<=p132]]]]]] U [EF [[p114<=1 & 1<=p114]] & [[p65<=1 & 1<=p65] & [[p128<=1 & 1<=p128] | [p131<=1 & 1<=p131]]]]] & [[~ [[[[p34<=1 & 1<=p34] & [p36<=1 & 1<=p36]] | [p12<=1 & 1<=p12]]] & AF [[p65<=1 & 1<=p65]]] | [[p57<=1 & 1<=p57] | EX [[~ [[p24<=1 & 1<=p24]] & [p68<=1 & 1<=p68]]]]]]]]
normalized: [[~ [EG [~ [[[[EX [[[p68<=1 & 1<=p68] & ~ [[p24<=1 & 1<=p24]]]] | [p57<=1 & 1<=p57]] | [~ [EG [~ [[p65<=1 & 1<=p65]]]] & ~ [[[p12<=1 & 1<=p12] | [[p36<=1 & 1<=p36] & [p34<=1 & 1<=p34]]]]]] & E [~ [[[~ [[[p132<=1 & 1<=p132] & [p100<=1 & 1<=p100]]] & [p55<=1 & 1<=p55]] & [p108<=1 & 1<=p108]]] U [[[[p131<=1 & 1<=p131] | [p128<=1 & 1<=p128]] & [p65<=1 & 1<=p65]] & E [true U [p114<=1 & 1<=p114]]]]]]]] & ~ [E [~ [[[[EX [[[p68<=1 & 1<=p68] & ~ [[p24<=1 & 1<=p24]]]] | [p57<=1 & 1<=p57]] | [~ [EG [~ [[p65<=1 & 1<=p65]]]] & ~ [[[p12<=1 & 1<=p12] | [[p36<=1 & 1<=p36] & [p34<=1 & 1<=p34]]]]]] & E [~ [[[~ [[[p132<=1 & 1<=p132] & [p100<=1 & 1<=p100]]] & [p55<=1 & 1<=p55]] & [p108<=1 & 1<=p108]]] U [[[[p131<=1 & 1<=p131] | [p128<=1 & 1<=p128]] & [p65<=1 & 1<=p65]] & E [true U [p114<=1 & 1<=p114]]]]]] U [~ [[[[[EX [~ [[p75<=1 & 1<=p75]]] | EX [[p62<=1 & 1<=p62]]] | EX [[[[p76<=1 & 1<=p76] | [p66<=1 & 1<=p66]] & [p85<=1 & 1<=p85]]]] & [~ [EG [~ [[p0<=1 & 1<=p0]]]] & ~ [E [~ [[p0<=1 & 1<=p0]] U [~ [[p9<=1 & 1<=p9]] & ~ [[p0<=1 & 1<=p0]]]]]]] & EX [~ [[[[p116<=1 & 1<=p116] & [p82<=1 & 1<=p82]] | [p38<=1 & 1<=p38]]]]]] & ~ [[[[EX [[[p68<=1 & 1<=p68] & ~ [[p24<=1 & 1<=p24]]]] | [p57<=1 & 1<=p57]] | [~ [EG [~ [[p65<=1 & 1<=p65]]]] & ~ [[[p12<=1 & 1<=p12] | [[p36<=1 & 1<=p36] & [p34<=1 & 1<=p34]]]]]] & E [~ [[[~ [[[p132<=1 & 1<=p132] & [p100<=1 & 1<=p100]]] & [p55<=1 & 1<=p55]] & [p108<=1 & 1<=p108]]] U [[[[p131<=1 & 1<=p131] | [p128<=1 & 1<=p128]] & [p65<=1 & 1<=p65]] & E [true U [p114<=1 & 1<=p114]]]]]]]]]] & ~ [EX [EG [~ [[E [[[p61<=1 & 1<=p61] | [p127<=1 & 1<=p127]] U [[p55<=1 & 1<=p55] & [p35<=1 & 1<=p35]]] & [[[p109<=1 & 1<=p109] | [p46<=1 & 1<=p46]] | [E [[p46<=1 & 1<=p46] U [[p119<=1 & 1<=p119] & [p30<=1 & 1<=p30]]] | ~ [EG [~ [[[p57<=1 & 1<=p57] & [p21<=1 & 1<=p21]]]]]]]]]]]]]

abstracting: (1<=p21)
states: 2,321,397,883,557 (12)
abstracting: (p21<=1)
states: 7,985,180,862,975 (12)
abstracting: (1<=p57)
states: 971,309,239,699 (11)
abstracting: (p57<=1)
states: 7,985,180,862,975 (12)
.
EG iterations: 1
abstracting: (1<=p30)
states: 1,154,639,029,759 (12)
abstracting: (p30<=1)
states: 7,985,180,862,975 (12)
abstracting: (1<=p119)
states: 1,006,462,222,380 (12)
abstracting: (p119<=1)
states: 7,985,180,862,975 (12)
abstracting: (1<=p46)
states: 3,140,275,843 (9)
abstracting: (p46<=1)
states: 7,985,180,862,975 (12)

before gc: list nodes free: 1061121

after gc: idd nodes used:8761350, unused:55238650; list nodes free:257748019
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 5896500 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16098832 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//
++ 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
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

1937474 1463098
iterations count:218302 (1705), effective:20818 (162)

initing FirstDep: 0m 0.000sec


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

net_ddint.h:600: Timeout: after 264 sec


sat_reach.icc:155: Timeout: after 242 sec


iterations count:5244 (40), effective:424 (3)

net_ddint.h:600: Timeout: after 222 sec


net_ddint.h:600: Timeout: after 203 sec


sat_reach.icc:155: Timeout: after 186 sec


sat_reach.icc:155: Timeout: after 171 sec


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

sat_reach.icc:155: Timeout: after 156 sec


sat_reach.icc:155: Timeout: after 143 sec


sat_reach.icc:155: Timeout: after 131 sec


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

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

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

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

net_ddint.h:600: Timeout: after 120 sec


sat_reach.icc:155: Timeout: after 110 sec


sat_reach.icc:155: Timeout: after 101 sec

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="ShieldPPPs-PT-002B"
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 ShieldPPPs-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 r394-oct2-167903717800378"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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