About the Execution of Marcie+red for GPPP-PT-C0001N0000000010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5481.520 | 9355.00 | 13259.00 | 287.80 | FFFFFFTTFFTFFFFT | normal |
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.r170-tall-167838857700778.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 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 GPPP-PT-C0001N0000000010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857700778
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 556K
-rw-r--r-- 1 mcc users 8.7K Feb 26 10:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 100K Feb 26 10:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Feb 26 10:35 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 10:35 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:09 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.9K Feb 25 16:09 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 104K Feb 26 10:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 18K Feb 26 10:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 132K Feb 26 10:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:09 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:09 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1 Mar 5 18:22 large_marking
-rw-r--r-- 1 mcc users 21K Mar 5 18:22 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 GPPP-PT-C0001N0000000010-CTLFireability-00
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLFireability-01
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLFireability-02
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLFireability-03
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLFireability-04
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLFireability-05
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLFireability-06
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLFireability-07
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLFireability-08
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLFireability-09
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLFireability-10
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLFireability-11
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLFireability-12
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLFireability-13
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLFireability-14
FORMULA_NAME GPPP-PT-C0001N0000000010-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678638748967
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=GPPP-PT-C0001N0000000010
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 16:32:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 16:32:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 16:32:30] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2023-03-12 16:32:30] [INFO ] Transformed 33 places.
[2023-03-12 16:32:30] [INFO ] Transformed 22 transitions.
[2023-03-12 16:32:30] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 79 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 9 ms.
Initial state reduction rules removed 2 formulas.
FORMULA GPPP-PT-C0001N0000000010-CTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000010-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 9 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 16:32:30] [INFO ] Computed 13 place invariants in 14 ms
[2023-03-12 16:32:31] [INFO ] Dead Transitions using invariants and state equation in 365 ms found 0 transitions.
[2023-03-12 16:32:31] [INFO ] Invariant cache hit.
[2023-03-12 16:32:31] [INFO ] Implicit Places using invariants in 35 ms returned []
[2023-03-12 16:32:31] [INFO ] Invariant cache hit.
[2023-03-12 16:32:31] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
[2023-03-12 16:32:31] [INFO ] Invariant cache hit.
[2023-03-12 16:32:31] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 533 ms. Remains : 33/33 places, 22/22 transitions.
Support contains 33 out of 33 places after structural reductions.
[2023-03-12 16:32:31] [INFO ] Flatten gal took : 17 ms
[2023-03-12 16:32:31] [INFO ] Flatten gal took : 6 ms
[2023-03-12 16:32:31] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 10005 steps, including 2 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 40) seen :36
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 107 ms. (steps per millisecond=93 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-12 16:32:31] [INFO ] Invariant cache hit.
[2023-03-12 16:32:32] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2023-03-12 16:32:32] [INFO ] [Real]Absence check using 6 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-12 16:32:32] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 4 atomic propositions for a total of 14 simplifications.
FORMULA GPPP-PT-C0001N0000000010-CTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000010-CTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0001N0000000010-CTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 16:32:32] [INFO ] Flatten gal took : 4 ms
[2023-03-12 16:32:32] [INFO ] Flatten gal took : 4 ms
[2023-03-12 16:32:32] [INFO ] Input system was already deterministic with 22 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 22/22 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 33 transition count 21
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 32 transition count 21
Applied a total of 2 rules in 6 ms. Remains 32 /33 variables (removed 1) and now considering 21/22 (removed 1) transitions.
// Phase 1: matrix 21 rows 32 cols
[2023-03-12 16:32:32] [INFO ] Computed 13 place invariants in 5 ms
[2023-03-12 16:32:32] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 51 ms. Remains : 32/33 places, 21/22 transitions.
[2023-03-12 16:32:32] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:32:32] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:32:32] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 16:32:32] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-12 16:32:32] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 16:32:32] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:32:32] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:32:32] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 16:32:32] [INFO ] Invariant cache hit.
[2023-03-12 16:32:32] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 16:32:32] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:32:32] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:32:32] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
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 5 place count 30 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 25 transition count 16
Applied a total of 13 rules in 9 ms. Remains 25 /33 variables (removed 8) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 25 cols
[2023-03-12 16:32:32] [INFO ] Computed 11 place invariants in 4 ms
[2023-03-12 16:32:32] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 42 ms. Remains : 25/33 places, 16/22 transitions.
[2023-03-12 16:32:32] [INFO ] Flatten gal took : 1 ms
[2023-03-12 16:32:32] [INFO ] Flatten gal took : 1 ms
[2023-03-12 16:32:32] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 3 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 8 place count 28 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 11 place count 26 transition count 17
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 13 place count 25 transition count 16
Applied a total of 13 rules in 5 ms. Remains 25 /33 variables (removed 8) and now considering 16/22 (removed 6) transitions.
// Phase 1: matrix 16 rows 25 cols
[2023-03-12 16:32:32] [INFO ] Computed 11 place invariants in 0 ms
[2023-03-12 16:32:32] [INFO ] Dead Transitions using invariants and state equation in 25 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 30 ms. Remains : 25/33 places, 16/22 transitions.
[2023-03-12 16:32:32] [INFO ] Flatten gal took : 1 ms
[2023-03-12 16:32:32] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:32:32] [INFO ] Input system was already deterministic with 16 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 16:32:32] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-12 16:32:32] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 16:32:32] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:32:32] [INFO ] Flatten gal took : 3 ms
[2023-03-12 16:32:32] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 16:32:32] [INFO ] Invariant cache hit.
[2023-03-12 16:32:32] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 16:32:32] [INFO ] Flatten gal took : 1 ms
[2023-03-12 16:32:32] [INFO ] Flatten gal took : 1 ms
[2023-03-12 16:32:32] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 22/22 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 33 transition count 21
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 32 transition count 21
Applied a total of 2 rules in 2 ms. Remains 32 /33 variables (removed 1) and now considering 21/22 (removed 1) transitions.
// Phase 1: matrix 21 rows 32 cols
[2023-03-12 16:32:32] [INFO ] Computed 13 place invariants in 0 ms
[2023-03-12 16:32:32] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 40 ms. Remains : 32/33 places, 21/22 transitions.
[2023-03-12 16:32:32] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:32:32] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:32:32] [INFO ] Input system was already deterministic with 21 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
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 5 place count 30 transition count 19
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 7 place count 29 transition count 18
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 9 place count 28 transition count 17
Applied a total of 9 rules in 5 ms. Remains 28 /33 variables (removed 5) and now considering 17/22 (removed 5) transitions.
// Phase 1: matrix 17 rows 28 cols
[2023-03-12 16:32:32] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-12 16:32:32] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31 ms. Remains : 28/33 places, 17/22 transitions.
[2023-03-12 16:32:32] [INFO ] Flatten gal took : 1 ms
[2023-03-12 16:32:32] [INFO ] Flatten gal took : 1 ms
[2023-03-12 16:32:32] [INFO ] Input system was already deterministic with 17 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 16:32:32] [INFO ] Computed 13 place invariants in 1 ms
[2023-03-12 16:32:32] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 16:32:32] [INFO ] Flatten gal took : 1 ms
[2023-03-12 16:32:32] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:32:32] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 16:32:32] [INFO ] Invariant cache hit.
[2023-03-12 16:32:32] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 16:32:32] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:32:32] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:32:32] [INFO ] Input system was already deterministic with 22 transitions.
[2023-03-12 16:32:32] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:32:32] [INFO ] Flatten gal took : 2 ms
[2023-03-12 16:32:32] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLFireability.sr.xml took 1 ms.
[2023-03-12 16:32:32] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 33 places, 22 transitions and 83 arcs took 0 ms.
Total runtime 2109 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: 33 NrTr: 22 NrArc: 83)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 2.716sec
RS generation: 0m 0.009sec
-> reachability set: #nodes 1088 (1.1e+03) #states 1,655,346 (6)
starting MCC model checker
--------------------------
checking: AG [AF [p7<=1]]
normalized: ~ [E [true U EG [~ [p7<=1]]]]
abstracting: (p7<=1)
states: 150,486 (5)
.
EG iterations: 1
-> the formula is FALSE
FORMULA GPPP-PT-C0001N0000000010-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.010sec
checking: EF [AG [~ [E [[1<=p9 & 1<=p13] U p24<=0]]]]
normalized: E [true U ~ [E [true U E [[1<=p9 & 1<=p13] U p24<=0]]]]
abstracting: (p24<=0)
states: 1,655,115 (6)
abstracting: (1<=p13)
states: 374,220 (5)
abstracting: (1<=p9)
states: 100,023 (5)
-> the formula is FALSE
FORMULA GPPP-PT-C0001N0000000010-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AG [[p20<=0 | EF [[1<=p3 & 1<=p23]]]]
normalized: ~ [E [true U ~ [[E [true U [1<=p3 & 1<=p23]] | p20<=0]]]]
abstracting: (p20<=0)
states: 954,954 (5)
abstracting: (1<=p23)
states: 700,392 (5)
abstracting: (1<=p3)
states: 1,568,028 (6)
-> the formula is TRUE
FORMULA GPPP-PT-C0001N0000000010-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.008sec
checking: EX [[AG [1<=p17] | [1<=p5 & 1<=p6]]]
normalized: EX [[[1<=p5 & 1<=p6] | ~ [E [true U ~ [1<=p17]]]]]
abstracting: (1<=p17)
states: 714,252 (5)
abstracting: (1<=p6)
states: 1,504,860 (6)
abstracting: (1<=p5)
states: 1,576,520 (6)
.-> the formula is FALSE
FORMULA GPPP-PT-C0001N0000000010-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AX [~ [E [[1<=p12 | ~ [A [[1<=p9 & 1<=p10] U [1<=p19 & 1<=p22]]]] U [[1<=p0 & 1<=p2] & [1<=p12 & 1<=p32]]]]]
normalized: ~ [EX [E [[~ [[~ [EG [~ [[1<=p19 & 1<=p22]]]] & ~ [E [~ [[1<=p19 & 1<=p22]] U [~ [[1<=p9 & 1<=p10]] & ~ [[1<=p19 & 1<=p22]]]]]]] | 1<=p12] U [[1<=p12 & 1<=p32] & [1<=p0 & 1<=p2]]]]]
abstracting: (1<=p2)
states: 1,655,346 (6)
abstracting: (1<=p0)
states: 1,472,163 (6)
abstracting: (1<=p32)
states: 1,440,516 (6)
abstracting: (1<=p12)
states: 714,252 (5)
abstracting: (1<=p12)
states: 714,252 (5)
abstracting: (1<=p22)
states: 700,392 (5)
abstracting: (1<=p19)
states: 1,653,267 (6)
abstracting: (1<=p10)
states: 11,550 (4)
abstracting: (1<=p9)
states: 100,023 (5)
abstracting: (1<=p22)
states: 700,392 (5)
abstracting: (1<=p19)
states: 1,653,267 (6)
abstracting: (1<=p22)
states: 700,392 (5)
abstracting: (1<=p19)
states: 1,653,267 (6)
..................................................................
EG iterations: 66
.-> the formula is FALSE
FORMULA GPPP-PT-C0001N0000000010-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.034sec
checking: EF [[~ [A [AX [[1<=p8 & 2<=p29]] U [E [1<=p12 U [7<=p1 & 7<=p25]] & [1<=p15 & 3<=p27]]]] & [AF [[[1<=p0 & [1<=p2 & 1<=p12]] & [1<=p32 & [1<=p8 & 1<=p30]]]] & 1<=p24]]]
normalized: E [true U [[~ [EG [~ [[[[1<=p8 & 1<=p30] & 1<=p32] & [[1<=p2 & 1<=p12] & 1<=p0]]]]] & 1<=p24] & ~ [[~ [EG [~ [[[1<=p15 & 3<=p27] & E [1<=p12 U [7<=p1 & 7<=p25]]]]]] & ~ [E [~ [[[1<=p15 & 3<=p27] & E [1<=p12 U [7<=p1 & 7<=p25]]]] U [EX [~ [[1<=p8 & 2<=p29]]] & ~ [[[1<=p15 & 3<=p27] & E [1<=p12 U [7<=p1 & 7<=p25]]]]]]]]]]]
abstracting: (7<=p25)
states: 231
abstracting: (7<=p1)
states: 1,655,346 (6)
abstracting: (1<=p12)
states: 714,252 (5)
abstracting: (3<=p27)
states: 1,446,060 (6)
abstracting: (1<=p15)
states: 107,877 (5)
abstracting: (2<=p29)
states: 1,358,742 (6)
abstracting: (1<=p8)
states: 106,953 (5)
.abstracting: (7<=p25)
states: 231
abstracting: (7<=p1)
states: 1,655,346 (6)
abstracting: (1<=p12)
states: 714,252 (5)
abstracting: (3<=p27)
states: 1,446,060 (6)
abstracting: (1<=p15)
states: 107,877 (5)
abstracting: (7<=p25)
states: 231
abstracting: (7<=p1)
states: 1,655,346 (6)
abstracting: (1<=p12)
states: 714,252 (5)
abstracting: (3<=p27)
states: 1,446,060 (6)
abstracting: (1<=p15)
states: 107,877 (5)
EG iterations: 0
abstracting: (1<=p24)
states: 231
abstracting: (1<=p0)
states: 1,472,163 (6)
abstracting: (1<=p12)
states: 714,252 (5)
abstracting: (1<=p2)
states: 1,655,346 (6)
abstracting: (1<=p32)
states: 1,440,516 (6)
abstracting: (1<=p30)
states: 296,604 (5)
abstracting: (1<=p8)
states: 106,953 (5)
.
EG iterations: 1
-> the formula is FALSE
FORMULA GPPP-PT-C0001N0000000010-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: E [EF [[AG [E [1<=p17 U [1<=p5 & 1<=p6]]] | [1<=p8 & 1<=p30]]] U [EG [[AG [[1<=p9 & 1<=p13]] | [[EG [1<=p24] & AG [[1<=p3 & 1<=p23]]] | [1<=p19 & 1<=p22]]]] | [1<=p16 & EF [EG [AF [1<=p16]]]]]]
normalized: E [E [true U [[1<=p8 & 1<=p30] | ~ [E [true U ~ [E [1<=p17 U [1<=p5 & 1<=p6]]]]]]] U [[1<=p16 & E [true U EG [~ [EG [~ [1<=p16]]]]]] | EG [[[[1<=p19 & 1<=p22] | [~ [E [true U ~ [[1<=p3 & 1<=p23]]]] & EG [1<=p24]]] | ~ [E [true U ~ [[1<=p9 & 1<=p13]]]]]]]]
abstracting: (1<=p13)
states: 374,220 (5)
abstracting: (1<=p9)
states: 100,023 (5)
abstracting: (1<=p24)
states: 231
....................................................
EG iterations: 52
abstracting: (1<=p23)
states: 700,392 (5)
abstracting: (1<=p3)
states: 1,568,028 (6)
abstracting: (1<=p22)
states: 700,392 (5)
abstracting: (1<=p19)
states: 1,653,267 (6)
..................................................................................
EG iterations: 82
abstracting: (1<=p16)
states: 285,516 (5)
.............................................................................
EG iterations: 77
..............................................................................
EG iterations: 78
abstracting: (1<=p16)
states: 285,516 (5)
abstracting: (1<=p6)
states: 1,504,860 (6)
abstracting: (1<=p5)
states: 1,576,520 (6)
abstracting: (1<=p17)
states: 714,252 (5)
abstracting: (1<=p30)
states: 296,604 (5)
abstracting: (1<=p8)
states: 106,953 (5)
-> the formula is TRUE
FORMULA GPPP-PT-C0001N0000000010-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.108sec
checking: AX [[AF [EG [E [1<=p17 U [7<=p1 & 7<=p25]]]] & E [[~ [[1<=p17 | [[1<=p9 & 1<=p10] | [[1<=p9 & 1<=p13] & [1<=p8 & 2<=p29]]]]] | [7<=p1 & 7<=p25]] U [[1<=p5 & 1<=p6] | [~ [[1<=p1 & 1<=p26]] & [1<=p9 & 1<=p13]]]]]]
normalized: ~ [EX [~ [[E [[[7<=p1 & 7<=p25] | ~ [[1<=p17 | [[[1<=p8 & 2<=p29] & [1<=p9 & 1<=p13]] | [1<=p9 & 1<=p10]]]]] U [[[1<=p9 & 1<=p13] & ~ [[1<=p1 & 1<=p26]]] | [1<=p5 & 1<=p6]]] & ~ [EG [~ [EG [E [1<=p17 U [7<=p1 & 7<=p25]]]]]]]]]]
abstracting: (7<=p25)
states: 231
abstracting: (7<=p1)
states: 1,655,346 (6)
abstracting: (1<=p17)
states: 714,252 (5)
....................................................
EG iterations: 52
EG iterations: 0
abstracting: (1<=p6)
states: 1,504,860 (6)
abstracting: (1<=p5)
states: 1,576,520 (6)
abstracting: (1<=p26)
states: 107,877 (5)
abstracting: (1<=p1)
states: 1,655,346 (6)
abstracting: (1<=p13)
states: 374,220 (5)
abstracting: (1<=p9)
states: 100,023 (5)
abstracting: (1<=p10)
states: 11,550 (4)
abstracting: (1<=p9)
states: 100,023 (5)
abstracting: (1<=p13)
states: 374,220 (5)
abstracting: (1<=p9)
states: 100,023 (5)
abstracting: (2<=p29)
states: 1,358,742 (6)
abstracting: (1<=p8)
states: 106,953 (5)
abstracting: (1<=p17)
states: 714,252 (5)
abstracting: (7<=p25)
states: 231
abstracting: (7<=p1)
states: 1,655,346 (6)
.-> the formula is FALSE
FORMULA GPPP-PT-C0001N0000000010-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.009sec
checking: EG [E [A [~ [[EF [[1<=p9 & 1<=p10]] | [1<=p8 & [1<=p30 & 1<=p17]]]] U A [[[1<=p0 & [1<=p2 & 1<=p12]] & [1<=p32 & [1<=p19 & 1<=p22]]] U ~ [[1<=p1 & 1<=p14]]]] U [~ [EF [[1<=p1 & [1<=p26 & 1<=p17]]]] | [2<=p7 | [1<=p3 & 1<=p23]]]]]
normalized: EG [E [[~ [EG [~ [[~ [EG [[1<=p1 & 1<=p14]]] & ~ [E [[1<=p1 & 1<=p14] U [~ [[[1<=p32 & [1<=p19 & 1<=p22]] & [1<=p0 & [1<=p2 & 1<=p12]]]] & [1<=p1 & 1<=p14]]]]]]]] & ~ [E [~ [[~ [EG [[1<=p1 & 1<=p14]]] & ~ [E [[1<=p1 & 1<=p14] U [~ [[[1<=p32 & [1<=p19 & 1<=p22]] & [1<=p0 & [1<=p2 & 1<=p12]]]] & [1<=p1 & 1<=p14]]]]]] U [[[1<=p8 & [1<=p30 & 1<=p17]] | E [true U [1<=p9 & 1<=p10]]] & ~ [[~ [EG [[1<=p1 & 1<=p14]]] & ~ [E [[1<=p1 & 1<=p14] U [~ [[[1<=p32 & [1<=p19 & 1<=p22]] & [1<=p0 & [1<=p2 & 1<=p12]]]] & [1<=p1 & 1<=p14]]]]]]]]]] U [[2<=p7 | [1<=p3 & 1<=p23]] | ~ [E [true U [1<=p1 & [1<=p26 & 1<=p17]]]]]]]
abstracting: (1<=p17)
states: 714,252 (5)
abstracting: (1<=p26)
states: 107,877 (5)
abstracting: (1<=p1)
states: 1,655,346 (6)
abstracting: (1<=p23)
states: 700,392 (5)
abstracting: (1<=p3)
states: 1,568,028 (6)
abstracting: (2<=p7)
states: 1,504,860 (6)
abstracting: (1<=p14)
states: 285,516 (5)
abstracting: (1<=p1)
states: 1,655,346 (6)
abstracting: (1<=p12)
states: 714,252 (5)
abstracting: (1<=p2)
states: 1,655,346 (6)
abstracting: (1<=p0)
states: 1,472,163 (6)
abstracting: (1<=p22)
states: 700,392 (5)
abstracting: (1<=p19)
states: 1,653,267 (6)
abstracting: (1<=p32)
states: 1,440,516 (6)
abstracting: (1<=p14)
states: 285,516 (5)
abstracting: (1<=p1)
states: 1,655,346 (6)
abstracting: (1<=p14)
states: 285,516 (5)
abstracting: (1<=p1)
states: 1,655,346 (6)
.............................................................................
EG iterations: 77
abstracting: (1<=p10)
states: 11,550 (4)
abstracting: (1<=p9)
states: 100,023 (5)
abstracting: (1<=p17)
states: 714,252 (5)
abstracting: (1<=p30)
states: 296,604 (5)
abstracting: (1<=p8)
states: 106,953 (5)
abstracting: (1<=p14)
states: 285,516 (5)
abstracting: (1<=p1)
states: 1,655,346 (6)
abstracting: (1<=p12)
states: 714,252 (5)
abstracting: (1<=p2)
states: 1,655,346 (6)
abstracting: (1<=p0)
states: 1,472,163 (6)
abstracting: (1<=p22)
states: 700,392 (5)
abstracting: (1<=p19)
states: 1,653,267 (6)
abstracting: (1<=p32)
states: 1,440,516 (6)
abstracting: (1<=p14)
states: 285,516 (5)
abstracting: (1<=p1)
states: 1,655,346 (6)
abstracting: (1<=p14)
states: 285,516 (5)
abstracting: (1<=p1)
states: 1,655,346 (6)
.............................................................................
EG iterations: 77
abstracting: (1<=p14)
states: 285,516 (5)
abstracting: (1<=p1)
states: 1,655,346 (6)
abstracting: (1<=p12)
states: 714,252 (5)
abstracting: (1<=p2)
states: 1,655,346 (6)
abstracting: (1<=p0)
states: 1,472,163 (6)
abstracting: (1<=p22)
states: 700,392 (5)
abstracting: (1<=p19)
states: 1,653,267 (6)
abstracting: (1<=p32)
states: 1,440,516 (6)
abstracting: (1<=p14)
states: 285,516 (5)
abstracting: (1<=p1)
states: 1,655,346 (6)
abstracting: (1<=p14)
states: 285,516 (5)
abstracting: (1<=p1)
states: 1,655,346 (6)
.............................................................................
EG iterations: 77
.............................................................................
EG iterations: 77
....................................
EG iterations: 36
-> the formula is FALSE
FORMULA GPPP-PT-C0001N0000000010-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.068sec
checking: [EX [[[1<=p9 & 1<=p10] | [AX [1<=p20] | [[[7<=p1 & 7<=p25] | [1<=p1 & 1<=p14]] & AF [1<=p24]]]]] | [~ [E [E [[1<=p9 & 1<=p13] U E [[1<=p19 & 1<=p22] U [1<=p1 & 1<=p14]]] U E [AF [[1<=p5 & 1<=p6]] U [[1<=p19 & 1<=p22] | [1<=p8 & 2<=p29]]]]] | AX [[p3<=0 | p23<=0]]]]
normalized: [[~ [EX [~ [[p3<=0 | p23<=0]]]] | ~ [E [E [[1<=p9 & 1<=p13] U E [[1<=p19 & 1<=p22] U [1<=p1 & 1<=p14]]] U E [~ [EG [~ [[1<=p5 & 1<=p6]]]] U [[1<=p8 & 2<=p29] | [1<=p19 & 1<=p22]]]]]] | EX [[[[~ [EG [~ [1<=p24]]] & [[1<=p1 & 1<=p14] | [7<=p1 & 7<=p25]]] | ~ [EX [~ [1<=p20]]]] | [1<=p9 & 1<=p10]]]]
abstracting: (1<=p10)
states: 11,550 (4)
abstracting: (1<=p9)
states: 100,023 (5)
abstracting: (1<=p20)
states: 700,392 (5)
.abstracting: (7<=p25)
states: 231
abstracting: (7<=p1)
states: 1,655,346 (6)
abstracting: (1<=p14)
states: 285,516 (5)
abstracting: (1<=p1)
states: 1,655,346 (6)
abstracting: (1<=p24)
states: 231
.......................................................................................
EG iterations: 87
.abstracting: (1<=p22)
states: 700,392 (5)
abstracting: (1<=p19)
states: 1,653,267 (6)
abstracting: (2<=p29)
states: 1,358,742 (6)
abstracting: (1<=p8)
states: 106,953 (5)
abstracting: (1<=p6)
states: 1,504,860 (6)
abstracting: (1<=p5)
states: 1,576,520 (6)
................................
EG iterations: 32
abstracting: (1<=p14)
states: 285,516 (5)
abstracting: (1<=p1)
states: 1,655,346 (6)
abstracting: (1<=p22)
states: 700,392 (5)
abstracting: (1<=p19)
states: 1,653,267 (6)
abstracting: (1<=p13)
states: 374,220 (5)
abstracting: (1<=p9)
states: 100,023 (5)
abstracting: (p23<=0)
states: 954,954 (5)
abstracting: (p3<=0)
states: 87,318 (4)
.-> the formula is TRUE
FORMULA GPPP-PT-C0001N0000000010-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.073sec
checking: E [~ [[[2<=p7 | ~ [[1<=p11 & [1<=p12 & 7<=p31]]]] & [p20<=0 | ~ [[E [[1<=p18 & 1<=p19] U 1<=p24] & [1<=p18 & 1<=p19]]]]]] U A [E [[~ [[1<=p1 & 1<=p14]] | AX [[1<=p9 & 1<=p10]]] U 1<=p21] U [E [A [[1<=p9 & 1<=p10] U 1<=p12] U [1<=p9 & 1<=p13]] & ~ [[[A [1<=p12 U [1<=p19 & 1<=p22]] & p24<=0] & [1<=p1 & 1<=p14]]]]]]
normalized: E [~ [[[p20<=0 | ~ [[[1<=p18 & 1<=p19] & E [[1<=p18 & 1<=p19] U 1<=p24]]]] & [2<=p7 | ~ [[1<=p11 & [1<=p12 & 7<=p31]]]]]] U [~ [EG [~ [[~ [[[1<=p1 & 1<=p14] & [p24<=0 & [~ [EG [~ [[1<=p19 & 1<=p22]]]] & ~ [E [~ [[1<=p19 & 1<=p22]] U [~ [1<=p12] & ~ [[1<=p19 & 1<=p22]]]]]]]]] & E [[~ [EG [~ [1<=p12]]] & ~ [E [~ [1<=p12] U [~ [[1<=p9 & 1<=p10]] & ~ [1<=p12]]]]] U [1<=p9 & 1<=p13]]]]]] & ~ [E [~ [[~ [[[1<=p1 & 1<=p14] & [p24<=0 & [~ [EG [~ [[1<=p19 & 1<=p22]]]] & ~ [E [~ [[1<=p19 & 1<=p22]] U [~ [1<=p12] & ~ [[1<=p19 & 1<=p22]]]]]]]]] & E [[~ [EG [~ [1<=p12]]] & ~ [E [~ [1<=p12] U [~ [[1<=p9 & 1<=p10]] & ~ [1<=p12]]]]] U [1<=p9 & 1<=p13]]]] U [~ [E [[~ [EX [~ [[1<=p9 & 1<=p10]]]] | ~ [[1<=p1 & 1<=p14]]] U 1<=p21]] & ~ [[~ [[[1<=p1 & 1<=p14] & [p24<=0 & [~ [EG [~ [[1<=p19 & 1<=p22]]]] & ~ [E [~ [[1<=p19 & 1<=p22]] U [~ [1<=p12] & ~ [[1<=p19 & 1<=p22]]]]]]]]] & E [[~ [EG [~ [1<=p12]]] & ~ [E [~ [1<=p12] U [~ [[1<=p9 & 1<=p10]] & ~ [1<=p12]]]]] U [1<=p9 & 1<=p13]]]]]]]]]
abstracting: (1<=p13)
states: 374,220 (5)
abstracting: (1<=p9)
states: 100,023 (5)
abstracting: (1<=p12)
states: 714,252 (5)
abstracting: (1<=p10)
states: 11,550 (4)
abstracting: (1<=p9)
states: 100,023 (5)
abstracting: (1<=p12)
states: 714,252 (5)
abstracting: (1<=p12)
states: 714,252 (5)
.................................................................................................................
EG iterations: 113
abstracting: (1<=p22)
states: 700,392 (5)
abstracting: (1<=p19)
states: 1,653,267 (6)
abstracting: (1<=p12)
states: 714,252 (5)
abstracting: (1<=p22)
states: 700,392 (5)
abstracting: (1<=p19)
states: 1,653,267 (6)
abstracting: (1<=p22)
states: 700,392 (5)
abstracting: (1<=p19)
states: 1,653,267 (6)
..................................................................
EG iterations: 66
abstracting: (p24<=0)
states: 1,655,115 (6)
abstracting: (1<=p14)
states: 285,516 (5)
abstracting: (1<=p1)
states: 1,655,346 (6)
abstracting: (1<=p21)
states: 700,392 (5)
abstracting: (1<=p14)
states: 285,516 (5)
abstracting: (1<=p1)
states: 1,655,346 (6)
abstracting: (1<=p10)
states: 11,550 (4)
abstracting: (1<=p9)
states: 100,023 (5)
.abstracting: (1<=p13)
states: 374,220 (5)
abstracting: (1<=p9)
states: 100,023 (5)
abstracting: (1<=p12)
states: 714,252 (5)
abstracting: (1<=p10)
states: 11,550 (4)
abstracting: (1<=p9)
states: 100,023 (5)
abstracting: (1<=p12)
states: 714,252 (5)
abstracting: (1<=p12)
states: 714,252 (5)
.................................................................................................................
EG iterations: 113
abstracting: (1<=p22)
states: 700,392 (5)
abstracting: (1<=p19)
states: 1,653,267 (6)
abstracting: (1<=p12)
states: 714,252 (5)
abstracting: (1<=p22)
states: 700,392 (5)
abstracting: (1<=p19)
states: 1,653,267 (6)
abstracting: (1<=p22)
states: 700,392 (5)
abstracting: (1<=p19)
states: 1,653,267 (6)
..................................................................
EG iterations: 66
abstracting: (p24<=0)
states: 1,655,115 (6)
abstracting: (1<=p14)
states: 285,516 (5)
abstracting: (1<=p1)
states: 1,655,346 (6)
abstracting: (1<=p13)
states: 374,220 (5)
abstracting: (1<=p9)
states: 100,023 (5)
abstracting: (1<=p12)
states: 714,252 (5)
abstracting: (1<=p10)
states: 11,550 (4)
abstracting: (1<=p9)
states: 100,023 (5)
abstracting: (1<=p12)
states: 714,252 (5)
abstracting: (1<=p12)
states: 714,252 (5)
.................................................................................................................
EG iterations: 113
abstracting: (1<=p22)
states: 700,392 (5)
abstracting: (1<=p19)
states: 1,653,267 (6)
abstracting: (1<=p12)
states: 714,252 (5)
abstracting: (1<=p22)
states: 700,392 (5)
abstracting: (1<=p19)
states: 1,653,267 (6)
abstracting: (1<=p22)
states: 700,392 (5)
abstracting: (1<=p19)
states: 1,653,267 (6)
..................................................................
EG iterations: 66
abstracting: (p24<=0)
states: 1,655,115 (6)
abstracting: (1<=p14)
states: 285,516 (5)
abstracting: (1<=p1)
states: 1,655,346 (6)
...............................................................................................................
EG iterations: 111
abstracting: (7<=p31)
states: 214,830 (5)
abstracting: (1<=p12)
states: 714,252 (5)
abstracting: (1<=p11)
states: 7,392 (3)
abstracting: (2<=p7)
states: 1,504,860 (6)
abstracting: (1<=p24)
states: 231
abstracting: (1<=p19)
states: 1,653,267 (6)
abstracting: (1<=p18)
states: 700,392 (5)
abstracting: (1<=p19)
states: 1,653,267 (6)
abstracting: (1<=p18)
states: 700,392 (5)
abstracting: (p20<=0)
states: 954,954 (5)
-> the formula is FALSE
FORMULA GPPP-PT-C0001N0000000010-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.119sec
totally nodes used: 409421 (4.1e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 840068 760132 1600200
used/not used/entry size/cache size: 1104065 66004799 16 1024MB
basic ops cache: hits/miss/sum: 165733 168973 334706
used/not used/entry size/cache size: 344409 16432807 12 192MB
unary ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 8 128MB
abstract ops cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 16777216 12 192MB
state nr cache: hits/miss/sum: 4800 7706 12506
used/not used/entry size/cache size: 7705 8380903 32 256MB
max state cache: hits/miss/sum: 0 0 0
used/not used/entry size/cache size: 0 8388608 32 256MB
uniqueHash elements/entry size/size: 67108864 4 256MB
0 66724165
1 377766
2 5630
3 510
4 97
5 45
6 74
7 30
8 12
9 11
>= 10 524
Total processing time: 0m 4.796sec
BK_STOP 1678638758322
--------------------
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
iterations count:1795 (81), effective:420 (19)
initing FirstDep: 0m 0.000sec
iterations count:305 (13), effective:71 (3)
iterations count:22 (1), effective:0 (0)
iterations count:26 (1), effective:1 (0)
iterations count:168 (7), effective:32 (1)
iterations count:50 (2), effective:7 (0)
iterations count:29 (1), effective:1 (0)
iterations count:156 (7), effective:34 (1)
iterations count:22 (1), effective:0 (0)
iterations count:22 (1), effective:0 (0)
iterations count:22 (1), effective:0 (0)
iterations count:22 (1), effective:0 (0)
iterations count:29 (1), effective:1 (0)
iterations count:29 (1), effective:7 (0)
iterations count:310 (14), effective:74 (3)
iterations count:42 (1), effective:3 (0)
iterations count:70 (3), effective:17 (0)
iterations count:331 (15), effective:78 (3)
iterations count:243 (11), effective:64 (2)
iterations count:22 (1), effective:0 (0)
iterations count:213 (9), effective:51 (2)
iterations count:383 (17), effective:89 (4)
iterations count:38 (1), effective:4 (0)
iterations count:356 (16), effective:85 (3)
iterations count:38 (1), effective:4 (0)
iterations count:22 (1), effective:0 (0)
iterations count:38 (1), effective:4 (0)
iterations count:69 (3), effective:10 (0)
iterations count:144 (6), effective:32 (1)
iterations count:58 (2), effective:8 (0)
iterations count:52 (2), effective:7 (0)
iterations count:91 (4), effective:14 (0)
iterations count:22 (1), effective:0 (0)
iterations count:119 (5), effective:23 (1)
iterations count:91 (4), effective:10 (0)
iterations count:43 (1), effective:5 (0)
iterations count:22 (1), effective:0 (0)
iterations count:119 (5), effective:23 (1)
iterations count:91 (4), effective:10 (0)
iterations count:167 (7), effective:38 (1)
iterations count:22 (1), effective:0 (0)
iterations count:119 (5), effective:23 (1)
iterations count:91 (4), effective:10 (0)
iterations count:22 (1), effective:0 (0)
iterations count:22 (1), effective:0 (0)
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="GPPP-PT-C0001N0000000010"
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 GPPP-PT-C0001N0000000010, 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 r170-tall-167838857700778"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0001N0000000010.tgz
mv GPPP-PT-C0001N0000000010 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;