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

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

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
12388.052 178325.00 183851.00 1585.50 TTTFFTTFTTFTTTFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r170-tall-167838857800842.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is GPPP-PT-C0100N0000000010, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r170-tall-167838857800842
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.4K Feb 26 10:45 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Feb 26 10:45 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Feb 26 10:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 10:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 16:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:10 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Feb 25 16:10 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 16:10 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:46 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 128K Feb 26 10:46 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 10:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Feb 26 10:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 16:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 16:10 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 17 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1 Mar 5 18:22 large_marking
-rw-r--r-- 1 mcc users 21K Mar 5 18:22 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME GPPP-PT-C0100N0000000010-CTLFireability-00
FORMULA_NAME GPPP-PT-C0100N0000000010-CTLFireability-01
FORMULA_NAME GPPP-PT-C0100N0000000010-CTLFireability-02
FORMULA_NAME GPPP-PT-C0100N0000000010-CTLFireability-03
FORMULA_NAME GPPP-PT-C0100N0000000010-CTLFireability-04
FORMULA_NAME GPPP-PT-C0100N0000000010-CTLFireability-05
FORMULA_NAME GPPP-PT-C0100N0000000010-CTLFireability-06
FORMULA_NAME GPPP-PT-C0100N0000000010-CTLFireability-07
FORMULA_NAME GPPP-PT-C0100N0000000010-CTLFireability-08
FORMULA_NAME GPPP-PT-C0100N0000000010-CTLFireability-09
FORMULA_NAME GPPP-PT-C0100N0000000010-CTLFireability-10
FORMULA_NAME GPPP-PT-C0100N0000000010-CTLFireability-11
FORMULA_NAME GPPP-PT-C0100N0000000010-CTLFireability-12
FORMULA_NAME GPPP-PT-C0100N0000000010-CTLFireability-13
FORMULA_NAME GPPP-PT-C0100N0000000010-CTLFireability-14
FORMULA_NAME GPPP-PT-C0100N0000000010-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678642261125

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=GPPP-PT-C0100N0000000010
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-12 17:31:02] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-12 17:31:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-12 17:31:02] [INFO ] Load time of PNML (sax parser for PT used): 24 ms
[2023-03-12 17:31:02] [INFO ] Transformed 33 places.
[2023-03-12 17:31:02] [INFO ] Transformed 22 transitions.
[2023-03-12 17:31:02] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 83 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 11 ms.
Initial state reduction rules removed 3 formulas.
FORMULA GPPP-PT-C0100N0000000010-CTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000010-CTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0100N0000000010-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 33 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 33/33 places, 22/22 transitions.
Applied a total of 0 rules in 10 ms. Remains 33 /33 variables (removed 0) and now considering 22/22 (removed 0) transitions.
// Phase 1: matrix 22 rows 33 cols
[2023-03-12 17:31:02] [INFO ] Computed 12 place invariants in 8 ms
[2023-03-12 17:31:03] [INFO ] Dead Transitions using invariants and state equation in 367 ms found 0 transitions.
[2023-03-12 17:31:03] [INFO ] Invariant cache hit.
[2023-03-12 17:31:03] [INFO ] Implicit Places using invariants in 40 ms returned []
[2023-03-12 17:31:03] [INFO ] Invariant cache hit.
[2023-03-12 17:31:03] [INFO ] Implicit Places using invariants and state equation in 46 ms returned [2]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 89 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/33 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 490 ms. Remains : 32/33 places, 22/22 transitions.
Support contains 30 out of 32 places after structural reductions.
[2023-03-12 17:31:03] [INFO ] Flatten gal took : 15 ms
[2023-03-12 17:31:03] [INFO ] Flatten gal took : 7 ms
[2023-03-12 17:31:03] [INFO ] Input system was already deterministic with 22 transitions.
Incomplete random walk after 10001 steps, including 22 resets, run finished after 175 ms. (steps per millisecond=57 ) properties (out of 39) seen :35
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 113 ms. (steps per millisecond=88 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10004 steps, including 4 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 22 rows 32 cols
[2023-03-12 17:31:03] [INFO ] Computed 11 place invariants in 1 ms
[2023-03-12 17:31:03] [INFO ] [Real]Absence check using 5 positive place invariants in 3 ms returned sat
[2023-03-12 17:31:04] [INFO ] [Real]Absence check using 5 positive and 6 generalized place invariants in 4 ms returned sat
[2023-03-12 17:31:04] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0 real:1
[2023-03-12 17:31:04] [INFO ] [Nat]Absence check using 5 positive place invariants in 1 ms returned sat
[2023-03-12 17:31:04] [INFO ] [Nat]Absence check using 5 positive and 6 generalized place invariants in 306 ms returned sat
[2023-03-12 17:31:04] [INFO ] After 416ms SMT Verify possible using all constraints in natural domain returned unsat :4 sat :0
Fused 4 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 1 ms.
Successfully simplified 4 atomic propositions for a total of 13 simplifications.
[2023-03-12 17:31:04] [INFO ] Flatten gal took : 5 ms
[2023-03-12 17:31:04] [INFO ] Flatten gal took : 4 ms
[2023-03-12 17:31:04] [INFO ] Input system was already deterministic with 22 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 17:31:04] [INFO ] Invariant cache hit.
[2023-03-12 17:31:04] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 41 ms. Remains : 32/32 places, 22/22 transitions.
[2023-03-12 17:31:04] [INFO ] Flatten gal took : 3 ms
[2023-03-12 17:31:04] [INFO ] Flatten gal took : 3 ms
[2023-03-12 17:31:04] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 17:31:04] [INFO ] Invariant cache hit.
[2023-03-12 17:31:04] [INFO ] Dead Transitions using invariants and state equation in 42 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 43 ms. Remains : 32/32 places, 22/22 transitions.
[2023-03-12 17:31:04] [INFO ] Flatten gal took : 3 ms
[2023-03-12 17:31:04] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:31:04] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 17:31:04] [INFO ] Invariant cache hit.
[2023-03-12 17:31:04] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 40 ms. Remains : 32/32 places, 22/22 transitions.
[2023-03-12 17:31:04] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:31:04] [INFO ] Flatten gal took : 1 ms
[2023-03-12 17:31:04] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 17:31:04] [INFO ] Invariant cache hit.
[2023-03-12 17:31:04] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 32/32 places, 22/22 transitions.
[2023-03-12 17:31:04] [INFO ] Flatten gal took : 1 ms
[2023-03-12 17:31:04] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:31:04] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 17:31:04] [INFO ] Invariant cache hit.
[2023-03-12 17:31:04] [INFO ] Dead Transitions using invariants and state equation in 32 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 32/32 places, 22/22 transitions.
[2023-03-12 17:31:04] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:31:04] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:31:04] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 17:31:04] [INFO ] Invariant cache hit.
[2023-03-12 17:31:04] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35 ms. Remains : 32/32 places, 22/22 transitions.
[2023-03-12 17:31:04] [INFO ] Flatten gal took : 1 ms
[2023-03-12 17:31:04] [INFO ] Flatten gal took : 1 ms
[2023-03-12 17:31:04] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 17:31:04] [INFO ] Invariant cache hit.
[2023-03-12 17:31:04] [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 : 32/32 places, 22/22 transitions.
[2023-03-12 17:31:04] [INFO ] Flatten gal took : 6 ms
[2023-03-12 17:31:04] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:31:04] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 17:31:04] [INFO ] Invariant cache hit.
[2023-03-12 17:31:04] [INFO ] Dead Transitions using invariants and state equation in 34 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36 ms. Remains : 32/32 places, 22/22 transitions.
[2023-03-12 17:31:04] [INFO ] Flatten gal took : 1 ms
[2023-03-12 17:31:04] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:31:04] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 17:31:04] [INFO ] Invariant cache hit.
[2023-03-12 17:31:04] [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 : 32/32 places, 22/22 transitions.
[2023-03-12 17:31:04] [INFO ] Flatten gal took : 1 ms
[2023-03-12 17:31:04] [INFO ] Flatten gal took : 1 ms
[2023-03-12 17:31:04] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 17:31:04] [INFO ] Invariant cache hit.
[2023-03-12 17:31:04] [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 : 32/32 places, 22/22 transitions.
[2023-03-12 17:31:04] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:31:04] [INFO ] Flatten gal took : 1 ms
[2023-03-12 17:31:04] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 17:31:04] [INFO ] Invariant cache hit.
[2023-03-12 17:31:05] [INFO ] Dead Transitions using invariants and state equation in 33 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33 ms. Remains : 32/32 places, 22/22 transitions.
[2023-03-12 17:31:05] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:31:05] [INFO ] Flatten gal took : 1 ms
[2023-03-12 17:31:05] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 17:31:05] [INFO ] Invariant cache hit.
[2023-03-12 17:31:05] [INFO ] Dead Transitions using invariants and state equation in 30 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32 ms. Remains : 32/32 places, 22/22 transitions.
[2023-03-12 17:31:05] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:31:05] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:31:05] [INFO ] Input system was already deterministic with 22 transitions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 22/22 transitions.
Applied a total of 0 rules in 0 ms. Remains 32 /32 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2023-03-12 17:31:05] [INFO ] Invariant cache hit.
[2023-03-12 17:31:05] [INFO ] Dead Transitions using invariants and state equation in 41 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 42 ms. Remains : 32/32 places, 22/22 transitions.
[2023-03-12 17:31:05] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:31:05] [INFO ] Flatten gal took : 4 ms
[2023-03-12 17:31:05] [INFO ] Input system was already deterministic with 22 transitions.
[2023-03-12 17:31:05] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:31:05] [INFO ] Flatten gal took : 2 ms
[2023-03-12 17:31:05] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLFireability.sr.xml took 2 ms.
[2023-03-12 17:31:05] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 32 places, 22 transitions and 81 arcs took 0 ms.
Total runtime 2572 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: 32 NrTr: 22 NrArc: 81)

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

