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

About the Execution of Marcie+red for SieveSingleMsgMbox-PT-d0m64

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
7880.607 330880.00 345564.00 167.10 TFFTTFTTFTFFTFTF normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r426-tajo-167905978900385.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
......................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is SieveSingleMsgMbox-PT-d0m64, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905978900385
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 6.0K Feb 26 10:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K Feb 26 10:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 26 10:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 10:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 10:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 10:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Feb 26 10:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 10:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 57K 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 SieveSingleMsgMbox-PT-d0m64-CTLCardinality-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-CTLCardinality-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-CTLCardinality-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-CTLCardinality-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-CTLCardinality-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-CTLCardinality-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-CTLCardinality-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-CTLCardinality-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-CTLCardinality-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-CTLCardinality-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-CTLCardinality-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-CTLCardinality-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-CTLCardinality-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-CTLCardinality-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-CTLCardinality-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m64-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679351313015

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=SieveSingleMsgMbox-PT-d0m64
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-20 22:28:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-20 22:28:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-20 22:28:35] [INFO ] Load time of PNML (sax parser for PT used): 53 ms
[2023-03-20 22:28:35] [INFO ] Transformed 262 places.
[2023-03-20 22:28:35] [INFO ] Transformed 73 transitions.
[2023-03-20 22:28:35] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 149 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 13 ms.
Deduced a syphon composed of 190 places in 1 ms
Reduce places removed 190 places and 0 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA SieveSingleMsgMbox-PT-d0m64-CTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m64-CTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m64-CTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m64-CTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m64-CTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m64-CTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m64-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m64-CTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m64-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m64-CTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 10 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 73/73 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 70 transition count 73
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 8 place count 64 transition count 67
Iterating global reduction 1 with 6 rules applied. Total rules applied 14 place count 64 transition count 67
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 63 transition count 66
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 63 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 62 transition count 65
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 62 transition count 65
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 19 place count 62 transition count 64
Applied a total of 19 rules in 29 ms. Remains 62 /72 variables (removed 10) and now considering 64/73 (removed 9) transitions.
// Phase 1: matrix 64 rows 62 cols
[2023-03-20 22:28:35] [INFO ] Computed 5 place invariants in 5 ms
[2023-03-20 22:28:36] [INFO ] Implicit Places using invariants in 384 ms returned []
[2023-03-20 22:28:36] [INFO ] Invariant cache hit.
[2023-03-20 22:28:36] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-20 22:28:36] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
[2023-03-20 22:28:36] [INFO ] Invariant cache hit.
[2023-03-20 22:28:36] [INFO ] Dead Transitions using invariants and state equation in 69 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 62/72 places, 64/73 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 690 ms. Remains : 62/72 places, 64/73 transitions.
Support contains 10 out of 62 places after structural reductions.
[2023-03-20 22:28:36] [INFO ] Flatten gal took : 35 ms
[2023-03-20 22:28:36] [INFO ] Flatten gal took : 10 ms
[2023-03-20 22:28:36] [INFO ] Input system was already deterministic with 64 transitions.
Support contains 8 out of 62 places (down from 10) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2234 resets, run finished after 515 ms. (steps per millisecond=19 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 1039 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 1004 resets, run finished after 68 ms. (steps per millisecond=147 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 1009 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 1018 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 1056 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 944 resets, run finished after 197 ms. (steps per millisecond=50 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 195724 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 195724 steps, saw 100198 distinct states, run finished after 3002 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 6 properties.
[2023-03-20 22:28:41] [INFO ] Invariant cache hit.
[2023-03-20 22:28:41] [INFO ] [Real]Absence check using 2 positive place invariants in 6 ms returned sat
[2023-03-20 22:28:41] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 22:28:41] [INFO ] After 44ms SMT Verify possible using state equation in real domain returned unsat :5 sat :1
[2023-03-20 22:28:41] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-20 22:28:41] [INFO ] After 7ms SMT Verify possible using 27 Read/Feed constraints in real domain returned unsat :5 sat :0 real:1
[2023-03-20 22:28:41] [INFO ] After 215ms SMT Verify possible using all constraints in real domain returned unsat :5 sat :0 real:1
[2023-03-20 22:28:41] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-20 22:28:41] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 3 ms returned sat
[2023-03-20 22:28:41] [INFO ] After 34ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :1
[2023-03-20 22:28:41] [INFO ] After 17ms SMT Verify possible using 27 Read/Feed constraints in natural domain returned unsat :5 sat :1
[2023-03-20 22:28:41] [INFO ] After 50ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-20 22:28:41] [INFO ] After 176ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :1
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 1 out of 62 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 62/62 places, 64/64 transitions.
Graph (complete) has 167 edges and 62 vertex of which 61 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 61 transition count 62
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 59 transition count 60
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 59 transition count 60
Applied a total of 7 rules in 10 ms. Remains 59 /62 variables (removed 3) and now considering 60/64 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 59/62 places, 60/64 transitions.
Incomplete random walk after 10000 steps, including 2286 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 966 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 2362180 steps, run timeout after 3001 ms. (steps per millisecond=787 ) properties seen :{}
Probabilistic random walk after 2362180 steps, saw 1192393 distinct states, run finished after 3001 ms. (steps per millisecond=787 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 60 rows 59 cols
[2023-03-20 22:28:44] [INFO ] Computed 4 place invariants in 16 ms
[2023-03-20 22:28:44] [INFO ] [Real]Absence check using 3 positive place invariants in 9 ms returned sat
[2023-03-20 22:28:44] [INFO ] [Real]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 22:28:44] [INFO ] After 32ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 22:28:44] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-20 22:28:44] [INFO ] After 10ms SMT Verify possible using 24 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 22:28:44] [INFO ] After 117ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-20 22:28:44] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 22:28:44] [INFO ] [Nat]Absence check using 3 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-20 22:28:44] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-20 22:28:44] [INFO ] After 9ms SMT Verify possible using 24 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-20 22:28:44] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-20 22:28:44] [INFO ] After 100ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 60/60 transitions.
Applied a total of 0 rules in 5 ms. Remains 59 /59 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 59/59 places, 60/60 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 60/60 transitions.
Applied a total of 0 rules in 5 ms. Remains 59 /59 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2023-03-20 22:28:44] [INFO ] Invariant cache hit.
[2023-03-20 22:28:44] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-20 22:28:45] [INFO ] Invariant cache hit.
[2023-03-20 22:28:45] [INFO ] State equation strengthened by 24 read => feed constraints.
[2023-03-20 22:28:45] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2023-03-20 22:28:45] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-20 22:28:45] [INFO ] Invariant cache hit.
[2023-03-20 22:28:45] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 314 ms. Remains : 59/59 places, 60/60 transitions.
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 rules applied. Total rules applied 3 place count 59 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 58 transition count 57
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 4 place count 58 transition count 47
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 24 place count 48 transition count 47
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 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 28 place count 46 transition count 45
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 34 place count 43 transition count 45
Applied a total of 34 rules in 21 ms. Remains 43 /59 variables (removed 16) and now considering 45/60 (removed 15) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 45 rows 43 cols
[2023-03-20 22:28:45] [INFO ] Computed 6 place invariants in 3 ms
[2023-03-20 22:28:45] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-20 22:28:45] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-20 22:28:45] [INFO ] After 29ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-20 22:28:45] [INFO ] After 35ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2023-03-20 22:28:45] [INFO ] After 110ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Successfully simplified 5 atomic propositions for a total of 5 simplifications.
FORMULA SieveSingleMsgMbox-PT-d0m64-CTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m64-CTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 22:28:45] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-20 22:28:45] [INFO ] Flatten gal took : 7 ms
FORMULA SieveSingleMsgMbox-PT-d0m64-CTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-20 22:28:45] [INFO ] Flatten gal took : 19 ms
[2023-03-20 22:28:45] [INFO ] Input system was already deterministic with 64 transitions.
Computed a total of 8 stabilizing places and 11 stable transitions
Graph (complete) has 190 edges and 62 vertex of which 61 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 62/62 places, 64/64 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 60 transition count 62
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 60 transition count 62
Applied a total of 4 rules in 9 ms. Remains 60 /62 variables (removed 2) and now considering 62/64 (removed 2) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 60/62 places, 62/64 transitions.
[2023-03-20 22:28:45] [INFO ] Flatten gal took : 5 ms
[2023-03-20 22:28:45] [INFO ] Flatten gal took : 6 ms
[2023-03-20 22:28:45] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 64/64 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 59 transition count 61
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 59 transition count 61
Applied a total of 6 rules in 11 ms. Remains 59 /62 variables (removed 3) and now considering 61/64 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11 ms. Remains : 59/62 places, 61/64 transitions.
[2023-03-20 22:28:45] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:28:45] [INFO ] Flatten gal took : 18 ms
[2023-03-20 22:28:45] [INFO ] Input system was already deterministic with 61 transitions.
Starting structural reductions in LTL mode, iteration 0 : 62/62 places, 64/64 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 59 transition count 61
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 59 transition count 61
Applied a total of 6 rules in 18 ms. Remains 59 /62 variables (removed 3) and now considering 61/64 (removed 3) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 59/62 places, 61/64 transitions.
[2023-03-20 22:28:45] [INFO ] Flatten gal took : 3 ms
[2023-03-20 22:28:45] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:28:45] [INFO ] Input system was already deterministic with 61 transitions.
[2023-03-20 22:28:45] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:28:45] [INFO ] Flatten gal took : 4 ms
[2023-03-20 22:28:45] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2023-03-20 22:28:45] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 62 places, 64 transitions and 253 arcs took 1 ms.
Total runtime 10063 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: 62 NrTr: 64 NrArc: 253)

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

