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-167838857400521.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 FlexibleBarrier-PT-14a, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857400521
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 7.7K Feb 25 13:05 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K Feb 25 13:05 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 12:48 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 12:48 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 16:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 25 13:14 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Feb 25 13:14 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 25 13:09 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 36K Feb 25 13:09 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:07 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 169K 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 FlexibleBarrier-PT-14a-CTLCardinality-00
FORMULA_NAME FlexibleBarrier-PT-14a-CTLCardinality-01
FORMULA_NAME FlexibleBarrier-PT-14a-CTLCardinality-02
FORMULA_NAME FlexibleBarrier-PT-14a-CTLCardinality-03
FORMULA_NAME FlexibleBarrier-PT-14a-CTLCardinality-04
FORMULA_NAME FlexibleBarrier-PT-14a-CTLCardinality-05
FORMULA_NAME FlexibleBarrier-PT-14a-CTLCardinality-06
FORMULA_NAME FlexibleBarrier-PT-14a-CTLCardinality-07
FORMULA_NAME FlexibleBarrier-PT-14a-CTLCardinality-08
FORMULA_NAME FlexibleBarrier-PT-14a-CTLCardinality-09
FORMULA_NAME FlexibleBarrier-PT-14a-CTLCardinality-10
FORMULA_NAME FlexibleBarrier-PT-14a-CTLCardinality-11
FORMULA_NAME FlexibleBarrier-PT-14a-CTLCardinality-12
FORMULA_NAME FlexibleBarrier-PT-14a-CTLCardinality-13
FORMULA_NAME FlexibleBarrier-PT-14a-CTLCardinality-14
FORMULA_NAME FlexibleBarrier-PT-14a-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678561092930

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=FlexibleBarrier-PT-14a
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-11 18:58:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-11 18:58:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 18:58:14] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2023-03-11 18:58:14] [INFO ] Transformed 171 places.
[2023-03-11 18:58:14] [INFO ] Transformed 578 transitions.
[2023-03-11 18:58:14] [INFO ] Found NUPN structural information;
[2023-03-11 18:58:14] [INFO ] Parsed PT model containing 171 places and 578 transitions and 2719 arcs in 130 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 11 ms.
Initial state reduction rules removed 1 formulas.
Ensure Unique test removed 170 transitions
Reduce redundant transitions removed 170 transitions.
FORMULA FlexibleBarrier-PT-14a-CTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FlexibleBarrier-PT-14a-CTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 75 out of 171 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 408/408 transitions.
Drop transitions removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 0 with 14 rules applied. Total rules applied 14 place count 171 transition count 394
Applied a total of 14 rules in 20 ms. Remains 171 /171 variables (removed 0) and now considering 394/408 (removed 14) transitions.
// Phase 1: matrix 394 rows 171 cols
[2023-03-11 18:58:14] [INFO ] Computed 16 place invariants in 21 ms
[2023-03-11 18:58:14] [INFO ] Implicit Places using invariants in 218 ms returned []
[2023-03-11 18:58:14] [INFO ] Invariant cache hit.
[2023-03-11 18:58:14] [INFO ] State equation strengthened by 253 read => feed constraints.
[2023-03-11 18:58:15] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 476 ms to find 0 implicit places.
[2023-03-11 18:58:15] [INFO ] Invariant cache hit.
[2023-03-11 18:58:15] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 171/171 places, 394/408 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 683 ms. Remains : 171/171 places, 394/408 transitions.
Support contains 75 out of 171 places after structural reductions.
[2023-03-11 18:58:15] [INFO ] Flatten gal took : 49 ms
[2023-03-11 18:58:15] [INFO ] Flatten gal took : 28 ms
[2023-03-11 18:58:15] [INFO ] Input system was already deterministic with 394 transitions.
Support contains 71 out of 171 places (down from 75) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 169 ms. (steps per millisecond=59 ) properties (out of 48) seen :47
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-11 18:58:15] [INFO ] Invariant cache hit.
[2023-03-11 18:58:15] [INFO ] [Real]Absence check using 16 positive place invariants in 5 ms returned sat
[2023-03-11 18:58:15] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
[2023-03-11 18:58:15] [INFO ] Flatten gal took : 22 ms
[2023-03-11 18:58:15] [INFO ] Flatten gal took : 19 ms
[2023-03-11 18:58:15] [INFO ] Input system was already deterministic with 394 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 8 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 171/171 places, 394/394 transitions.
[2023-03-11 18:58:15] [INFO ] Flatten gal took : 15 ms
[2023-03-11 18:58:15] [INFO ] Flatten gal took : 16 ms
[2023-03-11 18:58:15] [INFO ] Input system was already deterministic with 394 transitions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 8 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 171/171 places, 394/394 transitions.
[2023-03-11 18:58:16] [INFO ] Flatten gal took : 15 ms
[2023-03-11 18:58:16] [INFO ] Flatten gal took : 15 ms
[2023-03-11 18:58:16] [INFO ] Input system was already deterministic with 394 transitions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 6 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 171/171 places, 394/394 transitions.
[2023-03-11 18:58:16] [INFO ] Flatten gal took : 14 ms
[2023-03-11 18:58:16] [INFO ] Flatten gal took : 14 ms
[2023-03-11 18:58:16] [INFO ] Input system was already deterministic with 394 transitions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 3 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 171/171 places, 394/394 transitions.
[2023-03-11 18:58:16] [INFO ] Flatten gal took : 13 ms
[2023-03-11 18:58:16] [INFO ] Flatten gal took : 12 ms
[2023-03-11 18:58:16] [INFO ] Input system was already deterministic with 394 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Graph (trivial) has 136 edges and 171 vertex of which 42 / 171 are part of one of the 14 SCC in 3 ms
Free SCC test removed 28 places
Ensure Unique test removed 106 transitions
Reduce isomorphic transitions removed 106 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 2 places and 0 transitions.
Graph (trivial) has 190 edges and 140 vertex of which 134 / 140 are part of one of the 14 SCC in 0 ms
Free SCC test removed 120 places
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 4 rules applied. Total rules applied 5 place count 20 transition count 286
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 273 transitions
Reduce isomorphic transitions removed 273 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 287 rules applied. Total rules applied 292 place count 7 transition count 12
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 293 place count 6 transition count 12
Drop transitions removed 5 transitions
Redundant transition composition rules discarded 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 298 place count 6 transition count 7
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 1 rules applied. Total rules applied 299 place count 6 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 300 place count 5 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 300 place count 5 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 302 place count 4 transition count 5
Applied a total of 302 rules in 18 ms. Remains 4 /171 variables (removed 167) and now considering 5/394 (removed 389) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 18 ms. Remains : 4/171 places, 5/394 transitions.
[2023-03-11 18:58:16] [INFO ] Flatten gal took : 0 ms
[2023-03-11 18:58:16] [INFO ] Flatten gal took : 0 ms
[2023-03-11 18:58:16] [INFO ] Input system was already deterministic with 5 transitions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 5 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 171/171 places, 394/394 transitions.
[2023-03-11 18:58:16] [INFO ] Flatten gal took : 10 ms
[2023-03-11 18:58:16] [INFO ] Flatten gal took : 11 ms
[2023-03-11 18:58:16] [INFO ] Input system was already deterministic with 394 transitions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 3 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 14 ms. Remains : 171/171 places, 394/394 transitions.
[2023-03-11 18:58:16] [INFO ] Flatten gal took : 27 ms
[2023-03-11 18:58:16] [INFO ] Flatten gal took : 12 ms
[2023-03-11 18:58:16] [INFO ] Input system was already deterministic with 394 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Graph (trivial) has 128 edges and 171 vertex of which 36 / 171 are part of one of the 12 SCC in 0 ms
Free SCC test removed 24 places
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 25 place count 135 transition count 303
Drop transitions removed 112 transitions
Redundant transition composition rules discarded 112 transitions
Iterating global reduction 0 with 112 rules applied. Total rules applied 137 place count 135 transition count 191
Partial Post-agglomeration rule applied 2 times.
Drop transitions removed 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 139 place count 135 transition count 191
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 140 place count 134 transition count 190
Iterating global reduction 0 with 1 rules applied. Total rules applied 141 place count 134 transition count 190
Applied a total of 141 rules in 73 ms. Remains 134 /171 variables (removed 37) and now considering 190/394 (removed 204) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 73 ms. Remains : 134/171 places, 190/394 transitions.
[2023-03-11 18:58:16] [INFO ] Flatten gal took : 5 ms
[2023-03-11 18:58:16] [INFO ] Flatten gal took : 5 ms
[2023-03-11 18:58:16] [INFO ] Input system was already deterministic with 190 transitions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 3 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 171/171 places, 394/394 transitions.
[2023-03-11 18:58:16] [INFO ] Flatten gal took : 24 ms
[2023-03-11 18:58:16] [INFO ] Flatten gal took : 17 ms
[2023-03-11 18:58:16] [INFO ] Input system was already deterministic with 394 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Graph (trivial) has 131 edges and 171 vertex of which 36 / 171 are part of one of the 12 SCC in 0 ms
Free SCC test removed 24 places
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 0 with 26 rules applied. Total rules applied 27 place count 134 transition count 302
Drop transitions removed 101 transitions
Redundant transition composition rules discarded 101 transitions
Iterating global reduction 0 with 101 rules applied. Total rules applied 128 place count 134 transition count 201
Partial Post-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 131 place count 134 transition count 201
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 133 place count 132 transition count 199
Iterating global reduction 0 with 2 rules applied. Total rules applied 135 place count 132 transition count 199
Applied a total of 135 rules in 64 ms. Remains 132 /171 variables (removed 39) and now considering 199/394 (removed 195) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 65 ms. Remains : 132/171 places, 199/394 transitions.
[2023-03-11 18:58:16] [INFO ] Flatten gal took : 4 ms
[2023-03-11 18:58:16] [INFO ] Flatten gal took : 4 ms
[2023-03-11 18:58:16] [INFO ] Input system was already deterministic with 199 transitions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 2 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 171/171 places, 394/394 transitions.
[2023-03-11 18:58:16] [INFO ] Flatten gal took : 9 ms
[2023-03-11 18:58:16] [INFO ] Flatten gal took : 20 ms
[2023-03-11 18:58:16] [INFO ] Input system was already deterministic with 394 transitions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 2 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 171/171 places, 394/394 transitions.
[2023-03-11 18:58:16] [INFO ] Flatten gal took : 13 ms
[2023-03-11 18:58:16] [INFO ] Flatten gal took : 9 ms
[2023-03-11 18:58:16] [INFO ] Input system was already deterministic with 394 transitions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 2 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 171/171 places, 394/394 transitions.
[2023-03-11 18:58:16] [INFO ] Flatten gal took : 8 ms
[2023-03-11 18:58:16] [INFO ] Flatten gal took : 9 ms
[2023-03-11 18:58:16] [INFO ] Input system was already deterministic with 394 transitions.
Starting structural reductions in LTL mode, iteration 0 : 171/171 places, 394/394 transitions.
Applied a total of 0 rules in 3 ms. Remains 171 /171 variables (removed 0) and now considering 394/394 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 171/171 places, 394/394 transitions.
[2023-03-11 18:58:16] [INFO ] Flatten gal took : 8 ms
[2023-03-11 18:58:16] [INFO ] Flatten gal took : 13 ms
[2023-03-11 18:58:16] [INFO ] Input system was already deterministic with 394 transitions.
[2023-03-11 18:58:16] [INFO ] Flatten gal took : 10 ms
[2023-03-11 18:58:16] [INFO ] Flatten gal took : 9 ms
[2023-03-11 18:58:16] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 3 ms.
[2023-03-11 18:58:16] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 171 places, 394 transitions and 1647 arcs took 3 ms.
Total runtime 2658 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: 171 NrTr: 394 NrArc: 1647)

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

