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.r074-smll-167814400000202.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 ClientsAndServers-PT-N0001P0, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r074-smll-167814400000202
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 7.5K Feb 26 13:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 13:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 13:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 13:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 15:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Feb 26 13:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 183K Feb 26 13:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 13:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K Feb 26 13:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 15:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 8 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 9.2K 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 ClientsAndServers-PT-N0001P0-CTLFireability-00
FORMULA_NAME ClientsAndServers-PT-N0001P0-CTLFireability-01
FORMULA_NAME ClientsAndServers-PT-N0001P0-CTLFireability-02
FORMULA_NAME ClientsAndServers-PT-N0001P0-CTLFireability-03
FORMULA_NAME ClientsAndServers-PT-N0001P0-CTLFireability-04
FORMULA_NAME ClientsAndServers-PT-N0001P0-CTLFireability-05
FORMULA_NAME ClientsAndServers-PT-N0001P0-CTLFireability-06
FORMULA_NAME ClientsAndServers-PT-N0001P0-CTLFireability-07
FORMULA_NAME ClientsAndServers-PT-N0001P0-CTLFireability-08
FORMULA_NAME ClientsAndServers-PT-N0001P0-CTLFireability-09
FORMULA_NAME ClientsAndServers-PT-N0001P0-CTLFireability-10
FORMULA_NAME ClientsAndServers-PT-N0001P0-CTLFireability-11
FORMULA_NAME ClientsAndServers-PT-N0001P0-CTLFireability-12
FORMULA_NAME ClientsAndServers-PT-N0001P0-CTLFireability-13
FORMULA_NAME ClientsAndServers-PT-N0001P0-CTLFireability-14
FORMULA_NAME ClientsAndServers-PT-N0001P0-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678333513626

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=ClientsAndServers-PT-N0001P0
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-09 03:45:17] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-09 03:45:17] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-09 03:45:17] [INFO ] Load time of PNML (sax parser for PT used): 54 ms
[2023-03-09 03:45:17] [INFO ] Transformed 25 places.
[2023-03-09 03:45:17] [INFO ] Transformed 18 transitions.
[2023-03-09 03:45:17] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 198 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 28 ms.
Support contains 25 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 26 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2023-03-09 03:45:17] [INFO ] Computed 8 place invariants in 9 ms
[2023-03-09 03:45:17] [INFO ] Implicit Places using invariants in 249 ms returned []
[2023-03-09 03:45:18] [INFO ] Invariant cache hit.
[2023-03-09 03:45:18] [INFO ] Implicit Places using invariants and state equation in 91 ms returned []
Implicit Place search using SMT with State Equation took 434 ms to find 0 implicit places.
[2023-03-09 03:45:18] [INFO ] Invariant cache hit.
[2023-03-09 03:45:18] [INFO ] Dead Transitions using invariants and state equation in 106 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 573 ms. Remains : 25/25 places, 18/18 transitions.
Support contains 25 out of 25 places after structural reductions.
[2023-03-09 03:45:18] [INFO ] Flatten gal took : 34 ms
[2023-03-09 03:45:18] [INFO ] Flatten gal took : 13 ms
[2023-03-09 03:45:18] [INFO ] Input system was already deterministic with 18 transitions.
Incomplete random walk after 10001 steps, including 62 resets, run finished after 610 ms. (steps per millisecond=16 ) properties (out of 42) seen :40
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 10 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-09 03:45:19] [INFO ] Invariant cache hit.
[2023-03-09 03:45:19] [INFO ] [Real]Absence check using 5 positive place invariants in 2 ms returned sat
[2023-03-09 03:45:19] [INFO ] [Real]Absence check using 5 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-09 03:45:19] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :0
Fused 2 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Successfully simplified 2 atomic propositions for a total of 16 simplifications.
[2023-03-09 03:45:19] [INFO ] Flatten gal took : 5 ms
[2023-03-09 03:45:19] [INFO ] Flatten gal took : 5 ms
[2023-03-09 03:45:19] [INFO ] Input system was already deterministic with 18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 2 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 24/25 places, 18/18 transitions.
[2023-03-09 03:45:19] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:45:19] [INFO ] Flatten gal took : 3 ms
[2023-03-09 03:45:19] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 21/25 places, 18/18 transitions.
[2023-03-09 03:45:19] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:45:19] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:45:19] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 21 transition count 12
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 16 place count 15 transition count 12
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 16 place count 15 transition count 11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 14 transition count 11
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 11 transition count 8
Applied a total of 24 rules in 10 ms. Remains 11 /25 variables (removed 14) and now considering 8/18 (removed 10) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 11/25 places, 8/18 transitions.
[2023-03-09 03:45:19] [INFO ] Flatten gal took : 1 ms
[2023-03-09 03:45:19] [INFO ] Flatten gal took : 1 ms
[2023-03-09 03:45:19] [INFO ] Input system was already deterministic with 8 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 23 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 21 transition count 15
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 20 transition count 15
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 8 place count 20 transition count 13
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 12 place count 18 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 14 place count 17 transition count 12
Applied a total of 14 rules in 5 ms. Remains 17 /25 variables (removed 8) and now considering 12/18 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 5 ms. Remains : 17/25 places, 12/18 transitions.
[2023-03-09 03:45:19] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:45:19] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:45:19] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 1 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 24/25 places, 18/18 transitions.
[2023-03-09 03:45:19] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:45:19] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:45:19] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 21/25 places, 18/18 transitions.
[2023-03-09 03:45:19] [INFO ] Flatten gal took : 1 ms
[2023-03-09 03:45:19] [INFO ] Flatten gal took : 1 ms
[2023-03-09 03:45:19] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 18
Applied a total of 2 rules in 1 ms. Remains 23 /25 variables (removed 2) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 23/25 places, 18/18 transitions.
[2023-03-09 03:45:19] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:45:19] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:45:19] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 21/25 places, 18/18 transitions.
[2023-03-09 03:45:19] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:45:19] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:45:19] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 21/25 places, 18/18 transitions.
[2023-03-09 03:45:19] [INFO ] Flatten gal took : 1 ms
[2023-03-09 03:45:19] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:45:19] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 18
Applied a total of 2 rules in 1 ms. Remains 23 /25 variables (removed 2) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 23/25 places, 18/18 transitions.
[2023-03-09 03:45:19] [INFO ] Flatten gal took : 3 ms
[2023-03-09 03:45:19] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:45:19] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 18
Applied a total of 2 rules in 0 ms. Remains 23 /25 variables (removed 2) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 23/25 places, 18/18 transitions.
[2023-03-09 03:45:19] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:45:19] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:45:19] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 17
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 2 rules applied. Total rules applied 6 place count 21 transition count 16
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 20 transition count 16
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 7 place count 20 transition count 13
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 13 place count 17 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 15 place count 16 transition count 12
Applied a total of 15 rules in 4 ms. Remains 16 /25 variables (removed 9) and now considering 12/18 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 16/25 places, 12/18 transitions.
[2023-03-09 03:45:19] [INFO ] Flatten gal took : 1 ms
[2023-03-09 03:45:19] [INFO ] Flatten gal took : 1 ms
[2023-03-09 03:45:19] [INFO ] Input system was already deterministic with 12 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 25/25 places, 18/18 transitions.
[2023-03-09 03:45:19] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:45:19] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:45:19] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 21 transition count 17
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 6 place count 20 transition count 17
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 6 place count 20 transition count 15
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 10 place count 18 transition count 15
Applied a total of 10 rules in 4 ms. Remains 18 /25 variables (removed 7) and now considering 15/18 (removed 3) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 18/25 places, 15/18 transitions.
[2023-03-09 03:45:19] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:45:19] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:45:19] [INFO ] Input system was already deterministic with 15 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 0 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 22/25 places, 18/18 transitions.
[2023-03-09 03:45:19] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:45:19] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:45:19] [INFO ] Input system was already deterministic with 18 transitions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 24 transition count 18
Applied a total of 1 rules in 1 ms. Remains 24 /25 variables (removed 1) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 24/25 places, 18/18 transitions.
[2023-03-09 03:45:19] [INFO ] Flatten gal took : 1 ms
[2023-03-09 03:45:19] [INFO ] Flatten gal took : 2 ms
[2023-03-09 03:45:19] [INFO ] Input system was already deterministic with 18 transitions.
[2023-03-09 03:45:19] [INFO ] Flatten gal took : 3 ms
[2023-03-09 03:45:19] [INFO ] Flatten gal took : 3 ms
[2023-03-09 03:45:19] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 3 ms.
[2023-03-09 03:45:19] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 25 places, 18 transitions and 54 arcs took 0 ms.
Total runtime 2584 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: 18 NrArc: 54)

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