net check time: 0m 0.000sec

init dd package: 0m 3.303sec


RS generation: 4m46.768sec


-> reachability set: #nodes 103934 (1.0e+05) #states 1,172,124,894,009 (12)



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

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

abstracting: (0<=0)
states: 1,172,124,894,009 (12)
.-> the formula is TRUE

FORMULA SieveSingleMsgMbox-PT-d0m64-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m18.060sec

checking: AF [EX [0<=0]]
normalized: ~ [EG [~ [EX [0<=0]]]]

abstracting: (0<=0)
states: 1,172,124,894,009 (12)
..
EG iterations: 1
-> the formula is TRUE

FORMULA SieveSingleMsgMbox-PT-d0m64-CTLCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 5.082sec

checking: EG [~ [14<=p39]]
normalized: EG [~ [14<=p39]]

abstracting: (14<=p39)
states: 206,625,795,796 (11)
.
EG iterations: 1
-> the formula is TRUE

FORMULA SieveSingleMsgMbox-PT-d0m64-CTLCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.229sec

totally nodes used: 9049891 (9.0e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 3538798205 340472917 3879271122
used/not used/entry size/cache size: 66428522 680342 16 1024MB
basic ops cache: hits/miss/sum: 7688901 542142 8231043
used/not used/entry size/cache size: 901439 15875777 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: 1429029 104996 1534025
used/not used/entry size/cache size: 104270 8284338 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 59568389
1 6701841
2 712317
3 65820
4 13675
5 1986
6 5842
7 5092
8 7425
9 10576
>= 10 15901

Total processing time: 5m17.659sec


BK_STOP 1679351643895

--------------------
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

19252 119861 178609 92945
iterations count:404253 (6316), effective:13034 (203)

initing FirstDep: 0m 0.000sec

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="SieveSingleMsgMbox-PT-d0m64"
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 SieveSingleMsgMbox-PT-d0m64, 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 r426-tajo-167905978900385"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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