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-167863540300017.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-08, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r266-smll-167863540300017
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 8.0K Feb 26 17:06 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Feb 26 17:06 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K Feb 26 17:05 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Feb 26 17:05 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 24K Feb 25 16:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 16:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Feb 26 17:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 17:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Feb 26 17:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Feb 26 17:07 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 65K 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-08-CTLCardinality-00
FORMULA_NAME NQueens-PT-08-CTLCardinality-01
FORMULA_NAME NQueens-PT-08-CTLCardinality-02
FORMULA_NAME NQueens-PT-08-CTLCardinality-03
FORMULA_NAME NQueens-PT-08-CTLCardinality-04
FORMULA_NAME NQueens-PT-08-CTLCardinality-05
FORMULA_NAME NQueens-PT-08-CTLCardinality-06
FORMULA_NAME NQueens-PT-08-CTLCardinality-07
FORMULA_NAME NQueens-PT-08-CTLCardinality-08
FORMULA_NAME NQueens-PT-08-CTLCardinality-09
FORMULA_NAME NQueens-PT-08-CTLCardinality-10
FORMULA_NAME NQueens-PT-08-CTLCardinality-11
FORMULA_NAME NQueens-PT-08-CTLCardinality-12
FORMULA_NAME NQueens-PT-08-CTLCardinality-13
FORMULA_NAME NQueens-PT-08-CTLCardinality-14
FORMULA_NAME NQueens-PT-08-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678730565893

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-08
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-13 18:02:49] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-13 18:02:49] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-13 18:02:49] [INFO ] Load time of PNML (sax parser for PT used): 105 ms
[2023-03-13 18:02:49] [INFO ] Transformed 112 places.
[2023-03-13 18:02:49] [INFO ] Transformed 64 transitions.
[2023-03-13 18:02:49] [INFO ] Parsed PT model containing 112 places and 64 transitions and 320 arcs in 274 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 28 ms.
Reduce places removed 2 places and 0 transitions.
Support contains 80 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 64/64 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 93 transition count 64
Applied a total of 17 rules in 30 ms. Remains 93 /110 variables (removed 17) and now considering 64/64 (removed 0) transitions.
// Phase 1: matrix 64 rows 93 cols
[2023-03-13 18:02:50] [INFO ] Computed 29 place invariants in 18 ms
[2023-03-13 18:02:50] [INFO ] Implicit Places using invariants in 396 ms returned []
[2023-03-13 18:02:50] [INFO ] Invariant cache hit.
[2023-03-13 18:02:50] [INFO ] Implicit Places using invariants and state equation in 266 ms returned [92]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 729 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 92/110 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 92 /92 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 763 ms. Remains : 92/110 places, 64/64 transitions.
Support contains 80 out of 92 places after structural reductions.
[2023-03-13 18:02:51] [INFO ] Flatten gal took : 69 ms
[2023-03-13 18:02:51] [INFO ] Flatten gal took : 25 ms
[2023-03-13 18:02:51] [INFO ] Input system was already deterministic with 64 transitions.
Support contains 74 out of 92 places (down from 80) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 1315 resets, run finished after 1101 ms. (steps per millisecond=9 ) properties (out of 90) seen :70
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 6 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
// Phase 1: matrix 64 rows 92 cols
[2023-03-13 18:02:52] [INFO ] Computed 28 place invariants in 13 ms
[2023-03-13 18:02:52] [INFO ] [Real]Absence check using 10 positive place invariants in 5 ms returned sat
[2023-03-13 18:02:52] [INFO ] [Real]Absence check using 10 positive and 18 generalized place invariants in 16 ms returned sat
[2023-03-13 18:02:52] [INFO ] After 237ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-03-13 18:02:53] [INFO ] [Nat]Absence check using 10 positive place invariants in 15 ms returned sat
[2023-03-13 18:02:53] [INFO ] [Nat]Absence check using 10 positive and 18 generalized place invariants in 19 ms returned sat
[2023-03-13 18:02:53] [INFO ] After 447ms SMT Verify possible using all constraints in natural domain returned unsat :20 sat :0
Fused 20 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 20 atomic propositions for a total of 16 simplifications.
FORMULA NQueens-PT-08-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 18:02:53] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-13 18:02:53] [INFO ] Flatten gal took : 18 ms
[2023-03-13 18:02:53] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA NQueens-PT-08-CTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NQueens-PT-08-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-13 18:02:53] [INFO ] Flatten gal took : 16 ms
[2023-03-13 18:02:53] [INFO ] Input system was already deterministic with 64 transitions.
Support contains 60 out of 92 places (down from 65) after GAL structural reductions.
Computed a total of 92 stabilizing places and 64 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 92 transition count 64
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 64/64 transitions.
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 55 transition count 64
Applied a total of 37 rules in 5 ms. Remains 55 /92 variables (removed 37) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 55/92 places, 64/64 transitions.
[2023-03-13 18:02:53] [INFO ] Flatten gal took : 12 ms
[2023-03-13 18:02:53] [INFO ] Flatten gal took : 13 ms
[2023-03-13 18:02:53] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 64/64 transitions.
Reduce places removed 37 places and 0 transitions.
Iterating post reduction 0 with 37 rules applied. Total rules applied 37 place count 55 transition count 64
Applied a total of 37 rules in 3 ms. Remains 55 /92 variables (removed 37) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 55/92 places, 64/64 transitions.
[2023-03-13 18:02:53] [INFO ] Flatten gal took : 11 ms
[2023-03-13 18:02:53] [INFO ] Flatten gal took : 13 ms
[2023-03-13 18:02:53] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 64/64 transitions.
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 45 transition count 64
Applied a total of 47 rules in 3 ms. Remains 45 /92 variables (removed 47) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 45/92 places, 64/64 transitions.
[2023-03-13 18:02:53] [INFO ] Flatten gal took : 11 ms
[2023-03-13 18:02:53] [INFO ] Flatten gal took : 12 ms
[2023-03-13 18:02:53] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 92/92 places, 64/64 transitions.
Graph (complete) has 187 edges and 92 vertex of which 43 are kept as prefixes of interest. Removing 49 places using SCC suffix rule.3 ms
Discarding 49 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 43 /92 variables (removed 49) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 43/92 places, 64/64 transitions.
[2023-03-13 18:02:53] [INFO ] Flatten gal took : 12 ms
[2023-03-13 18:02:53] [INFO ] Flatten gal took : 11 ms
[2023-03-13 18:02:53] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 92/92 places, 64/64 transitions.
Graph (complete) has 187 edges and 92 vertex of which 50 are kept as prefixes of interest. Removing 42 places using SCC suffix rule.1 ms
Discarding 42 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 50 /92 variables (removed 42) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 6 ms. Remains : 50/92 places, 64/64 transitions.
[2023-03-13 18:02:53] [INFO ] Flatten gal took : 11 ms
[2023-03-13 18:02:53] [INFO ] Flatten gal took : 11 ms
[2023-03-13 18:02:53] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 64/64 transitions.
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 49 transition count 64
Applied a total of 43 rules in 2 ms. Remains 49 /92 variables (removed 43) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 49/92 places, 64/64 transitions.
[2023-03-13 18:02:53] [INFO ] Flatten gal took : 10 ms
[2023-03-13 18:02:53] [INFO ] Flatten gal took : 11 ms
[2023-03-13 18:02:53] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 64/64 transitions.
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 0 with 43 rules applied. Total rules applied 43 place count 49 transition count 64
Applied a total of 43 rules in 2 ms. Remains 49 /92 variables (removed 43) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 49/92 places, 64/64 transitions.
[2023-03-13 18:02:53] [INFO ] Flatten gal took : 9 ms
[2023-03-13 18:02:53] [INFO ] Flatten gal took : 11 ms
[2023-03-13 18:02:53] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 92/92 places, 64/64 transitions.
Graph (complete) has 187 edges and 92 vertex of which 47 are kept as prefixes of interest. Removing 45 places using SCC suffix rule.1 ms
Discarding 45 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 47 /92 variables (removed 45) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 47/92 places, 64/64 transitions.
[2023-03-13 18:02:53] [INFO ] Flatten gal took : 9 ms
[2023-03-13 18:02:53] [INFO ] Flatten gal took : 11 ms
[2023-03-13 18:02:53] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 92/92 places, 64/64 transitions.
Graph (complete) has 187 edges and 92 vertex of which 48 are kept as prefixes of interest. Removing 44 places using SCC suffix rule.1 ms
Discarding 44 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 48 /92 variables (removed 44) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 48/92 places, 64/64 transitions.
[2023-03-13 18:02:53] [INFO ] Flatten gal took : 14 ms
[2023-03-13 18:02:53] [INFO ] Flatten gal took : 9 ms
[2023-03-13 18:02:53] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 64/64 transitions.
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 0 with 47 rules applied. Total rules applied 47 place count 45 transition count 64
Applied a total of 47 rules in 2 ms. Remains 45 /92 variables (removed 47) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 45/92 places, 64/64 transitions.
[2023-03-13 18:02:53] [INFO ] Flatten gal took : 7 ms
[2023-03-13 18:02:53] [INFO ] Flatten gal took : 7 ms
[2023-03-13 18:02:53] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 64/64 transitions.
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 50 transition count 64
Applied a total of 42 rules in 1 ms. Remains 50 /92 variables (removed 42) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 50/92 places, 64/64 transitions.
[2023-03-13 18:02:53] [INFO ] Flatten gal took : 7 ms
[2023-03-13 18:02:53] [INFO ] Flatten gal took : 7 ms
[2023-03-13 18:02:54] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in LTL mode, iteration 0 : 92/92 places, 64/64 transitions.
Reduce places removed 42 places and 0 transitions.
Iterating post reduction 0 with 42 rules applied. Total rules applied 42 place count 50 transition count 64
Applied a total of 42 rules in 1 ms. Remains 50 /92 variables (removed 42) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 50/92 places, 64/64 transitions.
[2023-03-13 18:02:54] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:02:54] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:02:54] [INFO ] Input system was already deterministic with 64 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 92/92 places, 64/64 transitions.
Graph (complete) has 187 edges and 92 vertex of which 44 are kept as prefixes of interest. Removing 48 places using SCC suffix rule.1 ms
Discarding 48 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 44 /92 variables (removed 48) and now considering 64/64 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 44/92 places, 64/64 transitions.
[2023-03-13 18:02:54] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:02:54] [INFO ] Flatten gal took : 5 ms
[2023-03-13 18:02:54] [INFO ] Input system was already deterministic with 64 transitions.
[2023-03-13 18:02:54] [INFO ] Flatten gal took : 8 ms
[2023-03-13 18:02:54] [INFO ] Flatten gal took : 7 ms
[2023-03-13 18:02:54] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-13 18:02:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 92 places, 64 transitions and 302 arcs took 1 ms.
Total runtime 4525 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: 92 NrTr: 64 NrArc: 302)

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

