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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 532K
-rw-r--r-- 1 mcc users 7.7K Feb 26 01:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K Feb 26 01:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Feb 26 01:37 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 01:37 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Feb 25 17:21 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 17:21 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Feb 25 17:21 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:21 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Feb 26 01:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 26 01:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 01:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Feb 26 01:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:21 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:21 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 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
-rwxr-xr-x 1 mcc users 33K 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 TriangularGrid-PT-2011-CTLCardinality-00
FORMULA_NAME TriangularGrid-PT-2011-CTLCardinality-01
FORMULA_NAME TriangularGrid-PT-2011-CTLCardinality-02
FORMULA_NAME TriangularGrid-PT-2011-CTLCardinality-03
FORMULA_NAME TriangularGrid-PT-2011-CTLCardinality-04
FORMULA_NAME TriangularGrid-PT-2011-CTLCardinality-05
FORMULA_NAME TriangularGrid-PT-2011-CTLCardinality-06
FORMULA_NAME TriangularGrid-PT-2011-CTLCardinality-07
FORMULA_NAME TriangularGrid-PT-2011-CTLCardinality-08
FORMULA_NAME TriangularGrid-PT-2011-CTLCardinality-09
FORMULA_NAME TriangularGrid-PT-2011-CTLCardinality-10
FORMULA_NAME TriangularGrid-PT-2011-CTLCardinality-11
FORMULA_NAME TriangularGrid-PT-2011-CTLCardinality-12
FORMULA_NAME TriangularGrid-PT-2011-CTLCardinality-13
FORMULA_NAME TriangularGrid-PT-2011-CTLCardinality-14
FORMULA_NAME TriangularGrid-PT-2011-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679326314875

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=TriangularGrid-PT-2011
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 15:31:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 15:31:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 15:31:56] [INFO ] Load time of PNML (sax parser for PT used): 27 ms
[2023-03-20 15:31:56] [INFO ] Transformed 52 places.
[2023-03-20 15:31:56] [INFO ] Transformed 42 transitions.
[2023-03-20 15:31:56] [INFO ] Parsed PT model containing 52 places and 42 transitions and 168 arcs in 95 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 12 ms.
Support contains 50 out of 52 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 10 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
// Phase 1: matrix 42 rows 52 cols
[2023-03-20 15:31:56] [INFO ] Computed 23 place invariants in 8 ms
[2023-03-20 15:31:56] [INFO ] Implicit Places using invariants in 174 ms returned []
[2023-03-20 15:31:56] [INFO ] Invariant cache hit.
[2023-03-20 15:31:56] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
[2023-03-20 15:31:56] [INFO ] Invariant cache hit.
[2023-03-20 15:31:56] [INFO ] Dead Transitions using invariants and state equation in 74 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 347 ms. Remains : 52/52 places, 42/42 transitions.
Support contains 50 out of 52 places after structural reductions.
[2023-03-20 15:31:57] [INFO ] Flatten gal took : 19 ms
[2023-03-20 15:31:57] [INFO ] Flatten gal took : 8 ms
[2023-03-20 15:31:57] [INFO ] Input system was already deterministic with 42 transitions.
Incomplete random walk after 10000 steps, including 16 resets, run finished after 454 ms. (steps per millisecond=22 ) properties (out of 87) seen :75
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-20 15:31:58] [INFO ] Invariant cache hit.
[2023-03-20 15:31:58] [INFO ] [Real]Absence check using 22 positive place invariants in 4 ms returned sat
[2023-03-20 15:31:58] [INFO ] [Real]Absence check using 22 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 15:31:58] [INFO ] After 80ms SMT Verify possible using all constraints in real domain returned unsat :11 sat :0 real:1
[2023-03-20 15:31:58] [INFO ] After 27ms SMT Verify possible using all constraints in natural domain returned unsat :12 sat :0
Fused 12 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 12 atomic propositions for a total of 16 simplifications.
FORMULA TriangularGrid-PT-2011-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 15:31:58] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-20 15:31:58] [INFO ] Flatten gal took : 7 ms
FORMULA TriangularGrid-PT-2011-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 15:31:58] [INFO ] Flatten gal took : 5 ms
[2023-03-20 15:31:58] [INFO ] Input system was already deterministic with 42 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 52/52 places, 42/42 transitions.
[2023-03-20 15:31:58] [INFO ] Flatten gal took : 4 ms
[2023-03-20 15:31:58] [INFO ] Flatten gal took : 3 ms
[2023-03-20 15:31:58] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 52/52 places, 42/42 transitions.
[2023-03-20 15:31:58] [INFO ] Flatten gal took : 3 ms
[2023-03-20 15:31:58] [INFO ] Flatten gal took : 3 ms
[2023-03-20 15:31:58] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 4 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 52/52 places, 42/42 transitions.
[2023-03-20 15:31:58] [INFO ] Flatten gal took : 3 ms
[2023-03-20 15:31:58] [INFO ] Flatten gal took : 4 ms
[2023-03-20 15:31:58] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 52/52 places, 42/42 transitions.
[2023-03-20 15:31:58] [INFO ] Flatten gal took : 3 ms
[2023-03-20 15:31:58] [INFO ] Flatten gal took : 3 ms
[2023-03-20 15:31:58] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 52/52 places, 42/42 transitions.
[2023-03-20 15:31:58] [INFO ] Flatten gal took : 3 ms
[2023-03-20 15:31:58] [INFO ] Flatten gal took : 3 ms
[2023-03-20 15:31:58] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 7 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 7 ms. Remains : 52/52 places, 42/42 transitions.
[2023-03-20 15:31:58] [INFO ] Flatten gal took : 2 ms
[2023-03-20 15:31:58] [INFO ] Flatten gal took : 3 ms
[2023-03-20 15:31:58] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 52/52 places, 42/42 transitions.
[2023-03-20 15:31:58] [INFO ] Flatten gal took : 2 ms
[2023-03-20 15:31:58] [INFO ] Flatten gal took : 3 ms
[2023-03-20 15:31:58] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 52/52 places, 42/42 transitions.
[2023-03-20 15:31:58] [INFO ] Flatten gal took : 3 ms
[2023-03-20 15:31:58] [INFO ] Flatten gal took : 2 ms
[2023-03-20 15:31:58] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 52/52 places, 42/42 transitions.
[2023-03-20 15:31:58] [INFO ] Flatten gal took : 3 ms
[2023-03-20 15:31:58] [INFO ] Flatten gal took : 3 ms
[2023-03-20 15:31:58] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 52/52 places, 42/42 transitions.
[2023-03-20 15:31:58] [INFO ] Flatten gal took : 2 ms
[2023-03-20 15:31:58] [INFO ] Flatten gal took : 3 ms
[2023-03-20 15:31:58] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 52/52 places, 42/42 transitions.
[2023-03-20 15:31:58] [INFO ] Flatten gal took : 2 ms
[2023-03-20 15:31:58] [INFO ] Flatten gal took : 3 ms
[2023-03-20 15:31:58] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 52/52 places, 42/42 transitions.
[2023-03-20 15:31:58] [INFO ] Flatten gal took : 3 ms
[2023-03-20 15:31:58] [INFO ] Flatten gal took : 2 ms
[2023-03-20 15:31:58] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in LTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 52/52 places, 42/42 transitions.
[2023-03-20 15:31:58] [INFO ] Flatten gal took : 3 ms
[2023-03-20 15:31:58] [INFO ] Flatten gal took : 2 ms
[2023-03-20 15:31:58] [INFO ] Input system was already deterministic with 42 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 52/52 places, 42/42 transitions.
Applied a total of 0 rules in 2 ms. Remains 52 /52 variables (removed 0) and now considering 42/42 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 2 ms. Remains : 52/52 places, 42/42 transitions.
[2023-03-20 15:31:58] [INFO ] Flatten gal took : 3 ms
[2023-03-20 15:31:58] [INFO ] Flatten gal took : 2 ms
[2023-03-20 15:31:58] [INFO ] Input system was already deterministic with 42 transitions.
[2023-03-20 15:31:58] [INFO ] Flatten gal took : 3 ms
[2023-03-20 15:31:58] [INFO ] Flatten gal took : 3 ms
[2023-03-20 15:31:58] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-20 15:31:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 52 places, 42 transitions and 168 arcs took 0 ms.
Total runtime 2222 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: 52 NrTr: 42 NrArc: 168)

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

