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.r234-tall-167856419900154.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 JoinFreeModules-PT-0005, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r234-tall-167856419900154
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 7.4K Feb 25 11:54 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Feb 25 11:54 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Feb 25 11:54 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 25 11:54 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Feb 25 16:18 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Feb 25 16:18 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 16:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:18 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Feb 25 11:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 25 11:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Feb 25 11:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Feb 25 11:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:18 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 16:18 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 16K 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 JoinFreeModules-PT-0005-CTLFireability-00
FORMULA_NAME JoinFreeModules-PT-0005-CTLFireability-01
FORMULA_NAME JoinFreeModules-PT-0005-CTLFireability-02
FORMULA_NAME JoinFreeModules-PT-0005-CTLFireability-03
FORMULA_NAME JoinFreeModules-PT-0005-CTLFireability-04
FORMULA_NAME JoinFreeModules-PT-0005-CTLFireability-05
FORMULA_NAME JoinFreeModules-PT-0005-CTLFireability-06
FORMULA_NAME JoinFreeModules-PT-0005-CTLFireability-07
FORMULA_NAME JoinFreeModules-PT-0005-CTLFireability-08
FORMULA_NAME JoinFreeModules-PT-0005-CTLFireability-09
FORMULA_NAME JoinFreeModules-PT-0005-CTLFireability-10
FORMULA_NAME JoinFreeModules-PT-0005-CTLFireability-11
FORMULA_NAME JoinFreeModules-PT-0005-CTLFireability-12
FORMULA_NAME JoinFreeModules-PT-0005-CTLFireability-13
FORMULA_NAME JoinFreeModules-PT-0005-CTLFireability-14
FORMULA_NAME JoinFreeModules-PT-0005-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1679452059037

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=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=JoinFreeModules-PT-0005
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-22 02:27:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-22 02:27:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 02:27:40] [INFO ] Load time of PNML (sax parser for PT used): 26 ms
[2023-03-22 02:27:40] [INFO ] Transformed 26 places.
[2023-03-22 02:27:40] [INFO ] Transformed 41 transitions.
[2023-03-22 02:27:40] [INFO ] Parsed PT model containing 26 places and 41 transitions and 117 arcs in 80 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 10 ms.
Initial state reduction rules removed 7 formulas.
Reduce places removed 1 places and 0 transitions.
FORMULA JoinFreeModules-PT-0005-CTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0005-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0005-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0005-CTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0005-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0005-CTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA JoinFreeModules-PT-0005-CTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 41/41 transitions.
Applied a total of 0 rules in 9 ms. Remains 25 /25 variables (removed 0) and now considering 41/41 (removed 0) transitions.
// Phase 1: matrix 41 rows 25 cols
[2023-03-22 02:27:40] [INFO ] Computed 5 place invariants in 10 ms
[2023-03-22 02:27:40] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
[2023-03-22 02:27:40] [INFO ] Invariant cache hit.
[2023-03-22 02:27:40] [INFO ] Implicit Places using invariants in 30 ms returned []
[2023-03-22 02:27:40] [INFO ] Invariant cache hit.
[2023-03-22 02:27:40] [INFO ] State equation strengthened by 5 read => feed constraints.
[2023-03-22 02:27:40] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2023-03-22 02:27:40] [INFO ] Invariant cache hit.
[2023-03-22 02:27:40] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 313 ms. Remains : 25/25 places, 41/41 transitions.
Support contains 24 out of 25 places after structural reductions.
[2023-03-22 02:27:41] [INFO ] Flatten gal took : 18 ms
[2023-03-22 02:27:41] [INFO ] Flatten gal took : 5 ms
[2023-03-22 02:27:41] [INFO ] Input system was already deterministic with 41 transitions.
Support contains 23 out of 25 places (down from 24) after GAL structural reductions.
Incomplete random walk after 10001 steps, including 10 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 41) seen :40
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-22 02:27:41] [INFO ] Invariant cache hit.
[2023-03-22 02:27:41] [INFO ] [Real]Absence check using 5 positive place invariants in 5 ms returned sat
[2023-03-22 02:27:41] [INFO ] After 257ms 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 0 ms.
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
[2023-03-22 02:27:41] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-22 02:27:41] [INFO ] Flatten gal took : 5 ms
FORMULA JoinFreeModules-PT-0005-CTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-22 02:27:41] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:27:41] [INFO ] Input system was already deterministic with 41 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2023-03-22 02:27:41] [INFO ] Invariant cache hit.
[2023-03-22 02:27:41] [INFO ] Dead Transitions using invariants and state equation in 45 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 47 ms. Remains : 25/25 places, 41/41 transitions.
[2023-03-22 02:27:41] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:27:41] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:27:41] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 25/25 places, 41/41 transitions.
Applied a total of 0 rules in 6 ms. Remains 25 /25 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2023-03-22 02:27:41] [INFO ] Invariant cache hit.
[2023-03-22 02:27:41] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 46 ms. Remains : 25/25 places, 41/41 transitions.
[2023-03-22 02:27:41] [INFO ] Flatten gal took : 3 ms
[2023-03-22 02:27:41] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:27:41] [INFO ] Input system was already deterministic with 41 transitions.
Finished random walk after 58 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=58 )
FORMULA JoinFreeModules-PT-0005-CTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 41/41 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2023-03-22 02:27:41] [INFO ] Invariant cache hit.
[2023-03-22 02:27:41] [INFO ] Dead Transitions using invariants and state equation in 46 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48 ms. Remains : 25/25 places, 41/41 transitions.
[2023-03-22 02:27:41] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:27:41] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:27:41] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2023-03-22 02:27:41] [INFO ] Invariant cache hit.
[2023-03-22 02:27:41] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 39 ms. Remains : 25/25 places, 41/41 transitions.
[2023-03-22 02:27:41] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:27:41] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:27:41] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 41/41 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2023-03-22 02:27:41] [INFO ] Invariant cache hit.
[2023-03-22 02:27:41] [INFO ] Dead Transitions using invariants and state equation in 37 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 38 ms. Remains : 25/25 places, 41/41 transitions.
[2023-03-22 02:27:41] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:27:41] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:27:41] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 25/25 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2023-03-22 02:27:41] [INFO ] Invariant cache hit.
[2023-03-22 02:27:41] [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 39 ms. Remains : 25/25 places, 41/41 transitions.
[2023-03-22 02:27:41] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:27:41] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:27:41] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 41/41 transitions.
Applied a total of 0 rules in 1 ms. Remains 25 /25 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2023-03-22 02:27:41] [INFO ] Invariant cache hit.
[2023-03-22 02:27:42] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34 ms. Remains : 25/25 places, 41/41 transitions.
[2023-03-22 02:27:42] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:27:42] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:27:42] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 41/41 transitions.
Applied a total of 0 rules in 2 ms. Remains 25 /25 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2023-03-22 02:27:42] [INFO ] Invariant cache hit.
[2023-03-22 02:27:42] [INFO ] Dead Transitions using invariants and state equation in 38 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 25/25 places, 41/41 transitions.
[2023-03-22 02:27:42] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:27:42] [INFO ] Flatten gal took : 19 ms
[2023-03-22 02:27:42] [INFO ] Input system was already deterministic with 41 transitions.
[2023-03-22 02:27:42] [INFO ] Flatten gal took : 2 ms
[2023-03-22 02:27:42] [INFO ] Flatten gal took : 5 ms
[2023-03-22 02:27:42] [INFO ] Export to MCC of 7 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-22 02:27:42] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 25 places, 41 transitions and 115 arcs took 1 ms.
Total runtime 1712 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=CTLFireability.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 25 NrTr: 41 NrArc: 115)

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

