About the Execution of Marcie+red for NQueens-PT-05
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5448.915 | 13469.00 | 20170.00 | 536.70 | FFTTFFTFTFTTTTTF | 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-167863540300009.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 NQueens-PT-05, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863540300009
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 472K
-rw-r--r-- 1 mcc users 6.2K Feb 26 17:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 17:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 17:11 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 17:11 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.5K Feb 25 16:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 17:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 17:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 26 17:12 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 17:12 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 30K 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 NQueens-PT-05-CTLCardinality-00
FORMULA_NAME NQueens-PT-05-CTLCardinality-01
FORMULA_NAME NQueens-PT-05-CTLCardinality-02
FORMULA_NAME NQueens-PT-05-CTLCardinality-03
FORMULA_NAME NQueens-PT-05-CTLCardinality-04
FORMULA_NAME NQueens-PT-05-CTLCardinality-05
FORMULA_NAME NQueens-PT-05-CTLCardinality-06
FORMULA_NAME NQueens-PT-05-CTLCardinality-07
FORMULA_NAME NQueens-PT-05-CTLCardinality-08
FORMULA_NAME NQueens-PT-05-CTLCardinality-09
FORMULA_NAME NQueens-PT-05-CTLCardinality-10
FORMULA_NAME NQueens-PT-05-CTLCardinality-11
FORMULA_NAME NQueens-PT-05-CTLCardinality-12
FORMULA_NAME NQueens-PT-05-CTLCardinality-13
FORMULA_NAME NQueens-PT-05-CTLCardinality-14
FORMULA_NAME NQueens-PT-05-CTLCardinality-15
=== Now, execution of the tool begins
BK_START 1678730395234
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=NQueens-PT-05
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 17:59:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 17:59:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 17:59:58] [INFO ] Load time of PNML (sax parser for PT used): 48 ms
[2023-03-13 17:59:58] [INFO ] Transformed 55 places.
[2023-03-13 17:59:58] [INFO ] Transformed 25 transitions.
[2023-03-13 17:59:58] [INFO ] Parsed PT model containing 55 places and 25 transitions and 125 arcs in 162 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Initial state reduction rules removed 2 formulas.
Reduce places removed 2 places and 0 transitions.
FORMULA NQueens-PT-05-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-05-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 53 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 53/53 places, 25/25 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 50 transition count 25
Applied a total of 3 rules in 17 ms. Remains 50 /53 variables (removed 3) and now considering 25/25 (removed 0) transitions.
// Phase 1: matrix 25 rows 50 cols
[2023-03-13 17:59:58] [INFO ] Computed 25 place invariants in 13 ms
[2023-03-13 17:59:58] [INFO ] Implicit Places using invariants in 279 ms returned []
[2023-03-13 17:59:58] [INFO ] Invariant cache hit.
[2023-03-13 17:59:59] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 441 ms to find 0 implicit places.
[2023-03-13 17:59:59] [INFO ] Invariant cache hit.
[2023-03-13 17:59:59] [INFO ] Dead Transitions using invariants and state equation in 104 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 50/53 places, 25/25 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 567 ms. Remains : 50/53 places, 25/25 transitions.
Support contains 47 out of 50 places after structural reductions.
[2023-03-13 17:59:59] [INFO ] Flatten gal took : 42 ms
[2023-03-13 17:59:59] [INFO ] Flatten gal took : 17 ms
[2023-03-13 17:59:59] [INFO ] Input system was already deterministic with 25 transitions.
Support contains 46 out of 50 places (down from 47) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 1881 resets, run finished after 894 ms. (steps per millisecond=11 ) properties (out of 62) seen :46
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 20 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 21 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
[2023-03-13 18:00:00] [INFO ] Invariant cache hit.
[2023-03-13 18:00:00] [INFO ] [Real]Absence check using 18 positive place invariants in 9 ms returned sat
[2023-03-13 18:00:00] [INFO ] [Real]Absence check using 18 positive and 7 generalized place invariants in 4 ms returned sat
[2023-03-13 18:00:00] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0 real:14
[2023-03-13 18:00:01] [INFO ] [Nat]Absence check using 18 positive place invariants in 7 ms returned sat
[2023-03-13 18:00:01] [INFO ] [Nat]Absence check using 18 positive and 7 generalized place invariants in 8 ms returned sat
[2023-03-13 18:00:01] [INFO ] After 179ms SMT Verify possible using all constraints in natural domain returned unsat :16 sat :0
Fused 16 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 16 atomic propositions for a total of 14 simplifications.
[2023-03-13 18:00:01] [INFO ] Flatten gal took : 13 ms
[2023-03-13 18:00:01] [INFO ] Flatten gal took : 19 ms
[2023-03-13 18:00:01] [INFO ] Input system was already deterministic with 25 transitions.
Support contains 38 out of 50 places (down from 41) after GAL structural reductions.
Computed a total of 50 stabilizing places and 25 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 50 transition count 25
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 1 formulas.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 25/25 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 30 transition count 25
Applied a total of 20 rules in 2 ms. Remains 30 /50 variables (removed 20) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 30/50 places, 25/25 transitions.
[2023-03-13 18:00:01] [INFO ] Flatten gal took : 6 ms
[2023-03-13 18:00:01] [INFO ] Flatten gal took : 7 ms
[2023-03-13 18:00:01] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 25/25 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 30 transition count 25
Applied a total of 20 rules in 2 ms. Remains 30 /50 variables (removed 20) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 30/50 places, 25/25 transitions.
[2023-03-13 18:00:01] [INFO ] Flatten gal took : 8 ms
[2023-03-13 18:00:01] [INFO ] Flatten gal took : 7 ms
[2023-03-13 18:00:01] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 50/50 places, 25/25 transitions.
Graph (complete) has 88 edges and 50 vertex of which 28 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.2 ms
Discarding 22 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 28 /50 variables (removed 22) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 28/50 places, 25/25 transitions.
[2023-03-13 18:00:01] [INFO ] Flatten gal took : 6 ms
[2023-03-13 18:00:01] [INFO ] Flatten gal took : 6 ms
[2023-03-13 18:00:01] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 25/25 transitions.
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 30 transition count 25
Applied a total of 20 rules in 2 ms. Remains 30 /50 variables (removed 20) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 30/50 places, 25/25 transitions.
[2023-03-13 18:00:01] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:00:01] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:00:01] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 50/50 places, 25/25 transitions.
Graph (complete) has 88 edges and 50 vertex of which 32 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.1 ms
Discarding 18 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 4 ms. Remains 32 /50 variables (removed 18) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 32/50 places, 25/25 transitions.
[2023-03-13 18:00:01] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:00:01] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:00:01] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 25/25 transitions.
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 32 transition count 25
Applied a total of 18 rules in 2 ms. Remains 32 /50 variables (removed 18) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 32/50 places, 25/25 transitions.
[2023-03-13 18:00:01] [INFO ] Flatten gal took : 4 ms
[2023-03-13 18:00:01] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:00:01] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 50/50 places, 25/25 transitions.
Graph (complete) has 88 edges and 50 vertex of which 28 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 28 /50 variables (removed 22) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 28/50 places, 25/25 transitions.
[2023-03-13 18:00:01] [INFO ] Flatten gal took : 4 ms
[2023-03-13 18:00:01] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:00:01] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 25/25 transitions.
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 19 place count 31 transition count 25
Applied a total of 19 rules in 1 ms. Remains 31 /50 variables (removed 19) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/50 places, 25/25 transitions.
[2023-03-13 18:00:01] [INFO ] Flatten gal took : 4 ms
[2023-03-13 18:00:01] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:00:01] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 50/50 places, 25/25 transitions.
Graph (complete) has 88 edges and 50 vertex of which 30 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 30 /50 variables (removed 20) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 30/50 places, 25/25 transitions.
[2023-03-13 18:00:01] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:00:01] [INFO ] Flatten gal took : 6 ms
[2023-03-13 18:00:01] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 25/25 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 29 transition count 25
Applied a total of 21 rules in 1 ms. Remains 29 /50 variables (removed 21) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 29/50 places, 25/25 transitions.
[2023-03-13 18:00:01] [INFO ] Flatten gal took : 4 ms
[2023-03-13 18:00:01] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:00:01] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 50/50 places, 25/25 transitions.
Graph (complete) has 88 edges and 50 vertex of which 28 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.0 ms
Discarding 22 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 28 /50 variables (removed 22) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 28/50 places, 25/25 transitions.
[2023-03-13 18:00:01] [INFO ] Flatten gal took : 3 ms
[2023-03-13 18:00:01] [INFO ] Flatten gal took : 3 ms
[2023-03-13 18:00:01] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 50/50 places, 25/25 transitions.
Graph (complete) has 88 edges and 50 vertex of which 30 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 30 /50 variables (removed 20) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 30/50 places, 25/25 transitions.
[2023-03-13 18:00:01] [INFO ] Flatten gal took : 3 ms
[2023-03-13 18:00:01] [INFO ] Flatten gal took : 3 ms
[2023-03-13 18:00:01] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 25/25 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 29 transition count 25
Applied a total of 21 rules in 1 ms. Remains 29 /50 variables (removed 21) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 29/50 places, 25/25 transitions.
[2023-03-13 18:00:01] [INFO ] Flatten gal took : 3 ms
[2023-03-13 18:00:01] [INFO ] Flatten gal took : 3 ms
[2023-03-13 18:00:01] [INFO ] Input system was already deterministic with 25 transitions.
Starting structural reductions in LTL mode, iteration 0 : 50/50 places, 25/25 transitions.
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 29 transition count 25
Applied a total of 21 rules in 1 ms. Remains 29 /50 variables (removed 21) and now considering 25/25 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 29/50 places, 25/25 transitions.
[2023-03-13 18:00:01] [INFO ] Flatten gal took : 3 ms
[2023-03-13 18:00:01] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:00:01] [INFO ] Input system was already deterministic with 25 transitions.
[2023-03-13 18:00:01] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:00:01] [INFO ] Flatten gal took : 4 ms
[2023-03-13 18:00:01] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-13 18:00:01] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 50 places, 25 transitions and 122 arcs took 0 ms.
Total runtime 3303 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: 50 NrTr: 25 NrArc: 122)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.001sec
net check time: 0m 0.000sec
init dd package: 0m 3.767sec
RS generation: 0m 0.015sec
-> reachability set: #nodes 3056 (3.1e+03) #states 462
starting MCC model checker
--------------------------
checking: EG [1<=p26]
normalized: EG [1<=p26]
abstracting: (1<=p26)
states: 185
.....
EG iterations: 5
-> the formula is TRUE
FORMULA NQueens-PT-05-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.028sec
checking: EG [1<=p26]
normalized: EG [1<=p26]
abstracting: (1<=p26)
states: 185
.....
EG iterations: 5
-> the formula is TRUE
FORMULA NQueens-PT-05-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EG [1<=p22]
normalized: EG [1<=p22]
abstracting: (1<=p22)
states: 185
.....
EG iterations: 5
-> the formula is TRUE
FORMULA NQueens-PT-05-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.023sec
checking: AF [[1<=p20 & EX [p21<=0]]]
normalized: ~ [EG [~ [[1<=p20 & EX [p21<=0]]]]]
abstracting: (p21<=0)
states: 411
.abstracting: (1<=p20)
states: 59
.
EG iterations: 1
-> the formula is FALSE
FORMULA NQueens-PT-05-CTLCardinality-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.003sec
checking: AF [~ [E [EX [AX [1<=p13]] U p23<=0]]]
normalized: ~ [EG [E [EX [~ [EX [~ [1<=p13]]]] U p23<=0]]]
abstracting: (p23<=0)
states: 255
abstracting: (1<=p13)
states: 59
...
EG iterations: 1
-> the formula is FALSE
FORMULA NQueens-PT-05-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.040sec
checking: EG [EF [~ [p1<=p13]]]
normalized: EG [E [true U ~ [p1<=p13]]]
abstracting: (p1<=p13)
states: 419
.....
EG iterations: 5
-> the formula is TRUE
FORMULA NQueens-PT-05-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.013sec
checking: EG [E [AX [1<=0] U E [AF [1<=p21] U E [p43<=0 U 1<=p43]]]]
normalized: EG [E [~ [EX [~ [1<=0]]] U E [~ [EG [~ [1<=p21]]] U E [p43<=0 U 1<=p43]]]]
abstracting: (1<=p43)
states: 301
abstracting: (p43<=0)
states: 161
abstracting: (1<=p21)
states: 51
...
EG iterations: 3
abstracting: (1<=0)
states: 0
.....
EG iterations: 4
-> the formula is TRUE
FORMULA NQueens-PT-05-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.075sec
checking: EG [EF [[~ [1<=p44] & [EX [0<=0] | [1<=p9 | p49<=p6]]]]]
normalized: EG [E [true U [[[1<=p9 | p49<=p6] | EX [0<=0]] & ~ [1<=p44]]]]
abstracting: (1<=p44)
states: 258
abstracting: (0<=0)
states: 462
.abstracting: (p49<=p6)
states: 98
abstracting: (1<=p9)
states: 57
.....
EG iterations: 5
-> the formula is TRUE
FORMULA NQueens-PT-05-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.036sec
checking: EF [[E [1<=p16 U EX [p26<=p25]] | [EX [EF [p44<=0]] & AX [1<=0]]]]
normalized: E [true U [[~ [EX [~ [1<=0]]] & EX [E [true U p44<=0]]] | E [1<=p16 U EX [p26<=p25]]]]
abstracting: (p26<=p25)
states: 345
.abstracting: (1<=p16)
states: 47
abstracting: (p44<=0)
states: 204
.abstracting: (1<=0)
states: 0
.-> the formula is TRUE
FORMULA NQueens-PT-05-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.017sec
checking: AX [A [p18<=p2 U A [p5<=p25 U EG [[p41<=0 | 1<=p45]]]]]
normalized: ~ [EX [~ [[~ [EG [~ [[~ [EG [~ [EG [[p41<=0 | 1<=p45]]]]] & ~ [E [~ [EG [[p41<=0 | 1<=p45]]] U [~ [p5<=p25] & ~ [EG [[p41<=0 | 1<=p45]]]]]]]]]] & ~ [E [~ [[~ [EG [~ [EG [[p41<=0 | 1<=p45]]]]] & ~ [E [~ [EG [[p41<=0 | 1<=p45]]] U [~ [p5<=p25] & ~ [EG [[p41<=0 | 1<=p45]]]]]]]] U [~ [p18<=p2] & ~ [[~ [EG [~ [EG [[p41<=0 | 1<=p45]]]]] & ~ [E [~ [EG [[p41<=0 | 1<=p45]]] U [~ [p5<=p25] & ~ [EG [[p41<=0 | 1<=p45]]]]]]]]]]]]]]]
abstracting: (1<=p45)
states: 235
abstracting: (p41<=0)
states: 51
....
EG iterations: 4
abstracting: (p5<=p25)
states: 432
abstracting: (1<=p45)
states: 235
abstracting: (p41<=0)
states: 51
....
EG iterations: 4
abstracting: (1<=p45)
states: 235
abstracting: (p41<=0)
states: 51
....
EG iterations: 4
...
EG iterations: 3
abstracting: (p18<=p2)
states: 422
abstracting: (1<=p45)
states: 235
abstracting: (p41<=0)
states: 51
....
EG iterations: 4
abstracting: (p5<=p25)
states: 432
abstracting: (1<=p45)
states: 235
abstracting: (p41<=0)
states: 51
....
EG iterations: 4
abstracting: (1<=p45)
states: 235
abstracting: (p41<=0)
states: 51
....
EG iterations: 4
...
EG iterations: 3
abstracting: (1<=p45)
states: 235
abstracting: (p41<=0)
states: 51
....
EG iterations: 4
abstracting: (p5<=p25)
states: 432
abstracting: (1<=p45)
states: 235
abstracting: (p41<=0)
states: 51
....
EG iterations: 4
abstracting: (1<=p45)
states: 235
abstracting: (p41<=0)
states: 51
....
EG iterations: 4
...
EG iterations: 3
.
EG iterations: 1
.-> the formula is FALSE
FORMULA NQueens-PT-05-CTLCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.037sec
checking: A [1<=0 U EG [[EF [~ [EF [p14<=p28]]] | [p14<=0 | EF [[1<=p5 & p31<=p44]]]]]]
normalized: [~ [EG [~ [EG [[[p14<=0 | E [true U [1<=p5 & p31<=p44]]] | E [true U ~ [E [true U p14<=p28]]]]]]]] & ~ [E [~ [EG [[[p14<=0 | E [true U [1<=p5 & p31<=p44]]] | E [true U ~ [E [true U p14<=p28]]]]]] U [~ [1<=0] & ~ [EG [[[p14<=0 | E [true U [1<=p5 & p31<=p44]]] | E [true U ~ [E [true U p14<=p28]]]]]]]]]]
abstracting: (p14<=p28)
states: 415
abstracting: (p31<=p44)
states: 381
abstracting: (1<=p5)
states: 59
abstracting: (p14<=0)
states: 415
EG iterations: 0
abstracting: (1<=0)
states: 0
abstracting: (p14<=p28)
states: 415
abstracting: (p31<=p44)
states: 381
abstracting: (1<=p5)
states: 59
abstracting: (p14<=0)
states: 415
EG iterations: 0
abstracting: (p14<=p28)
states: 415
abstracting: (p31<=p44)
states: 381
abstracting: (1<=p5)
states: 59
abstracting: (p14<=0)
states: 415
EG iterations: 0
.
EG iterations: 1
-> the formula is TRUE
FORMULA NQueens-PT-05-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.015sec
checking: [~ [E [EX [EF [p8<=p40]] U EG [[p2<=0 & 1<=p38]]]] & [AG [[~ [p25<=p8] & ~ [A [p24<=0 U 1<=p8]]]] | AX [AF [p25<=0]]]]
normalized: [[~ [EX [EG [~ [p25<=0]]]] | ~ [E [true U ~ [[~ [[~ [EG [~ [1<=p8]]] & ~ [E [~ [1<=p8] U [~ [p24<=0] & ~ [1<=p8]]]]]] & ~ [p25<=p8]]]]]] & ~ [E [EX [E [true U p8<=p40]] U EG [[p2<=0 & 1<=p38]]]]]
abstracting: (1<=p38)
states: 301
abstracting: (p2<=0)
states: 405
....
EG iterations: 4
abstracting: (p8<=p40)
states: 452
.abstracting: (p25<=p8)
states: 284
abstracting: (1<=p8)
states: 59
abstracting: (p24<=0)
states: 231
abstracting: (1<=p8)
states: 59
abstracting: (1<=p8)
states: 59
....
EG iterations: 4
abstracting: (p25<=0)
states: 255
.....
EG iterations: 5
.-> the formula is FALSE
FORMULA NQueens-PT-05-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.043sec
checking: AF [[[E [EF [1<=p25] U 1<=p31] & [AG [[p34<=0 | p42<=p36]] & AF [~ [1<=p0]]]] & [[E [p48<=p9 U 1<=p42] & EX [1<=p13]] & [p14<=1 & 1<=p47]]]]
normalized: ~ [EG [~ [[[[p14<=1 & 1<=p47] & [EX [1<=p13] & E [p48<=p9 U 1<=p42]]] & [[~ [EG [1<=p0]] & ~ [E [true U ~ [[p34<=0 | p42<=p36]]]]] & E [E [true U 1<=p25] U 1<=p31]]]]]]
abstracting: (1<=p31)
states: 185
abstracting: (1<=p25)
states: 207
abstracting: (p42<=p36)
states: 283
abstracting: (p34<=0)
states: 161
abstracting: (1<=p0)
states: 51
.
EG iterations: 1
abstracting: (1<=p42)
states: 344
abstracting: (p48<=p9)
states: 162
abstracting: (1<=p13)
states: 59
.abstracting: (1<=p47)
states: 301
abstracting: (p14<=1)
states: 462
.
EG iterations: 1
-> the formula is FALSE
FORMULA NQueens-PT-05-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.034sec
checking: AF [[A [[[1<=p10 & p10<=p47] | [1<=p43 & p26<=1]] U AG [p17<=p42]] & [~ [1<=p19] & [EF [~ [1<=p3]] | [~ [1<=p30] | ~ [E [[1<=p38 | p25<=0] U 1<=p35]]]]]]]
normalized: ~ [EG [~ [[[[[~ [E [[1<=p38 | p25<=0] U 1<=p35]] | ~ [1<=p30]] | E [true U ~ [1<=p3]]] & ~ [1<=p19]] & [~ [EG [E [true U ~ [p17<=p42]]]] & ~ [E [E [true U ~ [p17<=p42]] U [~ [[[1<=p43 & p26<=1] | [1<=p10 & p10<=p47]]] & E [true U ~ [p17<=p42]]]]]]]]]]
abstracting: (p17<=p42)
states: 450
abstracting: (p10<=p47)
states: 442
abstracting: (1<=p10)
states: 43
abstracting: (p26<=1)
states: 462
abstracting: (1<=p43)
states: 301
abstracting: (p17<=p42)
states: 450
abstracting: (p17<=p42)
states: 450
.
EG iterations: 1
abstracting: (1<=p19)
states: 59
abstracting: (1<=p3)
states: 59
abstracting: (1<=p30)
states: 207
abstracting: (1<=p35)
states: 258
abstracting: (p25<=0)
states: 255
abstracting: (1<=p38)
states: 301
.
EG iterations: 1
-> the formula is FALSE
FORMULA NQueens-PT-05-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.016sec
totally nodes used: 149048 (1.5e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 62985 521313 584298
used/not used/entry size/cache size: 594215 66514649 16 1024MB
basic ops cache: hits/miss/sum: 15202 159918 175120
used/not used/entry size/cache size: 270787 16506429 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: 2234 17158 19392
used/not used/entry size/cache size: 17153 8371455 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 66968560
1 132519
2 7080
3 573
4 76
5 27
6 12
7 5
8 6
9 4
>= 10 2
Total processing time: 0m 6.016sec
BK_STOP 1678730408703
--------------------
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 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:328 (13), effective:25 (1)
initing FirstDep: 0m 0.000sec
iterations count:63 (2), effective:5 (0)
iterations count:27 (1), effective:1 (0)
iterations count:25 (1), effective:0 (0)
iterations count:25 (1), effective:0 (0)
iterations count:25 (1), effective:0 (0)
iterations count:67 (2), effective:4 (0)
iterations count:25 (1), effective:0 (0)
iterations count:67 (2), effective:4 (0)
iterations count:25 (1), effective:0 (0)
iterations count:72 (2), effective:4 (0)
iterations count:72 (2), effective:4 (0)
iterations count:49 (1), effective:1 (0)
iterations count:72 (2), effective:4 (0)
iterations count:25 (1), effective:0 (0)
iterations count:34 (1), effective:1 (0)
iterations count:61 (2), effective:3 (0)
iterations count:25 (1), effective:0 (0)
iterations count:34 (1), effective:1 (0)
iterations count:61 (2), effective:3 (0)
iterations count:25 (1), effective:0 (0)
iterations count:34 (1), effective:1 (0)
iterations count:61 (2), effective:3 (0)
iterations count:25 (1), effective:0 (0)
iterations count:25 (1), effective:0 (0)
iterations count:25 (1), effective:0 (0)
iterations count:119 (4), effective:8 (0)
iterations count:25 (1), effective:0 (0)
iterations count:25 (1), effective:0 (0)
iterations count:77 (3), effective:5 (0)
iterations count:25 (1), effective:0 (0)
iterations count:47 (1), effective:2 (0)
iterations count:47 (1), effective:2 (0)
iterations count:30 (1), effective:1 (0)
iterations count:47 (1), effective:2 (0)
iterations count:25 (1), effective:0 (0)
iterations count:25 (1), effective:0 (0)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="NQueens-PT-05"
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 NQueens-PT-05, 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-167863540300009"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/NQueens-PT-05.tgz
mv NQueens-PT-05 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 ;