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.r490-tall-167912708300169.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 Sudoku-PT-AN02, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r490-tall-167912708300169
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 780K
-rw-r--r-- 1 mcc users 12K Feb 26 09:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K Feb 26 09:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 14K Feb 26 09:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 89K Feb 26 09:02 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 6.7K Feb 25 17:16 LTLCardinality.txt
-rw-r--r-- 1 mcc users 34K Feb 25 17:16 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 17:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 29K Feb 25 17:16 LTLFireability.xml
-rw-r--r-- 1 mcc users 22K Feb 26 09:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 175K Feb 26 09:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 34K Feb 26 09:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 194K Feb 26 09:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 17:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.9K Feb 25 17:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 7.4K 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 Sudoku-PT-AN02-CTLCardinality-00
FORMULA_NAME Sudoku-PT-AN02-CTLCardinality-01
FORMULA_NAME Sudoku-PT-AN02-CTLCardinality-02
FORMULA_NAME Sudoku-PT-AN02-CTLCardinality-03
FORMULA_NAME Sudoku-PT-AN02-CTLCardinality-04
FORMULA_NAME Sudoku-PT-AN02-CTLCardinality-05
FORMULA_NAME Sudoku-PT-AN02-CTLCardinality-06
FORMULA_NAME Sudoku-PT-AN02-CTLCardinality-07
FORMULA_NAME Sudoku-PT-AN02-CTLCardinality-08
FORMULA_NAME Sudoku-PT-AN02-CTLCardinality-09
FORMULA_NAME Sudoku-PT-AN02-CTLCardinality-10
FORMULA_NAME Sudoku-PT-AN02-CTLCardinality-11
FORMULA_NAME Sudoku-PT-AN02-CTLCardinality-12
FORMULA_NAME Sudoku-PT-AN02-CTLCardinality-13
FORMULA_NAME Sudoku-PT-AN02-CTLCardinality-14
FORMULA_NAME Sudoku-PT-AN02-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679198031907

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=Sudoku-PT-AN02
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-19 03:53:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-19 03:53:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 03:53:53] [INFO ] Load time of PNML (sax parser for PT used): 20 ms
[2023-03-19 03:53:53] [INFO ] Transformed 20 places.
[2023-03-19 03:53:53] [INFO ] Transformed 8 transitions.
[2023-03-19 03:53:53] [INFO ] Parsed PT model containing 20 places and 8 transitions and 32 arcs in 76 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
FORMULA Sudoku-PT-AN02-CTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN02-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Applied a total of 0 rules in 6 ms. Remains 20 /20 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 20 cols
[2023-03-19 03:53:53] [INFO ] Computed 12 place invariants in 6 ms
[2023-03-19 03:53:53] [INFO ] Implicit Places using invariants in 145 ms returned []
[2023-03-19 03:53:53] [INFO ] Invariant cache hit.
[2023-03-19 03:53:53] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 218 ms to find 0 implicit places.
[2023-03-19 03:53:53] [INFO ] Invariant cache hit.
[2023-03-19 03:53:53] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 253 ms. Remains : 20/20 places, 8/8 transitions.
Support contains 20 out of 20 places after structural reductions.
[2023-03-19 03:53:54] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-19 03:53:54] [INFO ] Flatten gal took : 14 ms
FORMULA Sudoku-PT-AN02-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 03:53:54] [INFO ] Flatten gal took : 4 ms
[2023-03-19 03:53:54] [INFO ] Input system was already deterministic with 8 transitions.
Incomplete random walk after 10000 steps, including 2228 resets, run finished after 484 ms. (steps per millisecond=20 ) properties (out of 58) seen :37
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 56 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 54 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 54 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 54 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
[2023-03-19 03:53:54] [INFO ] Invariant cache hit.
[2023-03-19 03:53:54] [INFO ] [Real]Absence check using 12 positive place invariants in 1 ms returned sat
[2023-03-19 03:53:54] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :15 sat :0 real:6
[2023-03-19 03:53:54] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-03-19 03:53:54] [INFO ] After 53ms SMT Verify possible using all constraints in natural domain returned unsat :21 sat :0
Fused 21 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 21 atomic propositions for a total of 13 simplifications.
FORMULA Sudoku-PT-AN02-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Sudoku-PT-AN02-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-19 03:53:54] [INFO ] Flatten gal took : 8 ms
[2023-03-19 03:53:54] [INFO ] Flatten gal took : 2 ms
[2023-03-19 03:53:54] [INFO ] Input system was already deterministic with 8 transitions.
Computed a total of 20 stabilizing places and 8 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 20 transition count 8
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 SI_CTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Applied a total of 0 rules in 3 ms. Remains 20 /20 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 3 ms. Remains : 20/20 places, 8/8 transitions.
[2023-03-19 03:53:54] [INFO ] Flatten gal took : 2 ms
[2023-03-19 03:53:54] [INFO ] Flatten gal took : 2 ms
[2023-03-19 03:53:54] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 12 transition count 8
Applied a total of 8 rules in 0 ms. Remains 12 /20 variables (removed 8) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 12/20 places, 8/8 transitions.
[2023-03-19 03:53:54] [INFO ] Flatten gal took : 1 ms
[2023-03-19 03:53:54] [INFO ] Flatten gal took : 1 ms
[2023-03-19 03:53:54] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 20/20 places, 8/8 transitions.
[2023-03-19 03:53:54] [INFO ] Flatten gal took : 1 ms
[2023-03-19 03:53:54] [INFO ] Flatten gal took : 2 ms
[2023-03-19 03:53:54] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 16 transition count 8
Applied a total of 4 rules in 1 ms. Remains 16 /20 variables (removed 4) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 16/20 places, 8/8 transitions.
[2023-03-19 03:53:54] [INFO ] Flatten gal took : 1 ms
[2023-03-19 03:53:54] [INFO ] Flatten gal took : 1 ms
[2023-03-19 03:53:54] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Graph (complete) has 24 edges and 20 vertex of which 13 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 13 /20 variables (removed 7) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 13/20 places, 8/8 transitions.
[2023-03-19 03:53:54] [INFO ] Flatten gal took : 1 ms
[2023-03-19 03:53:54] [INFO ] Flatten gal took : 1 ms
[2023-03-19 03:53:54] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Graph (complete) has 24 edges and 20 vertex of which 12 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 0 ms. Remains 12 /20 variables (removed 8) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 0 ms. Remains : 12/20 places, 8/8 transitions.
[2023-03-19 03:53:54] [INFO ] Flatten gal took : 1 ms
[2023-03-19 03:53:54] [INFO ] Flatten gal took : 1 ms
[2023-03-19 03:53:54] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Graph (complete) has 24 edges and 20 vertex of which 16 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 16 /20 variables (removed 4) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 16/20 places, 8/8 transitions.
[2023-03-19 03:53:54] [INFO ] Flatten gal took : 1 ms
[2023-03-19 03:53:54] [INFO ] Flatten gal took : 1 ms
[2023-03-19 03:53:54] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 14 transition count 8
Applied a total of 6 rules in 0 ms. Remains 14 /20 variables (removed 6) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 14/20 places, 8/8 transitions.
[2023-03-19 03:53:54] [INFO ] Flatten gal took : 1 ms
[2023-03-19 03:53:54] [INFO ] Flatten gal took : 1 ms
[2023-03-19 03:53:54] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Graph (complete) has 24 edges and 20 vertex of which 12 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.0 ms
Discarding 8 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 12 /20 variables (removed 8) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 12/20 places, 8/8 transitions.
[2023-03-19 03:53:54] [INFO ] Flatten gal took : 1 ms
[2023-03-19 03:53:54] [INFO ] Flatten gal took : 1 ms
[2023-03-19 03:53:54] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 16 transition count 8
Applied a total of 4 rules in 1 ms. Remains 16 /20 variables (removed 4) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 16/20 places, 8/8 transitions.
[2023-03-19 03:53:54] [INFO ] Flatten gal took : 1 ms
[2023-03-19 03:53:54] [INFO ] Flatten gal took : 1 ms
[2023-03-19 03:53:54] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 8/8 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 14 transition count 8
Applied a total of 6 rules in 1 ms. Remains 14 /20 variables (removed 6) and now considering 8/8 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 14/20 places, 8/8 transitions.
[2023-03-19 03:53:54] [INFO ] Flatten gal took : 1 ms
[2023-03-19 03:53:54] [INFO ] Flatten gal took : 1 ms
[2023-03-19 03:53:54] [INFO ] Input system was already deterministic with 8 transitions.
[2023-03-19 03:53:54] [INFO ] Flatten gal took : 1 ms
[2023-03-19 03:53:54] [INFO ] Flatten gal took : 1 ms
[2023-03-19 03:53:54] [INFO ] Export to MCC of 11 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-19 03:53:54] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 20 places, 8 transitions and 32 arcs took 0 ms.
Total runtime 1652 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: 20 NrTr: 8 NrArc: 32)

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

