About the Execution of Marcie+red for GPPP-PT-C0010N0000000010
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 9070.880 | 70761.00 | 67427.00 | 5370.90 | FTTFTTTFFTTFTTTF | 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-167838857800818.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-C0010N0000000010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857800818
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.1K Feb 26 10:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 10:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 26 10:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 10:40 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.7K Feb 25 16:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 16:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 10:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 26 10:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:10 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-C0010N0000000010-CTLFireability-00
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLFireability-01
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLFireability-02
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLFireability-03
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLFireability-04
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLFireability-05
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLFireability-06
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLFireability-07
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLFireability-08
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLFireability-09
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLFireability-10
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLFireability-11
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLFireability-12
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLFireability-13
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLFireability-14
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1678642105059
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-C0010N0000000010
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 17:28:26] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 17:28:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 17:28:26] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2023-03-12 17:28:26] [INFO ] Transformed 33 places.
[2023-03-12 17:28:26] [INFO ] Transformed 22 transitions.
[2023-03-12 17:28:26] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 81 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
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 17:28:26] [INFO ] Computed 12 place invariants in 9 ms
[2023-03-12 17:28:27] [INFO ] Dead Transitions using invariants and state equation in 169 ms found 0 transitions.
[2023-03-12 17:28:27] [INFO ] Invariant cache hit.
[2023-03-12 17:28:27] [INFO ] Implicit Places using invariants in 34 ms returned []
[2023-03-12 17:28:27] [INFO ] Invariant cache hit.
[2023-03-12 17:28:27] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 92 ms to find 0 implicit places.
[2023-03-12 17:28:27] [INFO ] Invariant cache hit.
[2023-03-12 17:28:27] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 332 ms. Remains : 33/33 places, 22/22 transitions.
Support contains 33 out of 33 places after structural reductions.
[2023-03-12 17:28:27] [INFO ] Flatten gal took : 17 ms
[2023-03-12 17:28:27] [INFO ] Flatten gal took : 6 ms
[2023-03-12 17:28:27] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 10001 steps, including 24 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 47) seen :42
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-12 17:28:27] [INFO ] Invariant cache hit.
[2023-03-12 17:28:27] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-12 17:28:27] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-12 17:28:27] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2023-03-12 17:28:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-12 17:28:28] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 6 ms returned sat
[2023-03-12 17:28:28] [INFO ] After 58ms SMT Verify possible using all constraints in natural 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 16 simplifications.
[2023-03-12 17:28:28] [INFO ] Flatten gal took : 5 ms
[2023-03-12 17:28:28] [INFO ] Flatten gal took : 4 ms
[2023-03-12 17:28:28] [INFO ] Input system was already deterministic with 22 transitions.
Computed a total of 0 stabilizing places and 0 stable 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 17:28:28] [INFO ] Invariant cache hit.
[2023-03-12 17:28:28] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 17:28:28] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:28:28] [INFO ] Flatten gal took : 3 ms
[2023-03-12 17:28:28] [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 0 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 17:28:28] [INFO ] Invariant cache hit.
[2023-03-12 17:28:28] [INFO ] Dead Transitions using invariants and state equation in 33 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 17:28:28] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:28:28] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:28:28] [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 17:28:28] [INFO ] Invariant cache hit.
[2023-03-12 17:28:28] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 17:28:28] [INFO ] Flatten gal took : 1 ms
[2023-03-12 17:28:28] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:28:28] [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 17:28:28] [INFO ] Invariant cache hit.
[2023-03-12 17:28:28] [INFO ] Dead Transitions using invariants and state equation in 35 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 17:28:28] [INFO ] Flatten gal took : 3 ms
[2023-03-12 17:28:28] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:28:28] [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 17:28:28] [INFO ] Invariant cache hit.
[2023-03-12 17:28:28] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 17:28:28] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:28:28] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:28:28] [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 17:28:28] [INFO ] Invariant cache hit.
[2023-03-12 17:28:28] [INFO ] Dead Transitions using invariants and state equation in 38 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 17:28:28] [INFO ] Flatten gal took : 1 ms
[2023-03-12 17:28:28] [INFO ] Flatten gal took : 1 ms
[2023-03-12 17:28:28] [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 17:28:28] [INFO ] Invariant cache hit.
[2023-03-12 17:28:28] [INFO ] Dead Transitions using invariants and state equation in 30 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 17:28:28] [INFO ] Flatten gal took : 3 ms
[2023-03-12 17:28:28] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:28:28] [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 17:28:28] [INFO ] Invariant cache hit.
[2023-03-12 17:28:28] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 17:28:28] [INFO ] Flatten gal took : 1 ms
[2023-03-12 17:28:28] [INFO ] Flatten gal took : 1 ms
[2023-03-12 17:28:28] [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 17:28:28] [INFO ] Invariant cache hit.
[2023-03-12 17:28:28] [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 17:28:28] [INFO ] Flatten gal took : 1 ms
[2023-03-12 17:28:28] [INFO ] Flatten gal took : 1 ms
[2023-03-12 17:28:28] [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
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 15 place count 24 transition count 15
Applied a total of 15 rules in 14 ms. Remains 24 /33 variables (removed 9) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 24 cols
[2023-03-12 17:28:28] [INFO ] Computed 10 place invariants in 6 ms
[2023-03-12 17:28:28] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 48 ms. Remains : 24/33 places, 15/22 transitions.
[2023-03-12 17:28:28] [INFO ] Flatten gal took : 1 ms
[2023-03-12 17:28:28] [INFO ] Flatten gal took : 1 ms
[2023-03-12 17:28:28] [INFO ] Input system was already deterministic with 15 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 17:28:28] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-12 17:28:28] [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 17:28:28] [INFO ] Flatten gal took : 1 ms
[2023-03-12 17:28:28] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:28:28] [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 0 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 17:28:28] [INFO ] Invariant cache hit.
[2023-03-12 17:28:28] [INFO ] Dead Transitions using invariants and state equation in 33 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 17:28:28] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:28:28] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:28:28] [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 0 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 17:28:28] [INFO ] Invariant cache hit.
[2023-03-12 17:28:28] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 17:28:28] [INFO ] Flatten gal took : 1 ms
[2023-03-12 17:28:28] [INFO ] Flatten gal took : 1 ms
[2023-03-12 17:28:28] [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 0 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 17:28:28] [INFO ] Invariant cache hit.
[2023-03-12 17:28:28] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 17:28:28] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:28:28] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:28:28] [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 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 2 places and 0 transitions.
Iterating global reduction 2 with 3 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 6 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 17:28:28] [INFO ] Computed 10 place invariants in 2 ms
[2023-03-12 17:28:28] [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 38 ms. Remains : 25/33 places, 16/22 transitions.
[2023-03-12 17:28:28] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:28:28] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:28:28] [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 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 17:28:28] [INFO ] Computed 12 place invariants in 1 ms
[2023-03-12 17:28:28] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 17:28:28] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:28:28] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:28:28] [INFO ] Input system was already deterministic with 22 transitions.
[2023-03-12 17:28:28] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:28:28] [INFO ] Flatten gal took : 3 ms
[2023-03-12 17:28:28] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-12 17:28:28] [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 2997 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.782sec
RS generation: 0m 0.139sec
-> reachability set: #nodes 20770 (2.1e+04) #states 23,537,012,497 (10)
starting MCC model checker
--------------------------
checking: EG [p16<=0]
normalized: EG [p16<=0]
abstracting: (p16<=0)
states: 18,351,376,669 (10)
..............................................................................................................................................................................................................
EG iterations: 206
-> the formula is TRUE
FORMULA GPPP-PT-C0010N0000000010-CTLFireability-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.678sec
checking: EF [EG [AG [[p1<=0 | p14<=0]]]]
normalized: E [true U EG [~ [E [true U ~ [[p1<=0 | p14<=0]]]]]]
abstracting: (p14<=0)
states: 18,188,976,312 (10)
abstracting: (p1<=0)
states: 630,645,525 (8)
.
EG iterations: 1
-> the formula is TRUE
FORMULA GPPP-PT-C0010N0000000010-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.564sec
checking: EX [EG [AG [EF [[p11<=0 | [p12<=0 | p31<=69]]]]]]
normalized: EX [EG [~ [E [true U ~ [E [true U [p11<=0 | [p12<=0 | p31<=69]]]]]]]]
abstracting: (p31<=69)
states: 23,502,536,445 (10)
abstracting: (p12<=0)
states: 12,135,600,130 (10)
abstracting: (p11<=0)
states: 16,736,445,436 (10)
EG iterations: 0
.-> the formula is TRUE
FORMULA GPPP-PT-C0010N0000000010-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.063sec
checking: A [EX [EX [AG [p24<=0]]] U [1<=p1 & 1<=p26]]
normalized: [~ [EG [~ [[1<=p1 & 1<=p26]]]] & ~ [E [~ [[1<=p1 & 1<=p26]] U [~ [EX [EX [~ [E [true U ~ [p24<=0]]]]]] & ~ [[1<=p1 & 1<=p26]]]]]]
abstracting: (1<=p26)
states: 20,496,671,431 (10)
abstracting: (1<=p1)
states: 22,906,366,972 (10)
abstracting: (p24<=0)
states: 23,537,012,496 (10)
..abstracting: (1<=p26)
states: 20,496,671,431 (10)
abstracting: (1<=p1)
states: 22,906,366,972 (10)
abstracting: (1<=p26)
states: 20,496,671,431 (10)
abstracting: (1<=p1)
states: 22,906,366,972 (10)
...................................................................................................................................................
EG iterations: 147
-> the formula is TRUE
FORMULA GPPP-PT-C0010N0000000010-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.910sec
checking: ~ [E [~ [[AG [AX [1<=0]] & EF [2<=p7]]] U [~ [AF [[1<=p1 & 1<=p26]]] & EF [AX [1<=p12]]]]]
normalized: ~ [E [~ [[~ [E [true U EX [~ [1<=0]]]] & E [true U 2<=p7]]] U [E [true U ~ [EX [~ [1<=p12]]]] & EG [~ [[1<=p1 & 1<=p26]]]]]]
abstracting: (1<=p26)
states: 20,496,671,431 (10)
abstracting: (1<=p1)
states: 22,906,366,972 (10)
...................................................................................................................................................
EG iterations: 147
abstracting: (1<=p12)
states: 11,401,412,367 (10)
.abstracting: (2<=p7)
states: 21,352,933,308 (10)
abstracting: (1<=0)
states: 0
.-> the formula is FALSE
FORMULA GPPP-PT-C0010N0000000010-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.105sec
checking: AF [EG [E [EF [[2<=p7 & [1<=p18 & 1<=p19]]] U AX [AX [[1<=p15 & 30<=p27]]]]]]
normalized: ~ [EG [~ [EG [E [E [true U [2<=p7 & [1<=p18 & 1<=p19]]] U ~ [EX [EX [~ [[1<=p15 & 30<=p27]]]]]]]]]]
abstracting: (30<=p27)
states: 618,664,704 (8)
abstracting: (1<=p15)
states: 20,174,700,018 (10)
..abstracting: (1<=p19)
states: 23,537,012,496 (10)
abstracting: (1<=p18)
states: 11,381,623,482 (10)
abstracting: (2<=p7)
states: 21,352,933,308 (10)
..
EG iterations: 2
....................................................................................................................................................................
EG iterations: 164
-> the formula is FALSE
FORMULA GPPP-PT-C0010N0000000010-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.301sec
checking: AG [AX [[~ [E [1<=p20 U [1<=p19 & 1<=p22]]] | AF [[p8<=0 | p30<=0]]]]]
normalized: ~ [E [true U EX [~ [[~ [EG [~ [[p8<=0 | p30<=0]]]] | ~ [E [1<=p20 U [1<=p19 & 1<=p22]]]]]]]]
abstracting: (1<=p22)
states: 11,628,220,734 (10)
abstracting: (1<=p19)
states: 23,537,012,496 (10)
abstracting: (1<=p20)
states: 11,628,220,734 (10)
abstracting: (p30<=0)
states: 429,895,495 (8)
abstracting: (p8<=0)
states: 1,691,030,905 (9)
.....................................................................................................................................................................
EG iterations: 165
.-> the formula is FALSE
FORMULA GPPP-PT-C0010N0000000010-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.986sec
checking: [EG [EF [p24<=0]] & EX [EF [AG [[[[p0<=0 | p2<=0] | [p12<=0 | p32<=0]] & p21<=0]]]]]
normalized: [EG [E [true U p24<=0]] & EX [E [true U ~ [E [true U ~ [[p21<=0 & [[p12<=0 | p32<=0] | [p0<=0 | p2<=0]]]]]]]]]
abstracting: (p2<=0)
states: 0
abstracting: (p0<=0)
states: 1
abstracting: (p32<=0)
states: 34,476,052 (7)
abstracting: (p12<=0)
states: 12,135,600,130 (10)
abstracting: (p21<=0)
states: 11,908,791,763 (10)
.abstracting: (p24<=0)
states: 23,537,012,496 (10)
EG iterations: 0
-> the formula is TRUE
FORMULA GPPP-PT-C0010N0000000010-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.482sec
checking: AG [AF [[AF [EX [[p3<=0 | p23<=0]]] | [~ [E [[1<=p8 & 20<=p29] U 2<=p7]] & ~ [E [1<=p17 U 1<=p16]]]]]]
normalized: ~ [E [true U EG [~ [[[~ [E [1<=p17 U 1<=p16]] & ~ [E [[1<=p8 & 20<=p29] U 2<=p7]]] | ~ [EG [~ [EX [[p3<=0 | p23<=0]]]]]]]]]]
abstracting: (p23<=0)
states: 11,787,683,773 (10)
abstracting: (p3<=0)
states: 426,615,736 (8)
.............................................................................................................................................................
EG iterations: 156
abstracting: (2<=p7)
states: 21,352,933,308 (10)
abstracting: (20<=p29)
states: 429,895,495 (8)
abstracting: (1<=p8)
states: 21,845,981,592 (10)
abstracting: (1<=p16)
states: 5,185,635,828 (9)
abstracting: (1<=p17)
states: 11,401,412,367 (10)
................................................
EG iterations: 48
-> the formula is FALSE
FORMULA GPPP-PT-C0010N0000000010-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 2.633sec
checking: A [~ [[EX [[[1<=p9 & 1<=p10] | AG [1<=p24]]] & AG [[AX [[1<=p8 & 20<=p29]] & [[1<=p8 & 1<=p30] | 2<=p7]]]]] U [1<=p20 | [1<=p1 & 1<=p14]]]
normalized: [~ [EG [~ [[1<=p20 | [1<=p1 & 1<=p14]]]]] & ~ [E [~ [[1<=p20 | [1<=p1 & 1<=p14]]] U [[~ [E [true U ~ [[[2<=p7 | [1<=p8 & 1<=p30]] & ~ [EX [~ [[1<=p8 & 20<=p29]]]]]]]] & EX [[~ [E [true U ~ [1<=p24]]] | [1<=p9 & 1<=p10]]]] & ~ [[1<=p20 | [1<=p1 & 1<=p14]]]]]]]
abstracting: (1<=p14)
states: 5,348,036,185 (9)
abstracting: (1<=p1)
states: 22,906,366,972 (10)
abstracting: (1<=p20)
states: 11,628,220,734 (10)
abstracting: (1<=p10)
states: 3,515,367,765 (9)
abstracting: (1<=p9)
states: 22,641,221,169 (10)
abstracting: (1<=p24)
states: 1
.abstracting: (20<=p29)
states: 429,895,495 (8)
abstracting: (1<=p8)
states: 21,845,981,592 (10)
.abstracting: (1<=p30)
states: 23,107,117,002 (10)
abstracting: (1<=p8)
states: 21,845,981,592 (10)
abstracting: (2<=p7)
states: 21,352,933,308 (10)
abstracting: (1<=p14)
states: 5,348,036,185 (9)
abstracting: (1<=p1)
states: 22,906,366,972 (10)
abstracting: (1<=p20)
states: 11,628,220,734 (10)
abstracting: (1<=p14)
states: 5,348,036,185 (9)
abstracting: (1<=p1)
states: 22,906,366,972 (10)
abstracting: (1<=p20)
states: 11,628,220,734 (10)
..........................................................................................................................................................................
EG iterations: 170
-> the formula is FALSE
FORMULA GPPP-PT-C0010N0000000010-CTLFireability-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.756sec
checking: E [E [EX [[1<=p1 & [1<=p26 & ~ [[1<=p8 & 1<=p30]]]]] U EG [EF [[1<=p9 & 1<=p13]]]] U ~ [EF [~ [[A [[[1<=p0 & 1<=p2] & [1<=p12 & 1<=p32]] U 1<=p17] | ~ [[1<=p8 & 1<=p30]]]]]]]
normalized: E [E [EX [[1<=p1 & [1<=p26 & ~ [[1<=p8 & 1<=p30]]]]] U EG [E [true U [1<=p9 & 1<=p13]]]] U ~ [E [true U ~ [[~ [[1<=p8 & 1<=p30]] | [~ [EG [~ [1<=p17]]] & ~ [E [~ [1<=p17] U [~ [[[1<=p12 & 1<=p32] & [1<=p0 & 1<=p2]]] & ~ [1<=p17]]]]]]]]]]
abstracting: (1<=p17)
states: 11,401,412,367 (10)
abstracting: (1<=p2)
states: 23,537,012,497 (10)
abstracting: (1<=p0)
states: 23,537,012,496 (10)
abstracting: (1<=p32)
states: 23,502,536,445 (10)
abstracting: (1<=p12)
states: 11,401,412,367 (10)
abstracting: (1<=p17)
states: 11,401,412,367 (10)
abstracting: (1<=p17)
states: 11,401,412,367 (10)
.......................................................................................................................................................................................................................................................................................................................
EG iterations: 311
abstracting: (1<=p30)
states: 23,107,117,002 (10)
abstracting: (1<=p8)
states: 21,845,981,592 (10)
abstracting: (1<=p13)
states: 2,246,594,796 (9)
abstracting: (1<=p9)
states: 22,641,221,169 (10)
.......................................................................................................................................................
EG iterations: 151
abstracting: (1<=p30)
states: 23,107,117,002 (10)
abstracting: (1<=p8)
states: 21,845,981,592 (10)
abstracting: (1<=p26)
states: 20,496,671,431 (10)
abstracting: (1<=p1)
states: 22,906,366,972 (10)
.-> the formula is TRUE
FORMULA GPPP-PT-C0010N0000000010-CTLFireability-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 8.077sec
checking: [AX [AG [p12<=0]] | EX [[AF [p17<=0] & E [~ [[~ [[1<=p11 & [1<=p12 & 70<=p31]]] & [[1<=p3 & 1<=p23] | [1<=p1 & 1<=p26]]]] U [[1<=p15 & 30<=p27] | [[[1<=p11 & [1<=p12 & 70<=p31]] & [2<=p4 & [1<=p15 & 1<=p28]]] | p12<=0]]]]]]
normalized: [EX [[E [~ [[[[1<=p1 & 1<=p26] | [1<=p3 & 1<=p23]] & ~ [[1<=p11 & [1<=p12 & 70<=p31]]]]] U [[p12<=0 | [[2<=p4 & [1<=p15 & 1<=p28]] & [1<=p11 & [1<=p12 & 70<=p31]]]] | [1<=p15 & 30<=p27]]] & ~ [EG [~ [p17<=0]]]]] | ~ [EX [E [true U ~ [p12<=0]]]]]
abstracting: (p12<=0)
states: 12,135,600,130 (10)
.abstracting: (p17<=0)
states: 12,135,600,130 (10)
.................................................................................................................................................................
EG iterations: 161
abstracting: (30<=p27)
states: 618,664,704 (8)
abstracting: (1<=p15)
states: 20,174,700,018 (10)
abstracting: (70<=p31)
states: 34,476,052 (7)
abstracting: (1<=p12)
states: 11,401,412,367 (10)
abstracting: (1<=p11)
states: 6,800,567,061 (9)
abstracting: (1<=p28)
states: 22,918,347,793 (10)
abstracting: (1<=p15)
states: 20,174,700,018 (10)
abstracting: (2<=p4)
states: 21,418,482,813 (10)
abstracting: (p12<=0)
states: 12,135,600,130 (10)
abstracting: (70<=p31)
states: 34,476,052 (7)
abstracting: (1<=p12)
states: 11,401,412,367 (10)
abstracting: (1<=p11)
states: 6,800,567,061 (9)
abstracting: (1<=p23)
states: 11,749,328,724 (10)
abstracting: (1<=p3)
states: 23,110,396,761 (10)
abstracting: (1<=p26)
states: 20,496,671,431 (10)
abstracting: (1<=p1)
states: 22,906,366,972 (10)
.-> the formula is TRUE
FORMULA GPPP-PT-C0010N0000000010-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 1.913sec
checking: [A [[[EF [[1<=p1 & 1<=p26]] | [EG [[1<=p1 & 1<=p14]] & EG [[1<=p20 & 1<=p17]]]] & EX [[[[1<=p18 & 1<=p19] | E [1<=p17 U [1<=p9 & 1<=p13]]] | [AX [[1<=p9 & 1<=p10]] | EG [1<=p24]]]]] U ~ [[~ [AX [AG [[1<=p5 & 1<=p6]]]] & [EG [~ [[1<=p18 & 1<=p19]]] & AX [[1<=p9 & 1<=p10]]]]]] | [A [EG [1<=p12] U ~ [EX [0<=0]]] & AF [EX [AX [[[1<=p1 & 1<=p26] | 1<=p21]]]]]]
normalized: [[~ [EG [~ [EX [~ [EX [~ [[1<=p21 | [1<=p1 & 1<=p26]]]]]]]]] & [~ [EG [EX [0<=0]]] & ~ [E [EX [0<=0] U [~ [EG [1<=p12]] & EX [0<=0]]]]]] | [~ [EG [[[~ [EX [~ [[1<=p9 & 1<=p10]]]] & EG [~ [[1<=p18 & 1<=p19]]]] & EX [E [true U ~ [[1<=p5 & 1<=p6]]]]]]] & ~ [E [[[~ [EX [~ [[1<=p9 & 1<=p10]]]] & EG [~ [[1<=p18 & 1<=p19]]]] & EX [E [true U ~ [[1<=p5 & 1<=p6]]]]] U [~ [[EX [[[EG [1<=p24] | ~ [EX [~ [[1<=p9 & 1<=p10]]]]] | [E [1<=p17 U [1<=p9 & 1<=p13]] | [1<=p18 & 1<=p19]]]] & [[EG [[1<=p20 & 1<=p17]] & EG [[1<=p1 & 1<=p14]]] | E [true U [1<=p1 & 1<=p26]]]]] & [[~ [EX [~ [[1<=p9 & 1<=p10]]]] & EG [~ [[1<=p18 & 1<=p19]]]] & EX [E [true U ~ [[1<=p5 & 1<=p6]]]]]]]]]]
abstracting: (1<=p6)
states: 21,452,997,615 (10)
abstracting: (1<=p5)
states: 22,376,943,838 (10)
.abstracting: (1<=p19)
states: 23,537,012,496 (10)
abstracting: (1<=p18)
states: 11,381,623,482 (10)
.
EG iterations: 1
abstracting: (1<=p10)
states: 3,515,367,765 (9)
abstracting: (1<=p9)
states: 22,641,221,169 (10)
.abstracting: (1<=p26)
states: 20,496,671,431 (10)
abstracting: (1<=p1)
states: 22,906,366,972 (10)
abstracting: (1<=p14)
states: 5,348,036,185 (9)
abstracting: (1<=p1)
states: 22,906,366,972 (10)
............................................................................................................................................................
EG iterations: 156
abstracting: (1<=p17)
states: 11,401,412,367 (10)
abstracting: (1<=p20)
states: 11,628,220,734 (10)
............................................................................................................................................................
EG iterations: 156
abstracting: (1<=p19)
states: 23,537,012,496 (10)
abstracting: (1<=p18)
states: 11,381,623,482 (10)
abstracting: (1<=p13)
states: 2,246,594,796 (9)
abstracting: (1<=p9)
states: 22,641,221,169 (10)
abstracting: (1<=p17)
states: 11,401,412,367 (10)
abstracting: (1<=p10)
states: 3,515,367,765 (9)
abstracting: (1<=p9)
states: 22,641,221,169 (10)
.abstracting: (1<=p24)
states: 1
..
EG iterations: 2
.abstracting: (1<=p6)
states: 21,452,997,615 (10)
abstracting: (1<=p5)
states: 22,376,943,838 (10)
.abstracting: (1<=p19)
states: 23,537,012,496 (10)
abstracting: (1<=p18)
states: 11,381,623,482 (10)
.
EG iterations: 1
abstracting: (1<=p10)
states: 3,515,367,765 (9)
abstracting: (1<=p9)
states: 22,641,221,169 (10)
.abstracting: (1<=p6)
states: 21,452,997,615 (10)
abstracting: (1<=p5)
states: 22,376,943,838 (10)
.abstracting: (1<=p19)
states: 23,537,012,496 (10)
abstracting: (1<=p18)
states: 11,381,623,482 (10)
.
EG iterations: 1
abstracting: (1<=p10)
states: 3,515,367,765 (9)
abstracting: (1<=p9)
states: 22,641,221,169 (10)
......................................................................................................................................................
EG iterations: 149
abstracting: (0<=0)
states: 23,537,012,497 (10)
.abstracting: (1<=p12)
states: 11,401,412,367 (10)
.................................................................................................................................................................
EG iterations: 161
abstracting: (0<=0)
states: 23,537,012,497 (10)
.abstracting: (0<=0)
states: 23,537,012,497 (10)
......................................................................................................................................................................
EG iterations: 165
abstracting: (1<=p26)
states: 20,496,671,431 (10)
abstracting: (1<=p1)
states: 22,906,366,972 (10)
abstracting: (1<=p21)
states: 11,628,220,734 (10)
........................................................................................................................................................
EG iterations: 150
-> the formula is TRUE
FORMULA GPPP-PT-C0010N0000000010-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 6.361sec
checking: [A [[1<=p8 & 1<=p30] U [[1<=p8 & 1<=p30] | [E [[AF [[1<=p19 & 1<=p22]] | [1<=p8 & 20<=p29]] U [1<=p1 & 1<=p14]] & [[1<=p11 & [1<=p12 & 70<=p31]] | AX [AF [[1<=p19 & 1<=p22]]]]]]] & AX [[[~ [E [[1<=p9 & [1<=p13 & 1<=p21]] U ~ [[1<=p9 & 1<=p13]]]] | [[[[p9<=0 | p10<=0] | [p1<=69 | p25<=69]] & [p12<=0 & p20<=0]] | ~ [E [[1<=p8 & 20<=p29] U 1<=p12]]]] & AF [[p5<=0 | p6<=0]]]]]
normalized: [~ [EX [~ [[~ [EG [~ [[p5<=0 | p6<=0]]]] & [[~ [E [[1<=p8 & 20<=p29] U 1<=p12]] | [[p12<=0 & p20<=0] & [[p1<=69 | p25<=69] | [p9<=0 | p10<=0]]]] | ~ [E [[1<=p9 & [1<=p13 & 1<=p21]] U ~ [[1<=p9 & 1<=p13]]]]]]]]] & [~ [EG [~ [[[[~ [EX [EG [~ [[1<=p19 & 1<=p22]]]]] | [1<=p11 & [1<=p12 & 70<=p31]]] & E [[[1<=p8 & 20<=p29] | ~ [EG [~ [[1<=p19 & 1<=p22]]]]] U [1<=p1 & 1<=p14]]] | [1<=p8 & 1<=p30]]]]] & ~ [E [~ [[[[~ [EX [EG [~ [[1<=p19 & 1<=p22]]]]] | [1<=p11 & [1<=p12 & 70<=p31]]] & E [[[1<=p8 & 20<=p29] | ~ [EG [~ [[1<=p19 & 1<=p22]]]]] U [1<=p1 & 1<=p14]]] | [1<=p8 & 1<=p30]]] U [~ [[1<=p8 & 1<=p30]] & ~ [[[[~ [EX [EG [~ [[1<=p19 & 1<=p22]]]]] | [1<=p11 & [1<=p12 & 70<=p31]]] & E [[[1<=p8 & 20<=p29] | ~ [EG [~ [[1<=p19 & 1<=p22]]]]] U [1<=p1 & 1<=p14]]] | [1<=p8 & 1<=p30]]]]]]]]
abstracting: (1<=p30)
states: 23,107,117,002 (10)
abstracting: (1<=p8)
states: 21,845,981,592 (10)
abstracting: (1<=p14)
states: 5,348,036,185 (9)
abstracting: (1<=p1)
states: 22,906,366,972 (10)
abstracting: (1<=p22)
states: 11,628,220,734 (10)
abstracting: (1<=p19)
states: 23,537,012,496 (10)
........................................................................................................................................
EG iterations: 136
abstracting: (20<=p29)
states: 429,895,495 (8)
abstracting: (1<=p8)
states: 21,845,981,592 (10)
abstracting: (70<=p31)
states: 34,476,052 (7)
abstracting: (1<=p12)
states: 11,401,412,367 (10)
abstracting: (1<=p11)
states: 6,800,567,061 (9)
abstracting: (1<=p22)
states: 11,628,220,734 (10)
abstracting: (1<=p19)
states: 23,537,012,496 (10)
........................................................................................................................................
EG iterations: 136
.abstracting: (1<=p30)
states: 23,107,117,002 (10)
abstracting: (1<=p8)
states: 21,845,981,592 (10)
abstracting: (1<=p30)
states: 23,107,117,002 (10)
abstracting: (1<=p8)
states: 21,845,981,592 (10)
abstracting: (1<=p14)
states: 5,348,036,185 (9)
abstracting: (1<=p1)
states: 22,906,366,972 (10)
abstracting: (1<=p22)
states: 11,628,220,734 (10)
abstracting: (1<=p19)
states: 23,537,012,496 (10)
........................................................................................................................................
EG iterations: 136
abstracting: (20<=p29)
states: 429,895,495 (8)
abstracting: (1<=p8)
states: 21,845,981,592 (10)
abstracting: (70<=p31)
states: 34,476,052 (7)
abstracting: (1<=p12)
states: 11,401,412,367 (10)
abstracting: (1<=p11)
states: 6,800,567,061 (9)
abstracting: (1<=p22)
states: 11,628,220,734 (10)
abstracting: (1<=p19)
states: 23,537,012,496 (10)
........................................................................................................................................
EG iterations: 136
.abstracting: (1<=p30)
states: 23,107,117,002 (10)
abstracting: (1<=p8)
states: 21,845,981,592 (10)
abstracting: (1<=p14)
states: 5,348,036,185 (9)
abstracting: (1<=p1)
states: 22,906,366,972 (10)
abstracting: (1<=p22)
states: 11,628,220,734 (10)
abstracting: (1<=p19)
states: 23,537,012,496 (10)
........................................................................................................................................
EG iterations: 136
abstracting: (20<=p29)
states: 429,895,495 (8)
abstracting: (1<=p8)
states: 21,845,981,592 (10)
abstracting: (70<=p31)
states: 34,476,052 (7)
abstracting: (1<=p12)
states: 11,401,412,367 (10)
abstracting: (1<=p11)
states: 6,800,567,061 (9)
abstracting: (1<=p22)
states: 11,628,220,734 (10)
abstracting: (1<=p19)
states: 23,537,012,496 (10)
........................................................................................................................................
EG iterations: 136
...................................................................................................................................................................................................
EG iterations: 194
abstracting: (1<=p13)
states: 2,246,594,796 (9)
abstracting: (1<=p9)
states: 22,641,221,169 (10)
abstracting: (1<=p21)
states: 11,628,220,734 (10)
abstracting: (1<=p13)
states: 2,246,594,796 (9)
abstracting: (1<=p9)
states: 22,641,221,169 (10)
abstracting: (p10<=0)
states: 20,021,644,732 (10)
abstracting: (p9<=0)
states: 895,791,328 (8)
abstracting: (p25<=69)
states: 23,537,012,497 (10)
abstracting: (p1<=69)
states: 23,537,012,497 (10)
abstracting: (p20<=0)
states: 11,908,791,763 (10)
abstracting: (p12<=0)
states: 12,135,600,130 (10)
abstracting: (1<=p12)
states: 11,401,412,367 (10)
abstracting: (20<=p29)
states: 429,895,495 (8)
abstracting: (1<=p8)
states: 21,845,981,592 (10)
abstracting: (p6<=0)
states: 2,084,014,882 (9)
abstracting: (p5<=0)
states: 1,160,068,659 (9)
...................................................................................................................................................................
EG iterations: 163
.-> the formula is FALSE
FORMULA GPPP-PT-C0010N0000000010-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 4.006sec
checking: [AX [[A [[E [1<=p21 U 1<=p16] | ~ [[1<=p19 & 1<=p22]]] U E [[1<=p21 | 2<=p7] U [[1<=p8 & 1<=p30] | 1<=p17]]] | 1<=p24]] | [EG [AG [1<=p17]] & [EX [[AX [1<=p12] | [EG [[1<=p11 & [1<=p12 & 70<=p31]]] | [p16<=0 & p20<=0]]]] & E [EX [[[1<=p15 & 30<=p27] | E [1<=p21 U [1<=p1 & 1<=p14]]]] U E [[~ [[1<=p15 & 30<=p27]] & [[1<=p11 & [1<=p12 & 70<=p31]] | [1<=p12 | 1<=p12]]] U [[[1<=p9 & 1<=p10] & [1<=p5 & 1<=p6]] | A [[1<=p8 & 20<=p29] U 2<=p7]]]]]]]
normalized: [[[E [EX [[E [1<=p21 U [1<=p1 & 1<=p14]] | [1<=p15 & 30<=p27]]] U E [[[[1<=p11 & [1<=p12 & 70<=p31]] | [1<=p12 | 1<=p12]] & ~ [[1<=p15 & 30<=p27]]] U [[~ [EG [~ [2<=p7]]] & ~ [E [~ [2<=p7] U [~ [2<=p7] & ~ [[1<=p8 & 20<=p29]]]]]] | [[1<=p5 & 1<=p6] & [1<=p9 & 1<=p10]]]]] & EX [[[[p16<=0 & p20<=0] | EG [[1<=p11 & [1<=p12 & 70<=p31]]]] | ~ [EX [~ [1<=p12]]]]]] & EG [~ [E [true U ~ [1<=p17]]]]] | ~ [EX [~ [[1<=p24 | [~ [EG [~ [E [[1<=p21 | 2<=p7] U [1<=p17 | [1<=p8 & 1<=p30]]]]]] & ~ [E [~ [E [[1<=p21 | 2<=p7] U [1<=p17 | [1<=p8 & 1<=p30]]]] U [~ [[~ [[1<=p19 & 1<=p22]] | E [1<=p21 U 1<=p16]]] & ~ [E [[1<=p21 | 2<=p7] U [1<=p17 | [1<=p8 & 1<=p30]]]]]]]]]]]]]
abstracting: (1<=p30)
states: 23,107,117,002 (10)
abstracting: (1<=p8)
states: 21,845,981,592 (10)
abstracting: (1<=p17)
states: 11,401,412,367 (10)
abstracting: (2<=p7)
states: 21,352,933,308 (10)
abstracting: (1<=p21)
states: 11,628,220,734 (10)
abstracting: (1<=p16)
states: 5,185,635,828 (9)
abstracting: (1<=p21)
states: 11,628,220,734 (10)
abstracting: (1<=p22)
states: 11,628,220,734 (10)
abstracting: (1<=p19)
states: 23,537,012,496 (10)
abstracting: (1<=p30)
states: 23,107,117,002 (10)
abstracting: (1<=p8)
states: 21,845,981,592 (10)
abstracting: (1<=p17)
states: 11,401,412,367 (10)
abstracting: (2<=p7)
states: 21,352,933,308 (10)
abstracting: (1<=p21)
states: 11,628,220,734 (10)
abstracting: (1<=p30)
states: 23,107,117,002 (10)
abstracting: (1<=p8)
states: 21,845,981,592 (10)
abstracting: (1<=p17)
states: 11,401,412,367 (10)
abstracting: (2<=p7)
states: 21,352,933,308 (10)
abstracting: (1<=p21)
states: 11,628,220,734 (10)
......................................................
EG iterations: 54
abstracting: (1<=p24)
states: 1
.abstracting: (1<=p17)
states: 11,401,412,367 (10)
.
EG iterations: 1
abstracting: (1<=p12)
states: 11,401,412,367 (10)
.abstracting: (70<=p31)
states: 34,476,052 (7)
abstracting: (1<=p12)
states: 11,401,412,367 (10)
abstracting: (1<=p11)
states: 6,800,567,061 (9)
.
EG iterations: 1
abstracting: (p20<=0)
states: 11,908,791,763 (10)
abstracting: (p16<=0)
states: 18,351,376,669 (10)
.abstracting: (1<=p10)
states: 3,515,367,765 (9)
abstracting: (1<=p9)
states: 22,641,221,169 (10)
abstracting: (1<=p6)
states: 21,452,997,615 (10)
abstracting: (1<=p5)
states: 22,376,943,838 (10)
abstracting: (20<=p29)
states: 429,895,495 (8)
abstracting: (1<=p8)
states: 21,845,981,592 (10)
abstracting: (2<=p7)
states: 21,352,933,308 (10)
abstracting: (2<=p7)
states: 21,352,933,308 (10)
abstracting: (2<=p7)
states: 21,352,933,308 (10)
.............................................................................................
EG iterations: 93
abstracting: (30<=p27)
states: 618,664,704 (8)
abstracting: (1<=p15)
states: 20,174,700,018 (10)
abstracting: (1<=p12)
states: 11,401,412,367 (10)
abstracting: (1<=p12)
states: 11,401,412,367 (10)
abstracting: (70<=p31)
states: 34,476,052 (7)
abstracting: (1<=p12)
states: 11,401,412,367 (10)
abstracting: (1<=p11)
states: 6,800,567,061 (9)
abstracting: (30<=p27)
states: 618,664,704 (8)
abstracting: (1<=p15)
states: 20,174,700,018 (10)
abstracting: (1<=p14)
states: 5,348,036,185 (9)
abstracting: (1<=p1)
states: 22,906,366,972 (10)
abstracting: (1<=p21)
states: 11,628,220,734 (10)
.-> the formula is TRUE
FORMULA GPPP-PT-C0010N0000000010-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 6.702sec
checking: [EG [[[AX [[p16<=0 | [p18<=0 | p19<=0]]] & [E [[1<=p15 & 30<=p27] U [1<=p11 & [1<=p12 & 70<=p31]]] | [1<=p21 & [1<=p9 & 1<=p13]]]] | A [[[1<=p0 & 1<=p2] & [1<=p12 & 1<=p32]] U EX [~ [[1<=p1 & 1<=p14]]]]]] & EF [[[[A [[2<=p4 & [1<=p15 & 1<=p28]] U [1<=p1 & 1<=p26]] & EF [[p7<=1 | 1<=p17]]] | AG [[[1<=p1 & 1<=p26] & [1<=p16 & p7<=1]]]] & ~ [E [[[1<=p12 | 1<=p24] & A [[1<=p11 & [1<=p12 & 70<=p31]] U 1<=p12]] U EF [[1<=p9 & 1<=p13]]]]]]]
normalized: [E [true U [~ [E [[[~ [EG [~ [1<=p12]]] & ~ [E [~ [1<=p12] U [~ [[1<=p11 & [1<=p12 & 70<=p31]]] & ~ [1<=p12]]]]] & [1<=p12 | 1<=p24]] U E [true U [1<=p9 & 1<=p13]]]] & [~ [E [true U ~ [[[1<=p16 & p7<=1] & [1<=p1 & 1<=p26]]]]] | [E [true U [p7<=1 | 1<=p17]] & [~ [EG [~ [[1<=p1 & 1<=p26]]]] & ~ [E [~ [[1<=p1 & 1<=p26]] U [~ [[2<=p4 & [1<=p15 & 1<=p28]]] & ~ [[1<=p1 & 1<=p26]]]]]]]]]] & EG [[[~ [EG [~ [EX [~ [[1<=p1 & 1<=p14]]]]]] & ~ [E [~ [EX [~ [[1<=p1 & 1<=p14]]]] U [~ [[[1<=p12 & 1<=p32] & [1<=p0 & 1<=p2]]] & ~ [EX [~ [[1<=p1 & 1<=p14]]]]]]]] | [[[1<=p21 & [1<=p9 & 1<=p13]] | E [[1<=p15 & 30<=p27] U [1<=p11 & [1<=p12 & 70<=p31]]]] & ~ [EX [~ [[p16<=0 | [p18<=0 | p19<=0]]]]]]]]]
abstracting: (p19<=0)
states: 1
abstracting: (p18<=0)
states: 12,155,389,015 (10)
abstracting: (p16<=0)
states: 18,351,376,669 (10)
.abstracting: (70<=p31)
states: 34,476,052 (7)
abstracting: (1<=p12)
states: 11,401,412,367 (10)
abstracting: (1<=p11)
states: 6,800,567,061 (9)
abstracting: (30<=p27)
states: 618,664,704 (8)
abstracting: (1<=p15)
states: 20,174,700,018 (10)
abstracting: (1<=p13)
states: 2,246,594,796 (9)
abstracting: (1<=p9)
states: 22,641,221,169 (10)
abstracting: (1<=p21)
states: 11,628,220,734 (10)
abstracting: (1<=p14)
states: 5,348,036,185 (9)
abstracting: (1<=p1)
states: 22,906,366,972 (10)
.abstracting: (1<=p2)
states: 23,537,012,497 (10)
abstracting: (1<=p0)
states: 23,537,012,496 (10)
abstracting: (1<=p32)
states: 23,502,536,445 (10)
abstracting: (1<=p12)
states: 11,401,412,367 (10)
abstracting: (1<=p14)
states: 5,348,036,185 (9)
abstracting: (1<=p1)
states: 22,906,366,972 (10)
.abstracting: (1<=p14)
states: 5,348,036,185 (9)
abstracting: (1<=p1)
states: 22,906,366,972 (10)
...................................................................................................................................................
EG iterations: 146
.....................................................................................................................................................................
EG iterations: 165
abstracting: (1<=p26)
states: 20,496,671,431 (10)
abstracting: (1<=p1)
states: 22,906,366,972 (10)
abstracting: (1<=p28)
states: 22,918,347,793 (10)
abstracting: (1<=p15)
states: 20,174,700,018 (10)
abstracting: (2<=p4)
states: 21,418,482,813 (10)
abstracting: (1<=p26)
states: 20,496,671,431 (10)
abstracting: (1<=p1)
states: 22,906,366,972 (10)
abstracting: (1<=p26)
states: 20,496,671,431 (10)
abstracting: (1<=p1)
states: 22,906,366,972 (10)
...................................................................................................................................................
EG iterations: 147
abstracting: (1<=p17)
states: 11,401,412,367 (10)
abstracting: (p7<=1)
states: 2,184,079,189 (9)
abstracting: (1<=p26)
states: 20,496,671,431 (10)
abstracting: (1<=p1)
states: 22,906,366,972 (10)
abstracting: (p7<=1)
states: 2,184,079,189 (9)
abstracting: (1<=p16)
states: 5,185,635,828 (9)
abstracting: (1<=p13)
states: 2,246,594,796 (9)
abstracting: (1<=p9)
states: 22,641,221,169 (10)
abstracting: (1<=p24)
states: 1
abstracting: (1<=p12)
states: 11,401,412,367 (10)
abstracting: (1<=p12)
states: 11,401,412,367 (10)
abstracting: (70<=p31)
states: 34,476,052 (7)
abstracting: (1<=p12)
states: 11,401,412,367 (10)
abstracting: (1<=p11)
states: 6,800,567,061 (9)
abstracting: (1<=p12)
states: 11,401,412,367 (10)
abstracting: (1<=p12)
states: 11,401,412,367 (10)
.........................................................................................................................................................................................................................................................................................................
EG iterations: 297
-> the formula is TRUE
FORMULA GPPP-PT-C0010N0000000010-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m10.087sec
totally nodes used: 29459347 (2.9e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 106848578 57325238 164173816
used/not used/entry size/cache size: 46184666 20924198 16 1024MB
basic ops cache: hits/miss/sum: 26017909 13287794 39305703
used/not used/entry size/cache size: 12857167 3920049 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: 585104 306186 891290
used/not used/entry size/cache size: 300812 8087796 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 45151856
1 17308857
2 3736672
3 645115
4 116707
5 32295
6 17868
7 12649
8 10190
9 19836
>= 10 56819
Total processing time: 0m56.526sec
BK_STOP 1678642175820
--------------------
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.003sec
iterations count:1541 (70), effective:367 (16)
initing FirstDep: 0m 0.000sec
iterations count:749 (34), effective:145 (6)
iterations count:893 (40), effective:170 (7)
iterations count:25 (1), effective:1 (0)
iterations count:22 (1), effective:0 (0)
iterations count:1285 (58), effective:321 (14)
iterations count:1133 (51), effective:280 (12)
iterations count:114 (5), effective:19 (0)
iterations count:22 (1), effective:0 (0)
iterations count:242 (11), effective:45 (2)
iterations count:684 (31), effective:135 (6)
iterations count:22 (1), effective:0 (0)
iterations count:564 (25), effective:109 (4)
iterations count:701 (31), effective:146 (6)
iterations count:621 (28), effective:120 (5)
iterations count:1143 (51), effective:239 (10)
iterations count:26 (1), effective:1 (0)
iterations count:104 (4), effective:16 (0)
iterations count:785 (35), effective:160 (7)
iterations count:1024 (46), effective:215 (9)
iterations count:26 (1), effective:1 (0)
iterations count:25 (1), effective:1 (0)
iterations count:102 (4), effective:10 (0)
iterations count:200 (9), effective:39 (1)
iterations count:130 (5), effective:17 (0)
iterations count:22 (1), effective:0 (0)
iterations count:1180 (53), effective:250 (11)
iterations count:576 (26), effective:111 (5)
iterations count:276 (12), effective:45 (2)
iterations count:42 (1), effective:10 (0)
iterations count:103 (4), effective:16 (0)
iterations count:463 (21), effective:88 (4)
iterations count:42 (1), effective:10 (0)
iterations count:107 (4), effective:17 (0)
iterations count:42 (1), effective:10 (0)
iterations count:117 (5), effective:14 (0)
iterations count:763 (34), effective:145 (6)
iterations count:763 (34), effective:145 (6)
iterations count:22 (1), effective:0 (0)
iterations count:763 (34), effective:145 (6)
iterations count:29 (1), effective:1 (0)
iterations count:286 (13), effective:59 (2)
iterations count:123 (5), effective:21 (0)
iterations count:704 (32), effective:135 (6)
iterations count:123 (5), effective:21 (0)
iterations count:100 (4), effective:12 (0)
iterations count:123 (5), effective:21 (0)
iterations count:62 (2), effective:10 (0)
iterations count:25 (1), effective:1 (0)
iterations count:435 (19), effective:87 (3)
iterations count:702 (31), effective:135 (6)
iterations count:421 (19), effective:69 (3)
iterations count:49 (2), effective:6 (0)
iterations count:70 (3), effective:6 (0)
iterations count:152 (6), effective:10 (0)
iterations count:440 (20), effective:80 (3)
iterations count:212 (9), effective:38 (1)
iterations count:130 (5), effective:17 (0)
iterations count:22 (1), effective:0 (0)
iterations count:22 (1), effective:0 (0)
iterations count:164 (7), effective:25 (1)
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-C0010N0000000010"
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-C0010N0000000010, 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-167838857800818"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/GPPP-PT-C0010N0000000010.tgz
mv GPPP-PT-C0010N0000000010 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 ;