net check time: 0m 0.000sec

init dd package: 0m 2.738sec


RS generation: 0m 0.171sec


-> reachability set: #nodes 29418 (2.9e+04) #states 14,184,612,091 (10)



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

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

abstracting: (p22<=0)
states: 7,183,405,714 (9)
abstracting: (p2<=0)
states: 346,229,170 (8)
abstracting: (1<=0)
states: 0
...-> the formula is TRUE

FORMULA GPPP-PT-C0100N0000000010-CTLFireability-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.581sec

checking: EF [AX [EF [AX [[p10<=0 | [p11<=0 | p30<=699]]]]]]
normalized: E [true U ~ [EX [~ [E [true U ~ [EX [~ [[p10<=0 | [p11<=0 | p30<=699]]]]]]]]]]

abstracting: (p30<=699)
states: 14,157,899,025 (10)
abstracting: (p11<=0)
states: 8,156,888,251 (9)
abstracting: (p10<=0)
states: 14,168,881,627 (10)
..-> the formula is TRUE

FORMULA GPPP-PT-C0100N0000000010-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.145sec

checking: AF [EG [EX [[1<=p10 & [1<=p11 & 700<=p30]]]]]
normalized: ~ [EG [~ [EG [EX [[1<=p10 & [1<=p11 & 700<=p30]]]]]]]

abstracting: (700<=p30)
states: 26,713,066 (7)
abstracting: (1<=p11)
states: 6,027,723,840 (9)
abstracting: (1<=p10)
states: 15,730,464 (7)
...
EG iterations: 2
.......................................................................................................................................................................................................
EG iterations: 199
-> the formula is FALSE

FORMULA GPPP-PT-C0100N0000000010-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.424sec

checking: EF [AG [[[EX [[1<=p18 & 1<=p21]] | EX [[2<=p3 & [1<=p14 & 1<=p27]]]] | [p7<=0 | p29<=0]]]]
normalized: E [true U ~ [E [true U ~ [[[EX [[1<=p18 & 1<=p21]] | EX [[2<=p3 & [1<=p14 & 1<=p27]]]] | [p7<=0 | p29<=0]]]]]]