net check time: 0m 0.000sec

init dd package: 0m 3.625sec


RS generation: 0m 0.067sec


-> reachability set: #nodes 2197 (2.2e+03) #states 27,576 (4)



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

checking: EF [AG [EF [[1<=p16 | p24<=0]]]]
normalized: E [true U ~ [E [true U ~ [E [true U [1<=p16 | p24<=0]]]]]]

abstracting: (p24<=0)
states: 9,195 (3)
abstracting: (1<=p16)
states: 4,458 (3)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0001P0-CTLFireability-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.041sec

checking: A [AF [EX [~ [EG [1<=p9]]]] U 1<=p22]
normalized: [~ [EG [~ [1<=p22]]] & ~ [E [~ [1<=p22] U [EG [~ [EX [~ [EG [1<=p9]]]]] & ~ [1<=p22]]]]]

abstracting: (1<=p22)
states: 12,636 (4)
abstracting: (1<=p9)
states: 4,188 (3)
................
EG iterations: 16
...............
EG iterations: 14
abstracting: (1<=p22)
states: 12,636 (4)
abstracting: (1<=p22)
states: 12,636 (4)
..................................................................................
EG iterations: 82
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0001P0-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.305sec

checking: AX [[AG [AF [1<=p6]] | AX [[1<=p6 & 1<=p18]]]]
normalized: ~ [EX [~ [[~ [EX [~ [[1<=p6 & 1<=p18]]]] | ~ [E [true U EG [~ [1<=p6]]]]]]]]