net check time: 0m 0.000sec

init dd package: 0m 2.694sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 123 (1.2e+02) #states 35



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

checking: AX [EX [0<=0]]
normalized: ~ [EX [~ [EX [0<=0]]]]

abstracting: (0<=0)
states: 35
..-> the formula is TRUE

FORMULA Sudoku-PT-AN02-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EG [~ [p2<=0]]
normalized: EG [~ [p2<=0]]

abstracting: (p2<=0)
states: 18
....
EG iterations: 4
-> the formula is TRUE

FORMULA Sudoku-PT-AN02-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EG [p5<=p19]
normalized: EG [p5<=p19]

abstracting: (p5<=p19)
states: 31
...
EG iterations: 3
-> the formula is TRUE

FORMULA Sudoku-PT-AN02-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AF [AG [[p16<=p13 & p16<=p1]]]
normalized: ~ [EG [E [true U ~ [[p16<=p13 & p16<=p1]]]]]

abstracting: (p16<=p1)
states: 26
abstracting: (p16<=p13)
states: 26
....
EG iterations: 4
-> the formula is FALSE

FORMULA Sudoku-PT-AN02-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [[EF [AG [~ [1<=p13]]] & EF [~ [1<=p14]]] & [EF [p2<=0] & [EF [EX [AF [p10<=0]]] & EF [~ [p9<=p13]]]]]
normalized: [[E [true U ~ [E [true U 1<=p13]]] & E [true U ~ [1<=p14]]] & [[E [true U ~ [p9<=p13]] & E [true U EX [~ [EG [~ [p10<=0]]]]]] & E [true U p2<=0]]]