net check time: 0m 0.000sec

init dd package: 0m 2.680sec


RS generation: 0m 0.002sec


-> reachability set: #nodes 301 (3.0e+02) #states 11,592,740,743 (10)



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

checking: AG [EF [[AX [p14<=4] & [p7<=1 | p12<=0]]]]
normalized: ~ [E [true U ~ [E [true U [[p7<=1 | p12<=0] & ~ [EX [~ [p14<=4]]]]]]]]

abstracting: (p14<=4)
states: 10,017,028,409 (10)
.abstracting: (p12<=0)
states: 4,164,382,597 (9)
abstracting: (p7<=1)
states: 7,428,358,146 (9)
-> the formula is TRUE

FORMULA JoinFreeModules-PT-0005-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.016sec

checking: AF [~ [E [[p5<=4 | [1<=p22 & 5<=p4]] U 3<=p15]]]
normalized: ~ [EG [E [[[1<=p22 & 5<=p4] | p5<=4] U 3<=p15]]]

abstracting: (3<=p15)
states: 4,502,035,240 (9)
abstracting: (p5<=4)
states: 10,242,130,171 (10)
abstracting: (5<=p4)
states: 1,575,712,334 (9)
abstracting: (1<=p22)
states: 7,428,358,146 (9)
.
EG iterations: 1
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0005-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.014sec