abstracting: (1<=p6)
states: 3,168 (3)
.
EG iterations: 1
abstracting: (1<=p18)
states: 3,168 (3)
abstracting: (1<=p6)
states: 3,168 (3)
..-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0001P0-CTLFireability-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.015sec

checking: AF [[EX [AX [AF [[1<=p4 & 1<=p21]]]] & [p1<=0 | p19<=0]]]
normalized: ~ [EG [~ [[[p1<=0 | p19<=0] & EX [~ [EX [EG [~ [[1<=p4 & 1<=p21]]]]]]]]]]

abstracting: (1<=p21)
states: 26,017 (4)
abstracting: (1<=p4)
states: 18,381 (4)
........................................................
EG iterations: 56
..abstracting: (p19<=0)
states: 14,450 (4)
abstracting: (p1<=0)
states: 23,388 (4)
...................................................
EG iterations: 51
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0001P0-CTLFireability-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.203sec

checking: EF [AX [EG [[[1<=p3 & 1<=p14] & [1<=p0 & 1<=p13]]]]]
normalized: E [true U ~ [EX [~ [EG [[[1<=p0 & 1<=p13] & [1<=p3 & 1<=p14]]]]]]]

abstracting: (1<=p14)
states: 27,576 (4)
abstracting: (1<=p3)
states: 4,458 (3)
abstracting: (1<=p13)
states: 4,458 (3)
abstracting: (1<=p0)
states: 18,711 (4)
..............
EG iterations: 14
.-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0001P0-CTLFireability-07 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.011sec

checking: EF [[EG [AF [1<=p20]] | [AG [EF [1<=p6]] & [1<=p24 | [EX [p24<=0] & EG [A [[1<=p3 & 1<=p14] U [1<=p8 & 1<=p15]]]]]]]]
normalized: E [true U [[[1<=p24 | [EG [[~ [EG [~ [[1<=p8 & 1<=p15]]]] & ~ [E [~ [[1<=p8 & 1<=p15]] U [~ [[1<=p3 & 1<=p14]] & ~ [[1<=p8 & 1<=p15]]]]]]] & EX [p24<=0]]] & ~ [E [true U ~ [E [true U 1<=p6]]]]] | EG [~ [EG [~ [1<=p20]]]]]]

abstracting: (1<=p20)
states: 4,188 (3)
.............................................................
EG iterations: 61
..................
EG iterations: 18
abstracting: (1<=p6)
states: 3,168 (3)
abstracting: (p24<=0)
states: 9,195 (3)
.abstracting: (1<=p15)
states: 6,408 (3)
abstracting: (1<=p8)
states: 18,381 (4)
abstracting: (1<=p14)
states: 27,576 (4)
abstracting: (1<=p3)
states: 4,458 (3)
abstracting: (1<=p15)
states: 6,408 (3)
abstracting: (1<=p8)
states: 18,381 (4)
abstracting: (1<=p15)
states: 6,408 (3)
abstracting: (1<=p8)
states: 18,381 (4)
.....................................................................
EG iterations: 69
................
EG iterations: 16
abstracting: (1<=p24)
states: 18,381 (4)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0001P0-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.257sec

checking: EF [[AG [[EG [p22<=0] & [1<=p12 & [p11<=0 | p17<=0]]]] & [p16<=0 & AG [~ [E [[1<=p4 & 1<=p21] U [1<=p11 & 1<=p17]]]]]]]
normalized: E [true U [[p16<=0 & ~ [E [true U E [[1<=p4 & 1<=p21] U [1<=p11 & 1<=p17]]]]] & ~ [E [true U ~ [[[1<=p12 & [p11<=0 | p17<=0]] & EG [p22<=0]]]]]]]

abstracting: (p22<=0)
states: 14,940 (4)
..................................................................................
EG iterations: 82
abstracting: (p17<=0)
states: 14,000 (4)
abstracting: (p11<=0)
states: 24,408 (4)
abstracting: (1<=p12)
states: 3,168 (3)
abstracting: (1<=p17)
states: 13,576 (4)
abstracting: (1<=p11)
states: 3,168 (3)
abstracting: (1<=p21)
states: 26,017 (4)
abstracting: (1<=p4)
states: 18,381 (4)
abstracting: (p16<=0)
states: 23,118 (4)
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0001P0-CTLFireability-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.021sec

checking: AG [[EF [[EG [[p8<=0 | p15<=0]] | [1<=p2 & 1<=p14]]] | [EG [1<=p16] & [AF [[1<=p3 & 1<=p14]] & AG [[1<=p11 & 1<=p17]]]]]]
normalized: ~ [E [true U ~ [[[[~ [E [true U ~ [[1<=p11 & 1<=p17]]]] & ~ [EG [~ [[1<=p3 & 1<=p14]]]]] & EG [1<=p16]] | E [true U [[1<=p2 & 1<=p14] | EG [[p8<=0 | p15<=0]]]]]]]]

