About the Execution of Marcie+red for Parking-PT-104
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5449.476 | 15514.00 | 25180.00 | 475.40 | TTFTTTTFTFFFFTTT | 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.r266-smll-167863540900409.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 Parking-PT-104, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863540900409
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 6.7K Feb 26 14:59 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 14:59 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Feb 26 14:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K Feb 26 14:58 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Feb 25 16:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 16:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 16:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 15:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 15:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 14:59 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Feb 26 14:59 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:30 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:30 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 23K Mar 5 18:23 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME Parking-PT-104-CTLCardinality-00
FORMULA_NAME Parking-PT-104-CTLCardinality-01
FORMULA_NAME Parking-PT-104-CTLCardinality-02
FORMULA_NAME Parking-PT-104-CTLCardinality-03
FORMULA_NAME Parking-PT-104-CTLCardinality-04
FORMULA_NAME Parking-PT-104-CTLCardinality-05
FORMULA_NAME Parking-PT-104-CTLCardinality-06
FORMULA_NAME Parking-PT-104-CTLCardinality-07
FORMULA_NAME Parking-PT-104-CTLCardinality-08
FORMULA_NAME Parking-PT-104-CTLCardinality-09
FORMULA_NAME Parking-PT-104-CTLCardinality-10
FORMULA_NAME Parking-PT-104-CTLCardinality-11
FORMULA_NAME Parking-PT-104-CTLCardinality-12
FORMULA_NAME Parking-PT-104-CTLCardinality-13
FORMULA_NAME Parking-PT-104-CTLCardinality-14
FORMULA_NAME Parking-PT-104-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1679042456998
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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Parking-PT-104
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-17 08:41:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-17 08:41:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-17 08:41:00] [INFO ] Load time of PNML (sax parser for PT used): 80 ms
[2023-03-17 08:41:00] [INFO ] Transformed 65 places.
[2023-03-17 08:41:00] [INFO ] Transformed 97 transitions.
[2023-03-17 08:41:00] [INFO ] Found NUPN structural information;
[2023-03-17 08:41:00] [INFO ] Parsed PT model containing 65 places and 97 transitions and 284 arcs in 241 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 26 ms.
Ensure Unique test removed 41 transitions
Reduce redundant transitions removed 41 transitions.
Support contains 61 out of 65 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 56/56 transitions.
Applied a total of 0 rules in 23 ms. Remains 65 /65 variables (removed 0) and now considering 56/56 (removed 0) transitions.
// Phase 1: matrix 56 rows 65 cols
[2023-03-17 08:41:00] [INFO ] Computed 16 place invariants in 10 ms
[2023-03-17 08:41:01] [INFO ] Implicit Places using invariants in 331 ms returned []
[2023-03-17 08:41:01] [INFO ] Invariant cache hit.
[2023-03-17 08:41:01] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-17 08:41:01] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
[2023-03-17 08:41:01] [INFO ] Invariant cache hit.
[2023-03-17 08:41:01] [INFO ] Dead Transitions using invariants and state equation in 150 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 744 ms. Remains : 65/65 places, 56/56 transitions.
Support contains 61 out of 65 places after structural reductions.
[2023-03-17 08:41:01] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-17 08:41:01] [INFO ] Flatten gal took : 51 ms
FORMULA Parking-PT-104-CTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-17 08:41:01] [INFO ] Flatten gal took : 22 ms
[2023-03-17 08:41:01] [INFO ] Input system was already deterministic with 56 transitions.
Support contains 53 out of 65 places (down from 61) after GAL structural reductions.
FORMULA Parking-PT-104-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 594 resets, run finished after 831 ms. (steps per millisecond=12 ) properties (out of 58) seen :51
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 104 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 102 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 103 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 100 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2023-03-17 08:41:03] [INFO ] Invariant cache hit.
[2023-03-17 08:41:03] [INFO ] [Real]Absence check using 15 positive place invariants in 6 ms returned sat
[2023-03-17 08:41:03] [INFO ] [Real]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-17 08:41:03] [INFO ] After 79ms SMT Verify possible using state equation in real domain returned unsat :1 sat :1 real:4
[2023-03-17 08:41:03] [INFO ] State equation strengthened by 12 read => feed constraints.
[2023-03-17 08:41:03] [INFO ] After 13ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :1 sat :0 real:5
[2023-03-17 08:41:03] [INFO ] After 245ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2023-03-17 08:41:03] [INFO ] [Nat]Absence check using 15 positive place invariants in 8 ms returned sat
[2023-03-17 08:41:03] [INFO ] [Nat]Absence check using 15 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-17 08:41:03] [INFO ] After 83ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2023-03-17 08:41:03] [INFO ] After 42ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :1 sat :5
[2023-03-17 08:41:03] [INFO ] After 141ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 83 ms.
[2023-03-17 08:41:04] [INFO ] After 416ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 10 ms.
Support contains 5 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 56/56 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 65 transition count 54
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 63 transition count 54
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 63 transition count 52
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 61 transition count 52
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 60 transition count 51
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 60 transition count 51
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 16 place count 57 transition count 48
Free-agglomeration rule applied 9 times.
Iterating global reduction 2 with 9 rules applied. Total rules applied 25 place count 57 transition count 39
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 34 place count 48 transition count 39
Applied a total of 34 rules in 45 ms. Remains 48 /65 variables (removed 17) and now considering 39/56 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 45 ms. Remains : 48/65 places, 39/56 transitions.
Finished random walk after 78 steps, including 0 resets, run visited all 5 properties in 3 ms. (steps per millisecond=26 )
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
[2023-03-17 08:41:04] [INFO ] Flatten gal took : 14 ms
[2023-03-17 08:41:04] [INFO ] Flatten gal took : 15 ms
[2023-03-17 08:41:04] [INFO ] Input system was already deterministic with 56 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Starting structural reductions in SI_CTL mode, iteration 0 : 65/65 places, 56/56 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 64 transition count 53
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 62 transition count 53
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 62 transition count 51
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 60 transition count 51
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 59 transition count 50
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 59 transition count 50
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 58 transition count 49
Applied a total of 12 rules in 24 ms. Remains 58 /65 variables (removed 7) and now considering 49/56 (removed 7) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 26 ms. Remains : 58/65 places, 49/56 transitions.
[2023-03-17 08:41:04] [INFO ] Flatten gal took : 7 ms
[2023-03-17 08:41:04] [INFO ] Flatten gal took : 8 ms
[2023-03-17 08:41:04] [INFO ] Input system was already deterministic with 49 transitions.
Incomplete random walk after 10000 steps, including 649 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Finished probabilistic random walk after 92 steps, run visited all 1 properties in 24 ms. (steps per millisecond=3 )
Probabilistic random walk after 92 steps, saw 82 distinct states, run finished after 24 ms. (steps per millisecond=3 ) properties seen :1
FORMULA Parking-PT-104-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 56/56 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 64 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 55
Applied a total of 2 rules in 8 ms. Remains 64 /65 variables (removed 1) and now considering 55/56 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 64/65 places, 55/56 transitions.
[2023-03-17 08:41:04] [INFO ] Flatten gal took : 8 ms
[2023-03-17 08:41:04] [INFO ] Flatten gal took : 8 ms
[2023-03-17 08:41:04] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 56/56 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 64 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 55
Applied a total of 2 rules in 9 ms. Remains 64 /65 variables (removed 1) and now considering 55/56 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10 ms. Remains : 64/65 places, 55/56 transitions.
[2023-03-17 08:41:04] [INFO ] Flatten gal took : 7 ms
[2023-03-17 08:41:04] [INFO ] Flatten gal took : 8 ms
[2023-03-17 08:41:04] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 56/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 65 /65 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 65/65 places, 56/56 transitions.
[2023-03-17 08:41:04] [INFO ] Flatten gal took : 7 ms
[2023-03-17 08:41:04] [INFO ] Flatten gal took : 7 ms
[2023-03-17 08:41:04] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 65/65 places, 56/56 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 65 transition count 54
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 63 transition count 54
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 63 transition count 52
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 61 transition count 52
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 60 transition count 51
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 60 transition count 51
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 12 place count 59 transition count 50
Applied a total of 12 rules in 33 ms. Remains 59 /65 variables (removed 6) and now considering 50/56 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 33 ms. Remains : 59/65 places, 50/56 transitions.
[2023-03-17 08:41:04] [INFO ] Flatten gal took : 6 ms
[2023-03-17 08:41:04] [INFO ] Flatten gal took : 7 ms
[2023-03-17 08:41:04] [INFO ] Input system was already deterministic with 50 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=0 )
FORMULA Parking-PT-104-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 56/56 transitions.
Applied a total of 0 rules in 3 ms. Remains 65 /65 variables (removed 0) and now considering 56/56 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 65/65 places, 56/56 transitions.
[2023-03-17 08:41:04] [INFO ] Flatten gal took : 7 ms
[2023-03-17 08:41:04] [INFO ] Flatten gal took : 7 ms
[2023-03-17 08:41:04] [INFO ] Input system was already deterministic with 56 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 65/65 places, 56/56 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 65 transition count 54
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 63 transition count 54
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 63 transition count 52
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 61 transition count 52
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 10 place count 60 transition count 51
Applied a total of 10 rules in 17 ms. Remains 60 /65 variables (removed 5) and now considering 51/56 (removed 5) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 17 ms. Remains : 60/65 places, 51/56 transitions.
[2023-03-17 08:41:04] [INFO ] Flatten gal took : 6 ms
[2023-03-17 08:41:04] [INFO ] Flatten gal took : 7 ms
[2023-03-17 08:41:04] [INFO ] Input system was already deterministic with 51 transitions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 56/56 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 64 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 55
Applied a total of 2 rules in 5 ms. Remains 64 /65 variables (removed 1) and now considering 55/56 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 64/65 places, 55/56 transitions.
[2023-03-17 08:41:04] [INFO ] Flatten gal took : 6 ms
[2023-03-17 08:41:04] [INFO ] Flatten gal took : 7 ms
[2023-03-17 08:41:04] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 65/65 places, 56/56 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 65 transition count 54
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 63 transition count 54
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 63 transition count 52
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 61 transition count 52
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 60 transition count 51
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 60 transition count 51
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 12 place count 59 transition count 50
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 59 transition count 50
Applied a total of 13 rules in 35 ms. Remains 59 /65 variables (removed 6) and now considering 50/56 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 35 ms. Remains : 59/65 places, 50/56 transitions.
[2023-03-17 08:41:04] [INFO ] Flatten gal took : 5 ms
[2023-03-17 08:41:04] [INFO ] Flatten gal took : 6 ms
[2023-03-17 08:41:04] [INFO ] Input system was already deterministic with 50 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 65/65 places, 56/56 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 1 place count 65 transition count 55
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 3 place count 64 transition count 54
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 4 place count 63 transition count 54
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 4 place count 63 transition count 53
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 6 place count 62 transition count 53
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 7 place count 61 transition count 52
Iterating global reduction 3 with 1 rules applied. Total rules applied 8 place count 61 transition count 52
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 9 place count 61 transition count 52
Applied a total of 9 rules in 22 ms. Remains 61 /65 variables (removed 4) and now considering 52/56 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 61/65 places, 52/56 transitions.
[2023-03-17 08:41:04] [INFO ] Flatten gal took : 6 ms
[2023-03-17 08:41:04] [INFO ] Flatten gal took : 7 ms
[2023-03-17 08:41:04] [INFO ] Input system was already deterministic with 52 transitions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 56/56 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 64 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 55
Applied a total of 2 rules in 5 ms. Remains 64 /65 variables (removed 1) and now considering 55/56 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 64/65 places, 55/56 transitions.
[2023-03-17 08:41:04] [INFO ] Flatten gal took : 6 ms
[2023-03-17 08:41:04] [INFO ] Flatten gal took : 6 ms
[2023-03-17 08:41:04] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 56/56 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 64 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 55
Applied a total of 2 rules in 4 ms. Remains 64 /65 variables (removed 1) and now considering 55/56 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 64/65 places, 55/56 transitions.
[2023-03-17 08:41:04] [INFO ] Flatten gal took : 6 ms
[2023-03-17 08:41:04] [INFO ] Flatten gal took : 6 ms
[2023-03-17 08:41:04] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in LTL mode, iteration 0 : 65/65 places, 56/56 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 64 transition count 55
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 55
Applied a total of 2 rules in 4 ms. Remains 64 /65 variables (removed 1) and now considering 55/56 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 64/65 places, 55/56 transitions.
[2023-03-17 08:41:04] [INFO ] Flatten gal took : 6 ms
[2023-03-17 08:41:04] [INFO ] Flatten gal took : 6 ms
[2023-03-17 08:41:04] [INFO ] Input system was already deterministic with 55 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 65/65 places, 56/56 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 1 place count 65 transition count 55
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 64 transition count 55
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 64 transition count 54
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 63 transition count 54
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 5 place count 62 transition count 53
Iterating global reduction 2 with 1 rules applied. Total rules applied 6 place count 62 transition count 53
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 61 transition count 52
Applied a total of 8 rules in 14 ms. Remains 61 /65 variables (removed 4) and now considering 52/56 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 14 ms. Remains : 61/65 places, 52/56 transitions.
[2023-03-17 08:41:04] [INFO ] Flatten gal took : 6 ms
[2023-03-17 08:41:04] [INFO ] Flatten gal took : 6 ms
[2023-03-17 08:41:04] [INFO ] Input system was already deterministic with 52 transitions.
[2023-03-17 08:41:04] [INFO ] Flatten gal took : 7 ms
[2023-03-17 08:41:04] [INFO ] Flatten gal took : 7 ms
[2023-03-17 08:41:04] [INFO ] Export to MCC of 12 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 6 ms.
[2023-03-17 08:41:04] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 65 places, 56 transitions and 198 arcs took 1 ms.
Total runtime 4724 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=CTLCardinality.xml --memory=6 --mcc-mode
parse successfull
net created successfully
Net: Petri
(NrP: 65 NrTr: 56 NrArc: 198)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec
net check time: 0m 0.000sec
init dd package: 0m 3.802sec
RS generation: 0m 0.013sec
-> reachability set: #nodes 461 (4.6e+02) #states 31,745 (4)
starting MCC model checker
--------------------------
checking: AG [AF [EX [AX [[p31<=1 & 1<=p31]]]]]
normalized: ~ [E [true U EG [~ [EX [~ [EX [~ [[p31<=1 & 1<=p31]]]]]]]]]
abstracting: (1<=p31)
states: 1,024 (3)
abstracting: (p31<=1)
states: 31,745 (4)
........................
EG iterations: 22
-> the formula is FALSE
FORMULA Parking-PT-104-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.161sec
checking: EG [EX [[p8<=1 & 1<=p8]]]
normalized: EG [EX [[p8<=1 & 1<=p8]]]
abstracting: (1<=p8)
states: 15,872 (4)
abstracting: (p8<=1)
states: 31,745 (4)
.....................
EG iterations: 20
-> the formula is TRUE
FORMULA Parking-PT-104-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.020sec
checking: EF [AG [EF [AX [[[0<=p11 & p11<=0] | [p25<=1 & 1<=p25]]]]]]
normalized: E [true U ~ [E [true U ~ [E [true U ~ [EX [~ [[[p25<=1 & 1<=p25] | [0<=p11 & p11<=0]]]]]]]]]]
abstracting: (p11<=0)
states: 15,873 (4)
abstracting: (0<=p11)
states: 31,745 (4)
abstracting: (1<=p25)
states: 768
abstracting: (p25<=1)
states: 31,745 (4)
.-> the formula is TRUE
FORMULA Parking-PT-104-CTLCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.037sec
checking: A [AF [~ [AF [[p6<=0 & 0<=p6]]]] U EF [~ [[p62<=0 & 0<=p62]]]]
normalized: [~ [EG [~ [E [true U ~ [[p62<=0 & 0<=p62]]]]]] & ~ [E [~ [E [true U ~ [[p62<=0 & 0<=p62]]]] U [EG [~ [EG [~ [[p6<=0 & 0<=p6]]]]] & ~ [E [true U ~ [[p62<=0 & 0<=p62]]]]]]]]
abstracting: (0<=p62)
states: 31,745 (4)
abstracting: (p62<=0)
states: 26,113 (4)
abstracting: (0<=p6)
states: 31,745 (4)
abstracting: (p6<=0)
states: 15,873 (4)
.................
EG iterations: 17
..
EG iterations: 2
abstracting: (0<=p62)
states: 31,745 (4)
abstracting: (p62<=0)
states: 26,113 (4)
abstracting: (0<=p62)
states: 31,745 (4)
abstracting: (p62<=0)
states: 26,113 (4)
.
EG iterations: 1
-> the formula is TRUE
FORMULA Parking-PT-104-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.107sec
checking: AF [[[p50<=1 & 1<=p50] | AG [EX [[~ [[p37<=0 & 0<=p37]] & ~ [[p16<=1 & 1<=p16]]]]]]]
normalized: ~ [EG [~ [[~ [E [true U ~ [EX [[~ [[p16<=1 & 1<=p16]] & ~ [[p37<=0 & 0<=p37]]]]]]] | [p50<=1 & 1<=p50]]]]]
abstracting: (1<=p50)
states: 1,024 (3)
abstracting: (p50<=1)
states: 31,745 (4)
abstracting: (0<=p37)
states: 31,745 (4)
abstracting: (p37<=0)
states: 31,233 (4)
abstracting: (1<=p16)
states: 15,872 (4)
abstracting: (p16<=1)
states: 31,745 (4)
..
EG iterations: 1
-> the formula is FALSE
FORMULA Parking-PT-104-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: AF [[[p64<=0 & 0<=p64] & [E [[[p5<=0 & 0<=p5] | [p25<=1 & 1<=p25]] U [p16<=1 & 1<=p16]] & AG [[[p27<=1 & 1<=p27] | [[p45<=0 & 0<=p45] | [p15<=1 & 1<=p15]]]]]]]
normalized: ~ [EG [~ [[[~ [E [true U ~ [[[[p15<=1 & 1<=p15] | [p45<=0 & 0<=p45]] | [p27<=1 & 1<=p27]]]]] & E [[[p25<=1 & 1<=p25] | [p5<=0 & 0<=p5]] U [p16<=1 & 1<=p16]]] & [p64<=0 & 0<=p64]]]]]
abstracting: (0<=p64)
states: 31,745 (4)
abstracting: (p64<=0)
states: 22,017 (4)
abstracting: (1<=p16)
states: 15,872 (4)
abstracting: (p16<=1)
states: 31,745 (4)
abstracting: (0<=p5)
states: 31,745 (4)
abstracting: (p5<=0)
states: 15,873 (4)
abstracting: (1<=p25)
states: 768
abstracting: (p25<=1)
states: 31,745 (4)
abstracting: (1<=p27)
states: 768
abstracting: (p27<=1)
states: 31,745 (4)
abstracting: (0<=p45)
states: 31,745 (4)
abstracting: (p45<=0)
states: 31,233 (4)
abstracting: (1<=p15)
states: 15,872 (4)
abstracting: (p15<=1)
states: 31,745 (4)
........
EG iterations: 8
-> the formula is FALSE
FORMULA Parking-PT-104-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.043sec
checking: EG [[[p36<=0 & 0<=p36] & [[p5<=0 & 0<=p5] | [[[p49<=1 & 1<=p49] & AG [[[p49<=0 & 0<=p49] | [p58<=1 & 1<=p58]]]] | [[p60<=0 & 0<=p60] & [p56<=1 & 1<=p56]]]]]]
normalized: EG [[[[[[p56<=1 & 1<=p56] & [p60<=0 & 0<=p60]] | [~ [E [true U ~ [[[p58<=1 & 1<=p58] | [p49<=0 & 0<=p49]]]]] & [p49<=1 & 1<=p49]]] | [p5<=0 & 0<=p5]] & [p36<=0 & 0<=p36]]]
abstracting: (0<=p36)
states: 31,745 (4)
abstracting: (p36<=0)
states: 31,233 (4)
abstracting: (0<=p5)
states: 31,745 (4)
abstracting: (p5<=0)
states: 15,873 (4)
abstracting: (1<=p49)
states: 1,024 (3)
abstracting: (p49<=1)
states: 31,745 (4)
abstracting: (0<=p49)
states: 31,745 (4)
abstracting: (p49<=0)
states: 30,721 (4)
abstracting: (1<=p58)
states: 22,528 (4)
abstracting: (p58<=1)
states: 31,745 (4)
abstracting: (0<=p60)
states: 31,745 (4)
abstracting: (p60<=0)
states: 1,025 (3)
abstracting: (1<=p56)
states: 1,024 (3)
abstracting: (p56<=1)
states: 31,745 (4)
.................
EG iterations: 17
-> the formula is TRUE
FORMULA Parking-PT-104-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.090sec
checking: AF [[[[p29<=1 & 1<=p29] & [p60<=1 & 1<=p60]] | [AG [E [[p32<=0 & 0<=p32] U E [[p56<=0 & 0<=p56] U [p13<=0 & 0<=p13]]]] & EF [[[p38<=0 & 0<=p38] & AF [[[p4<=0 & 0<=p4] & [p18<=1 & 1<=p18]]]]]]]]
normalized: ~ [EG [~ [[[E [true U [~ [EG [~ [[[p18<=1 & 1<=p18] & [p4<=0 & 0<=p4]]]]] & [p38<=0 & 0<=p38]]] & ~ [E [true U ~ [E [[p32<=0 & 0<=p32] U E [[p56<=0 & 0<=p56] U [p13<=0 & 0<=p13]]]]]]] | [[p60<=1 & 1<=p60] & [p29<=1 & 1<=p29]]]]]]
abstracting: (1<=p29)
states: 512
abstracting: (p29<=1)
states: 31,745 (4)
abstracting: (1<=p60)
states: 30,720 (4)
abstracting: (p60<=1)
states: 31,745 (4)
abstracting: (0<=p13)
states: 31,745 (4)
abstracting: (p13<=0)
states: 15,873 (4)
abstracting: (0<=p56)
states: 31,745 (4)
abstracting: (p56<=0)
states: 30,721 (4)
abstracting: (0<=p32)
states: 31,745 (4)
abstracting: (p32<=0)
states: 5,633 (3)
abstracting: (0<=p38)
states: 31,745 (4)
abstracting: (p38<=0)
states: 30,721 (4)
abstracting: (0<=p4)
states: 31,745 (4)
abstracting: (p4<=0)
states: 15,873 (4)
abstracting: (1<=p18)
states: 768
abstracting: (p18<=1)
states: 31,745 (4)
..........
EG iterations: 10
..............
EG iterations: 14
-> the formula is FALSE
FORMULA Parking-PT-104-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.045sec
checking: E [AX [[EG [[[p29<=0 & 0<=p29] | [p46<=1 & 1<=p46]]] & [[p16<=0 & 0<=p16] | [p10<=1 & 1<=p10]]]] U ~ [[~ [EF [[p4<=1 & 1<=p4]]] | ~ [[E [AG [[[p11<=0 & 0<=p11] | [p41<=1 & 1<=p41]]] U ~ [[p13<=1 & 1<=p13]]] | ~ [[AF [[p24<=1 & 1<=p24]] | [[p1<=0 & 0<=p1] | [p54<=1 & 1<=p54]]]]]]]]]
normalized: E [~ [EX [~ [[[[p10<=1 & 1<=p10] | [p16<=0 & 0<=p16]] & EG [[[p46<=1 & 1<=p46] | [p29<=0 & 0<=p29]]]]]]] U ~ [[~ [[~ [[[[p54<=1 & 1<=p54] | [p1<=0 & 0<=p1]] | ~ [EG [~ [[p24<=1 & 1<=p24]]]]]] | E [~ [E [true U ~ [[[p41<=1 & 1<=p41] | [p11<=0 & 0<=p11]]]]] U ~ [[p13<=1 & 1<=p13]]]]] | ~ [E [true U [p4<=1 & 1<=p4]]]]]]
abstracting: (1<=p4)
states: 15,872 (4)
abstracting: (p4<=1)
states: 31,745 (4)
abstracting: (1<=p13)
states: 15,872 (4)
abstracting: (p13<=1)
states: 31,745 (4)
abstracting: (0<=p11)
states: 31,745 (4)
abstracting: (p11<=0)
states: 15,873 (4)
abstracting: (1<=p41)
states: 768
abstracting: (p41<=1)
states: 31,745 (4)
abstracting: (1<=p24)
states: 26,112 (4)
abstracting: (p24<=1)
states: 31,745 (4)
............
EG iterations: 12
abstracting: (0<=p1)
states: 31,745 (4)
abstracting: (p1<=0)
states: 15,873 (4)
abstracting: (1<=p54)
states: 1,024 (3)
abstracting: (p54<=1)
states: 31,745 (4)
abstracting: (0<=p29)
states: 31,745 (4)
abstracting: (p29<=0)
states: 31,233 (4)
abstracting: (1<=p46)
states: 1,024 (3)
abstracting: (p46<=1)
states: 31,745 (4)
..............
EG iterations: 14
abstracting: (0<=p16)
states: 31,745 (4)
abstracting: (p16<=0)
states: 15,873 (4)
abstracting: (1<=p10)
states: 15,872 (4)
abstracting: (p10<=1)
states: 31,745 (4)
.-> the formula is TRUE
FORMULA Parking-PT-104-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.027sec
checking: A [AF [[~ [E [[[p26<=0 & 0<=p26] | [p62<=1 & 1<=p62]] U [[p43<=0 & 0<=p43] | [p38<=1 & 1<=p38]]]] & [EF [[[p23<=0 & 0<=p23] | [p63<=1 & 1<=p63]]] & EG [[[p39<=0 & 0<=p39] | [p54<=1 & 1<=p54]]]]]] U [AF [[p6<=1 & 1<=p6]] & [[p40<=0 & 0<=p40] & AG [[AG [AX [[p11<=1 & 1<=p11]]] | [p14<=1 & 1<=p14]]]]]]
normalized: [~ [EG [~ [[[~ [E [true U ~ [[[p14<=1 & 1<=p14] | ~ [E [true U EX [~ [[p11<=1 & 1<=p11]]]]]]]]] & [p40<=0 & 0<=p40]] & ~ [EG [~ [[p6<=1 & 1<=p6]]]]]]]] & ~ [E [~ [[[~ [E [true U ~ [[[p14<=1 & 1<=p14] | ~ [E [true U EX [~ [[p11<=1 & 1<=p11]]]]]]]]] & [p40<=0 & 0<=p40]] & ~ [EG [~ [[p6<=1 & 1<=p6]]]]]] U [EG [~ [[[EG [[[p54<=1 & 1<=p54] | [p39<=0 & 0<=p39]]] & E [true U [[p63<=1 & 1<=p63] | [p23<=0 & 0<=p23]]]] & ~ [E [[[p62<=1 & 1<=p62] | [p26<=0 & 0<=p26]] U [[p38<=1 & 1<=p38] | [p43<=0 & 0<=p43]]]]]]] & ~ [[[~ [E [true U ~ [[[p14<=1 & 1<=p14] | ~ [E [true U EX [~ [[p11<=1 & 1<=p11]]]]]]]]] & [p40<=0 & 0<=p40]] & ~ [EG [~ [[p6<=1 & 1<=p6]]]]]]]]]]
abstracting: (1<=p6)
states: 15,872 (4)
abstracting: (p6<=1)
states: 31,745 (4)
...............
EG iterations: 15
abstracting: (0<=p40)
states: 31,745 (4)
abstracting: (p40<=0)
states: 5,121 (3)
abstracting: (1<=p11)
states: 15,872 (4)
abstracting: (p11<=1)
states: 31,745 (4)
.abstracting: (1<=p14)
states: 15,872 (4)
abstracting: (p14<=1)
states: 31,745 (4)
abstracting: (0<=p43)
states: 31,745 (4)
abstracting: (p43<=0)
states: 31,233 (4)
abstracting: (1<=p38)
states: 1,024 (3)
abstracting: (p38<=1)
states: 31,745 (4)
abstracting: (0<=p26)
states: 31,745 (4)
abstracting: (p26<=0)
states: 30,977 (4)
abstracting: (1<=p62)
states: 5,632 (3)
abstracting: (p62<=1)
states: 31,745 (4)
abstracting: (0<=p23)
states: 31,745 (4)
abstracting: (p23<=0)
states: 30,721 (4)
abstracting: (1<=p63)
states: 9,728 (3)
abstracting: (p63<=1)
states: 31,745 (4)
abstracting: (0<=p39)
states: 31,745 (4)
abstracting: (p39<=0)
states: 30,721 (4)
abstracting: (1<=p54)
states: 1,024 (3)
abstracting: (p54<=1)
states: 31,745 (4)
.
EG iterations: 1
...........
EG iterations: 11
abstracting: (1<=p6)
states: 15,872 (4)
abstracting: (p6<=1)
states: 31,745 (4)
...............
EG iterations: 15
abstracting: (0<=p40)
states: 31,745 (4)
abstracting: (p40<=0)
states: 5,121 (3)
abstracting: (1<=p11)
states: 15,872 (4)
abstracting: (p11<=1)
states: 31,745 (4)
.abstracting: (1<=p14)
states: 15,872 (4)
abstracting: (p14<=1)
states: 31,745 (4)
abstracting: (1<=p6)
states: 15,872 (4)
abstracting: (p6<=1)
states: 31,745 (4)
...............
EG iterations: 15
abstracting: (0<=p40)
states: 31,745 (4)
abstracting: (p40<=0)
states: 5,121 (3)
abstracting: (1<=p11)
states: 15,872 (4)
abstracting: (p11<=1)
states: 31,745 (4)
.abstracting: (1<=p14)
states: 15,872 (4)
abstracting: (p14<=1)
states: 31,745 (4)
.
EG iterations: 1
-> the formula is FALSE
FORMULA Parking-PT-104-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.050sec
checking: [E [~ [[[EG [[p51<=1 & 1<=p51]] | [AF [EG [[[p55<=0 & 0<=p55] | [p4<=1 & 1<=p4]]]] | ~ [[[p25<=0 & 0<=p25] | [p26<=1 & 1<=p26]]]]] | [EX [[p21<=1 & 1<=p21]] | [E [[p16<=1 & 1<=p16] U [p6<=0 & 0<=p6]] | AF [[p2<=0 & 0<=p2]]]]]] U AX [AF [[[p37<=0 & 0<=p37] | [p61<=1 & 1<=p61]]]]] & AG [AX [[[AF [[p38<=0 & 0<=p38]] | [A [[[p25<=0 & 0<=p25] | [p15<=1 & 1<=p15]] U [[p28<=0 & 0<=p28] | [p32<=1 & 1<=p32]]] | [[0<=p37 & p37<=0] & [p33<=1 & 1<=p33]]]] | [[[p59<=0 & 0<=p59] & [p41<=1 & 1<=p41]] | [[p30<=1 & 1<=p30] | [p20<=0 & 0<=p20]]]]]]]
normalized: [~ [E [true U EX [~ [[[[[p30<=1 & 1<=p30] | [p20<=0 & 0<=p20]] | [[p41<=1 & 1<=p41] & [p59<=0 & 0<=p59]]] | [[[[p33<=1 & 1<=p33] & [0<=p37 & p37<=0]] | [~ [EG [~ [[[p32<=1 & 1<=p32] | [p28<=0 & 0<=p28]]]]] & ~ [E [~ [[[p32<=1 & 1<=p32] | [p28<=0 & 0<=p28]]] U [~ [[[p15<=1 & 1<=p15] | [p25<=0 & 0<=p25]]] & ~ [[[p32<=1 & 1<=p32] | [p28<=0 & 0<=p28]]]]]]]] | ~ [EG [~ [[p38<=0 & 0<=p38]]]]]]]]]] & E [~ [[[[~ [EG [~ [[p2<=0 & 0<=p2]]]] | E [[p16<=1 & 1<=p16] U [p6<=0 & 0<=p6]]] | EX [[p21<=1 & 1<=p21]]] | [[~ [[[p26<=1 & 1<=p26] | [p25<=0 & 0<=p25]]] | ~ [EG [~ [EG [[[p4<=1 & 1<=p4] | [p55<=0 & 0<=p55]]]]]]] | EG [[p51<=1 & 1<=p51]]]]] U ~ [EX [EG [~ [[[p61<=1 & 1<=p61] | [p37<=0 & 0<=p37]]]]]]]]
abstracting: (0<=p37)
states: 31,745 (4)
abstracting: (p37<=0)
states: 31,233 (4)
abstracting: (1<=p61)
states: 6,656 (3)
abstracting: (p61<=1)
states: 31,745 (4)
...........
EG iterations: 11
.abstracting: (1<=p51)
states: 1,024 (3)
abstracting: (p51<=1)
states: 31,745 (4)
.
EG iterations: 1
abstracting: (0<=p55)
states: 31,745 (4)
abstracting: (p55<=0)
states: 30,721 (4)
abstracting: (1<=p4)
states: 15,872 (4)
abstracting: (p4<=1)
states: 31,745 (4)
.............
EG iterations: 13
...............
EG iterations: 15
abstracting: (0<=p25)
states: 31,745 (4)
abstracting: (p25<=0)
states: 30,977 (4)
abstracting: (1<=p26)
states: 768
abstracting: (p26<=1)
states: 31,745 (4)
abstracting: (1<=p21)
states: 512
abstracting: (p21<=1)
states: 31,745 (4)
.abstracting: (0<=p6)
states: 31,745 (4)
abstracting: (p6<=0)
states: 15,873 (4)
abstracting: (1<=p16)
states: 15,872 (4)
abstracting: (p16<=1)
states: 31,745 (4)
abstracting: (0<=p2)
states: 31,745 (4)
abstracting: (p2<=0)
states: 15,873 (4)
.................
EG iterations: 17
abstracting: (0<=p38)
states: 31,745 (4)
abstracting: (p38<=0)
states: 30,721 (4)
.
EG iterations: 1
abstracting: (0<=p28)
states: 31,745 (4)
abstracting: (p28<=0)
states: 30,977 (4)
abstracting: (1<=p32)
states: 26,112 (4)
abstracting: (p32<=1)
states: 31,745 (4)
abstracting: (0<=p25)
states: 31,745 (4)
abstracting: (p25<=0)
states: 30,977 (4)
abstracting: (1<=p15)
states: 15,872 (4)
abstracting: (p15<=1)
states: 31,745 (4)
abstracting: (0<=p28)
states: 31,745 (4)
abstracting: (p28<=0)
states: 30,977 (4)
abstracting: (1<=p32)
states: 26,112 (4)
abstracting: (p32<=1)
states: 31,745 (4)
abstracting: (0<=p28)
states: 31,745 (4)
abstracting: (p28<=0)
states: 30,977 (4)
abstracting: (1<=p32)
states: 26,112 (4)
abstracting: (p32<=1)
states: 31,745 (4)
............
EG iterations: 12
abstracting: (p37<=0)
states: 31,233 (4)
abstracting: (0<=p37)
states: 31,745 (4)
abstracting: (1<=p33)
states: 768
abstracting: (p33<=1)
states: 31,745 (4)
abstracting: (0<=p59)
states: 31,745 (4)
abstracting: (p59<=0)
states: 30,721 (4)
abstracting: (1<=p41)
states: 768
abstracting: (p41<=1)
states: 31,745 (4)
abstracting: (0<=p20)
states: 31,745 (4)
abstracting: (p20<=0)
states: 30,977 (4)
abstracting: (1<=p30)
states: 1,024 (3)
abstracting: (p30<=1)
states: 31,745 (4)
.-> the formula is TRUE
FORMULA Parking-PT-104-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.103sec
checking: A [AF [[[[AX [[p11<=1 & 1<=p11]] | EX [[p39<=0 & 0<=p39]]] | [[p64<=0 & 0<=p64] | [p16<=0 & 0<=p16]]] | [[[p21<=1 & 1<=p21] | [p44<=0 & 0<=p44]] | [[p52<=1 & 1<=p52] | [[p22<=1 & 1<=p22] | [EF [~ [[[p32<=0 & 0<=p32] | [p44<=1 & 1<=p44]]]] & AX [[[[p37<=0 & 0<=p37] | [p46<=1 & 1<=p46]] & [[p64<=0 & 0<=p64] | [p63<=1 & 1<=p63]]]]]]]]]] U [AX [[[p32<=1 & 1<=p32] & ~ [EF [[p37<=1 & 1<=p37]]]]] & [A [[p14<=1 & 1<=p14] U [[p21<=0 & 0<=p21] | [p19<=1 & 1<=p19]]] & [EX [[AG [[[p34<=0 & 0<=p34] | [p50<=1 & 1<=p50]]] & [[[p2<=0 & 0<=p2] | [p28<=1 & 1<=p28]] & [p38<=1 & 1<=p38]]]] | AX [[[p50<=0 & 0<=p50] | [p54<=1 & 1<=p54]]]]]]]
normalized: [~ [EG [~ [[[[~ [EX [~ [[[p54<=1 & 1<=p54] | [p50<=0 & 0<=p50]]]]] | EX [[[[p38<=1 & 1<=p38] & [[p28<=1 & 1<=p28] | [p2<=0 & 0<=p2]]] & ~ [E [true U ~ [[[p50<=1 & 1<=p50] | [p34<=0 & 0<=p34]]]]]]]] & [~ [EG [~ [[[p19<=1 & 1<=p19] | [p21<=0 & 0<=p21]]]]] & ~ [E [~ [[[p19<=1 & 1<=p19] | [p21<=0 & 0<=p21]]] U [~ [[p14<=1 & 1<=p14]] & ~ [[[p19<=1 & 1<=p19] | [p21<=0 & 0<=p21]]]]]]]] & ~ [EX [~ [[~ [E [true U [p37<=1 & 1<=p37]]] & [p32<=1 & 1<=p32]]]]]]]]] & ~ [E [~ [[[[~ [EX [~ [[[p54<=1 & 1<=p54] | [p50<=0 & 0<=p50]]]]] | EX [[[[p38<=1 & 1<=p38] & [[p28<=1 & 1<=p28] | [p2<=0 & 0<=p2]]] & ~ [E [true U ~ [[[p50<=1 & 1<=p50] | [p34<=0 & 0<=p34]]]]]]]] & [~ [EG [~ [[[p19<=1 & 1<=p19] | [p21<=0 & 0<=p21]]]]] & ~ [E [~ [[[p19<=1 & 1<=p19] | [p21<=0 & 0<=p21]]] U [~ [[p14<=1 & 1<=p14]] & ~ [[[p19<=1 & 1<=p19] | [p21<=0 & 0<=p21]]]]]]]] & ~ [EX [~ [[~ [E [true U [p37<=1 & 1<=p37]]] & [p32<=1 & 1<=p32]]]]]]] U [EG [~ [[[[[[~ [EX [~ [[[[p63<=1 & 1<=p63] | [p64<=0 & 0<=p64]] & [[p46<=1 & 1<=p46] | [p37<=0 & 0<=p37]]]]]] & E [true U ~ [[[p44<=1 & 1<=p44] | [p32<=0 & 0<=p32]]]]] | [p22<=1 & 1<=p22]] | [p52<=1 & 1<=p52]] | [[p44<=0 & 0<=p44] | [p21<=1 & 1<=p21]]] | [[[p16<=0 & 0<=p16] | [p64<=0 & 0<=p64]] | [EX [[p39<=0 & 0<=p39]] | ~ [EX [~ [[p11<=1 & 1<=p11]]]]]]]]] & ~ [[[[~ [EX [~ [[[p54<=1 & 1<=p54] | [p50<=0 & 0<=p50]]]]] | EX [[[[p38<=1 & 1<=p38] & [[p28<=1 & 1<=p28] | [p2<=0 & 0<=p2]]] & ~ [E [true U ~ [[[p50<=1 & 1<=p50] | [p34<=0 & 0<=p34]]]]]]]] & [~ [EG [~ [[[p19<=1 & 1<=p19] | [p21<=0 & 0<=p21]]]]] & ~ [E [~ [[[p19<=1 & 1<=p19] | [p21<=0 & 0<=p21]]] U [~ [[p14<=1 & 1<=p14]] & ~ [[[p19<=1 & 1<=p19] | [p21<=0 & 0<=p21]]]]]]]] & ~ [EX [~ [[~ [E [true U [p37<=1 & 1<=p37]]] & [p32<=1 & 1<=p32]]]]]]]]]]]
abstracting: (1<=p32)
states: 26,112 (4)
abstracting: (p32<=1)
states: 31,745 (4)
abstracting: (1<=p37)
states: 512
abstracting: (p37<=1)
states: 31,745 (4)
.abstracting: (0<=p21)
states: 31,745 (4)
abstracting: (p21<=0)
states: 31,233 (4)
abstracting: (1<=p19)
states: 768
abstracting: (p19<=1)
states: 31,745 (4)
abstracting: (1<=p14)
states: 15,872 (4)
abstracting: (p14<=1)
states: 31,745 (4)
abstracting: (0<=p21)
states: 31,745 (4)
abstracting: (p21<=0)
states: 31,233 (4)
abstracting: (1<=p19)
states: 768
abstracting: (p19<=1)
states: 31,745 (4)
abstracting: (0<=p21)
states: 31,745 (4)
abstracting: (p21<=0)
states: 31,233 (4)
abstracting: (1<=p19)
states: 768
abstracting: (p19<=1)
states: 31,745 (4)
.
EG iterations: 1
abstracting: (0<=p34)
states: 31,745 (4)
abstracting: (p34<=0)
states: 30,977 (4)
abstracting: (1<=p50)
states: 1,024 (3)
abstracting: (p50<=1)
states: 31,745 (4)
abstracting: (0<=p2)
states: 31,745 (4)
abstracting: (p2<=0)
states: 15,873 (4)
abstracting: (1<=p28)
states: 768
abstracting: (p28<=1)
states: 31,745 (4)
abstracting: (1<=p38)
states: 1,024 (3)
abstracting: (p38<=1)
states: 31,745 (4)
.abstracting: (0<=p50)
states: 31,745 (4)
abstracting: (p50<=0)
states: 30,721 (4)
abstracting: (1<=p54)
states: 1,024 (3)
abstracting: (p54<=1)
states: 31,745 (4)
.abstracting: (1<=p11)
states: 15,872 (4)
abstracting: (p11<=1)
states: 31,745 (4)
.abstracting: (0<=p39)
states: 31,745 (4)
abstracting: (p39<=0)
states: 30,721 (4)
.abstracting: (0<=p64)
states: 31,745 (4)
abstracting: (p64<=0)
states: 22,017 (4)
abstracting: (0<=p16)
states: 31,745 (4)
abstracting: (p16<=0)
states: 15,873 (4)
abstracting: (1<=p21)
states: 512
abstracting: (p21<=1)
states: 31,745 (4)
abstracting: (0<=p44)
states: 31,745 (4)
abstracting: (p44<=0)
states: 31,233 (4)
abstracting: (1<=p52)
states: 1,024 (3)
abstracting: (p52<=1)
states: 31,745 (4)
abstracting: (1<=p22)
states: 1,024 (3)
abstracting: (p22<=1)
states: 31,745 (4)
abstracting: (0<=p32)
states: 31,745 (4)
abstracting: (p32<=0)
states: 5,633 (3)
abstracting: (1<=p44)
states: 512
abstracting: (p44<=1)
states: 31,745 (4)
abstracting: (0<=p37)
states: 31,745 (4)
abstracting: (p37<=0)
states: 31,233 (4)
abstracting: (1<=p46)
states: 1,024 (3)
abstracting: (p46<=1)
states: 31,745 (4)
abstracting: (0<=p64)
states: 31,745 (4)
abstracting: (p64<=0)
states: 22,017 (4)
abstracting: (1<=p63)
states: 9,728 (3)
abstracting: (p63<=1)
states: 31,745 (4)
..
EG iterations: 1
abstracting: (1<=p32)
states: 26,112 (4)
abstracting: (p32<=1)
states: 31,745 (4)
abstracting: (1<=p37)
states: 512
abstracting: (p37<=1)
states: 31,745 (4)
.abstracting: (0<=p21)
states: 31,745 (4)
abstracting: (p21<=0)
states: 31,233 (4)
abstracting: (1<=p19)
states: 768
abstracting: (p19<=1)
states: 31,745 (4)
abstracting: (1<=p14)
states: 15,872 (4)
abstracting: (p14<=1)
states: 31,745 (4)
abstracting: (0<=p21)
states: 31,745 (4)
abstracting: (p21<=0)
states: 31,233 (4)
abstracting: (1<=p19)
states: 768
abstracting: (p19<=1)
states: 31,745 (4)
abstracting: (0<=p21)
states: 31,745 (4)
abstracting: (p21<=0)
states: 31,233 (4)
abstracting: (1<=p19)
states: 768
abstracting: (p19<=1)
states: 31,745 (4)
.
EG iterations: 1
abstracting: (0<=p34)
states: 31,745 (4)
abstracting: (p34<=0)
states: 30,977 (4)
abstracting: (1<=p50)
states: 1,024 (3)
abstracting: (p50<=1)
states: 31,745 (4)
abstracting: (0<=p2)
states: 31,745 (4)
abstracting: (p2<=0)
states: 15,873 (4)
abstracting: (1<=p28)
states: 768
abstracting: (p28<=1)
states: 31,745 (4)
abstracting: (1<=p38)
states: 1,024 (3)
abstracting: (p38<=1)
states: 31,745 (4)
.abstracting: (0<=p50)
states: 31,745 (4)
abstracting: (p50<=0)
states: 30,721 (4)
abstracting: (1<=p54)
states: 1,024 (3)
abstracting: (p54<=1)
states: 31,745 (4)
.abstracting: (1<=p32)
states: 26,112 (4)
abstracting: (p32<=1)
states: 31,745 (4)
abstracting: (1<=p37)
states: 512
abstracting: (p37<=1)
states: 31,745 (4)
.abstracting: (0<=p21)
states: 31,745 (4)
abstracting: (p21<=0)
states: 31,233 (4)
abstracting: (1<=p19)
states: 768
abstracting: (p19<=1)
states: 31,745 (4)
abstracting: (1<=p14)
states: 15,872 (4)
abstracting: (p14<=1)
states: 31,745 (4)
abstracting: (0<=p21)
states: 31,745 (4)
abstracting: (p21<=0)
states: 31,233 (4)
abstracting: (1<=p19)
states: 768
abstracting: (p19<=1)
states: 31,745 (4)
abstracting: (0<=p21)
states: 31,745 (4)
abstracting: (p21<=0)
states: 31,233 (4)
abstracting: (1<=p19)
states: 768
abstracting: (p19<=1)
states: 31,745 (4)
.
EG iterations: 1
abstracting: (0<=p34)
states: 31,745 (4)
abstracting: (p34<=0)
states: 30,977 (4)
abstracting: (1<=p50)
states: 1,024 (3)
abstracting: (p50<=1)
states: 31,745 (4)
abstracting: (0<=p2)
states: 31,745 (4)
abstracting: (p2<=0)
states: 15,873 (4)
abstracting: (1<=p28)
states: 768
abstracting: (p28<=1)
states: 31,745 (4)
abstracting: (1<=p38)
states: 1,024 (3)
abstracting: (p38<=1)
states: 31,745 (4)
.abstracting: (0<=p50)
states: 31,745 (4)
abstracting: (p50<=0)
states: 30,721 (4)
abstracting: (1<=p54)
states: 1,024 (3)
abstracting: (p54<=1)
states: 31,745 (4)
...................
EG iterations: 18
-> the formula is FALSE
FORMULA Parking-PT-104-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.072sec
totally nodes used: 425494 (4.3e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 511082 1482767 1993849
used/not used/entry size/cache size: 1854102 65254762 16 1024MB
basic ops cache: hits/miss/sum: 85153 239676 324829
used/not used/entry size/cache size: 468201 16309015 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: 1609 5502 7111
used/not used/entry size/cache size: 5497 8383111 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 66699014
1 395303
2 13501
3 996
4 49
5 1
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 6.314sec
BK_STOP 1679042472512
--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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 CTLCardinality -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:874 (15), effective:108 (1)
initing FirstDep: 0m 0.000sec
iterations count:558 (9), effective:57 (1)
iterations count:1458 (26), effective:175 (3)
iterations count:56 (1), effective:0 (0)
iterations count:1044 (18), effective:91 (1)
iterations count:1044 (18), effective:91 (1)
iterations count:56 (1), effective:0 (0)
iterations count:1044 (18), effective:91 (1)
iterations count:70 (1), effective:4 (0)
iterations count:533 (9), effective:47 (0)
iterations count:1091 (19), effective:98 (1)
iterations count:1931 (34), effective:214 (3)
iterations count:466 (8), effective:44 (0)
iterations count:56 (1), effective:0 (0)
iterations count:241 (4), effective:18 (0)
iterations count:608 (10), effective:58 (1)
iterations count:499 (8), effective:44 (0)
iterations count:121 (2), effective:3 (0)
iterations count:56 (1), effective:0 (0)
iterations count:65 (1), effective:2 (0)
iterations count:428 (7), effective:45 (0)
iterations count:123 (2), effective:10 (0)
iterations count:69 (1), effective:1 (0)
iterations count:70 (1), effective:3 (0)
iterations count:428 (7), effective:45 (0)
iterations count:123 (2), effective:10 (0)
iterations count:56 (1), effective:0 (0)
iterations count:428 (7), effective:45 (0)
iterations count:123 (2), effective:10 (0)
iterations count:57 (1), effective:1 (0)
iterations count:56 (1), effective:0 (0)
iterations count:1070 (19), effective:94 (1)
iterations count:57 (1), effective:1 (0)
iterations count:1038 (18), effective:91 (1)
iterations count:214 (3), effective:13 (0)
iterations count:1070 (19), effective:94 (1)
iterations count:57 (1), effective:1 (0)
iterations count:1038 (18), effective:91 (1)
iterations count:1070 (19), effective:94 (1)
iterations count:57 (1), effective:1 (0)
iterations count:1038 (18), effective:91 (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="Parking-PT-104"
export BK_EXAMINATION="CTLCardinality"
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 Parking-PT-104, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r266-smll-167863540900409"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Parking-PT-104.tgz
mv Parking-PT-104 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;