net check time: 0m 0.000sec

init dd package: 0m 2.743sec


RS generation: 0m 0.058sec


-> reachability set: #nodes 968 (9.7e+02) #states 940,096,149 (8)



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

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

abstracting: (p23<=0)
states: 660,357,832 (8)
........
EG iterations: 8
.-> the formula is TRUE

FORMULA TriangularGrid-PT-2011-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.046sec

checking: EG [EF [AX [AG [~ [p33<=p20]]]]]
normalized: EG [E [true U ~ [EX [E [true U p33<=p20]]]]]

abstracting: (p33<=p20)
states: 480,151,719 (8)
.
EG iterations: 0
-> the formula is TRUE

FORMULA TriangularGrid-PT-2011-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.365sec

checking: AF [[~ [p35<=0] & AX [~ [1<=p40]]]]
normalized: ~ [EG [~ [[~ [EX [1<=p40]] & ~ [p35<=0]]]]]

abstracting: (p35<=0)
states: 660,357,832 (8)
abstracting: (1<=p40)
states: 279,747,756 (8)
.........
EG iterations: 8
-> the formula is FALSE

FORMULA TriangularGrid-PT-2011-CTLCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.045sec

checking: [EF [EG [~ [1<=p28]]] & AG [p19<=p29]]
normalized: [~ [E [true U ~ [p19<=p29]]] & E [true U EG [~ [1<=p28]]]]