abstracting: (p15<=0)
states: 21,168 (4)
abstracting: (p8<=0)
states: 9,195 (3)
.....................................................................
EG iterations: 69
abstracting: (1<=p14)
states: 27,576 (4)
abstracting: (1<=p2)
states: 3,168 (3)
abstracting: (1<=p16)
states: 4,458 (3)
................
EG iterations: 16
abstracting: (1<=p14)
states: 27,576 (4)
abstracting: (1<=p3)
states: 4,458 (3)
.........................................................................
EG iterations: 73
abstracting: (1<=p17)
states: 13,576 (4)
abstracting: (1<=p11)
states: 3,168 (3)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0001P0-CTLFireability-11 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.067sec

checking: [AX [AF [~ [E [AF [[1<=p4 & 1<=p21]] U EX [[1<=p1 & 1<=p19]]]]]] | E [[AG [E [1<=p22 U [1<=p2 & 1<=p14]]] | [1<=p2 & 1<=p14]] U 1<=p6]]
normalized: [E [[[1<=p2 & 1<=p14] | ~ [E [true U ~ [E [1<=p22 U [1<=p2 & 1<=p14]]]]]] U 1<=p6] | ~ [EX [EG [E [~ [EG [~ [[1<=p4 & 1<=p21]]]] U EX [[1<=p1 & 1<=p19]]]]]]]

abstracting: (1<=p19)
states: 13,126 (4)
abstracting: (1<=p1)
states: 4,188 (3)
.abstracting: (1<=p21)
states: 26,017 (4)
abstracting: (1<=p4)
states: 18,381 (4)
........................................................
EG iterations: 56
.
EG iterations: 1
.abstracting: (1<=p6)
states: 3,168 (3)
abstracting: (1<=p14)
states: 27,576 (4)
abstracting: (1<=p2)
states: 3,168 (3)
abstracting: (1<=p22)
states: 12,636 (4)
abstracting: (1<=p14)
states: 27,576 (4)
abstracting: (1<=p2)
states: 3,168 (3)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0001P0-CTLFireability-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.036sec

checking: AG [[EF [[[1<=p5 & 1<=p15] | AG [p24<=0]]] | [A [EG [[1<=p20 & [1<=p5 & 1<=p15]]] U AF [[[1<=p0 & 1<=p13] & [1<=p5 & 1<=p15]]]] | [1<=p2 & 1<=p14]]]]
normalized: ~ [E [true U ~ [[E [true U [[1<=p5 & 1<=p15] | ~ [E [true U ~ [p24<=0]]]]] | [[1<=p2 & 1<=p14] | [~ [EG [EG [~ [[[1<=p5 & 1<=p15] & [1<=p0 & 1<=p13]]]]]] & ~ [E [EG [~ [[[1<=p5 & 1<=p15] & [1<=p0 & 1<=p13]]]] U [~ [EG [[1<=p20 & [1<=p5 & 1<=p15]]]] & EG [~ [[[1<=p5 & 1<=p15] & [1<=p0 & 1<=p13]]]]]]]]]]]]]

abstracting: (1<=p13)
states: 4,458 (3)
abstracting: (1<=p0)
states: 18,711 (4)
abstracting: (1<=p15)
states: 6,408 (3)
abstracting: (1<=p5)
states: 12,636 (4)
.
EG iterations: 1
abstracting: (1<=p15)
states: 6,408 (3)
abstracting: (1<=p5)
states: 12,636 (4)
abstracting: (1<=p20)
states: 4,188 (3)
..............
EG iterations: 14
abstracting: (1<=p13)
states: 4,458 (3)
abstracting: (1<=p0)
states: 18,711 (4)
abstracting: (1<=p15)
states: 6,408 (3)
abstracting: (1<=p5)
states: 12,636 (4)
.
EG iterations: 1
abstracting: (1<=p13)
states: 4,458 (3)
abstracting: (1<=p0)
states: 18,711 (4)
abstracting: (1<=p15)
states: 6,408 (3)
abstracting: (1<=p5)
states: 12,636 (4)
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p14)
states: 27,576 (4)
abstracting: (1<=p2)
states: 3,168 (3)
abstracting: (p24<=0)
states: 9,195 (3)
abstracting: (1<=p15)
states: 6,408 (3)
abstracting: (1<=p5)
states: 12,636 (4)
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0001P0-CTLFireability-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.032sec

checking: [AG [EF [[[AX [[1<=p0 & 1<=p13]] & AF [p10<=0]] & 1<=p18]]] | AF [[[~ [A [[1<=p8 & 1<=p15] U 1<=p24]] & EF [[[1<=p3 & 1<=p14] | [p7<=0 | p23<=0]]]] & [[p11<=0 | p17<=0] & [1<=p4 & 1<=p21]]]]]
normalized: [~ [EG [~ [[[[1<=p4 & 1<=p21] & [p11<=0 | p17<=0]] & [E [true U [[p7<=0 | p23<=0] | [1<=p3 & 1<=p14]]] & ~ [[~ [EG [~ [1<=p24]]] & ~ [E [~ [1<=p24] U [~ [[1<=p8 & 1<=p15]] & ~ [1<=p24]]]]]]]]]]] | ~ [E [true U ~ [E [true U [1<=p18 & [~ [EG [~ [p10<=0]]] & ~ [EX [~ [[1<=p0 & 1<=p13]]]]]]]]]]]