net check time: 0m 0.000sec

init dd package: 0m 3.684sec


RS generation: 0m 4.063sec


-> reachability set: #nodes 373733 (3.7e+05) #states 118,969 (5)



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

checking: EG [p23<=0]
normalized: EG [p23<=0]

abstracting: (p23<=0)
states: 108,666 (5)
.....
EG iterations: 5
-> the formula is TRUE

FORMULA NQueens-PT-08-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.348sec

checking: EG [1<=p74]
normalized: EG [1<=p74]

abstracting: (1<=p74)
states: 80,699 (4)
.....
EG iterations: 5
-> the formula is TRUE

FORMULA NQueens-PT-08-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.990sec

checking: AF [EG [E [p65<=p43 U p83<=p41]]]
normalized: ~ [EG [~ [EG [E [p65<=p43 U p83<=p41]]]]]

abstracting: (p83<=p41)
states: 58,593 (4)
abstracting: (p65<=p43)
states: 36,524 (4)
.
EG iterations: 1
.....
EG iterations: 5
-> the formula is FALSE

FORMULA NQueens-PT-08-CTLCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.874sec

checking: AG [E [~ [EF [p48<=p84]] U EX [p59<=p62]]]
normalized: ~ [E [true U ~ [E [~ [E [true U p48<=p84]] U EX [p59<=p62]]]]]