abstracting: (1<=p28)
states: 660,357,832 (8)
.......
EG iterations: 7
abstracting: (p19<=p29)
states: 860,761,795 (8)
-> the formula is FALSE

FORMULA TriangularGrid-PT-2011-CTLCardinality-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.167sec

checking: EF [EG [[AG [p43<=0] | [AF [1<=p4] & EF [p50<=p48]]]]]
normalized: E [true U EG [[[E [true U p50<=p48] & ~ [EG [~ [1<=p4]]]] | ~ [E [true U ~ [p43<=0]]]]]]

abstracting: (p43<=0)
states: 279,738,317 (8)
abstracting: (1<=p4)
states: 361,510,402 (8)
.
EG iterations: 1
abstracting: (p50<=p48)
states: 739,690,667 (8)
....
EG iterations: 4
-> the formula is TRUE

FORMULA TriangularGrid-PT-2011-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.137sec

checking: AG [[p4<=p9 | AF [[AX [[1<=p3 | 1<=p34]] & ~ [p6<=p24]]]]]
normalized: ~ [E [true U ~ [[p4<=p9 | ~ [EG [~ [[~ [p6<=p24] & ~ [EX [~ [[1<=p3 | 1<=p34]]]]]]]]]]]]

abstracting: (1<=p34)
states: 279,738,317 (8)
abstracting: (1<=p3)
states: 361,499,225 (8)
.abstracting: (p6<=p24)
states: 648,271,719 (8)
.......
EG iterations: 7
abstracting: (p4<=p9)
states: 678,365,841 (8)
-> the formula is FALSE

FORMULA TriangularGrid-PT-2011-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.465sec