checking: [EX [EX [5<=p10]] | [AG [p17<=1] | EG [EX [[AG [3<=p8] | EF [p20<=4]]]]]]
normalized: [[EG [EX [[E [true U p20<=4] | ~ [E [true U ~ [3<=p8]]]]]] | ~ [E [true U ~ [p17<=1]]]] | EX [EX [5<=p10]]]

abstracting: (5<=p10)
states: 1,350,610,572 (9)
..abstracting: (p17<=1)
states: 7,428,358,146 (9)
abstracting: (3<=p8)
states: 4,502,035,240 (9)
abstracting: (p20<=4)
states: 10,242,130,171 (10)
.................
EG iterations: 16
-> the formula is TRUE

FORMULA JoinFreeModules-PT-0005-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.023sec

checking: [AF [AG [3<=p15]] | [EG [[p7<=0 | EF [[1<=p2 | 2<=p1]]]] & AG [EX [3<=p23]]]]
normalized: [[~ [E [true U ~ [EX [3<=p23]]]] & EG [[p7<=0 | E [true U [1<=p2 | 2<=p1]]]]] | ~ [EG [E [true U ~ [3<=p15]]]]]

abstracting: (3<=p15)
states: 4,502,035,240 (9)

EG iterations: 0
abstracting: (2<=p1)
states: 4,502,035,240 (9)
abstracting: (1<=p2)
states: 7,428,358,146 (9)
abstracting: (p7<=0)
states: 4,164,382,597 (9)
...........
EG iterations: 11
abstracting: (3<=p23)
states: 4,502,035,240 (9)
.-> the formula is FALSE

FORMULA JoinFreeModules-PT-0005-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.026sec

checking: EF [[3<=p18 & EF [[AX [p0<=2] | [[p20<=2 & [[p2<=4 | p7<=4] | [p12<=4 | [p17<=4 | p22<=4]]]] | EF [p19<=4]]]]]]
normalized: E [true U [3<=p18 & E [true U [[E [true U p19<=4] | [p20<=2 & [[p12<=4 | [p17<=4 | p22<=4]] | [p2<=4 | p7<=4]]]] | ~ [EX [~ [p0<=2]]]]]]]

abstracting: (p0<=2)
states: 7,090,705,503 (9)
.abstracting: (p7<=4)
states: 11,255,088,100 (10)
abstracting: (p2<=4)
states: 11,255,088,100 (10)
abstracting: (p22<=4)
states: 11,255,088,100 (10)
abstracting: (p17<=4)
states: 11,255,088,100 (10)
abstracting: (p12<=4)
states: 11,255,088,100 (10)
abstracting: (p20<=2)
states: 7,090,705,503 (9)
abstracting: (p19<=4)
states: 10,017,028,409 (10)
abstracting: (3<=p18)
states: 4,502,035,240 (9)
-> the formula is TRUE