abstracting: (p59<=p62)
states: 83,853 (4)
.abstracting: (p48<=p84)
states: 97,565 (4)
-> the formula is FALSE

FORMULA NQueens-PT-08-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m28.696sec

checking: EX [[EF [p80<=0] & [EG [AX [1<=0]] & A [p63<=0 U [1<=p52 | AX [p59<=p54]]]]]]
normalized: EX [[[[~ [EG [~ [[1<=p52 | ~ [EX [~ [p59<=p54]]]]]]] & ~ [E [~ [[1<=p52 | ~ [EX [~ [p59<=p54]]]]] U [~ [p63<=0] & ~ [[1<=p52 | ~ [EX [~ [p59<=p54]]]]]]]]] & EG [~ [EX [~ [1<=0]]]]] & E [true U p80<=0]]]

abstracting: (p80<=0)
states: 29,033 (4)
abstracting: (1<=0)
states: 0
..
EG iterations: 1
abstracting: (p59<=p54)
states: 87,794 (4)
.abstracting: (1<=p52)
states: 51,017 (4)
abstracting: (p63<=0)
states: 8,237 (3)
abstracting: (p59<=p54)
states: 87,794 (4)
.abstracting: (1<=p52)
states: 51,017 (4)
abstracting: (p59<=p54)
states: 87,794 (4)
.abstracting: (1<=p52)
states: 51,017 (4)
.......
EG iterations: 7
.-> the formula is FALSE