checking: AX [A [~ [[p6<=p49 & p3<=p16]] U AG [A [AF [1<=p40] U [p20<=p30 & p11<=0]]]]]
normalized: ~ [EX [~ [[~ [EG [E [true U ~ [[~ [EG [~ [[p20<=p30 & p11<=0]]]] & ~ [E [~ [[p20<=p30 & p11<=0]] U [EG [~ [1<=p40]] & ~ [[p20<=p30 & p11<=0]]]]]]]]]] & ~ [E [E [true U ~ [[~ [EG [~ [[p20<=p30 & p11<=0]]]] & ~ [E [~ [[p20<=p30 & p11<=0]] U [EG [~ [1<=p40]] & ~ [[p20<=p30 & p11<=0]]]]]]]] U [[p6<=p49 & p3<=p16] & E [true U ~ [[~ [EG [~ [[p20<=p30 & p11<=0]]]] & ~ [E [~ [[p20<=p30 & p11<=0]] U [EG [~ [1<=p40]] & ~ [[p20<=p30 & p11<=0]]]]]]]]]]]]]]]

abstracting: (p11<=0)
states: 578,585,747 (8)
abstracting: (p20<=p30)
states: 860,761,795 (8)
abstracting: (1<=p40)
states: 279,747,756 (8)
........
EG iterations: 8
abstracting: (p11<=0)
states: 578,585,747 (8)
abstracting: (p20<=p30)
states: 860,761,795 (8)
abstracting: (p11<=0)
states: 578,585,747 (8)
abstracting: (p20<=p30)
states: 860,761,795 (8)
............
EG iterations: 12
abstracting: (p3<=p16)
states: 648,281,136 (8)
abstracting: (p6<=p49)
states: 749,519,753 (8)
abstracting: (p11<=0)
states: 578,585,747 (8)
abstracting: (p20<=p30)
states: 860,761,795 (8)
abstracting: (1<=p40)
states: 279,747,756 (8)
........
EG iterations: 8
abstracting: (p11<=0)
states: 578,585,747 (8)
abstracting: (p20<=p30)
states: 860,761,795 (8)
abstracting: (p11<=0)
states: 578,585,747 (8)
abstracting: (p20<=p30)
states: 860,761,795 (8)
............
EG iterations: 12
abstracting: (p11<=0)
states: 578,585,747 (8)
abstracting: (p20<=p30)
states: 860,761,795 (8)
abstracting: (1<=p40)
states: 279,747,756 (8)
........
EG iterations: 8
abstracting: (p11<=0)
states: 578,585,747 (8)
abstracting: (p20<=p30)
states: 860,761,795 (8)
abstracting: (p11<=0)
states: 578,585,747 (8)
abstracting: (p20<=p30)
states: 860,761,795 (8)
............
EG iterations: 12
...
EG iterations: 3
.-> the formula is FALSE

FORMULA TriangularGrid-PT-2011-CTLCardinality-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.269sec

checking: EF [EG [[1<=p1 & ~ [A [[p24<=p46 | p45<=p7] U [p8<=p5 | p18<=p9]]]]]]
normalized: E [true U EG [[1<=p1 & ~ [[~ [EG [~ [[p8<=p5 | p18<=p9]]]] & ~ [E [~ [[p8<=p5 | p18<=p9]] U [~ [[p8<=p5 | p18<=p9]] & ~ [[p24<=p46 | p45<=p7]]]]]]]]]]

abstracting: (p45<=p7)
states: 539,205,955 (8)
abstracting: (p24<=p46)
states: 860,763,314 (8)
abstracting: (p18<=p9)
states: 762,400,596 (8)
abstracting: (p8<=p5)
states: 678,375,039 (8)
abstracting: (p18<=p9)
states: 762,400,596 (8)
abstracting: (p8<=p5)
states: 678,375,039 (8)
abstracting: (p18<=p9)
states: 762,400,596 (8)
abstracting: (p8<=p5)
states: 678,375,039 (8)
........................
EG iterations: 24
abstracting: (1<=p1)
states: 361,510,402 (8)
...
EG iterations: 3
-> the formula is TRUE

FORMULA TriangularGrid-PT-2011-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.463sec

checking: [AF [p8<=0] & [EF [[~ [p10<=p15] | [p38<=p17 | p41<=p4]]] & AG [EF [[p23<=0 & p0<=1]]]]]
normalized: [[~ [E [true U ~ [E [true U [p23<=0 & p0<=1]]]]] & E [true U [[p38<=p17 | p41<=p4] | ~ [p10<=p15]]]] & ~ [EG [~ [p8<=0]]]]