abstracting: (p2<=0)
states: 18
abstracting: (p10<=0)
states: 26
.
EG iterations: 1
.abstracting: (p9<=p13)
states: 30
abstracting: (1<=p14)
states: 17
abstracting: (1<=p13)
states: 17
-> the formula is TRUE

FORMULA Sudoku-PT-AN02-CTLCardinality-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: A [[~ [1<=p13] | A [EG [[EG [1<=p16] | [1<=p4 | p7<=p6]]] U EF [[1<=p1 & p14<=1]]]] U 1<=p11]
normalized: [~ [EG [~ [1<=p11]]] & ~ [E [~ [1<=p11] U [~ [[[~ [EG [~ [E [true U [1<=p1 & p14<=1]]]]] & ~ [E [~ [E [true U [1<=p1 & p14<=1]]] U [~ [EG [[[1<=p4 | p7<=p6] | EG [1<=p16]]]] & ~ [E [true U [1<=p1 & p14<=1]]]]]]] | ~ [1<=p13]]] & ~ [1<=p11]]]]]

abstracting: (1<=p11)
states: 9
abstracting: (1<=p13)
states: 17
abstracting: (p14<=1)
states: 35
abstracting: (1<=p1)
states: 17
abstracting: (1<=p16)
states: 17
....
EG iterations: 4
abstracting: (p7<=p6)
states: 26
abstracting: (1<=p4)
states: 9
.
EG iterations: 1
abstracting: (p14<=1)
states: 35
abstracting: (1<=p1)
states: 17
abstracting: (p14<=1)
states: 35
abstracting: (1<=p1)
states: 17
.
EG iterations: 1
abstracting: (1<=p11)
states: 9
abstracting: (1<=p11)
states: 9
...
EG iterations: 3
-> the formula is FALSE