abstracting: (p29<=0)
states: 596,317 (5)
abstracting: (p7<=0)
states: 842,012,689 (8)
abstracting: (1<=p27)
states: 14,184,612,049 (10)
abstracting: (1<=p14)
states: 13,128,134,451 (10)
abstracting: (2<=p3)
states: 12,967,632,465 (10)
.abstracting: (1<=p21)
states: 6,495,048,153 (9)
abstracting: (1<=p18)
states: 14,184,612,090 (10)
.-> the formula is TRUE

FORMULA GPPP-PT-C0100N0000000010-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.648sec

checking: E [p16<=0 U [A [[AG [~ [[p2<=0 | p22<=0]]] & [[700<=p1 & 700<=p24] | [1<=p10 & [1<=p11 & 700<=p30]]]] U [1<=p17 & 1<=p18]] & EX [0<=0]]]
normalized: E [p16<=0 U [[~ [EG [~ [[1<=p17 & 1<=p18]]]] & ~ [E [~ [[1<=p17 & 1<=p18]] U [~ [[1<=p17 & 1<=p18]] & ~ [[[[1<=p10 & [1<=p11 & 700<=p30]] | [700<=p1 & 700<=p24]] & ~ [E [true U [p2<=0 | p22<=0]]]]]]]]] & EX [0<=0]]]

abstracting: (0<=0)
states: 14,184,612,091 (10)
.abstracting: (p22<=0)
states: 7,183,405,714 (9)
abstracting: (p2<=0)
states: 346,229,170 (8)
abstracting: (700<=p24)
states: 0
abstracting: (700<=p1)
states: 0
abstracting: (700<=p30)
states: 26,713,066 (7)
abstracting: (1<=p11)
states: 6,027,723,840 (9)
abstracting: (1<=p10)
states: 15,730,464 (7)
abstracting: (1<=p18)
states: 14,184,612,090 (10)
abstracting: (1<=p17)
states: 6,013,612,704 (9)
abstracting: (1<=p18)
states: 14,184,612,090 (10)
abstracting: (1<=p17)
states: 6,013,612,704 (9)
abstracting: (1<=p18)
states: 14,184,612,090 (10)
abstracting: (1<=p17)
states: 6,013,612,704 (9)
.
EG iterations: 1
abstracting: (p16<=0)
states: 8,156,888,251 (9)
-> the formula is TRUE

FORMULA GPPP-PT-C0100N0000000010-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.616sec

checking: E [~ [[AX [A [[1<=p1 & 1<=p25] U 1<=p20]] & AF [AX [[1<=p14 & 300<=p26]]]]] U EG [~ [[~ [AG [[1<=p1 & 1<=p13]]] | AF [[1<=p10 & [1<=p11 & 700<=p30]]]]]]]
normalized: E [~ [[~ [EG [EX [~ [[1<=p14 & 300<=p26]]]]] & ~ [EX [~ [[~ [EG [~ [1<=p20]]] & ~ [E [~ [1<=p20] U [~ [[1<=p1 & 1<=p25]] & ~ [1<=p20]]]]]]]]]] U EG [~ [[~ [EG [~ [[1<=p10 & [1<=p11 & 700<=p30]]]]] | E [true U ~ [[1<=p1 & 1<=p13]]]]]]]

abstracting: (1<=p13)
states: 2,555,110,735 (9)
abstracting: (1<=p1)
states: 13,128,134,452 (10)
abstracting: (700<=p30)
states: 26,713,066 (7)
abstracting: (1<=p11)
states: 6,027,723,840 (9)
abstracting: (1<=p10)
states: 15,730,464 (7)
.............................................................................................................................................................................................................................................................................
EG iterations: 269
.
EG iterations: 1
abstracting: (1<=p20)
states: 6,495,048,153 (9)
abstracting: (1<=p25)
states: 14,184,612,090 (10)
abstracting: (1<=p1)
states: 13,128,134,452 (10)
abstracting: (1<=p20)
states: 6,495,048,153 (9)
abstracting: (1<=p20)
states: 6,495,048,153 (9)
.............................................................................................................................................................................................................................................................................................................................................................
EG iterations: 349
.abstracting: (300<=p26)
states: 42
abstracting: (1<=p14)
states: 13,128,134,451 (10)
..........................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 377
-> the formula is FALSE

FORMULA GPPP-PT-C0100N0000000010-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m24.138sec

checking: AG [AX [[[p20<=0 & [1<=p8 & 1<=p9]] & [[p1<=0 | p25<=0] & [[p10<=0 | [p11<=0 | p30<=699]] & [p18<=0 | p21<=0]]]]]]
normalized: ~ [E [true U EX [~ [[[[p1<=0 | p25<=0] & [[p18<=0 | p21<=0] & [p10<=0 | [p11<=0 | p30<=699]]]] & [p20<=0 & [1<=p8 & 1<=p9]]]]]]]

abstracting: (1<=p9)
states: 10,386,285 (7)
abstracting: (1<=p8)
states: 13,342,003,323 (10)
abstracting: (p20<=0)
states: 7,689,563,938 (9)
abstracting: (p30<=699)
states: 14,157,899,025 (10)
abstracting: (p11<=0)
states: 8,156,888,251 (9)
abstracting: (p10<=0)
states: 14,168,881,627 (10)
abstracting: (p21<=0)
states: 7,689,563,938 (9)
abstracting: (p18<=0)
states: 1
abstracting: (p25<=0)
states: 1
abstracting: (p1<=0)
states: 1,056,477,639 (9)
.-> the formula is FALSE

FORMULA GPPP-PT-C0100N0000000010-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.307sec

checking: AG [EF [[[A [[1<=p1 & 1<=p13] U 1<=p15] & 1<=p8] & [1<=p12 & [AX [[1<=p14 & 300<=p26]] | [[1<=p17 & 1<=p18] | [1<=p4 & 1<=p5]]]]]]]
normalized: ~ [E [true U ~ [E [true U [[1<=p12 & [[[1<=p4 & 1<=p5] | [1<=p17 & 1<=p18]] | ~ [EX [~ [[1<=p14 & 300<=p26]]]]]] & [1<=p8 & [~ [EG [~ [1<=p15]]] & ~ [E [~ [1<=p15] U [~ [[1<=p1 & 1<=p13]] & ~ [1<=p15]]]]]]]]]]]