FORMULA NQueens-PT-08-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m20.759sec

checking: EG [[p46<=p84 & EX [EF [~ [E [p31<=p33 U p28<=0]]]]]]
normalized: EG [[p46<=p84 & EX [E [true U ~ [E [p31<=p33 U p28<=0]]]]]]

abstracting: (p28<=0)
states: 108,666 (5)
abstracting: (p31<=p33)
states: 112,066 (5)
.abstracting: (p46<=p84)
states: 114,839 (5)
.........
EG iterations: 9
-> the formula is FALSE

FORMULA NQueens-PT-08-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.903sec

checking: AF [[p39<=p45 & [AG [~ [1<=p15]] & [EF [~ [1<=p85]] | [EG [~ [1<=p83]] & AX [p40<=p57]]]]]]
normalized: ~ [EG [~ [[p39<=p45 & [[[~ [EX [~ [p40<=p57]]] & EG [~ [1<=p83]]] | E [true U ~ [1<=p85]]] & ~ [E [true U 1<=p15]]]]]]]

abstracting: (1<=p15)
states: 10,172 (4)
abstracting: (1<=p85)
states: 57,117 (4)
abstracting: (1<=p83)
states: 65,683 (4)
.
EG iterations: 1
abstracting: (p40<=p57)
states: 114,477 (5)
.abstracting: (p39<=p45)
states: 109,600 (5)
.....
EG iterations: 5
-> the formula is FALSE

FORMULA NQueens-PT-08-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m11.290sec

checking: EF [[EF [[1<=p34 & p8<=p4]] & [EF [EG [p78<=p48]] & p64<=p59]]]
normalized: E [true U [[p64<=p59 & E [true U EG [p78<=p48]]] & E [true U [1<=p34 & p8<=p4]]]]

abstracting: (p8<=p4)
states: 110,183 (5)
abstracting: (1<=p34)
states: 8,832 (3)
abstracting: (p78<=p48)
states: 52,599 (4)
......
EG iterations: 6
abstracting: (p64<=p59)
states: 62,027 (4)
-> the formula is TRUE

FORMULA NQueens-PT-08-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m16.951sec

checking: AX [~ [E [[AX [p41<=p84] & [~ [p15<=p0] & p78<=1]] U [EG [[1<=p30 & p86<=0]] & ~ [p7<=0]]]]]
normalized: ~ [EX [E [[[p78<=1 & ~ [p15<=p0]] & ~ [EX [~ [p41<=p84]]]] U [~ [p7<=0] & EG [[1<=p30 & p86<=0]]]]]]

abstracting: (p86<=0)
states: 58,485 (4)
abstracting: (1<=p30)
states: 7,685 (3)
.
EG iterations: 1
abstracting: (p7<=0)
states: 110,280 (5)
abstracting: (p41<=p84)
states: 114,587 (5)
.abstracting: (p15<=p0)
states: 109,618 (5)
abstracting: (p78<=1)
states: 118,969 (5)
.-> the formula is FALSE

FORMULA NQueens-PT-08-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.211sec