FORMULA JoinFreeModules-PT-0005-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.009sec

checking: EX [~ [A [[EG [2<=p12] & AG [3<=p18]] U E [E [2<=p6 U 2<=p11] U [E [5<=p5 U 1<=p7] | [[5<=p7 & 5<=p2] & [[5<=p17 & 5<=p22] & 5<=p12]]]]]]]
normalized: EX [~ [[~ [EG [~ [E [E [2<=p6 U 2<=p11] U [[[5<=p12 & [5<=p17 & 5<=p22]] & [5<=p7 & 5<=p2]] | E [5<=p5 U 1<=p7]]]]]] & ~ [E [~ [E [E [2<=p6 U 2<=p11] U [[[5<=p12 & [5<=p17 & 5<=p22]] & [5<=p7 & 5<=p2]] | E [5<=p5 U 1<=p7]]]] U [~ [[~ [E [true U ~ [3<=p18]]] & EG [2<=p12]]] & ~ [E [E [2<=p6 U 2<=p11] U [[[5<=p12 & [5<=p17 & 5<=p22]] & [5<=p7 & 5<=p2]] | E [5<=p5 U 1<=p7]]]]]]]]]]

abstracting: (1<=p7)
states: 7,428,358,146 (9)
abstracting: (5<=p5)
states: 1,350,610,572 (9)
abstracting: (5<=p2)
states: 337,652,643 (8)
abstracting: (5<=p7)
states: 337,652,643 (8)
abstracting: (5<=p22)
states: 337,652,643 (8)
abstracting: (5<=p17)
states: 337,652,643 (8)
abstracting: (5<=p12)
states: 337,652,643 (8)
abstracting: (2<=p11)
states: 4,502,035,240 (9)
abstracting: (2<=p6)
states: 4,502,035,240 (9)
abstracting: (2<=p12)
states: 4,164,382,597 (9)
..............
EG iterations: 14
abstracting: (3<=p18)
states: 4,502,035,240 (9)
abstracting: (1<=p7)
states: 7,428,358,146 (9)
abstracting: (5<=p5)
states: 1,350,610,572 (9)
abstracting: (5<=p2)
states: 337,652,643 (8)
abstracting: (5<=p7)
states: 337,652,643 (8)
abstracting: (5<=p22)
states: 337,652,643 (8)
abstracting: (5<=p17)
states: 337,652,643 (8)
abstracting: (5<=p12)
states: 337,652,643 (8)
abstracting: (2<=p11)
states: 4,502,035,240 (9)
abstracting: (2<=p6)
states: 4,502,035,240 (9)
abstracting: (1<=p7)
states: 7,428,358,146 (9)
abstracting: (5<=p5)
states: 1,350,610,572 (9)
abstracting: (5<=p2)
states: 337,652,643 (8)
abstracting: (5<=p7)
states: 337,652,643 (8)
abstracting: (5<=p22)
states: 337,652,643 (8)
abstracting: (5<=p17)
states: 337,652,643 (8)
abstracting: (5<=p12)
states: 337,652,643 (8)
abstracting: (2<=p11)
states: 4,502,035,240 (9)
abstracting: (2<=p6)
states: 4,502,035,240 (9)
..............
EG iterations: 14
.-> the formula is FALSE

FORMULA JoinFreeModules-PT-0005-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.054sec