abstracting: (1<=p15)
states: 2,361,709,584 (9)
abstracting: (1<=p13)
states: 2,555,110,735 (9)
abstracting: (1<=p1)
states: 13,128,134,452 (10)
abstracting: (1<=p15)
states: 2,361,709,584 (9)
abstracting: (1<=p15)
states: 2,361,709,584 (9)
.
EG iterations: 1
abstracting: (1<=p8)
states: 13,342,003,323 (10)
abstracting: (300<=p26)
states: 42
abstracting: (1<=p14)
states: 13,128,134,451 (10)
.abstracting: (1<=p18)
states: 14,184,612,090 (10)
abstracting: (1<=p17)
states: 6,013,612,704 (9)
abstracting: (1<=p5)
states: 12,955,699,758 (10)
abstracting: (1<=p4)
states: 13,466,675,506 (10)
abstracting: (1<=p12)
states: 942,157,236 (8)
-> the formula is FALSE

FORMULA GPPP-PT-C0100N0000000010-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.521sec

checking: AF [[[AF [[1<=p1 & 1<=p13]] | [AX [[p14<=0 | p26<=299]] | [1<=p17 & 1<=p18]]] | [[1<=p14 & 300<=p26] | [[1<=p8 & 1<=p12] | [1<=p18 & 1<=p21]]]]]
normalized: ~ [EG [~ [[[[[1<=p18 & 1<=p21] | [1<=p8 & 1<=p12]] | [1<=p14 & 300<=p26]] | [[[1<=p17 & 1<=p18] | ~ [EX [~ [[p14<=0 | p26<=299]]]]] | ~ [EG [~ [[1<=p1 & 1<=p13]]]]]]]]]

abstracting: (1<=p13)
states: 2,555,110,735 (9)
abstracting: (1<=p1)
states: 13,128,134,452 (10)
......................................................................................................................................................................................................................................................................................
EG iterations: 278
abstracting: (p26<=299)
states: 14,184,612,049 (10)
abstracting: (p14<=0)
states: 1,056,477,640 (9)
.abstracting: (1<=p18)
states: 14,184,612,090 (10)
abstracting: (1<=p17)
states: 6,013,612,704 (9)
abstracting: (300<=p26)
states: 42
abstracting: (1<=p14)
states: 13,128,134,451 (10)
abstracting: (1<=p12)
states: 942,157,236 (8)
abstracting: (1<=p8)
states: 13,342,003,323 (10)
abstracting: (1<=p21)
states: 6,495,048,153 (9)
abstracting: (1<=p18)
states: 14,184,612,090 (10)
..
EG iterations: 2
-> the formula is TRUE

FORMULA GPPP-PT-C0100N0000000010-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 7.095sec

checking: A [A [AX [AF [~ [[1<=p7 & 1<=p29]]]] U [EX [[EG [[1<=p7 & 1<=p29]] | AG [1<=p23]]] | EG [~ [AX [1<=0]]]]] U AX [[E [A [~ [[p2<=0 | p22<=0]] U 1<=p19] U p23<=0] | AG [A [[1<=p4 & 1<=p5] U [1<=p10 & [1<=p11 & 700<=p30]]]]]]]
normalized: [~ [EG [EX [~ [[~ [E [true U ~ [[~ [EG [~ [[1<=p10 & [1<=p11 & 700<=p30]]]]] & ~ [E [~ [[1<=p10 & [1<=p11 & 700<=p30]]] U [~ [[1<=p4 & 1<=p5]] & ~ [[1<=p10 & [1<=p11 & 700<=p30]]]]]]]]]] | E [[~ [EG [~ [1<=p19]]] & ~ [E [~ [1<=p19] U [[p2<=0 | p22<=0] & ~ [1<=p19]]]]] U p23<=0]]]]]] & ~ [E [EX [~ [[~ [E [true U ~ [[~ [EG [~ [[1<=p10 & [1<=p11 & 700<=p30]]]]] & ~ [E [~ [[1<=p10 & [1<=p11 & 700<=p30]]] U [~ [[1<=p4 & 1<=p5]] & ~ [[1<=p10 & [1<=p11 & 700<=p30]]]]]]]]]] | E [[~ [EG [~ [1<=p19]]] & ~ [E [~ [1<=p19] U [[p2<=0 | p22<=0] & ~ [1<=p19]]]]] U p23<=0]]]] U [~ [[~ [EG [~ [[EG [EX [~ [1<=0]]] | EX [[~ [E [true U ~ [1<=p23]]] | EG [[1<=p7 & 1<=p29]]]]]]]] & ~ [E [~ [[EG [EX [~ [1<=0]]] | EX [[~ [E [true U ~ [1<=p23]]] | EG [[1<=p7 & 1<=p29]]]]]] U [EX [EG [[1<=p7 & 1<=p29]]] & ~ [[EG [EX [~ [1<=0]]] | EX [[~ [E [true U ~ [1<=p23]]] | EG [[1<=p7 & 1<=p29]]]]]]]]]]] & EX [~ [[~ [E [true U ~ [[~ [EG [~ [[1<=p10 & [1<=p11 & 700<=p30]]]]] & ~ [E [~ [[1<=p10 & [1<=p11 & 700<=p30]]] U [~ [[1<=p4 & 1<=p5]] & ~ [[1<=p10 & [1<=p11 & 700<=p30]]]]]]]]]] | E [[~ [EG [~ [1<=p19]]] & ~ [E [~ [1<=p19] U [[p2<=0 | p22<=0] & ~ [1<=p19]]]]] U p23<=0]]]]]]]]

