fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r170-tall-167838856800153
Last Updated
May 14, 2023

About the Execution of Marcie+red for Eratosthenes-PT-050

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
5449.184 8811.00 12874.00 410.10 TTTFFTFFFTTTFFTT normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r170-tall-167838856800153.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 Eratosthenes-PT-050, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838856800153
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 496K
-rw-r--r-- 1 mcc users 5.6K Feb 25 11:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Feb 25 11:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Feb 25 11:52 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 25 11:52 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 16:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 11:55 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Feb 25 11:55 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 11:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 25 11:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 16:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 50K 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 Eratosthenes-PT-050-CTLCardinality-00
FORMULA_NAME Eratosthenes-PT-050-CTLCardinality-01
FORMULA_NAME Eratosthenes-PT-050-CTLCardinality-02
FORMULA_NAME Eratosthenes-PT-050-CTLCardinality-03
FORMULA_NAME Eratosthenes-PT-050-CTLCardinality-04
FORMULA_NAME Eratosthenes-PT-050-CTLCardinality-05
FORMULA_NAME Eratosthenes-PT-050-CTLCardinality-06
FORMULA_NAME Eratosthenes-PT-050-CTLCardinality-07
FORMULA_NAME Eratosthenes-PT-050-CTLCardinality-08
FORMULA_NAME Eratosthenes-PT-050-CTLCardinality-09
FORMULA_NAME Eratosthenes-PT-050-CTLCardinality-10
FORMULA_NAME Eratosthenes-PT-050-CTLCardinality-11
FORMULA_NAME Eratosthenes-PT-050-CTLCardinality-12
FORMULA_NAME Eratosthenes-PT-050-CTLCardinality-13
FORMULA_NAME Eratosthenes-PT-050-CTLCardinality-14
FORMULA_NAME Eratosthenes-PT-050-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678493458986

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=Eratosthenes-PT-050
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 00:11:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 00:11:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 00:11:00] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2023-03-11 00:11:00] [INFO ] Transformed 49 places.
[2023-03-11 00:11:00] [INFO ] Transformed 108 transitions.
[2023-03-11 00:11:00] [INFO ] Parsed PT model containing 49 places and 108 transitions and 324 arcs in 104 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 10 ms.
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 28 transitions
Reduce redundant transitions removed 28 transitions.
FORMULA Eratosthenes-PT-050-CTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 80/80 transitions.
Drop transitions removed 46 transitions
Redundant transition composition rules discarded 46 transitions
Iterating global reduction 0 with 46 rules applied. Total rules applied 46 place count 34 transition count 34
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 29 transition count 29
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 29 transition count 29
Applied a total of 56 rules in 13 ms. Remains 29 /34 variables (removed 5) and now considering 29/80 (removed 51) transitions.
// Phase 1: matrix 29 rows 29 cols
[2023-03-11 00:11:00] [INFO ] Computed 0 place invariants in 5 ms
[2023-03-11 00:11:00] [INFO ] Implicit Places using invariants in 121 ms returned []
[2023-03-11 00:11:00] [INFO ] Invariant cache hit.
[2023-03-11 00:11:00] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2023-03-11 00:11:00] [INFO ] Invariant cache hit.
[2023-03-11 00:11:01] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 29/34 places, 29/80 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 264 ms. Remains : 29/34 places, 29/80 transitions.
Support contains 28 out of 29 places after structural reductions.
[2023-03-11 00:11:01] [INFO ] Flatten gal took : 17 ms
[2023-03-11 00:11:01] [INFO ] Flatten gal took : 4 ms
[2023-03-11 00:11:01] [INFO ] Input system was already deterministic with 29 transitions.
Support contains 26 out of 29 places (down from 28) after GAL structural reductions.
Incomplete random walk after 10003 steps, including 277 resets, run finished after 479 ms. (steps per millisecond=20 ) properties (out of 36) seen :23
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10000 steps, including 19 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 13) seen :0
Running SMT prover for 13 properties.
[2023-03-11 00:11:02] [INFO ] Invariant cache hit.
[2023-03-11 00:11:02] [INFO ] After 91ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:9
[2023-03-11 00:11:02] [INFO ] After 81ms SMT Verify possible using all constraints in natural domain returned unsat :13 sat :0
Fused 13 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 13 atomic propositions for a total of 15 simplifications.
FORMULA Eratosthenes-PT-050-CTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-050-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 00:11:02] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
[2023-03-11 00:11:02] [INFO ] Flatten gal took : 3 ms
FORMULA Eratosthenes-PT-050-CTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-050-CTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-050-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-11 00:11:02] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:11:02] [INFO ] Input system was already deterministic with 29 transitions.
Support contains 16 out of 29 places (down from 20) after GAL structural reductions.
Computed a total of 29 stabilizing places and 29 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 29 transition count 29
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
AF dead knowledge conclusive for 2 formulas.
FORMULA Eratosthenes-PT-050-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Eratosthenes-PT-050-CTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 29/29 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 2 transition count 2
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 2 transition count 2
Applied a total of 54 rules in 1 ms. Remains 2 /29 variables (removed 27) and now considering 2/29 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 2/29 places, 2/29 transitions.
[2023-03-11 00:11:02] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:11:02] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:11:02] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 29/29 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 4 transition count 4
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 4 transition count 4
Applied a total of 50 rules in 1 ms. Remains 4 /29 variables (removed 25) and now considering 4/29 (removed 25) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 4/29 places, 4/29 transitions.
[2023-03-11 00:11:02] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:11:02] [INFO ] Flatten gal took : 1 ms
[2023-03-11 00:11:02] [INFO ] Input system was already deterministic with 4 transitions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 29/29 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 3 transition count 3
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 3 transition count 3
Applied a total of 52 rules in 1 ms. Remains 3 /29 variables (removed 26) and now considering 3/29 (removed 26) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 3/29 places, 3/29 transitions.
[2023-03-11 00:11:02] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:11:02] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:11:02] [INFO ] Input system was already deterministic with 3 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 29/29 places, 29/29 transitions.
Graph (complete) has 0 edges and 29 vertex of which 2 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.1 ms
Discarding 27 places :
Also discarding 27 output transitions
Drop transitions removed 27 transitions
Applied a total of 1 rules in 4 ms. Remains 2 /29 variables (removed 27) and now considering 2/29 (removed 27) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 2/29 places, 2/29 transitions.
[2023-03-11 00:11:02] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:11:02] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:11:02] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 29/29 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 5 transition count 5
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 5 transition count 5
Applied a total of 48 rules in 1 ms. Remains 5 /29 variables (removed 24) and now considering 5/29 (removed 24) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 5/29 places, 5/29 transitions.
[2023-03-11 00:11:02] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:11:02] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:11:02] [INFO ] Input system was already deterministic with 5 transitions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 29/29 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 2 transition count 2
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 2 transition count 2
Applied a total of 54 rules in 1 ms. Remains 2 /29 variables (removed 27) and now considering 2/29 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 2/29 places, 2/29 transitions.
[2023-03-11 00:11:02] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:11:02] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:11:02] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in LTL mode, iteration 0 : 29/29 places, 29/29 transitions.
Discarding 27 places :
Symmetric choice reduction at 0 with 27 rule applications. Total rules 27 place count 2 transition count 2
Iterating global reduction 0 with 27 rules applied. Total rules applied 54 place count 2 transition count 2
Applied a total of 54 rules in 1 ms. Remains 2 /29 variables (removed 27) and now considering 2/29 (removed 27) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 2/29 places, 2/29 transitions.
[2023-03-11 00:11:02] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:11:02] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:11:02] [INFO ] Input system was already deterministic with 2 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 29/29 places, 29/29 transitions.
Graph (complete) has 0 edges and 29 vertex of which 3 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.0 ms
Discarding 26 places :
Also discarding 26 output transitions
Drop transitions removed 26 transitions
Applied a total of 1 rules in 1 ms. Remains 3 /29 variables (removed 26) and now considering 3/29 (removed 26) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 1 ms. Remains : 3/29 places, 3/29 transitions.
[2023-03-11 00:11:02] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:11:02] [INFO ] Flatten gal took : 0 ms
[2023-03-11 00:11:02] [INFO ] Input system was already deterministic with 3 transitions.
[2023-03-11 00:11:02] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:11:02] [INFO ] Flatten gal took : 2 ms
[2023-03-11 00:11:02] [INFO ] Export to MCC of 8 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-11 00:11:02] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 29 places, 29 transitions and 29 arcs took 1 ms.
Total runtime 1797 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: 29 NrTr: 29 NrArc: 29)

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