checking: AF [[~ [p37<=p43] | [~ [p80<=p3] & [EG [~ [p81<=0]] & [AX [p58<=p61] | [p41<=1 & p46<=p72]]]]]]
normalized: ~ [EG [~ [[[[[[p41<=1 & p46<=p72] | ~ [EX [~ [p58<=p61]]]] & EG [~ [p81<=0]]] & ~ [p80<=p3]] | ~ [p37<=p43]]]]]

abstracting: (p37<=p43)
states: 110,137 (5)
abstracting: (p80<=p3)
states: 37,062 (4)
abstracting: (p81<=0)
states: 38,270 (4)
.....
EG iterations: 5
abstracting: (p58<=p61)
states: 86,011 (4)
.abstracting: (p46<=p72)
states: 115,058 (5)
abstracting: (p41<=1)
states: 118,969 (5)
.....
EG iterations: 5
-> the formula is TRUE

FORMULA NQueens-PT-08-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m20.193sec

checking: AG [[1<=p42 | E [A [E [p20<=0 U 1<=p86] U EG [p83<=p10]] U [[EG [p18<=0] | [~ [p10<=0] | ~ [[p32<=0 & p20<=0]]]] & AF [[p32<=0 | p91<=0]]]]]]
normalized: ~ [E [true U ~ [[1<=p42 | E [[~ [EG [~ [EG [p83<=p10]]]] & ~ [E [~ [EG [p83<=p10]] U [~ [E [p20<=0 U 1<=p86]] & ~ [EG [p83<=p10]]]]]] U [~ [EG [~ [[p32<=0 | p91<=0]]]] & [[~ [[p32<=0 & p20<=0]] | ~ [p10<=0]] | EG [p18<=0]]]]]]]]

abstracting: (p18<=0)
states: 112,256 (5)
...
before gc: list nodes free: 474631

after gc: idd nodes used:3702010, unused:60297990; list nodes free:280784919
.
EG iterations: 4
abstracting: (p10<=0)
states: 110,280 (5)
abstracting: (p20<=0)
states: 111,284 (5)
abstracting: (p32<=0)
states: 108,797 (5)
abstracting: (p91<=0)
states: 18,738 (4)
abstracting: (p32<=0)
states: 108,797 (5)
....
EG iterations: 4
abstracting: (p83<=p10)
states: 58,445 (4)
.
EG iterations: 1
abstracting: (1<=p86)
states: 60,484 (4)
abstracting: (p20<=0)
states: 111,284 (5)
abstracting: (p83<=p10)
states: 58,445 (4)
.
EG iterations: 1
abstracting: (p83<=p10)
states: 58,445 (4)
.
EG iterations: 1
.....
EG iterations: 5
abstracting: (1<=p42)
states: 10,172 (4)
-> the formula is FALSE

FORMULA NQueens-PT-08-CTLCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m44.864sec

checking: E [~ [[[[~ [AF [p11<=0]] | p73<=0] | EX [1<=p22]] | [[1<=p28 | 1<=p5] | [1<=p27 | [~ [[1<=p48 | p26<=0]] & p84<=0]]]]] U EG [A [AG [[p15<=p23 & 1<=p73]] U EF [[1<=p38 & 1<=p40]]]]]
normalized: E [~ [[[[1<=p27 | [p84<=0 & ~ [[1<=p48 | p26<=0]]]] | [1<=p28 | 1<=p5]] | [EX [1<=p22] | [p73<=0 | EG [~ [p11<=0]]]]]] U EG [[~ [EG [~ [E [true U [1<=p38 & 1<=p40]]]]] & ~ [E [~ [E [true U [1<=p38 & 1<=p40]]] U [E [true U ~ [[p15<=p23 & 1<=p73]]] & ~ [E [true U [1<=p38 & 1<=p40]]]]]]]]]

abstracting: (1<=p40)
states: 8,237 (3)
abstracting: (1<=p38)
states: 8,689 (3)
abstracting: (1<=p73)
states: 73,504 (4)
abstracting: (p15<=p23)
states: 109,758 (5)
abstracting: (1<=p40)
states: 8,237 (3)
abstracting: (1<=p38)
states: 8,689 (3)
abstracting: (1<=p40)
states: 8,237 (3)
abstracting: (1<=p38)
states: 8,689 (3)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (p11<=0)
states: 110,137 (5)
.
EG iterations: 1
abstracting: (p73<=0)
states: 45,465 (4)
abstracting: (1<=p22)
states: 10,303 (4)
.abstracting: (1<=p5)
states: 10,172 (4)
abstracting: (1<=p28)
states: 10,303 (4)
abstracting: (p26<=0)
states: 112,256 (5)
abstracting: (1<=p48)
states: 47,617 (4)
abstracting: (p84<=0)
states: 58,485 (4)
abstracting: (1<=p27)
states: 7,685 (3)
-> the formula is TRUE