abstracting: (p23<=0)
states: 14,184,612,090 (10)
abstracting: (1<=p19)
states: 6,495,048,153 (9)
abstracting: (p22<=0)
states: 7,183,405,714 (9)
abstracting: (p2<=0)
states: 346,229,170 (8)
abstracting: (1<=p19)
states: 6,495,048,153 (9)
abstracting: (1<=p19)
states: 6,495,048,153 (9)
...........................................................................................................................................................................................................................................................................................................................................................
EG iterations: 347
abstracting: (700<=p30)
states: 26,713,066 (7)
abstracting: (1<=p11)
states: 6,027,723,840 (9)
abstracting: (1<=p10)
states: 15,730,464 (7)
abstracting: (1<=p5)
states: 12,955,699,758 (10)
abstracting: (1<=p4)
states: 13,466,675,506 (10)
abstracting: (700<=p30)
states: 26,713,066 (7)
abstracting: (1<=p11)
states: 6,027,723,840 (9)
abstracting: (1<=p10)
states: 15,730,464 (7)
abstracting: (700<=p30)
states: 26,713,066 (7)
abstracting: (1<=p11)
states: 6,027,723,840 (9)
abstracting: (1<=p10)
states: 15,730,464 (7)
.............................................................................................................................................................................................................................................................................
EG iterations: 269
.abstracting: (1<=p29)
states: 14,184,015,774 (10)
abstracting: (1<=p7)
states: 13,342,599,402 (10)
.......................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 375
abstracting: (1<=p23)
states: 1
.abstracting: (1<=0)
states: 0
..........................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 377
abstracting: (1<=p29)
states: 14,184,015,774 (10)
abstracting: (1<=p7)
states: 13,342,599,402 (10)
.......................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 375
.abstracting: (1<=p29)
states: 14,184,015,774 (10)
abstracting: (1<=p7)
states: 13,342,599,402 (10)
.......................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 375
abstracting: (1<=p23)
states: 1
.abstracting: (1<=0)
states: 0
..........................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 377
abstracting: (1<=p29)
states: 14,184,015,774 (10)
abstracting: (1<=p7)
states: 13,342,599,402 (10)
.......................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 375
abstracting: (1<=p23)
states: 1
.abstracting: (1<=0)
states: 0
..........................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 377
.
EG iterations: 1
abstracting: (p23<=0)
states: 14,184,612,090 (10)
abstracting: (1<=p19)
states: 6,495,048,153 (9)
abstracting: (p22<=0)
states: 7,183,405,714 (9)
abstracting: (p2<=0)
states: 346,229,170 (8)
abstracting: (1<=p19)
states: 6,495,048,153 (9)
abstracting: (1<=p19)
states: 6,495,048,153 (9)
...........................................................................................................................................................................................................................................................................................................................................................
EG iterations: 347
abstracting: (700<=p30)
states: 26,713,066 (7)
abstracting: (1<=p11)
states: 6,027,723,840 (9)
abstracting: (1<=p10)
states: 15,730,464 (7)
abstracting: (1<=p5)
states: 12,955,699,758 (10)
abstracting: (1<=p4)
states: 13,466,675,506 (10)
abstracting: (700<=p30)
states: 26,713,066 (7)
abstracting: (1<=p11)
states: 6,027,723,840 (9)
abstracting: (1<=p10)
states: 15,730,464 (7)
abstracting: (700<=p30)
states: 26,713,066 (7)
abstracting: (1<=p11)
states: 6,027,723,840 (9)
abstracting: (1<=p10)
states: 15,730,464 (7)
.............................................................................................................................................................................................................................................................................
EG iterations: 269
.abstracting: (p23<=0)
states: 14,184,612,090 (10)
abstracting: (1<=p19)
states: 6,495,048,153 (9)
abstracting: (p22<=0)
states: 7,183,405,714 (9)
abstracting: (p2<=0)
states: 346,229,170 (8)
abstracting: (1<=p19)
states: 6,495,048,153 (9)
abstracting: (1<=p19)
states: 6,495,048,153 (9)
...........................................................................................................................................................................................................................................................................................................................................................
EG iterations: 347
abstracting: (700<=p30)
states: 26,713,066 (7)
abstracting: (1<=p11)
states: 6,027,723,840 (9)
abstracting: (1<=p10)
states: 15,730,464 (7)
abstracting: (1<=p5)
states: 12,955,699,758 (10)
abstracting: (1<=p4)
states: 13,466,675,506 (10)
abstracting: (700<=p30)
states: 26,713,066 (7)
abstracting: (1<=p11)
states: 6,027,723,840 (9)
abstracting: (1<=p10)
states: 15,730,464 (7)
abstracting: (700<=p30)
states: 26,713,066 (7)
abstracting: (1<=p11)
states: 6,027,723,840 (9)
abstracting: (1<=p10)
states: 15,730,464 (7)
.............................................................................................................................................................................................................................................................................
EG iterations: 269
..
EG iterations: 1
-> the formula is TRUE

FORMULA GPPP-PT-C0100N0000000010-CTLFireability-05 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m22.486sec