net check time: 0m 0.000sec

init dd package: 0m 2.706sec


RS generation: 0m 0.000sec


-> reachability set: #nodes 29 (2.9e+01) #states 1,879,048,192 (9)



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

checking: AG [EF [[1<=p13 & EX [0<=0]]]]
normalized: ~ [E [true U ~ [E [true U [EX [0<=0] & 1<=p13]]]]]

abstracting: (1<=p13)
states: 939,524,096 (8)
abstracting: (0<=0)
states: 1,879,048,192 (9)
.-> the formula is FALSE

FORMULA Eratosthenes-PT-050-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

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

abstracting: (1<=0)
states: 0
.abstracting: (1<=p10)
states: 939,524,096 (8)
....................................
EG iterations: 35
-> the formula is TRUE

FORMULA Eratosthenes-PT-050-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.028sec

checking: EG [[~ [p24<=0] & AX [1<=0]]]
normalized: EG [[~ [EX [~ [1<=0]]] & ~ [p24<=0]]]

abstracting: (p24<=0)
states: 939,524,096 (8)
abstracting: (1<=0)
states: 0
..
EG iterations: 1
-> the formula is FALSE

FORMULA Eratosthenes-PT-050-CTLCardinality-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AG [AF [EX [[~ [1<=p1] | ~ [p17<=1]]]]]
normalized: ~ [E [true U EG [~ [EX [[~ [p17<=1] | ~ [1<=p1]]]]]]]