abstracting: (p8<=0)
states: 578,596,924 (8)
....
EG iterations: 4
abstracting: (p10<=p15)
states: 889,499,851 (8)
abstracting: (p41<=p4)
states: 762,408,297 (8)
abstracting: (p38<=p17)
states: 739,682,747 (8)
abstracting: (p0<=1)
states: 819,204,983 (8)
abstracting: (p23<=0)
states: 660,357,832 (8)
-> the formula is FALSE

FORMULA TriangularGrid-PT-2011-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.468sec

checking: AG [[EF [[EX [~ [1<=p20]] & AF [AX [p14<=0]]]] & [p29<=p45 | [EX [EF [~ [p8<=p14]]] & [AG [[1<=p27 | 1<=p31]] | EF [AG [p29<=p9]]]]]]]
normalized: ~ [E [true U ~ [[E [true U [~ [EG [EX [~ [p14<=0]]]] & EX [~ [1<=p20]]]] & [p29<=p45 | [[~ [E [true U ~ [[1<=p27 | 1<=p31]]]] | E [true U ~ [E [true U ~ [p29<=p9]]]]] & EX [E [true U ~ [p8<=p14]]]]]]]]]

abstracting: (p8<=p14)
states: 889,503,044 (8)
.abstracting: (p29<=p9)
states: 539,205,955 (8)
abstracting: (1<=p31)
states: 660,348,393 (8)
abstracting: (1<=p27)
states: 660,348,393 (8)
abstracting: (p29<=p45)
states: 739,684,266 (8)
abstracting: (1<=p20)
states: 279,747,756 (8)
.abstracting: (p14<=0)
states: 83,539,845 (7)
....
EG iterations: 3
-> the formula is FALSE

FORMULA TriangularGrid-PT-2011-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.338sec

checking: EF [[[AF [p44<=p37] & [EF [[1<=p48 & p1<=1]] | [AX [1<=p3] | EX [1<=p17]]]] & [AG [1<=p25] & A [p21<=p40 U 1<=p36]]]]
normalized: E [true U [[[[EX [1<=p17] | ~ [EX [~ [1<=p3]]]] | E [true U [1<=p48 & p1<=1]]] & ~ [EG [~ [p44<=p37]]]] & [~ [E [true U ~ [1<=p25]]] & [~ [E [~ [1<=p36] U [~ [1<=p36] & ~ [p21<=p40]]]] & ~ [EG [~ [1<=p36]]]]]]]

abstracting: (1<=p36)
states: 279,747,756 (8)
........
EG iterations: 8
abstracting: (p21<=p40)
states: 739,692,186 (8)
abstracting: (1<=p36)
states: 279,747,756 (8)
abstracting: (1<=p36)
states: 279,747,756 (8)
abstracting: (1<=p25)
states: 660,357,832 (8)
abstracting: (p44<=p37)
states: 480,143,799 (8)
....................
EG iterations: 20
abstracting: (p1<=1)
states: 819,204,983 (8)
abstracting: (1<=p48)
states: 660,357,832 (8)
abstracting: (1<=p3)
states: 361,499,225 (8)
.abstracting: (1<=p17)
states: 279,738,317 (8)
.-> the formula is TRUE

FORMULA TriangularGrid-PT-2011-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.731sec

checking: E [[~ [[EG [[p25<=0 | p43<=p36]] & EF [1<=p51]]] | [~ [EX [[AX [1<=p36] & p23<=p34]]] | [~ [[AG [1<=p4] & p15<=p19]] & [AG [AF [1<=p41]] | p39<=0]]]] U AG [[p21<=0 | [EG [p39<=0] & 1<=p21]]]]
normalized: E [[[[[p39<=0 | ~ [E [true U EG [~ [1<=p41]]]]] & ~ [[p15<=p19 & ~ [E [true U ~ [1<=p4]]]]]] | ~ [EX [[p23<=p34 & ~ [EX [~ [1<=p36]]]]]]] | ~ [[E [true U 1<=p51] & EG [[p25<=0 | p43<=p36]]]]] U ~ [E [true U ~ [[p21<=0 | [1<=p21 & EG [p39<=0]]]]]]]