checking: AX [[[EX [A [EF [1<=p11] U A [1<=p16 U 1<=p16]]] | AX [[~ [E [[1<=p18 & 1<=p21] U 1<=p23]] & A [[1<=p17 & 1<=p18] U [1<=p10 & [1<=p11 & 700<=p30]]]]]] | [[[EX [p23<=0] & AG [[1<=p17 & 1<=p18]]] & [1<=p23 & [AG [1<=p15] | [p15<=0 | [[1<=p1 & 1<=p13] & [1<=p2 & 1<=p22]]]]]] | [[p1<=0 | p13<=0] & [EX [1<=p19] | EF [[1<=p10 & [1<=p11 & 700<=p30]]]]]]]]
normalized: ~ [EX [~ [[[[[E [true U [1<=p10 & [1<=p11 & 700<=p30]]] | EX [1<=p19]] & [p1<=0 | p13<=0]] | [[1<=p23 & [~ [E [true U ~ [1<=p15]]] | [p15<=0 | [[1<=p2 & 1<=p22] & [1<=p1 & 1<=p13]]]]] & [~ [E [true U ~ [[1<=p17 & 1<=p18]]]] & EX [p23<=0]]]] | [~ [EX [~ [[[~ [EG [~ [[1<=p10 & [1<=p11 & 700<=p30]]]]] & ~ [E [~ [[1<=p10 & [1<=p11 & 700<=p30]]] U [~ [[1<=p17 & 1<=p18]] & ~ [[1<=p10 & [1<=p11 & 700<=p30]]]]]]] & ~ [E [[1<=p18 & 1<=p21] U 1<=p23]]]]]] | EX [[~ [EG [~ [[~ [EG [~ [1<=p16]]] & ~ [E [~ [1<=p16] U [~ [1<=p16] & ~ [1<=p16]]]]]]]] & ~ [E [~ [[~ [EG [~ [1<=p16]]] & ~ [E [~ [1<=p16] U [~ [1<=p16] & ~ [1<=p16]]]]]] U [~ [E [true U 1<=p11]] & ~ [[~ [EG [~ [1<=p16]]] & ~ [E [~ [1<=p16] U [~ [1<=p16] & ~ [1<=p16]]]]]]]]]]]]]]]]

abstracting: (1<=p16)
states: 6,027,723,840 (9)
abstracting: (1<=p16)
states: 6,027,723,840 (9)
abstracting: (1<=p16)
states: 6,027,723,840 (9)
abstracting: (1<=p16)
states: 6,027,723,840 (9)
.........................................................................................................................................................................................................................................................................................................................................................
EG iterations: 345
abstracting: (1<=p11)
states: 6,027,723,840 (9)
abstracting: (1<=p16)
states: 6,027,723,840 (9)
abstracting: (1<=p16)
states: 6,027,723,840 (9)
abstracting: (1<=p16)
states: 6,027,723,840 (9)
abstracting: (1<=p16)
states: 6,027,723,840 (9)
.........................................................................................................................................................................................................................................................................................................................................................
EG iterations: 345
abstracting: (1<=p16)
states: 6,027,723,840 (9)
abstracting: (1<=p16)
states: 6,027,723,840 (9)
abstracting: (1<=p16)
states: 6,027,723,840 (9)
abstracting: (1<=p16)
states: 6,027,723,840 (9)
.........................................................................................................................................................................................................................................................................................................................................................
EG iterations: 345
.........................................................................................................................................................................................................................................................................................................................................................
EG iterations: 345
.abstracting: (1<=p23)
states: 1
abstracting: (1<=p21)
states: 6,495,048,153 (9)
abstracting: (1<=p18)
states: 14,184,612,090 (10)
abstracting: (700<=p30)
states: 26,713,066 (7)
abstracting: (1<=p11)
states: 6,027,723,840 (9)
abstracting: (1<=p10)
states: 15,730,464 (7)
abstracting: (1<=p18)
states: 14,184,612,090 (10)
abstracting: (1<=p17)
states: 6,013,612,704 (9)
abstracting: (700<=p30)
states: 26,713,066 (7)
abstracting: (1<=p11)
states: 6,027,723,840 (9)
abstracting: (1<=p10)
states: 15,730,464 (7)
abstracting: (700<=p30)
states: 26,713,066 (7)
abstracting: (1<=p11)
states: 6,027,723,840 (9)
abstracting: (1<=p10)
states: 15,730,464 (7)
.............................................................................................................................................................................................................................................................................
EG iterations: 269
.abstracting: (p23<=0)
states: 14,184,612,090 (10)
.abstracting: (1<=p18)
states: 14,184,612,090 (10)
abstracting: (1<=p17)
states: 6,013,612,704 (9)
abstracting: (1<=p13)
states: 2,555,110,735 (9)
abstracting: (1<=p1)
states: 13,128,134,452 (10)
abstracting: (1<=p22)
states: 7,001,206,377 (9)
abstracting: (1<=p2)
states: 13,838,382,921 (10)
abstracting: (p15<=0)
states: 11,822,902,507 (10)
abstracting: (1<=p15)
states: 2,361,709,584 (9)
abstracting: (1<=p23)
states: 1
abstracting: (p13<=0)
states: 11,629,501,356 (10)
abstracting: (p1<=0)
states: 1,056,477,639 (9)
abstracting: (1<=p19)
states: 6,495,048,153 (9)
.abstracting: (700<=p30)
states: 26,713,066 (7)
abstracting: (1<=p11)
states: 6,027,723,840 (9)
abstracting: (1<=p10)
states: 15,730,464 (7)
.-> the formula is TRUE

FORMULA GPPP-PT-C0100N0000000010-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.517sec

checking: AF [[[1<=p15 & [2<=p3 & 1<=p14]] & [[1<=p27 & 1<=p2] & [1<=p22 & [[1<=p8 & 1<=p9] | [[EX [[1<=p7 & 200<=p28]] & [[1<=p7 & 1<=p29] | [[p1<=699 | p24<=699] & [p10<=0 | [p11<=0 | p30<=699]]]]] | [[[E [1<=p15 U [2<=p3 & [1<=p14 & 1<=p27]]] & [1<=p17 & 1<=p18]] | [AG [1<=p16] & AF [1<=p11]]] & [EF [[p10<=0 | [p11<=0 | p30<=699]]] | AG [p16<=0]]]]]]]]]
normalized: ~ [EG [~ [[[[1<=p22 & [[[[~ [E [true U ~ [p16<=0]]] | E [true U [p10<=0 | [p11<=0 | p30<=699]]]] & [[~ [EG [~ [1<=p11]]] & ~ [E [true U ~ [1<=p16]]]] | [[1<=p17 & 1<=p18] & E [1<=p15 U [2<=p3 & [1<=p14 & 1<=p27]]]]]] | [[[[p10<=0 | [p11<=0 | p30<=699]] & [p1<=699 | p24<=699]] | [1<=p7 & 1<=p29]] & EX [[1<=p7 & 200<=p28]]]] | [1<=p8 & 1<=p9]]] & [1<=p27 & 1<=p2]] & [1<=p15 & [2<=p3 & 1<=p14]]]]]]