abstracting: (1<=p13)
states: 4,458 (3)
abstracting: (1<=p0)
states: 18,711 (4)
.abstracting: (p10<=0)
states: 24,408 (4)
................
EG iterations: 16
abstracting: (1<=p18)
states: 3,168 (3)
abstracting: (1<=p24)
states: 18,381 (4)
abstracting: (1<=p15)
states: 6,408 (3)
abstracting: (1<=p8)
states: 18,381 (4)
abstracting: (1<=p24)
states: 18,381 (4)
abstracting: (1<=p24)
states: 18,381 (4)
........................................................................................................................
EG iterations: 120
abstracting: (1<=p14)
states: 27,576 (4)
abstracting: (1<=p3)
states: 4,458 (3)
abstracting: (p23<=0)
states: 1,469 (3)
abstracting: (p7<=0)
states: 14,940 (4)
abstracting: (p17<=0)
states: 14,000 (4)
abstracting: (p11<=0)
states: 24,408 (4)
abstracting: (1<=p21)
states: 26,017 (4)
abstracting: (1<=p4)
states: 18,381 (4)
...................
EG iterations: 19
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0001P0-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.197sec

checking: AF [[A [~ [[EF [[1<=p8 & 1<=p15]] & [1<=p1 & 1<=p19]]] U 1<=p10] & [[~ [E [AF [1<=p22] U AF [[1<=p2 & 1<=p14]]]] | [EF [[p5<=0 | p15<=0]] & [p9<=0 & EX [[p1<=0 | p19<=0]]]]] & [EF [[p7<=0 | p23<=0]] | AX [p6<=0]]]]]
normalized: ~ [EG [~ [[[[~ [EX [~ [p6<=0]]] | E [true U [p7<=0 | p23<=0]]] & [[[p9<=0 & EX [[p1<=0 | p19<=0]]] & E [true U [p5<=0 | p15<=0]]] | ~ [E [~ [EG [~ [1<=p22]]] U ~ [EG [~ [[1<=p2 & 1<=p14]]]]]]]] & [~ [EG [~ [1<=p10]]] & ~ [E [~ [1<=p10] U [[[1<=p1 & 1<=p19] & E [true U [1<=p8 & 1<=p15]]] & ~ [1<=p10]]]]]]]]]

abstracting: (1<=p10)
states: 3,168 (3)
abstracting: (1<=p15)
states: 6,408 (3)
abstracting: (1<=p8)
states: 18,381 (4)
abstracting: (1<=p19)
states: 13,126 (4)
abstracting: (1<=p1)
states: 4,188 (3)
abstracting: (1<=p10)
states: 3,168 (3)
abstracting: (1<=p10)
states: 3,168 (3)
..................................................
EG iterations: 50
abstracting: (1<=p14)
states: 27,576 (4)
abstracting: (1<=p2)
states: 3,168 (3)
..................................................
EG iterations: 50
abstracting: (1<=p22)
states: 12,636 (4)
..................................................................................
EG iterations: 82
abstracting: (p15<=0)
states: 21,168 (4)
abstracting: (p5<=0)
states: 14,940 (4)
abstracting: (p19<=0)
states: 14,450 (4)
abstracting: (p1<=0)
states: 23,388 (4)
.abstracting: (p9<=0)
states: 23,388 (4)
abstracting: (p23<=0)
states: 1,469 (3)
abstracting: (p7<=0)
states: 14,940 (4)
abstracting: (p6<=0)
states: 24,408 (4)
................
EG iterations: 15
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0001P0-CTLFireability-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.096sec

checking: [AF [1<=p9] | AG [[A [AF [E [[1<=p0 & 1<=p13] U 1<=p9]] U ~ [[1<=p16 | ~ [[1<=p5 & 1<=p15]]]]] & [AX [AF [1<=p22]] & [EF [[p8<=0 | p15<=0]] | [E [[1<=p1 & 1<=p19] U [1<=p8 & 1<=p15]] | AF [[1<=p3 & 1<=p14]]]]]]]]
normalized: [~ [E [true U ~ [[[[[~ [EG [~ [[1<=p3 & 1<=p14]]]] | E [[1<=p1 & 1<=p19] U [1<=p8 & 1<=p15]]] | E [true U [p8<=0 | p15<=0]]] & ~ [EX [EG [~ [1<=p22]]]]] & [~ [EG [[1<=p16 | ~ [[1<=p5 & 1<=p15]]]]] & ~ [E [[1<=p16 | ~ [[1<=p5 & 1<=p15]]] U [EG [~ [E [[1<=p0 & 1<=p13] U 1<=p9]]] & [1<=p16 | ~ [[1<=p5 & 1<=p15]]]]]]]]]]] | ~ [EG [~ [1<=p9]]]]