net check time: 0m 0.000sec

init dd package: 0m 2.783sec


RS generation: 4m47.460sec


-> reachability set: #nodes 1712402 (1.7e+06) #states 1,283,918,464,548,865 (15)



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

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

abstracting: (0<=0)
states: 1,283,918,464,548,865 (15)

before gc: list nodes free: 156303

after gc: idd nodes used:3328352, unused:60671648; list nodes free:276390185
.MC time: 3m57.117sec

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

abstracting: (1<=0)
states: 0

before gc: list nodes free: 1538103

after gc: idd nodes used:3408210, unused:60591790; list nodes free:278013243
.-> the formula is FALSE

FORMULA FlexibleBarrier-PT-14a-CTLCardinality-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m33.098sec

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

abstracting: (1<=p61)
states: 106,993,205,379,072 (14)
abstracting: (p61<=1)
states: 1,283,918,464,548,865 (15)
abstracting: (0<=p79)
states: 1,283,918,464,548,865 (15)
abstracting: (p79<=0)
states: 1,176,925,259,169,793 (15)
MC time: 3m45.023sec

checking: [AG [AF [[p113<=0 & 0<=p113]]] | EX [AG [EF [[[p11<=0 & 0<=p11] & [p97<=1 & 1<=p97]]]]]]
normalized: [EX [~ [E [true U ~ [E [true U [[p97<=1 & 1<=p97] & [p11<=0 & 0<=p11]]]]]]] | ~ [E [true U EG [~ [[p113<=0 & 0<=p113]]]]]]