FORMULA Sudoku-PT-AN02-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: [EX [~ [p2<=p5]] & AF [[~ [p6<=p0] & [AG [~ [p13<=p1]] & A [p18<=p14 U EF [p5<=p12]]]]]]
normalized: [~ [EG [~ [[[[~ [EG [~ [E [true U p5<=p12]]]] & ~ [E [~ [E [true U p5<=p12]] U [~ [p18<=p14] & ~ [E [true U p5<=p12]]]]]] & ~ [E [true U p13<=p1]]] & ~ [p6<=p0]]]]] & EX [~ [p2<=p5]]]

abstracting: (p2<=p5)
states: 22
.abstracting: (p6<=p0)
states: 26
abstracting: (p13<=p1)
states: 30
abstracting: (p5<=p12)
states: 26
abstracting: (p18<=p14)
states: 26
abstracting: (p5<=p12)
states: 26
abstracting: (p5<=p12)
states: 26
.
EG iterations: 1

EG iterations: 0
-> the formula is FALSE

FORMULA Sudoku-PT-AN02-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: [EX [EG [[EG [~ [p19<=p15]] | AX [~ [1<=p4]]]]] | [AX [EF [[[p18<=0 & p10<=0] | [1<=p12 | 1<=p17]]]] & AG [[AG [1<=p11] & [1<=p13 & p9<=p14]]]]]
normalized: [[~ [E [true U ~ [[[1<=p13 & p9<=p14] & ~ [E [true U ~ [1<=p11]]]]]]] & ~ [EX [~ [E [true U [[1<=p12 | 1<=p17] | [p18<=0 & p10<=0]]]]]]] | EX [EG [[~ [EX [1<=p4]] | EG [~ [p19<=p15]]]]]]

abstracting: (p19<=p15)
states: 30
...
EG iterations: 3
abstracting: (1<=p4)
states: 9
..
EG iterations: 1
.abstracting: (p10<=0)
states: 26
abstracting: (p18<=0)
states: 18
abstracting: (1<=p17)
states: 17
abstracting: (1<=p12)
states: 17
.abstracting: (1<=p11)
states: 9
abstracting: (p9<=p14)
states: 26
abstracting: (1<=p13)
states: 17
-> the formula is TRUE

FORMULA Sudoku-PT-AN02-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AF [EG [sum(p11, p10, p9, p8, p7, p6, p5, p4)<=sum(p15, p14, p13, p12)]]
normalized: ~ [EG [~ [EG [sum(p11, p10, p9, p8, p7, p6, p5, p4)<=sum(p15, p14, p13, p12)]]]]

abstracting: (sum(p11, p10, p9, p8, p7, p6, p5, p4)<=sum(p15, p14, p13, p12))
states: 25
..
EG iterations: 2
.
EG iterations: 1
-> the formula is TRUE

FORMULA Sudoku-PT-AN02-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.031sec

checking: EG [sum(p11, p10, p9, p8, p7, p6, p5, p4)<=sum(p15, p14, p13, p12)]
normalized: EG [sum(p11, p10, p9, p8, p7, p6, p5, p4)<=sum(p15, p14, p13, p12)]

abstracting: (sum(p11, p10, p9, p8, p7, p6, p5, p4)<=sum(p15, p14, p13, p12))
states: 25
..
EG iterations: 2
-> the formula is TRUE