abstracting: (1<=p14)
states: 13,128,134,451 (10)
abstracting: (2<=p3)
states: 12,967,632,465 (10)
abstracting: (1<=p15)
states: 2,361,709,584 (9)
abstracting: (1<=p2)
states: 13,838,382,921 (10)
abstracting: (1<=p27)
states: 14,184,612,049 (10)
abstracting: (1<=p9)
states: 10,386,285 (7)
abstracting: (1<=p8)
states: 13,342,003,323 (10)
abstracting: (200<=p28)
states: 596,317 (5)
abstracting: (1<=p7)
states: 13,342,599,402 (10)
.abstracting: (1<=p29)
states: 14,184,015,774 (10)
abstracting: (1<=p7)
states: 13,342,599,402 (10)
abstracting: (p24<=699)
states: 14,184,612,091 (10)
abstracting: (p1<=699)
states: 14,184,612,091 (10)
abstracting: (p30<=699)
states: 14,157,899,025 (10)
abstracting: (p11<=0)
states: 8,156,888,251 (9)
abstracting: (p10<=0)
states: 14,168,881,627 (10)
abstracting: (1<=p27)
states: 14,184,612,049 (10)
abstracting: (1<=p14)
states: 13,128,134,451 (10)
abstracting: (2<=p3)
states: 12,967,632,465 (10)
abstracting: (1<=p15)
states: 2,361,709,584 (9)
abstracting: (1<=p18)
states: 14,184,612,090 (10)
abstracting: (1<=p17)
states: 6,013,612,704 (9)
abstracting: (1<=p16)
states: 6,027,723,840 (9)
abstracting: (1<=p11)
states: 6,027,723,840 (9)
.......................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 359
abstracting: (p30<=699)
states: 14,157,899,025 (10)
abstracting: (p11<=0)
states: 8,156,888,251 (9)
abstracting: (p10<=0)
states: 14,168,881,627 (10)
abstracting: (p16<=0)
states: 8,156,888,251 (9)
abstracting: (1<=p22)
states: 7,001,206,377 (9)
.
EG iterations: 1
-> the formula is FALSE

FORMULA GPPP-PT-C0100N0000000010-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m12.767sec

checking: [AF [AG [[[EX [[2<=p6 | 1<=p15]] | E [1<=p15 U [1<=p1 & 1<=p25]]] | [~ [A [~ [[p2<=0 | p22<=0]] U [1<=p4 & 1<=p5]]] | [[1<=p8 & 1<=p12] | 2<=p6]]]]] & A [[[E [EX [[1<=p8 & 1<=p9]] U [1<=p11 | [700<=p1 & 700<=p24]]] & ~ [[[1<=p17 & 1<=p18] | [1<=p14 & 300<=p26]]]] & [~ [EX [[[1<=p2 & 1<=p22] & [1<=p1 & 1<=p25]]]] & EG [[EX [[1<=p7 & 1<=p29]] | A [2<=p6 U [2<=p3 & [1<=p14 & 1<=p27]]]]]]] U [AF [[E [1<=p23 U 1<=p16] & EX [[1<=p17 & 1<=p18]]]] & ~ [AF [[EF [[1<=p1 & 1<=p13]] | EG [[1<=p1 & 1<=p25]]]]]]]]
normalized: [[~ [EG [~ [[EG [~ [[EG [[1<=p1 & 1<=p25]] | E [true U [1<=p1 & 1<=p13]]]]] & ~ [EG [~ [[EX [[1<=p17 & 1<=p18]] & E [1<=p23 U 1<=p16]]]]]]]]] & ~ [E [~ [[EG [~ [[EG [[1<=p1 & 1<=p25]] | E [true U [1<=p1 & 1<=p13]]]]] & ~ [EG [~ [[EX [[1<=p17 & 1<=p18]] & E [1<=p23 U 1<=p16]]]]]]] U [~ [[[EG [[EX [[1<=p7 & 1<=p29]] | [~ [EG [~ [[2<=p3 & [1<=p14 & 1<=p27]]]]] & ~ [E [~ [[2<=p3 & [1<=p14 & 1<=p27]]] U [~ [[2<=p3 & [1<=p14 & 1<=p27]]] & ~ [2<=p6]]]]]]] & ~ [EX [[[1<=p1 & 1<=p25] & [1<=p2 & 1<=p22]]]]] & [~ [[[1<=p14 & 300<=p26] | [1<=p17 & 1<=p18]]] & E [EX [[1<=p8 & 1<=p9]] U [1<=p11 | [700<=p1 & 700<=p24]]]]]] & ~ [[EG [~ [[EG [[1<=p1 & 1<=p25]] | E [true U [1<=p1 & 1<=p13]]]]] & ~ [EG [~ [[EX [[1<=p17 & 1<=p18]] & E [1<=p23 U 1<=p16]]]]]]]]]]] & ~ [EG [E [true U ~ [[[[2<=p6 | [1<=p8 & 1<=p12]] | ~ [[~ [EG [~ [[1<=p4 & 1<=p5]]]] & ~ [E [~ [[1<=p4 & 1<=p5]] U [[p2<=0 | p22<=0] & ~ [[1<=p4 & 1<=p5]]]]]]]] | [E [1<=p15 U [1<=p1 & 1<=p25]] | EX [[2<=p6 | 1<=p15]]]]]]]]]