abstracting: (0<=p113)
states: 1,283,918,464,548,865 (15)
abstracting: (p113<=0)
states: 1,176,925,259,169,793 (15)
.
before gc: list nodes free: 2074134

after gc: idd nodes used:5756711, unused:58243289; list nodes free:267521324
MC time: 3m28.021sec

checking: EX [EX [EG [[AF [[p150<=0 & 0<=p150]] & [[p64<=0 & 0<=p64] & [[p26<=0 & 0<=p26] | [p144<=1 & 1<=p144]]]]]]]
normalized: EX [EX [EG [[[[[p144<=1 & 1<=p144] | [p26<=0 & 0<=p26]] & [p64<=0 & 0<=p64]] & ~ [EG [~ [[p150<=0 & 0<=p150]]]]]]]]

abstracting: (0<=p150)
states: 1,283,918,464,548,865 (15)
abstracting: (p150<=0)
states: 1,176,925,259,169,793 (15)

before gc: list nodes free: 1533044

after gc: idd nodes used:4707085, unused:59292915; list nodes free:272041220
.
before gc: list nodes free: 2973858

after gc: idd nodes used:6028162, unused:57971838; list nodes free:265999118
MC time: 3m12.485sec

checking: EF [[AG [[p158<=1 & 1<=p158]] & [[p161<=0 & 0<=p161] & [[p154<=0 & 0<=p154] | [p36<=1 & 1<=p36]]]]]
normalized: E [true U [[[[p36<=1 & 1<=p36] | [p154<=0 & 0<=p154]] & [p161<=0 & 0<=p161]] & ~ [E [true U ~ [[p158<=1 & 1<=p158]]]]]]