abstracting: (1<=p9)
states: 4,188 (3)
..................................................
EG iterations: 50
abstracting: (1<=p15)
states: 6,408 (3)
abstracting: (1<=p5)
states: 12,636 (4)
abstracting: (1<=p16)
states: 4,458 (3)
abstracting: (1<=p9)
states: 4,188 (3)
abstracting: (1<=p13)
states: 4,458 (3)
abstracting: (1<=p0)
states: 18,711 (4)
..............................
EG iterations: 30
abstracting: (1<=p15)
states: 6,408 (3)
abstracting: (1<=p5)
states: 12,636 (4)
abstracting: (1<=p16)
states: 4,458 (3)
abstracting: (1<=p15)
states: 6,408 (3)
abstracting: (1<=p5)
states: 12,636 (4)
abstracting: (1<=p16)
states: 4,458 (3)
......................
EG iterations: 22
abstracting: (1<=p22)
states: 12,636 (4)
..................................................................................
EG iterations: 82
.abstracting: (p15<=0)
states: 21,168 (4)
abstracting: (p8<=0)
states: 9,195 (3)
abstracting: (1<=p15)
states: 6,408 (3)
abstracting: (1<=p8)
states: 18,381 (4)
abstracting: (1<=p19)
states: 13,126 (4)
abstracting: (1<=p1)
states: 4,188 (3)
abstracting: (1<=p14)
states: 27,576 (4)
abstracting: (1<=p3)
states: 4,458 (3)
.........................................................................
EG iterations: 73
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0001P0-CTLFireability-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.127sec

checking: [E [~ [A [1<=p12 U [[1<=p9 & [1<=p4 & 1<=p21]] | EX [[1<=p1 & 1<=p19]]]]] U [EX [[[EG [~ [[p7<=0 | p23<=0]]] | [1<=p7 & 1<=p23]] | [[1<=p0 & 1<=p13] | ~ [[1<=p1 & [1<=p19 & 1<=p6]]]]]] & AX [E [1<=p10 U AG [[1<=p4 & 1<=p21]]]]]] | AG [[AF [~ [E [[1<=p1 & 1<=p19] U 1<=p20]]] & [1<=p11 & 1<=p17]]]]
normalized: [~ [E [true U ~ [[[1<=p11 & 1<=p17] & ~ [EG [E [[1<=p1 & 1<=p19] U 1<=p20]]]]]]] | E [~ [[~ [EG [~ [[EX [[1<=p1 & 1<=p19]] | [1<=p9 & [1<=p4 & 1<=p21]]]]]] & ~ [E [~ [[EX [[1<=p1 & 1<=p19]] | [1<=p9 & [1<=p4 & 1<=p21]]]] U [~ [1<=p12] & ~ [[EX [[1<=p1 & 1<=p19]] | [1<=p9 & [1<=p4 & 1<=p21]]]]]]]]] U [~ [EX [~ [E [1<=p10 U ~ [E [true U ~ [[1<=p4 & 1<=p21]]]]]]]] & EX [[[~ [[1<=p1 & [1<=p19 & 1<=p6]]] | [1<=p0 & 1<=p13]] | [[1<=p7 & 1<=p23] | EG [~ [[p7<=0 | p23<=0]]]]]]]]]

abstracting: (p23<=0)
states: 1,469 (3)
abstracting: (p7<=0)
states: 14,940 (4)
................
EG iterations: 16
abstracting: (1<=p23)
states: 26,107 (4)
abstracting: (1<=p7)
states: 12,636 (4)
abstracting: (1<=p13)
states: 4,458 (3)
abstracting: (1<=p0)
states: 18,711 (4)
abstracting: (1<=p6)
states: 3,168 (3)
abstracting: (1<=p19)
states: 13,126 (4)
abstracting: (1<=p1)
states: 4,188 (3)
.abstracting: (1<=p21)
states: 26,017 (4)
abstracting: (1<=p4)
states: 18,381 (4)
abstracting: (1<=p10)
states: 3,168 (3)
.abstracting: (1<=p21)
states: 26,017 (4)
abstracting: (1<=p4)
states: 18,381 (4)
abstracting: (1<=p9)
states: 4,188 (3)
abstracting: (1<=p19)
states: 13,126 (4)
abstracting: (1<=p1)
states: 4,188 (3)
.abstracting: (1<=p12)
states: 3,168 (3)
abstracting: (1<=p21)
states: 26,017 (4)
abstracting: (1<=p4)
states: 18,381 (4)
abstracting: (1<=p9)
states: 4,188 (3)
abstracting: (1<=p19)
states: 13,126 (4)
abstracting: (1<=p1)
states: 4,188 (3)
.abstracting: (1<=p21)
states: 26,017 (4)
abstracting: (1<=p4)
states: 18,381 (4)
abstracting: (1<=p9)
states: 4,188 (3)
abstracting: (1<=p19)
states: 13,126 (4)
abstracting: (1<=p1)
states: 4,188 (3)
..................................................
EG iterations: 49
abstracting: (1<=p20)
states: 4,188 (3)
abstracting: (1<=p19)
states: 13,126 (4)
abstracting: (1<=p1)
states: 4,188 (3)
.................
EG iterations: 17
abstracting: (1<=p17)
states: 13,576 (4)
abstracting: (1<=p11)
states: 3,168 (3)
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0001P0-CTLFireability-12 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.089sec

