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

About the Execution of Marcie+red for GPPP-PT-C0010N0000000010

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
9006.768 88110.00 87967.00 5868.20 TFTTFFTTTTTTFTFF 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-167838857800817.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 GPPP-PT-C0010N0000000010, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857800817
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 500K
-rw-r--r-- 1 mcc users 7.1K Feb 26 10:42 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Feb 26 10:42 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Feb 26 10:40 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Feb 26 10:40 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Feb 25 16:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 10:43 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 117K Feb 26 10:43 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:43 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Feb 26 10:43 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1 Mar 5 18:22 large_marking
-rw-r--r-- 1 mcc users 21K 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 GPPP-PT-C0010N0000000010-CTLCardinality-00
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLCardinality-01
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLCardinality-02
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLCardinality-03
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLCardinality-04
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLCardinality-05
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLCardinality-06
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLCardinality-07
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLCardinality-08
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLCardinality-09
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLCardinality-10
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLCardinality-11
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLCardinality-12
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLCardinality-13
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLCardinality-14
FORMULA_NAME GPPP-PT-C0010N0000000010-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678642049268

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=GPPP-PT-C0010N0000000010
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 17:27:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-12 17:27:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 17:27:30] [INFO ] Load time of PNML (sax parser for PT used): 23 ms
[2023-03-12 17:27:30] [INFO ] Transformed 33 places.
[2023-03-12 17:27:30] [INFO ] Transformed 22 transitions.
[2023-03-12 17:27:30] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 78 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 11 ms.
Initial state reduction rules removed 1 formulas.
FORMULA GPPP-PT-C0010N0000000010-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 33 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 8 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 17:27:30] [INFO ] Computed 12 place invariants in 11 ms
[2023-03-12 17:27:30] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
[2023-03-12 17:27:30] [INFO ] Invariant cache hit.
[2023-03-12 17:27:30] [INFO ] Implicit Places using invariants in 27 ms returned []
[2023-03-12 17:27:30] [INFO ] Invariant cache hit.
[2023-03-12 17:27:31] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 61 ms to find 0 implicit places.
[2023-03-12 17:27:31] [INFO ] Invariant cache hit.
[2023-03-12 17:27:31] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 288 ms. Remains : 33/33 places, 22/22 transitions.
Support contains 33 out of 33 places after structural reductions.
[2023-03-12 17:27:31] [INFO ] Flatten gal took : 18 ms
[2023-03-12 17:27:31] [INFO ] Flatten gal took : 6 ms
[2023-03-12 17:27:31] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 10000 steps, including 23 resets, run finished after 199 ms. (steps per millisecond=50 ) properties (out of 86) seen :44
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 42) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 42) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 41) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 41) seen :0
Running SMT prover for 41 properties.
[2023-03-12 17:27:32] [INFO ] Invariant cache hit.
[2023-03-12 17:27:32] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2023-03-12 17:27:32] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2023-03-12 17:27:32] [INFO ] After 96ms SMT Verify possible using all constraints in real domain returned unsat :4 sat :0 real:37
[2023-03-12 17:27:32] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2023-03-12 17:27:32] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 5 ms returned sat
[2023-03-12 17:27:35] [INFO ] After 32ms SMT Verify possible using state equation in natural domain returned unsat :40 sat :1
[2023-03-12 17:27:35] [INFO ] After 42ms SMT Verify possible using trap constraints in natural domain returned unsat :40 sat :1
Attempting to minimize the solution found.
Minimization took 7 ms.
[2023-03-12 17:27:35] [INFO ] After 3091ms SMT Verify possible using all constraints in natural domain returned unsat :40 sat :1
Fused 41 Parikh solutions to 1 different solutions.
Finished Parikh walk after 176 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=88 )
Parikh walk visited 1 properties in 2 ms.
Successfully simplified 40 atomic propositions for a total of 15 simplifications.
FORMULA GPPP-PT-C0010N0000000010-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000010-CTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000010-CTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000010-CTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 17:27:35] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-12 17:27:35] [INFO ] Flatten gal took : 5 ms
FORMULA GPPP-PT-C0010N0000000010-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-12 17:27:35] [INFO ] Flatten gal took : 3 ms
[2023-03-12 17:27:35] [INFO ] Input system was already deterministic with 22 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 17:27:35] [INFO ] Invariant cache hit.
[2023-03-12 17:27:35] [INFO ] Dead Transitions using invariants and state equation in 31 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 17:27:35] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:27:35] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:27:35] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 17:27:35] [INFO ] Invariant cache hit.
[2023-03-12 17:27:35] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 17:27:35] [INFO ] Flatten gal took : 3 ms
[2023-03-12 17:27:35] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:27:35] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 17:27:35] [INFO ] Invariant cache hit.
[2023-03-12 17:27:35] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 17:27:35] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:27:35] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:27:35] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 20
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 20
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 19
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 19
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 25 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 24 transition count 15
Applied a total of 15 rules in 13 ms. Remains 24 /33 variables (removed 9) and now considering 15/22 (removed 7) transitions.
// Phase 1: matrix 15 rows 24 cols
[2023-03-12 17:27:35] [INFO ] Computed 10 place invariants in 4 ms
[2023-03-12 17:27:35] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 54 ms. Remains : 24/33 places, 15/22 transitions.
[2023-03-12 17:27:35] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:27:35] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:27:35] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 17:27:35] [INFO ] Computed 12 place invariants in 0 ms
[2023-03-12 17:27:35] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 17:27:35] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:27:35] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:27:35] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 17:27:35] [INFO ] Invariant cache hit.
[2023-03-12 17:27:35] [INFO ] Dead Transitions using invariants and state equation in 28 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 17:27:35] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:27:35] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:27:35] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 17:27:35] [INFO ] Invariant cache hit.
[2023-03-12 17:27:35] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 17:27:35] [INFO ] Flatten gal took : 1 ms
[2023-03-12 17:27:35] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:27:35] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 17:27:35] [INFO ] Invariant cache hit.
[2023-03-12 17:27:35] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 28 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 17:27:35] [INFO ] Flatten gal took : 1 ms
[2023-03-12 17:27:35] [INFO ] Flatten gal took : 5 ms
[2023-03-12 17:27:35] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 17:27:35] [INFO ] Invariant cache hit.
[2023-03-12 17:27:36] [INFO ] Dead Transitions using invariants and state equation in 26 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 26 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 17:27:36] [INFO ] Flatten gal took : 1 ms
[2023-03-12 17:27:36] [INFO ] Flatten gal took : 1 ms
[2023-03-12 17:27:36] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 17:27:36] [INFO ] Invariant cache hit.
[2023-03-12 17:27:36] [INFO ] Dead Transitions using invariants and state equation in 27 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 29 ms. Remains : 33/33 places, 22/22 transitions.
[2023-03-12 17:27:36] [INFO ] Flatten gal took : 1 ms
[2023-03-12 17:27:36] [INFO ] Flatten gal took : 1 ms
[2023-03-12 17:27:36] [INFO ] Input system was already deterministic with 22 transitions.
[2023-03-12 17:27:36] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:27:36] [INFO ] Flatten gal took : 1 ms
[2023-03-12 17:27:36] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-12 17:27:36] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 33 places, 22 transitions and 83 arcs took 0 ms.
Total runtime 5450 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: 33 NrTr: 22 NrArc: 83)

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