abstracting: (1<=p158)
states: 106,993,205,379,072 (14)
abstracting: (p158<=1)
states: 1,283,918,464,548,865 (15)
abstracting: (0<=p161)
states: 1,283,918,464,548,865 (15)
abstracting: (p161<=0)
states: 1,176,925,259,169,793 (15)
abstracting: (0<=p154)
states: 1,283,918,464,548,865 (15)
abstracting: (p154<=0)
states: 1,176,925,259,169,793 (15)
abstracting: (1<=p36)
states: 106,993,205,379,072 (14)
abstracting: (p36<=1)
states: 1,283,918,464,548,865 (15)
-> the formula is FALSE

FORMULA FlexibleBarrier-PT-14a-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 2m38.966sec

checking: [E [E [[[[p165<=1 & 1<=p165] | ~ [[p119<=1 & 1<=p119]]] | [0<=p74 & p74<=0]] U [p20<=1 & 1<=p20]] U EG [[p71<=1 & 1<=p71]]] & AX [[p169<=1 & 1<=p169]]]
normalized: [~ [EX [~ [[p169<=1 & 1<=p169]]]] & E [E [[[0<=p74 & p74<=0] | [~ [[p119<=1 & 1<=p119]] | [p165<=1 & 1<=p165]]] U [p20<=1 & 1<=p20]] U EG [[p71<=1 & 1<=p71]]]]

abstracting: (1<=p71)
states: 106,993,205,379,072 (14)
abstracting: (p71<=1)
states: 1,283,918,464,548,865 (15)
.
before gc: list nodes free: 1747115

after gc: idd nodes used:6059780, unused:57940220; list nodes free:265898251
MC time: 2m58.632sec

checking: AG [~ [A [[AF [[p20<=1 & 1<=p20]] & [[p159<=0 & 0<=p159] | [p140<=1 & 1<=p140]]] U EF [[[[p84<=0 & 0<=p84] | [p23<=1 & 1<=p23]] & AG [[p113<=0 & 0<=p113]]]]]]]
normalized: ~ [E [true U [~ [EG [~ [E [true U [~ [E [true U ~ [[p113<=0 & 0<=p113]]]] & [[p23<=1 & 1<=p23] | [p84<=0 & 0<=p84]]]]]]] & ~ [E [~ [E [true U [~ [E [true U ~ [[p113<=0 & 0<=p113]]]] & [[p23<=1 & 1<=p23] | [p84<=0 & 0<=p84]]]]] U [~ [[[[p140<=1 & 1<=p140] | [p159<=0 & 0<=p159]] & ~ [EG [~ [[p20<=1 & 1<=p20]]]]]] & ~ [E [true U [~ [E [true U ~ [[p113<=0 & 0<=p113]]]] & [[p23<=1 & 1<=p23] | [p84<=0 & 0<=p84]]]]]]]]]]]