abstracting: (1<=p15)
states: 2,361,709,584 (9)
abstracting: (2<=p6)
states: 12,846,993,996 (10)
.abstracting: (1<=p25)
states: 14,184,612,090 (10)
abstracting: (1<=p1)
states: 13,128,134,452 (10)
abstracting: (1<=p15)
states: 2,361,709,584 (9)
abstracting: (1<=p5)
states: 12,955,699,758 (10)
abstracting: (1<=p4)
states: 13,466,675,506 (10)
abstracting: (p22<=0)
states: 7,183,405,714 (9)
abstracting: (p2<=0)
states: 346,229,170 (8)
abstracting: (1<=p5)
states: 12,955,699,758 (10)
abstracting: (1<=p4)
states: 13,466,675,506 (10)
abstracting: (1<=p5)
states: 12,955,699,758 (10)
abstracting: (1<=p4)
states: 13,466,675,506 (10)
........................................................................................................
EG iterations: 104
abstracting: (1<=p12)
states: 942,157,236 (8)
abstracting: (1<=p8)
states: 13,342,003,323 (10)
abstracting: (2<=p6)
states: 12,846,993,996 (10)
.
EG iterations: 1
abstracting: (1<=p16)
states: 6,027,723,840 (9)
abstracting: (1<=p23)
states: 1
abstracting: (1<=p18)
states: 14,184,612,090 (10)
abstracting: (1<=p17)
states: 6,013,612,704 (9)
.....................................................................................................................................................................................................................................................................................................................................................
EG iterations: 340
abstracting: (1<=p13)
states: 2,555,110,735 (9)
abstracting: (1<=p1)
states: 13,128,134,452 (10)
abstracting: (1<=p25)
states: 14,184,612,090 (10)
abstracting: (1<=p1)
states: 13,128,134,452 (10)
...................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 371
.
EG iterations: 1
abstracting: (700<=p24)
states: 0
abstracting: (700<=p1)
states: 0
abstracting: (1<=p11)
states: 6,027,723,840 (9)
abstracting: (1<=p9)
states: 10,386,285 (7)
abstracting: (1<=p8)
states: 13,342,003,323 (10)
.abstracting: (1<=p18)
states: 14,184,612,090 (10)
abstracting: (1<=p17)
states: 6,013,612,704 (9)
abstracting: (300<=p26)
states: 42
abstracting: (1<=p14)
states: 13,128,134,451 (10)
abstracting: (1<=p22)
states: 7,001,206,377 (9)
abstracting: (1<=p2)
states: 13,838,382,921 (10)
abstracting: (1<=p25)
states: 14,184,612,090 (10)
abstracting: (1<=p1)
states: 13,128,134,452 (10)
.abstracting: (2<=p6)
states: 12,846,993,996 (10)
abstracting: (1<=p27)
states: 14,184,612,049 (10)
abstracting: (1<=p14)
states: 13,128,134,451 (10)
abstracting: (2<=p3)
states: 12,967,632,465 (10)
abstracting: (1<=p27)
states: 14,184,612,049 (10)
abstracting: (1<=p14)
states: 13,128,134,451 (10)
abstracting: (2<=p3)
states: 12,967,632,465 (10)
abstracting: (1<=p27)
states: 14,184,612,049 (10)
abstracting: (1<=p14)
states: 13,128,134,451 (10)
abstracting: (2<=p3)
states: 12,967,632,465 (10)
........................................................................................................................
EG iterations: 120
abstracting: (1<=p29)
states: 14,184,015,774 (10)
abstracting: (1<=p7)
states: 13,342,599,402 (10)
........................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 375
abstracting: (1<=p16)
states: 6,027,723,840 (9)
abstracting: (1<=p23)
states: 1
abstracting: (1<=p18)
states: 14,184,612,090 (10)
abstracting: (1<=p17)
states: 6,013,612,704 (9)
.....................................................................................................................................................................................................................................................................................................................................................
EG iterations: 340
abstracting: (1<=p13)
states: 2,555,110,735 (9)
abstracting: (1<=p1)
states: 13,128,134,452 (10)
abstracting: (1<=p25)
states: 14,184,612,090 (10)
abstracting: (1<=p1)
states: 13,128,134,452 (10)
...................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 371
.
EG iterations: 1
abstracting: (1<=p16)
states: 6,027,723,840 (9)
abstracting: (1<=p23)
states: 1
abstracting: (1<=p18)
states: 14,184,612,090 (10)
abstracting: (1<=p17)
states: 6,013,612,704 (9)
.....................................................................................................................................................................................................................................................................................................................................................
EG iterations: 340
abstracting: (1<=p13)
states: 2,555,110,735 (9)
abstracting: (1<=p1)
states: 13,128,134,452 (10)
abstracting: (1<=p25)
states: 14,184,612,090 (10)
abstracting: (1<=p1)
states: 13,128,134,452 (10)
...................................................................................................................................................................................................................................................................................................................................................................................
EG iterations: 371
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA GPPP-PT-C0100N0000000010-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m19.004sec

totally nodes used: 58756408 (5.9e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 173692988 108138124 281831112
used/not used/entry size/cache size: 59674582 7434282 16 1024MB
basic ops cache: hits/miss/sum: 37897013 21597355 59494368
used/not used/entry size/cache size: 15264721 1512495 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: 528268 351289 879557
used/not used/entry size/cache size: 344425 8044183 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 29440012
1 23827785
2 9963253
3 2930952
4 704853
5 155426
6 35794
7 9880
8 4367
9 2852
>= 10 33690

Total processing time: 2m53.297sec


BK_STOP 1678642439450

--------------------
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:1783 (81), effective:414 (18)

initing FirstDep: 0m 0.000sec


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

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

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

iterations count:464 (21), effective:91 (4)

iterations count:1652 (75), effective:378 (17)

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

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

iterations count:137 (6), effective:17 (0)

iterations count:286 (13), effective:44 (2)

iterations count:304 (13), effective:47 (2)

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

iterations count:286 (13), effective:44 (2)

iterations count:208 (9), effective:35 (1)

iterations count:399 (18), effective:71 (3)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

iterations count:131 (5), effective:18 (0)

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

iterations count:503 (22), effective:90 (4)

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

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

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

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

iterations count:34 (1), effective:3 (0)

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

iterations count:91 (4), effective:19 (0)

iterations count:50 (2), effective:7 (0)

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

iterations count:143 (6), effective:20 (0)

iterations count:116 (5), effective:17 (0)

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

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

iterations count:168 (7), effective:25 (1)

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

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

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

iterations count:168 (7), effective:25 (1)

iterations count:56 (2), effective:8 (0)

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

iterations count:168 (7), effective:25 (1)

Sequence of Actions to be Executed by the VM

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

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

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