net check time: 0m 0.000sec

init dd package: 0m 2.710sec


RS generation: 0m 0.140sec


-> reachability set: #nodes 20770 (2.1e+04) #states 23,537,012,497 (10)



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

checking: EF [AX [1<=0]]
normalized: E [true U ~ [EX [~ [1<=0]]]]

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

FORMULA GPPP-PT-C0010N0000000010-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.296sec

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

abstracting: (0<=0)
states: 23,537,012,497 (10)
.-> the formula is TRUE

FORMULA GPPP-PT-C0010N0000000010-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.000sec

checking: EF [AG [EF [18<=p1]]]
normalized: E [true U ~ [E [true U ~ [E [true U 18<=p1]]]]]

abstracting: (18<=p1)
states: 2,323,815,934 (9)
-> the formula is FALSE

FORMULA GPPP-PT-C0010N0000000010-CTLCardinality-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.647sec

checking: AF [EX [[EG [~ [p7<=p23]] | [p2<=p32 | 39<=p26]]]]
normalized: ~ [EG [~ [EX [[[p2<=p32 | 39<=p26] | EG [~ [p7<=p23]]]]]]]

abstracting: (p7<=p23)
states: 2,785,050,553 (9)
.....................................................................................................................................................................
EG iterations: 165
abstracting: (39<=p26)
states: 7
abstracting: (p2<=p32)
states: 23,502,536,445 (10)
.........................................
EG iterations: 40
-> the formula is TRUE

FORMULA GPPP-PT-C0010N0000000010-CTLCardinality-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.062sec

checking: AF [AX [[AF [~ [p32<=42]] & [p27<=p7 | [8<=p31 & EX [~ [p15<=17]]]]]]]
normalized: ~ [EG [EX [~ [[[p27<=p7 | [8<=p31 & EX [~ [p15<=17]]]] & ~ [EG [p32<=42]]]]]]]

abstracting: (p32<=42)
states: 34,476,052 (7)
.
EG iterations: 1
abstracting: (p15<=17)
states: 22,153,336,570 (10)
.abstracting: (8<=p31)
states: 3,275,933,425 (9)
abstracting: (p27<=p7)
states: 12,024,338,044 (10)
.......................................................................................................................................................
EG iterations: 150
-> the formula is FALSE