FORMULA Sudoku-PT-AN02-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: A [[E [~ [p18<=p1] U 1<=p14] | [EG [EF [1<=p3]] & [EX [~ [EX [p3<=p6]]] & E [[A [p9<=0 U 1<=p18] & [[p9<=0 | p19<=p10] & ~ [p0<=p14]]] U AG [E [1<=p8 U 1<=p10]]]]]] U [1<=p16 & EG [EF [[[1<=p3 & 1<=p8] & [p19<=1 & p9<=p17]]]]]]
normalized: [~ [EG [~ [[EG [E [true U [[p19<=1 & p9<=p17] & [1<=p3 & 1<=p8]]]] & 1<=p16]]]] & ~ [E [~ [[EG [E [true U [[p19<=1 & p9<=p17] & [1<=p3 & 1<=p8]]]] & 1<=p16]] U [~ [[[[E [[[~ [p0<=p14] & [p9<=0 | p19<=p10]] & [~ [EG [~ [1<=p18]]] & ~ [E [~ [1<=p18] U [~ [p9<=0] & ~ [1<=p18]]]]]] U ~ [E [true U ~ [E [1<=p8 U 1<=p10]]]]] & EX [~ [EX [p3<=p6]]]] & EG [E [true U 1<=p3]]] | E [~ [p18<=p1] U 1<=p14]]] & ~ [[EG [E [true U [[p19<=1 & p9<=p17] & [1<=p3 & 1<=p8]]]] & 1<=p16]]]]]]

abstracting: (1<=p16)
states: 17
abstracting: (1<=p8)
states: 9
abstracting: (1<=p3)
states: 17
abstracting: (p9<=p17)
states: 26
abstracting: (p19<=1)
states: 35
....
EG iterations: 4
abstracting: (1<=p14)
states: 17
abstracting: (p18<=p1)
states: 26
abstracting: (1<=p3)
states: 17
....
EG iterations: 4
abstracting: (p3<=p6)
states: 22
..abstracting: (1<=p10)
states: 9
abstracting: (1<=p8)
states: 9
abstracting: (1<=p18)
states: 17
abstracting: (p9<=0)
states: 26
abstracting: (1<=p18)
states: 17
abstracting: (1<=p18)
states: 17
.
EG iterations: 1
abstracting: (p19<=p10)
states: 23
abstracting: (p9<=0)
states: 26
abstracting: (p0<=p14)
states: 26
abstracting: (1<=p16)
states: 17
abstracting: (1<=p8)
states: 9
abstracting: (1<=p3)
states: 17
abstracting: (p9<=p17)
states: 26
abstracting: (p19<=1)
states: 35
....
EG iterations: 4
abstracting: (1<=p16)
states: 17
abstracting: (1<=p8)
states: 9
abstracting: (1<=p3)
states: 17
abstracting: (p9<=p17)
states: 26
abstracting: (p19<=1)
states: 35
....
EG iterations: 4
.
EG iterations: 1
-> the formula is TRUE

FORMULA Sudoku-PT-AN02-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

totally nodes used: 2796 (2.8e+03)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1937 8900 10837
used/not used/entry size/cache size: 10373 67098491 16 1024MB
basic ops cache: hits/miss/sum: 1401 6698 8099
used/not used/entry size/cache size: 11441 16765775 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 4095 4095
used/not used/entry size/cache size: 1 16777215 12 192MB
state nr cache: hits/miss/sum: 238 743 981
used/not used/entry size/cache size: 743 8387865 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 67106094
1 2744
2 26
3 0
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0

Total processing time: 0m 4.325sec


BK_STOP 1679198040453

--------------------
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:37 (4), effective:8 (1)

initing FirstDep: 0m 0.000sec


iterations count:16 (2), effective:3 (0)

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

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

iterations count:19 (2), effective:3 (0)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:13 (1), effective:1 (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="Sudoku-PT-AN02"
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 Sudoku-PT-AN02, 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 r490-tall-167912708300169"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Sudoku-PT-AN02.tgz
mv Sudoku-PT-AN02 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 ;