checking: AF [[E [[E [EG [[1<=p0 & 1<=p13]] U [[1<=p8 & 1<=p15] | [1<=p4 & 1<=p21]]] | [EX [[1<=p0 & 1<=p13]] | p24<=0]] U EX [[[EG [[1<=p1 & 1<=p19]] & 1<=p4] & [1<=p21 & [1<=p0 & 1<=p13]]]]] & [[AG [[p22<=0 & p20<=0]] | [p2<=0 | p14<=0]] | [p7<=0 | [p23<=0 | [EX [p9<=0] & [p22<=0 & [p1<=0 | p19<=0]]]]]]]]
normalized: ~ [EG [~ [[[[[p2<=0 | p14<=0] | ~ [E [true U ~ [[p22<=0 & p20<=0]]]]] | [p7<=0 | [p23<=0 | [[p22<=0 & [p1<=0 | p19<=0]] & EX [p9<=0]]]]] & E [[[p24<=0 | EX [[1<=p0 & 1<=p13]]] | E [EG [[1<=p0 & 1<=p13]] U [[1<=p4 & 1<=p21] | [1<=p8 & 1<=p15]]]] U EX [[[1<=p21 & [1<=p0 & 1<=p13]] & [1<=p4 & EG [[1<=p1 & 1<=p19]]]]]]]]]]

abstracting: (1<=p19)
states: 13,126 (4)
abstracting: (1<=p1)
states: 4,188 (3)
................
EG iterations: 16
abstracting: (1<=p4)
states: 18,381 (4)
abstracting: (1<=p13)
states: 4,458 (3)
abstracting: (1<=p0)
states: 18,711 (4)
abstracting: (1<=p21)
states: 26,017 (4)
.abstracting: (1<=p15)
states: 6,408 (3)
abstracting: (1<=p8)
states: 18,381 (4)
abstracting: (1<=p21)
states: 26,017 (4)
abstracting: (1<=p4)
states: 18,381 (4)
abstracting: (1<=p13)
states: 4,458 (3)
abstracting: (1<=p0)
states: 18,711 (4)
................
EG iterations: 16
abstracting: (1<=p13)
states: 4,458 (3)
abstracting: (1<=p0)
states: 18,711 (4)
.abstracting: (p24<=0)
states: 9,195 (3)
abstracting: (p9<=0)
states: 23,388 (4)
.abstracting: (p19<=0)
states: 14,450 (4)
abstracting: (p1<=0)
states: 23,388 (4)
abstracting: (p22<=0)
states: 14,940 (4)
abstracting: (p23<=0)
states: 1,469 (3)
abstracting: (p7<=0)
states: 14,940 (4)
abstracting: (p20<=0)
states: 23,388 (4)
abstracting: (p22<=0)
states: 14,940 (4)
abstracting: (p14<=0)
states: 0
abstracting: (p2<=0)
states: 24,408 (4)
.............................
EG iterations: 29
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0001P0-CTLFireability-15 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.123sec

checking: EF [[[AX [[1<=p4 & [1<=p21 & 1<=p18]]] & EG [A [p16<=0 U [AG [[1<=p1 & 1<=p19]] | AX [[1<=p3 & 1<=p14]]]]]] & [[[EX [[[1<=p0 & 1<=p13] | 1<=p9]] | 1<=p20] | [[1<=p2 & 1<=p14] | [[1<=p12 & [1<=p11 & 1<=p17]] & [1<=p0 & [1<=p13 & [[1<=p2 & 1<=p14] | [[1<=p5 & 1<=p15] | [[1<=p3 & 1<=p14] & [1<=p4 & 1<=p21]]]]]]]]] & [[E [1<=p22 U 1<=p18] | 1<=p6] | [[1<=p8 & 1<=p15] | [1<=p1 & 1<=p19]]]]]]
normalized: E [true U [[[[[1<=p1 & 1<=p19] | [1<=p8 & 1<=p15]] | [1<=p6 | E [1<=p22 U 1<=p18]]] & [[[[1<=p0 & [1<=p13 & [[[[1<=p4 & 1<=p21] & [1<=p3 & 1<=p14]] | [1<=p5 & 1<=p15]] | [1<=p2 & 1<=p14]]]] & [1<=p12 & [1<=p11 & 1<=p17]]] | [1<=p2 & 1<=p14]] | [1<=p20 | EX [[1<=p9 | [1<=p0 & 1<=p13]]]]]] & [EG [[~ [EG [~ [[~ [EX [~ [[1<=p3 & 1<=p14]]]] | ~ [E [true U ~ [[1<=p1 & 1<=p19]]]]]]]] & ~ [E [~ [[~ [EX [~ [[1<=p3 & 1<=p14]]]] | ~ [E [true U ~ [[1<=p1 & 1<=p19]]]]]] U [~ [p16<=0] & ~ [[~ [EX [~ [[1<=p3 & 1<=p14]]]] | ~ [E [true U ~ [[1<=p1 & 1<=p19]]]]]]]]]]] & ~ [EX [~ [[1<=p4 & [1<=p21 & 1<=p18]]]]]]]]