FORMULA GPPP-PT-C0010N0000000010-CTLCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 4.888sec

checking: [[A [AF [p1<=p26] U [EF [1<=p21] & AF [p27<=p28]]] & EF [~ [p31<=9]]] | AX [1<=0]]
normalized: [~ [EX [~ [1<=0]]] | [E [true U ~ [p31<=9]] & [~ [EG [~ [[~ [EG [~ [p27<=p28]]] & E [true U 1<=p21]]]]] & ~ [E [~ [[~ [EG [~ [p27<=p28]]] & E [true U 1<=p21]]] U [EG [~ [p1<=p26]] & ~ [[~ [EG [~ [p27<=p28]]] & E [true U 1<=p21]]]]]]]]]

abstracting: (1<=p21)
states: 11,628,220,734 (10)
abstracting: (p27<=p28)
states: 15,186,199,600 (10)
.............................................................................................................................................................
EG iterations: 157
abstracting: (p1<=p26)
states: 4,519,730,562 (9)
..
EG iterations: 2
abstracting: (1<=p21)
states: 11,628,220,734 (10)
abstracting: (p27<=p28)
states: 15,186,199,600 (10)
.............................................................................................................................................................
EG iterations: 157
abstracting: (1<=p21)
states: 11,628,220,734 (10)
abstracting: (p27<=p28)
states: 15,186,199,600 (10)
.............................................................................................................................................................
EG iterations: 157
.
EG iterations: 1
abstracting: (p31<=9)
states: 23,139,475,131 (10)
abstracting: (1<=0)
states: 0
.-> the formula is TRUE

FORMULA GPPP-PT-C0010N0000000010-CTLCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.277sec

checking: EX [E [E [[p16<=p3 | [22<=p14 | [p32<=p17 & 35<=p28]]] U ~ [EG [p3<=p17]]] U p29<=9]]
normalized: EX [E [E [[p16<=p3 | [22<=p14 | [p32<=p17 & 35<=p28]]] U ~ [EG [p3<=p17]]] U p29<=9]]

abstracting: (p29<=9)
states: 15,891,637,194 (10)
abstracting: (p3<=p17)
states: 2,786,032,822 (9)
.
EG iterations: 1
abstracting: (35<=p28)
states: 0
abstracting: (p32<=p17)
states: 34,476,052 (7)
abstracting: (22<=p14)
states: 0
abstracting: (p16<=p3)
states: 23,210,557,465 (10)
.-> the formula is TRUE

FORMULA GPPP-PT-C0010N0000000010-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.035sec

checking: [[EX [[[EF [p9<=p23] | AF [AG [~ [p4<=p32]]]] & [EX [0<=0] & EF [15<=p15]]]] & AX [1<=0]] & [EX [AF [[AX [p22<=p24] & EX [p20<=p7]]]] & EX [0<=0]]]
normalized: [[EX [0<=0] & EX [~ [EG [~ [[EX [p20<=p7] & ~ [EX [~ [p22<=p24]]]]]]]]] & [~ [EX [~ [1<=0]]] & EX [[[E [true U 15<=p15] & EX [0<=0]] & [~ [EG [E [true U p4<=p32]]] | E [true U p9<=p23]]]]]]

abstracting: (p9<=p23)
states: 1,607,883,647 (9)
abstracting: (p4<=p32)
states: 23,503,998,131 (10)

EG iterations: 0
abstracting: (0<=0)
states: 23,537,012,497 (10)
.abstracting: (15<=p15)
states: 2,254,748,241 (9)
.abstracting: (1<=0)
states: 0
.abstracting: (p22<=p24)
states: 11,908,791,763 (10)
.abstracting: (p20<=p7)
states: 22,208,415,901 (10)
..................................................................................................................................................................
EG iterations: 161
.abstracting: (0<=0)
states: 23,537,012,497 (10)
.-> the formula is FALSE

FORMULA GPPP-PT-C0010N0000000010-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m10.145sec

checking: EX [[EF [~ [p20<=p9]] & [[~ [A [~ [p2<=p7] U AG [p12<=p28]]] | EG [p14<=p7]] & [EF [~ [40<=p31]] | 9<=p18]]]]
normalized: EX [[[[9<=p18 | E [true U ~ [40<=p31]]] & [EG [p14<=p7] | ~ [[~ [EG [E [true U ~ [p12<=p28]]]] & ~ [E [E [true U ~ [p12<=p28]] U [p2<=p7 & E [true U ~ [p12<=p28]]]]]]]]] & E [true U ~ [p20<=p9]]]]