abstracting: (1<=p1)
states: 939,524,096 (8)
abstracting: (p17<=1)
states: 1,879,048,192 (9)
..
EG iterations: 1
-> the formula is FALSE

FORMULA Eratosthenes-PT-050-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.001sec

checking: EF [AG [~ [p27<=p7]]]
normalized: E [true U ~ [E [true U p27<=p7]]]

abstracting: (p27<=p7)
states: 1,409,286,144 (9)
-> the formula is FALSE

FORMULA Eratosthenes-PT-050-CTLCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [AG [[~ [p26<=p6] | ~ [1<=p22]]]]
normalized: E [true U ~ [E [true U ~ [[~ [1<=p22] | ~ [p26<=p6]]]]]]

abstracting: (p26<=p6)
states: 1,409,286,144 (9)
abstracting: (1<=p22)
states: 939,524,096 (8)
-> the formula is TRUE

FORMULA Eratosthenes-PT-050-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: AX [~ [A [[~ [EX [p16<=p27]] | AX [1<=p27]] U EG [A [1<=p2 U 1<=p2]]]]]
normalized: ~ [EX [[~ [EG [~ [EG [[~ [EG [~ [1<=p2]]] & ~ [E [~ [1<=p2] U [~ [1<=p2] & ~ [1<=p2]]]]]]]]] & ~ [E [~ [EG [[~ [EG [~ [1<=p2]]] & ~ [E [~ [1<=p2] U [~ [1<=p2] & ~ [1<=p2]]]]]]] U [~ [[~ [EX [~ [1<=p27]]] | ~ [EX [p16<=p27]]]] & ~ [EG [[~ [EG [~ [1<=p2]]] & ~ [E [~ [1<=p2] U [~ [1<=p2] & ~ [1<=p2]]]]]]]]]]]]]

abstracting: (1<=p2)
states: 939,524,096 (8)
abstracting: (1<=p2)
states: 939,524,096 (8)
abstracting: (1<=p2)
states: 939,524,096 (8)
abstracting: (1<=p2)
states: 939,524,096 (8)
.
EG iterations: 1
...................................
EG iterations: 35
abstracting: (p16<=p27)
states: 1,409,286,144 (9)
.abstracting: (1<=p27)
states: 939,524,096 (8)
.abstracting: (1<=p2)
states: 939,524,096 (8)
abstracting: (1<=p2)
states: 939,524,096 (8)
abstracting: (1<=p2)
states: 939,524,096 (8)
abstracting: (1<=p2)
states: 939,524,096 (8)
.
EG iterations: 1
...................................
EG iterations: 35
abstracting: (1<=p2)
states: 939,524,096 (8)
abstracting: (1<=p2)
states: 939,524,096 (8)
abstracting: (1<=p2)
states: 939,524,096 (8)
abstracting: (1<=p2)
states: 939,524,096 (8)
.
EG iterations: 1
...................................
EG iterations: 35

EG iterations: 0
.-> the formula is TRUE

FORMULA Eratosthenes-PT-050-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.010sec

checking: [AX [E [1<=p7 U AX [1<=p0]]] | E [p21<=p7 U AF [~ [EF [1<=p8]]]]]
normalized: [E [p21<=p7 U ~ [EG [E [true U 1<=p8]]]] | ~ [EX [~ [E [1<=p7 U ~ [EX [~ [1<=p0]]]]]]]]

abstracting: (1<=p0)
states: 939,524,096 (8)
.abstracting: (1<=p7)
states: 939,524,096 (8)
.abstracting: (1<=p8)
states: 939,524,096 (8)
...................................
EG iterations: 35
abstracting: (p21<=p7)
states: 1,409,286,144 (9)
-> the formula is TRUE

FORMULA Eratosthenes-PT-050-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.006sec

totally nodes used: 42866 (4.3e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 32750 40463 73213
used/not used/entry size/cache size: 78788 67030076 16 1024MB
basic ops cache: hits/miss/sum: 8152 13324 21476
used/not used/entry size/cache size: 26033 16751183 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: 30 251 281
used/not used/entry size/cache size: 251 8388357 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 67066521
1 41877
2 418
3 45
4 1
5 0
6 1
7 0
8 1
9 0
>= 10 0

Total processing time: 0m 4.295sec


BK_STOP 1678493467797

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
++ perl -pe 's/.*\.//g'
+ 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:63 (2), effective:34 (1)

initing FirstDep: 0m 0.000sec


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

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

iterations count:63 (2), effective:34 (1)

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

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

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

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

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

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

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

iterations count:51 (1), effective:22 (0)

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

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

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Eratosthenes-PT-050"
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 Eratosthenes-PT-050, 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 r170-tall-167838856800153"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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