abstracting: (0<=p84)
states: 1,283,918,464,548,865 (15)
abstracting: (p84<=0)
states: 1,176,925,259,169,793 (15)
abstracting: (1<=p23)
states: 106,993,205,379,072 (14)
abstracting: (p23<=1)
states: 1,283,918,464,548,865 (15)
abstracting: (0<=p113)
states: 1,283,918,464,548,865 (15)
abstracting: (p113<=0)
states: 1,176,925,259,169,793 (15)
MC time: 2m43.292sec

checking: EG [[AG [[[p82<=0 & 0<=p82] | [EF [[[p148<=0 & 0<=p148] & [p111<=1 & 1<=p111]]] | EF [[[p96<=1 & 1<=p96] & [p126<=0 & 0<=p126]]]]]] & EX [[[p159<=0 & 0<=p159] | [p110<=1 & 1<=p110]]]]]
normalized: EG [[EX [[[p110<=1 & 1<=p110] | [p159<=0 & 0<=p159]]] & ~ [E [true U ~ [[[E [true U [[p126<=0 & 0<=p126] & [p96<=1 & 1<=p96]]] | E [true U [[p111<=1 & 1<=p111] & [p148<=0 & 0<=p148]]]] | [p82<=0 & 0<=p82]]]]]]]

abstracting: (0<=p82)
states: 1,283,918,464,548,865 (15)
abstracting: (p82<=0)
states: 1,176,925,259,169,793 (15)
abstracting: (0<=p148)
states: 1,283,918,464,548,865 (15)
abstracting: (p148<=0)
states: 1,176,925,259,169,793 (15)
abstracting: (1<=p111)
states: 106,993,205,379,072 (14)
abstracting: (p111<=1)
states: 1,283,918,464,548,865 (15)
MC time: 2m30.194sec

checking: AX [AG [[[[p11<=1 & 1<=p11] & [p15<=0 & 0<=p15]] & [[p40<=1 & 1<=p40] & [[p28<=0 & 0<=p28] | [[p48<=0 & 0<=p48] & [[p130<=1 & 1<=p130] & [p126<=1 & 1<=p126]]]]]]]]
normalized: ~ [EX [E [true U ~ [[[[[[[p126<=1 & 1<=p126] & [p130<=1 & 1<=p130]] & [p48<=0 & 0<=p48]] | [p28<=0 & 0<=p28]] & [p40<=1 & 1<=p40]] & [[p15<=0 & 0<=p15] & [p11<=1 & 1<=p11]]]]]]]

abstracting: (1<=p11)
states: 106,993,205,379,072 (14)
abstracting: (p11<=1)
states: 1,283,918,464,548,865 (15)
abstracting: (0<=p15)
states: 1,283,918,464,548,865 (15)
abstracting: (p15<=0)
states: 1,176,925,259,169,793 (15)
abstracting: (1<=p40)
states: 106,993,205,379,072 (14)
abstracting: (p40<=1)
states: 1,283,918,464,548,865 (15)
abstracting: (0<=p28)
states: 1,283,918,464,548,865 (15)
abstracting: (p28<=0)
states: 1,176,925,259,169,793 (15)
abstracting: (0<=p48)
states: 1,283,918,464,548,865 (15)
abstracting: (p48<=0)
states: 1,176,925,259,169,793 (15)
abstracting: (1<=p130)
states: 106,993,205,379,072 (14)
abstracting: (p130<=1)
states: 1,283,918,464,548,865 (15)
abstracting: (1<=p126)
states: 106,993,205,379,072 (14)
abstracting: (p126<=1)
states: 1,283,918,464,548,865 (15)
MC time: 2m17.316sec