abstracting: (p39<=0)
states: 660,357,832 (8)
........
EG iterations: 8
abstracting: (1<=p21)
states: 279,738,317 (8)
abstracting: (p21<=0)
states: 660,357,832 (8)
abstracting: (p43<=p36)
states: 480,151,719 (8)
abstracting: (p25<=0)
states: 279,738,317 (8)
.......
EG iterations: 7
abstracting: (1<=p51)
states: 660,357,832 (8)
abstracting: (1<=p36)
states: 279,747,756 (8)
.abstracting: (p23<=p34)
states: 739,690,667 (8)
.abstracting: (1<=p4)
states: 361,510,402 (8)
abstracting: (p15<=p19)
states: 125,694,203 (8)
abstracting: (1<=p41)
states: 279,738,317 (8)
........
EG iterations: 8
abstracting: (p39<=0)
states: 660,357,832 (8)
-> the formula is TRUE

FORMULA TriangularGrid-PT-2011-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.171sec

checking: E [[[~ [E [[p41<=p40 & [1<=p6 & 1<=p44]] U 1<=p24]] | EX [[p2<=0 | p47<=p21]]] | [1<=p8 | E [[[p34<=p10 & p17<=0] & [1<=p8 & p36<=0]] U AX [1<=p42]]]] U ~ [E [1<=p28 U AF [1<=p33]]]]
normalized: E [[[EX [[p2<=0 | p47<=p21]] | ~ [E [[p41<=p40 & [1<=p6 & 1<=p44]] U 1<=p24]]] | [1<=p8 | E [[[1<=p8 & p36<=0] & [p34<=p10 & p17<=0]] U ~ [EX [~ [1<=p42]]]]]] U ~ [E [1<=p28 U ~ [EG [~ [1<=p33]]]]]]

abstracting: (1<=p33)
states: 660,357,832 (8)
.......
EG iterations: 7
abstracting: (1<=p28)
states: 660,357,832 (8)
abstracting: (1<=p42)
states: 279,738,317 (8)
.abstracting: (p17<=0)
states: 660,357,832 (8)
abstracting: (p34<=p10)
states: 762,408,057 (8)
abstracting: (p36<=0)
states: 660,348,393 (8)
abstracting: (1<=p8)
states: 361,499,225 (8)
abstracting: (1<=p8)
states: 361,499,225 (8)
abstracting: (1<=p24)
states: 279,738,317 (8)
abstracting: (1<=p44)
states: 660,357,832 (8)
abstracting: (1<=p6)
states: 361,508,424 (8)
abstracting: (p41<=p40)
states: 739,692,186 (8)
abstracting: (p47<=p21)
states: 480,151,719 (8)
abstracting: (p2<=0)
states: 578,587,725 (8)
.-> the formula is TRUE

FORMULA TriangularGrid-PT-2011-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.160sec

checking: E [[p17<=p15 & ~ [[~ [[A [p2<=p8 U p18<=0] | [[p21<=p50 & p10<=p25] | EX [1<=p47]]]] | ~ [[E [p36<=p46 U p3<=0] | [p13<=1 | p48<=p4]]]]]] U AG [E [p36<=0 U 1<=p8]]]
normalized: E [[p17<=p15 & ~ [[~ [[[p13<=1 | p48<=p4] | E [p36<=p46 U p3<=0]]] | ~ [[[EX [1<=p47] | [p21<=p50 & p10<=p25]] | [~ [EG [~ [p18<=0]]] & ~ [E [~ [p18<=0] U [~ [p2<=p8] & ~ [p18<=0]]]]]]]]]] U ~ [E [true U ~ [E [p36<=0 U 1<=p8]]]]]