abstracting: (1<=p18)
states: 3,168 (3)
abstracting: (1<=p21)
states: 26,017 (4)
abstracting: (1<=p4)
states: 18,381 (4)
.abstracting: (1<=p19)
states: 13,126 (4)
abstracting: (1<=p1)
states: 4,188 (3)
abstracting: (1<=p14)
states: 27,576 (4)
abstracting: (1<=p3)
states: 4,458 (3)
.abstracting: (p16<=0)
states: 23,118 (4)
abstracting: (1<=p19)
states: 13,126 (4)
abstracting: (1<=p1)
states: 4,188 (3)
abstracting: (1<=p14)
states: 27,576 (4)
abstracting: (1<=p3)
states: 4,458 (3)
.abstracting: (1<=p19)
states: 13,126 (4)
abstracting: (1<=p1)
states: 4,188 (3)
abstracting: (1<=p14)
states: 27,576 (4)
abstracting: (1<=p3)
states: 4,458 (3)
..................
EG iterations: 17
..............
EG iterations: 14
abstracting: (1<=p13)
states: 4,458 (3)
abstracting: (1<=p0)
states: 18,711 (4)
abstracting: (1<=p9)
states: 4,188 (3)
.abstracting: (1<=p20)
states: 4,188 (3)
abstracting: (1<=p14)
states: 27,576 (4)
abstracting: (1<=p2)
states: 3,168 (3)
abstracting: (1<=p17)
states: 13,576 (4)
abstracting: (1<=p11)
states: 3,168 (3)
abstracting: (1<=p12)
states: 3,168 (3)
abstracting: (1<=p14)
states: 27,576 (4)
abstracting: (1<=p2)
states: 3,168 (3)
abstracting: (1<=p15)
states: 6,408 (3)
abstracting: (1<=p5)
states: 12,636 (4)
abstracting: (1<=p14)
states: 27,576 (4)
abstracting: (1<=p3)
states: 4,458 (3)
abstracting: (1<=p21)
states: 26,017 (4)
abstracting: (1<=p4)
states: 18,381 (4)
abstracting: (1<=p13)
states: 4,458 (3)
abstracting: (1<=p0)
states: 18,711 (4)
abstracting: (1<=p18)
states: 3,168 (3)
abstracting: (1<=p22)
states: 12,636 (4)
abstracting: (1<=p6)
states: 3,168 (3)
abstracting: (1<=p15)
states: 6,408 (3)
abstracting: (1<=p8)
states: 18,381 (4)
abstracting: (1<=p19)
states: 13,126 (4)
abstracting: (1<=p1)
states: 4,188 (3)
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0001P0-CTLFireability-04 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.025sec

totally nodes used: 831078 (8.3e+05)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 1341605 1904713 3246318
used/not used/entry size/cache size: 2547617 64561247 16 1024MB
basic ops cache: hits/miss/sum: 307256 462962 770218
used/not used/entry size/cache size: 909274 15867942 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: 13878 19477 33355
used/not used/entry size/cache size: 19449 8369159 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 66334520
1 736165
2 31751
3 3293
4 1098
5 691
6 444
7 251
8 96
9 93
>= 10 462

Total processing time: 0m 7.093sec


BK_STOP 1678333528228

--------------------
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:1006 (55), effective:216 (12)

initing FirstDep: 0m 0.000sec


iterations count:82 (4), effective:8 (0)

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

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

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

iterations count:365 (20), effective:79 (4)

iterations count:101 (5), effective:19 (1)

iterations count:321 (17), effective:63 (3)

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

iterations count:82 (4), effective:15 (0)

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

iterations count:116 (6), effective:21 (1)

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

iterations count:98 (5), effective:19 (1)

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

iterations count:95 (5), effective:18 (1)

iterations count:98 (5), effective:19 (1)

iterations count:44 (2), effective:6 (0)

iterations count:101 (5), effective:19 (1)

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

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

iterations count:124 (6), effective:23 (1)

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

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

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

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

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

iterations count:92 (5), effective:18 (1)

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

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

iterations count:97 (5), effective:19 (1)

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

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

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

iterations count:117 (6), effective:25 (1)

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

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

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

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

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

iterations count:408 (22), effective:72 (4)

iterations count:95 (5), effective:16 (0)

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

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

iterations count:95 (5), effective:15 (0)

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

iterations count:112 (6), effective:20 (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="ClientsAndServers-PT-N0001P0"
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 ClientsAndServers-PT-N0001P0, 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 r074-smll-167814400000202"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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