FORMULA NQueens-PT-08-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.280sec

checking: E [EF [[p5<=0 & [AF [~ [1<=p27]] | [A [1<=p55 U 1<=p89] & [p51<=p25 | [p40<=p3 & 1<=p49]]]]]] U AG [[AG [[~ [1<=p25] & ~ [p4<=p14]]] & [1<=p29 | [EX [0<=0] & [p38<=1 & 1<=p21]]]]]]
normalized: E [E [true U [p5<=0 & [[[p51<=p25 | [p40<=p3 & 1<=p49]] & [~ [EG [~ [1<=p89]]] & ~ [E [~ [1<=p89] U [~ [1<=p55] & ~ [1<=p89]]]]]] | ~ [EG [1<=p27]]]]] U ~ [E [true U ~ [[[1<=p29 | [[p38<=1 & 1<=p21] & EX [0<=0]]] & ~ [E [true U ~ [[~ [p4<=p14] & ~ [1<=p25]]]]]]]]]]

abstracting: (1<=p25)
states: 7,685 (3)
abstracting: (p4<=p14)
states: 108,666 (5)
abstracting: (0<=0)
states: 118,969 (5)
.abstracting: (1<=p21)
states: 8,786 (3)
abstracting: (p38<=1)
states: 118,969 (5)
abstracting: (1<=p29)
states: 7,287 (3)
abstracting: (1<=p27)
states: 7,685 (3)
.
EG iterations: 1
abstracting: (1<=p89)
states: 80,699 (4)
abstracting: (1<=p55)
states: 42,807 (4)
abstracting: (1<=p89)
states: 80,699 (4)
abstracting: (1<=p89)
states: 80,699 (4)
.
EG iterations: 1
abstracting: (1<=p49)
states: 51,017 (4)
abstracting: (p40<=p3)
states: 111,627 (5)
abstracting: (p51<=p25)
states: 66,974 (4)
abstracting: (p5<=0)
states: 108,797 (5)
-> the formula is TRUE

FORMULA NQueens-PT-08-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.597sec

totally nodes used: 84695733 (8.5e+07)
number of garbage collections: 1
fire ops cache: hits/miss/sum: 25820820 234674994 260495814
used/not used/entry size/cache size: 41501662 25607202 16 1024MB
basic ops cache: hits/miss/sum: 3427841 35741144 39168985
used/not used/entry size/cache size: 10916821 5860395 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: 342272 2881413 3223685
used/not used/entry size/cache size: 1123076 7265532 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 48676847
1 13731714
2 3658241
3 852876
4 160097
5 24968
6 3438
7 512
8 111
9 33
>= 10 27

Total processing time: 3m28.275sec


BK_STOP 1678730783497

--------------------
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:1961 (30), effective:64 (1)

initing FirstDep: 0m 0.000sec


iterations count:265 (4), effective:7 (0)

iterations count:197 (3), effective:7 (0)

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

iterations count:1961 (30), effective:64 (1)

iterations count:86 (1), effective:3 (0)

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

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

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

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

iterations count:355 (5), effective:8 (0)

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

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

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

iterations count:100 (1), effective:2 (0)

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

iterations count:334 (5), effective:7 (0)

iterations count:510 (7), effective:22 (0)

iterations count:1078 (16), effective:29 (0)

iterations count:171 (2), effective:2 (0)

iterations count:249 (3), effective:6 (0)

iterations count:171 (2), effective:2 (0)

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

iterations count:171 (2), effective:2 (0)

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

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

iterations count:847 (13), effective:23 (0)

iterations count:276 (4), effective:8 (0)

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

iterations count:149 (2), effective:5 (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-08"
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-08, 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-167863540300017"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NQueens-PT-08.tgz
mv NQueens-PT-08 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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;