checking: A [[AG [EF [AX [3<=p10]]] & [~ [AF [AG [4<=p23]]] & [AG [EF [4<=p18]] | [1<=p12 | [[5<=p2 & 5<=p7] & [5<=p12 & [5<=p17 & 5<=p22]]]]]]] U [[AF [[2<=p22 & 3<=p13]] & [EX [[3<=p13 | 2<=p12]] | [2<=p7 | 3<=p20]]] | [[p10<=4 & AX [4<=p8]] & [EG [A [[5<=p15 & 5<=p10] U EF [5<=p9]]] & [[EG [5<=p24] | EF [5<=p5]] & [A [5<=p14 U 4<=p8] | [E [2<=p17 U 3<=p18] | EG [3<=p0]]]]]]]]
normalized: [~ [EG [~ [[[[[[[EG [3<=p0] | E [2<=p17 U 3<=p18]] | [~ [EG [~ [4<=p8]]] & ~ [E [~ [4<=p8] U [~ [5<=p14] & ~ [4<=p8]]]]]] & [E [true U 5<=p5] | EG [5<=p24]]] & EG [[~ [EG [~ [E [true U 5<=p9]]]] & ~ [E [~ [E [true U 5<=p9]] U [~ [[5<=p15 & 5<=p10]] & ~ [E [true U 5<=p9]]]]]]]] & [p10<=4 & ~ [EX [~ [4<=p8]]]]] | [[[2<=p7 | 3<=p20] | EX [[3<=p13 | 2<=p12]]] & ~ [EG [~ [[2<=p22 & 3<=p13]]]]]]]]] & ~ [E [~ [[[[[[[EG [3<=p0] | E [2<=p17 U 3<=p18]] | [~ [EG [~ [4<=p8]]] & ~ [E [~ [4<=p8] U [~ [5<=p14] & ~ [4<=p8]]]]]] & [E [true U 5<=p5] | EG [5<=p24]]] & EG [[~ [EG [~ [E [true U 5<=p9]]]] & ~ [E [~ [E [true U 5<=p9]] U [~ [[5<=p15 & 5<=p10]] & ~ [E [true U 5<=p9]]]]]]]] & [p10<=4 & ~ [EX [~ [4<=p8]]]]] | [[[2<=p7 | 3<=p20] | EX [[3<=p13 | 2<=p12]]] & ~ [EG [~ [[2<=p22 & 3<=p13]]]]]]] U [~ [[[[[1<=p12 | [[5<=p12 & [5<=p17 & 5<=p22]] & [5<=p2 & 5<=p7]]] | ~ [E [true U ~ [E [true U 4<=p18]]]]] & EG [E [true U ~ [4<=p23]]]] & ~ [E [true U ~ [E [true U ~ [EX [~ [3<=p10]]]]]]]]] & ~ [[[[[[[EG [3<=p0] | E [2<=p17 U 3<=p18]] | [~ [EG [~ [4<=p8]]] & ~ [E [~ [4<=p8] U [~ [5<=p14] & ~ [4<=p8]]]]]] & [E [true U 5<=p5] | EG [5<=p24]]] & EG [[~ [EG [~ [E [true U 5<=p9]]]] & ~ [E [~ [E [true U 5<=p9]] U [~ [[5<=p15 & 5<=p10]] & ~ [E [true U 5<=p9]]]]]]]] & [p10<=4 & ~ [EX [~ [4<=p8]]]]] | [[[2<=p7 | 3<=p20] | EX [[3<=p13 | 2<=p12]]] & ~ [EG [~ [[2<=p22 & 3<=p13]]]]]]]]]]]