abstracting: (1<=p8)
states: 361,499,225 (8)
abstracting: (p36<=0)
states: 660,348,393 (8)
abstracting: (p18<=0)
states: 660,348,393 (8)
abstracting: (p2<=p8)
states: 678,365,601 (8)
abstracting: (p18<=0)
states: 660,348,393 (8)
abstracting: (p18<=0)
states: 660,348,393 (8)
............
EG iterations: 12
abstracting: (p10<=p25)
states: 749,521,251 (8)
abstracting: (p21<=p50)
states: 860,763,314 (8)
abstracting: (1<=p47)
states: 660,348,393 (8)
.abstracting: (p3<=0)
states: 578,596,924 (8)
abstracting: (p36<=p46)
states: 860,761,795 (8)
abstracting: (p48<=p4)
states: 539,198,254 (8)
abstracting: (p13<=1)
states: 241,697,013 (8)
abstracting: (p17<=p15)
states: 919,806,607 (8)
-> the formula is TRUE

FORMULA TriangularGrid-PT-2011-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.288sec

totally nodes used: 4308418 (4.3e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 16858205 18287612 35145817
used/not used/entry size/cache size: 19030569 48078295 16 1024MB
basic ops cache: hits/miss/sum: 3620146 4118721 7738867
used/not used/entry size/cache size: 5446741 11330475 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: 28243 30682 58925
used/not used/entry size/cache size: 30640 8357968 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 63168444
1 3665787
2 238092
3 23953
4 4864
5 2155
6 1346
7 968
8 622
9 425
>= 10 2208

Total processing time: 0m13.092sec


BK_STOP 1679326332542

--------------------
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:2962 (70), effective:503 (11)

initing FirstDep: 0m 0.000sec


iterations count:454 (10), effective:67 (1)

iterations count:5656 (134), effective:981 (23)

iterations count:369 (8), effective:49 (1)

iterations count:846 (20), effective:116 (2)

iterations count:106 (2), effective:11 (0)

iterations count:377 (8), effective:53 (1)

iterations count:391 (9), effective:56 (1)

iterations count:1772 (42), effective:272 (6)

iterations count:280 (6), effective:33 (0)

iterations count:608 (14), effective:100 (2)

iterations count:280 (6), effective:33 (0)

iterations count:608 (14), effective:100 (2)

iterations count:839 (19), effective:118 (2)

iterations count:280 (6), effective:33 (0)

iterations count:608 (14), effective:100 (2)

iterations count:487 (11), effective:69 (1)

iterations count:1483 (35), effective:236 (5)

iterations count:164 (3), effective:23 (0)

iterations count:194 (4), effective:27 (0)

iterations count:4344 (103), effective:677 (16)

iterations count:1344 (32), effective:196 (4)

iterations count:345 (8), effective:44 (1)

iterations count:3703 (88), effective:575 (13)

iterations count:735 (17), effective:115 (2)

iterations count:1985 (47), effective:334 (7)

iterations count:5966 (142), effective:996 (23)

iterations count:418 (9), effective:67 (1)

iterations count:344 (8), effective:44 (1)

iterations count:275 (6), effective:34 (0)

iterations count:5146 (122), effective:824 (19)

iterations count:4079 (97), effective:729 (17)

iterations count:121 (2), effective:11 (0)

iterations count:160 (3), effective:24 (0)

iterations count:150 (3), effective:15 (0)

iterations count:9503 (226), effective:1725 (41)

iterations count:3526 (83), effective:546 (13)

iterations count:5381 (128), effective:946 (22)

iterations count:428 (10), effective:66 (1)

iterations count:1917 (45), effective:289 (6)

iterations count:230 (5), effective:32 (0)

iterations count:3361 (80), effective:583 (13)

iterations count:414 (9), effective:67 (1)

iterations count:505 (12), effective:69 (1)

iterations count:6462 (153), effective:1110 (26)

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="TriangularGrid-PT-2011"
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 TriangularGrid-PT-2011, 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-167912709000721"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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