checking: [EG [E [[p152<=1 & 1<=p152] U EF [~ [AX [[p20<=0 & 0<=p20]]]]]] & E [EG [[AF [[p0<=1 & 1<=p0]] | [~ [A [[p133<=1 & 1<=p133] U [p70<=0 & 0<=p70]]] | EF [[p4<=1 & 1<=p4]]]]] U [[p16<=0 & 0<=p16] | [p117<=1 & 1<=p117]]]]
normalized: [E [EG [[[E [true U [p4<=1 & 1<=p4]] | ~ [[~ [EG [~ [[p70<=0 & 0<=p70]]]] & ~ [E [~ [[p70<=0 & 0<=p70]] U [~ [[p133<=1 & 1<=p133]] & ~ [[p70<=0 & 0<=p70]]]]]]]] | ~ [EG [~ [[p0<=1 & 1<=p0]]]]]] U [[p117<=1 & 1<=p117] | [p16<=0 & 0<=p16]]] & EG [E [[p152<=1 & 1<=p152] U E [true U EX [~ [[p20<=0 & 0<=p20]]]]]]]

abstracting: (0<=p20)
states: 1,283,918,464,548,865 (15)
abstracting: (p20<=0)
states: 1,176,925,259,169,793 (15)

before gc: list nodes free: 1456133

after gc: idd nodes used:12145596, unused:51854404; list nodes free:237882280
.MC time: 2m 6.152sec

checking: E [A [[~ [[[p42<=0 & 0<=p42] | [p144<=1 & 1<=p144]]] & AG [[AG [[[p116<=0 & 0<=p116] | [p70<=1 & 1<=p70]]] | ~ [[[p170<=0 & 0<=p170] | [p141<=1 & 1<=p141]]]]]] U AF [EX [[[p59<=0 & 0<=p59] | [p72<=1 & 1<=p72]]]]] U [p128<=1 & 1<=p128]]
normalized: E [[~ [EG [EG [~ [EX [[[p72<=1 & 1<=p72] | [p59<=0 & 0<=p59]]]]]]] & ~ [E [EG [~ [EX [[[p72<=1 & 1<=p72] | [p59<=0 & 0<=p59]]]]] U [~ [[~ [E [true U ~ [[~ [[[p141<=1 & 1<=p141] | [p170<=0 & 0<=p170]]] | ~ [E [true U ~ [[[p70<=1 & 1<=p70] | [p116<=0 & 0<=p116]]]]]]]]] & ~ [[[p144<=1 & 1<=p144] | [p42<=0 & 0<=p42]]]]] & EG [~ [EX [[[p72<=1 & 1<=p72] | [p59<=0 & 0<=p59]]]]]]]]] U [p128<=1 & 1<=p128]]

abstracting: (1<=p128)
states: 106,993,205,379,072 (14)
abstracting: (p128<=1)
states: 1,283,918,464,548,865 (15)
abstracting: (0<=p59)
states: 1,283,918,464,548,865 (15)
abstracting: (p59<=0)
states: 1,176,925,259,169,793 (15)
abstracting: (1<=p72)
states: 106,993,205,379,072 (14)
abstracting: (p72<=1)
states: 1,283,918,464,548,865 (15)

before gc: list nodes free: 1758655

after gc: idd nodes used:12114416, unused:51885584; list nodes free:237707780
MC time: 1m55.289sec

checking: AX [[E [[[~ [[p115<=0 & 0<=p115]] & [[p115<=0 & 0<=p115] | [[p167<=1 & 1<=p167] | ~ [[p148<=0 & 0<=p148]]]]] | ~ [EX [[[p72<=0 & 0<=p72] | [p154<=1 & 1<=p154]]]]] U ~ [[EF [[p102<=1 & 1<=p102]] | [[p45<=1 & 1<=p45] & [[p5<=1 & 1<=p5] & ~ [[p113<=1 & 1<=p113]]]]]]] | [p62<=0 & 0<=p62]]]
normalized: ~ [EX [~ [[[p62<=0 & 0<=p62] | E [[~ [EX [[[p154<=1 & 1<=p154] | [p72<=0 & 0<=p72]]]] | [[[~ [[p148<=0 & 0<=p148]] | [p167<=1 & 1<=p167]] | [p115<=0 & 0<=p115]] & ~ [[p115<=0 & 0<=p115]]]] U ~ [[[[~ [[p113<=1 & 1<=p113]] & [p5<=1 & 1<=p5]] & [p45<=1 & 1<=p45]] | E [true U [p102<=1 & 1<=p102]]]]]]]]]

abstracting: (1<=p102)
states: 106,993,205,379,072 (14)
abstracting: (p102<=1)
states: 1,283,918,464,548,865 (15)
MC time: 1m46.170sec