abstracting: (3<=p13)
states: 4,502,035,240 (9)
abstracting: (2<=p22)
states: 4,164,382,597 (9)
.
EG iterations: 1
abstracting: (2<=p12)
states: 4,164,382,597 (9)
abstracting: (3<=p13)
states: 4,502,035,240 (9)
.abstracting: (3<=p20)
states: 4,502,035,240 (9)
abstracting: (2<=p7)
states: 4,164,382,597 (9)
abstracting: (4<=p8)
states: 2,138,466,739 (9)
.abstracting: (p10<=4)
states: 10,242,130,171 (10)
abstracting: (5<=p9)
states: 1,575,712,334 (9)
abstracting: (5<=p10)
states: 1,350,610,572 (9)
abstracting: (5<=p15)
states: 1,350,610,572 (9)
abstracting: (5<=p9)
states: 1,575,712,334 (9)
abstracting: (5<=p9)
states: 1,575,712,334 (9)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (5<=p24)
states: 1,575,712,334 (9)
.....................
EG iterations: 21
abstracting: (5<=p5)
states: 1,350,610,572 (9)
abstracting: (4<=p8)
states: 2,138,466,739 (9)
abstracting: (5<=p14)
states: 1,575,712,334 (9)
abstracting: (4<=p8)
states: 2,138,466,739 (9)
abstracting: (4<=p8)
states: 2,138,466,739 (9)
.................
EG iterations: 17
abstracting: (3<=p18)
states: 4,502,035,240 (9)
abstracting: (2<=p17)
states: 4,164,382,597 (9)
abstracting: (3<=p0)
states: 4,502,035,240 (9)
.....................
EG iterations: 21
abstracting: (3<=p10)
states: 4,502,035,240 (9)
.abstracting: (4<=p23)
states: 2,138,466,739 (9)

EG iterations: 0
abstracting: (4<=p18)
states: 2,138,466,739 (9)
abstracting: (5<=p7)
states: 337,652,643 (8)
abstracting: (5<=p2)
states: 337,652,643 (8)
abstracting: (5<=p22)
states: 337,652,643 (8)
abstracting: (5<=p17)
states: 337,652,643 (8)
abstracting: (5<=p12)
states: 337,652,643 (8)
abstracting: (1<=p12)
states: 7,428,358,146 (9)
abstracting: (3<=p13)
states: 4,502,035,240 (9)
abstracting: (2<=p22)
states: 4,164,382,597 (9)
.
EG iterations: 1
abstracting: (2<=p12)
states: 4,164,382,597 (9)
abstracting: (3<=p13)
states: 4,502,035,240 (9)
.abstracting: (3<=p20)
states: 4,502,035,240 (9)
abstracting: (2<=p7)
states: 4,164,382,597 (9)
abstracting: (4<=p8)
states: 2,138,466,739 (9)
.abstracting: (p10<=4)
states: 10,242,130,171 (10)
abstracting: (5<=p9)
states: 1,575,712,334 (9)
abstracting: (5<=p10)
states: 1,350,610,572 (9)
abstracting: (5<=p15)
states: 1,350,610,572 (9)
abstracting: (5<=p9)
states: 1,575,712,334 (9)
abstracting: (5<=p9)
states: 1,575,712,334 (9)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (5<=p24)
states: 1,575,712,334 (9)
.....................
EG iterations: 21
abstracting: (5<=p5)
states: 1,350,610,572 (9)
abstracting: (4<=p8)
states: 2,138,466,739 (9)
abstracting: (5<=p14)
states: 1,575,712,334 (9)
abstracting: (4<=p8)
states: 2,138,466,739 (9)
abstracting: (4<=p8)
states: 2,138,466,739 (9)
.................
EG iterations: 17
abstracting: (3<=p18)
states: 4,502,035,240 (9)
abstracting: (2<=p17)
states: 4,164,382,597 (9)
abstracting: (3<=p0)
states: 4,502,035,240 (9)
.....................
EG iterations: 21
abstracting: (3<=p13)
states: 4,502,035,240 (9)
abstracting: (2<=p22)
states: 4,164,382,597 (9)
.
EG iterations: 1
abstracting: (2<=p12)
states: 4,164,382,597 (9)
abstracting: (3<=p13)
states: 4,502,035,240 (9)
.abstracting: (3<=p20)
states: 4,502,035,240 (9)
abstracting: (2<=p7)
states: 4,164,382,597 (9)
abstracting: (4<=p8)
states: 2,138,466,739 (9)
.abstracting: (p10<=4)
states: 10,242,130,171 (10)
abstracting: (5<=p9)
states: 1,575,712,334 (9)
abstracting: (5<=p10)
states: 1,350,610,572 (9)
abstracting: (5<=p15)
states: 1,350,610,572 (9)
abstracting: (5<=p9)
states: 1,575,712,334 (9)
abstracting: (5<=p9)
states: 1,575,712,334 (9)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (5<=p24)
states: 1,575,712,334 (9)
.....................
EG iterations: 21
abstracting: (5<=p5)
states: 1,350,610,572 (9)
abstracting: (4<=p8)
states: 2,138,466,739 (9)
abstracting: (5<=p14)
states: 1,575,712,334 (9)
abstracting: (4<=p8)
states: 2,138,466,739 (9)
abstracting: (4<=p8)
states: 2,138,466,739 (9)
.................
EG iterations: 17
abstracting: (3<=p18)
states: 4,502,035,240 (9)
abstracting: (2<=p17)
states: 4,164,382,597 (9)
abstracting: (3<=p0)
states: 4,502,035,240 (9)
.....................
EG iterations: 21
.
EG iterations: 1
-> the formula is FALSE