abstracting: (p20<=p9)
states: 22,823,004,374 (10)
abstracting: (p12<=p28)
states: 23,055,860,518 (10)
abstracting: (p2<=p7)
states: 6,194,644,956 (9)
abstracting: (p12<=p28)
states: 23,055,860,518 (10)
abstracting: (p12<=p28)
states: 23,055,860,518 (10)
.
EG iterations: 1
abstracting: (p14<=p7)
states: 23,032,493,055 (10)
...........................................................
EG iterations: 59
abstracting: (40<=p31)
states: 34,476,052 (7)
abstracting: (9<=p18)
states: 506,583 (5)
.-> the formula is TRUE

FORMULA GPPP-PT-C0010N0000000010-CTLCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 3.021sec

checking: A [[EG [[p28<=p13 & EF [~ [p11<=p6]]]] | ~ [AF [[[31<=p4 & p27<=5] | p27<=3]]]] U ~ [AX [E [EX [p5<=p3] U ~ [[69<=p11 | p20<=p10]]]]]]
normalized: [~ [EG [~ [EX [~ [E [EX [p5<=p3] U ~ [[69<=p11 | p20<=p10]]]]]]]] & ~ [E [~ [EX [~ [E [EX [p5<=p3] U ~ [[69<=p11 | p20<=p10]]]]]] U [~ [EX [~ [E [EX [p5<=p3] U ~ [[69<=p11 | p20<=p10]]]]]] & ~ [[EG [~ [[p27<=3 | [31<=p4 & p27<=5]]]] | EG [[p28<=p13 & E [true U ~ [p11<=p6]]]]]]]]]]

abstracting: (p11<=p6)
states: 22,918,543,371 (10)
abstracting: (p28<=p13)
states: 668,092,236 (8)
.............................................................................................................
EG iterations: 109
abstracting: (p27<=5)
states: 10,602,113,119 (10)
abstracting: (31<=p4)
states: 0
abstracting: (p27<=3)
states: 7,816,664,950 (9)
.............................................................................................................................................................
EG iterations: 157
abstracting: (p20<=p10)
states: 12,836,339,461 (10)
abstracting: (69<=p11)
states: 0
abstracting: (p5<=p3)
states: 6,218,550,119 (9)
..abstracting: (p20<=p10)
states: 12,836,339,461 (10)
abstracting: (69<=p11)
states: 0
abstracting: (p5<=p3)
states: 6,218,550,119 (9)
..abstracting: (p20<=p10)
states: 12,836,339,461 (10)
abstracting: (69<=p11)
states: 0
abstracting: (p5<=p3)
states: 6,218,550,119 (9)
.................................................................................................................................................................
EG iterations: 159
-> the formula is TRUE

FORMULA GPPP-PT-C0010N0000000010-CTLCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m39.089sec

totally nodes used: 30225953 (3.0e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 109912495 62841332 172753827
used/not used/entry size/cache size: 49177977 17930887 16 1024MB
basic ops cache: hits/miss/sum: 40761378 22644677 63406055
used/not used/entry size/cache size: 15125575 1651641 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: 574500 316331 890831
used/not used/entry size/cache size: 310376 8078232 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 44439825
1 17783699
2 3985678
3 675463
4 112718
5 31046
6 18084
7 9148
8 5871
9 8988
>= 10 38344

Total processing time: 1m15.266sec


BK_STOP 1678642137378

--------------------
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:1541 (70), effective:367 (16)

initing FirstDep: 0m 0.000sec


iterations count:1636 (74), effective:399 (18)

iterations count:1078 (49), effective:225 (10)

iterations count:297 (13), effective:58 (2)

iterations count:629 (28), effective:121 (5)

iterations count:629 (28), effective:121 (5)

iterations count:156 (7), effective:33 (1)

iterations count:629 (28), effective:121 (5)

iterations count:986 (44), effective:195 (8)

iterations count:612 (27), effective:116 (5)

iterations count:346 (15), effective:72 (3)

iterations count:1118 (50), effective:239 (10)

iterations count:109 (4), effective:14 (0)

iterations count:177 (8), effective:34 (1)

iterations count:1111 (50), effective:217 (9)

iterations count:978 (44), effective:201 (9)

iterations count:978 (44), effective:201 (9)

iterations count:505 (22), effective:88 (4)

iterations count:978 (44), effective:201 (9)

iterations count:109 (4), effective:14 (0)

iterations count:1079 (49), effective:202 (9)

iterations count:1088 (49), effective:201 (9)

iterations count:1088 (49), effective:201 (9)

iterations count:3393 (154), effective:667 (30)

iterations count:1088 (49), effective:201 (9)

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="GPPP-PT-C0010N0000000010"
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 GPPP-PT-C0010N0000000010, 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-167838857800817"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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