checking: [EX [[[[[[AX [[0<=p122 & p122<=0]] | EX [[p165<=0 & 0<=p165]]] & [[p126<=0 & 0<=p126] & [p83<=1 & 1<=p83]]] | [[[p12<=0 & 0<=p12] | [[p170<=0 & 0<=p170] & [p1<=1 & 1<=p1]]] & [p58<=0 & 0<=p58]]] | [[AF [[p45<=0 & 0<=p45]] & [p76<=0 & 0<=p76]] & [[p133<=1 & 1<=p133] & [[p144<=0 & 0<=p144] & [p26<=1 & 1<=p26]]]]] & ~ [E [EX [0<=0] U [[[p131<=0 & 0<=p131] | [p42<=1 & 1<=p42]] & [p123<=1 & 1<=p123]]]]]] | [EX [[p97<=0 & 0<=p97]] & EF [[E [[[p17<=0 & 0<=p17] | [p91<=1 & 1<=p91]] U [p132<=1 & 1<=p132]] & AG [[p82<=1 & 1<=p82]]]]]]
normalized: [[E [true U [~ [E [true U ~ [[p82<=1 & 1<=p82]]]] & E [[[p91<=1 & 1<=p91] | [p17<=0 & 0<=p17]] U [p132<=1 & 1<=p132]]]] & EX [[p97<=0 & 0<=p97]]] | EX [[~ [E [EX [0<=0] U [[p123<=1 & 1<=p123] & [[p42<=1 & 1<=p42] | [p131<=0 & 0<=p131]]]]] & [[[[[p26<=1 & 1<=p26] & [p144<=0 & 0<=p144]] & [p133<=1 & 1<=p133]] & [[p76<=0 & 0<=p76] & ~ [EG [~ [[p45<=0 & 0<=p45]]]]]] | [[[p58<=0 & 0<=p58] & [[[p1<=1 & 1<=p1] & [p170<=0 & 0<=p170]] | [p12<=0 & 0<=p12]]] | [[[p83<=1 & 1<=p83] & [p126<=0 & 0<=p126]] & [EX [[p165<=0 & 0<=p165]] | ~ [EX [~ [[0<=p122 & p122<=0]]]]]]]]]]]

abstracting: (p122<=0)
states: 1,176,925,259,169,793 (15)
abstracting: (0<=p122)
states: 1,283,918,464,548,865 (15)
.abstracting: (0<=p165)
states: 1,283,918,464,548,865 (15)
abstracting: (p165<=0)
states: 1,176,925,259,169,793 (15)
MC time: 1m37.324sec

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

abstracting: (0<=0)
states: 1,283,918,464,548,865 (15)

before gc: list nodes free: 1577299

after gc: idd nodes used:12967554, unused:51032446; list nodes free:233969805
.-> the formula is TRUE

FORMULA FlexibleBarrier-PT-14a-CTLCardinality-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 5m26.977sec

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

abstracting: (0<=p79)
states: 1,283,918,464,548,865 (15)
abstracting: (p79<=0)
states: 1,176,925,259,169,793 (15)
abstracting: (1<=p61)
states: 106,993,205,379,072 (14)
abstracting: (p61<=1)
states: 1,283,918,464,548,865 (15)

before gc: list nodes free: 177470

after gc: idd nodes used:12143274, unused:51856726; list nodes free:237553326
-> the formula is TRUE

FORMULA FlexibleBarrier-PT-14a-CTLCardinality-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 5936708 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16101884 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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:17326 (43), effective:298 (0)

initing FirstDep: 0m 0.000sec


sat_reach.icc:155: Timeout: after 236 sec


sat_reach.icc:155: Timeout: after 224 sec


net_ddint.h:442: Timeout: after 207 sec


net_ddint.h:442: Timeout: after 191 sec


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

net_ddint.h:442: Timeout: after 177 sec


sat_reach.icc:155: Timeout: after 162 sec


sat_reach.icc:155: Timeout: after 149 sec


sat_reach.icc:155: Timeout: after 136 sec


sat_reach.icc:155: Timeout: after 125 sec


net_ddint.h:600: Timeout: after 114 sec


sat_reach.icc:155: Timeout: after 105 sec


net_ddint.h:600: Timeout: after 96 sec


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

iterations count:2189 (5), effective:24 (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="FlexibleBarrier-PT-14a"
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 FlexibleBarrier-PT-14a, 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-167838857400521"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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