FORMULA JoinFreeModules-PT-0005-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.103sec

totally nodes used: 275759 (2.8e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 645412 415492 1060904
used/not used/entry size/cache size: 633851 66475013 16 1024MB
basic ops cache: hits/miss/sum: 272926 154267 427193
used/not used/entry size/cache size: 308524 16468692 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: 15851 8579 24430
used/not used/entry size/cache size: 8578 8380030 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 66852660
1 249196
2 5228
3 635
4 130
5 142
6 48
7 23
8 100
9 21
>= 10 681

Total processing time: 0m 4.477sec


BK_STOP 1679452067596

--------------------
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 CTLFireability -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:443 (10), effective:100 (2)

initing FirstDep: 0m 0.000sec


iterations count:213 (5), effective:69 (1)

iterations count:80 (1), effective:12 (0)

iterations count:89 (2), effective:14 (0)

iterations count:47 (1), effective:2 (0)

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

iterations count:68 (1), effective:10 (0)

iterations count:64 (1), effective:6 (0)

iterations count:517 (12), effective:131 (3)

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

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

iterations count:65 (1), effective:5 (0)

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

iterations count:68 (1), effective:8 (0)

iterations count:68 (1), effective:7 (0)

iterations count:47 (1), effective:2 (0)

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

iterations count:68 (1), effective:8 (0)

iterations count:68 (1), effective:7 (0)

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

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

iterations count:68 (1), effective:8 (0)

iterations count:68 (1), effective:7 (0)

iterations count:84 (2), effective:18 (0)

iterations count:84 (2), effective:18 (0)

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

iterations count:84 (2), effective:18 (0)

iterations count:83 (2), effective:16 (0)

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

iterations count:65 (1), effective:5 (0)

iterations count:621 (15), effective:148 (3)

iterations count:47 (1), effective:2 (0)

iterations count:90 (2), effective:15 (0)

iterations count:126 (3), effective:25 (0)

iterations count:84 (2), effective:18 (0)

iterations count:84 (2), effective:18 (0)

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

iterations count:84 (2), effective:18 (0)

iterations count:83 (2), effective:16 (0)

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

iterations count:65 (1), effective:5 (0)

iterations count:46 (1), effective:5 (0)

iterations count:84 (2), effective:18 (0)

iterations count:84 (2), effective:18 (0)

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

iterations count:84 (2), effective:18 (0)

iterations count:83 (2), effective:16 (0)

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

iterations count:65 (1), effective:5 (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="JoinFreeModules-PT-0005"
export BK_EXAMINATION="CTLFireability"
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 JoinFreeModules-PT-0005, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r234-tall-167856419900154"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/JoinFreeModules-PT-0005.tgz
mv JoinFreeModules-PT-0005 execution
cd execution
if [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;