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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 396K
-rw-r--r-- 1 mcc users 5.8K Feb 26 13:27 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K Feb 26 13:27 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 13:26 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Feb 26 13:26 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.7K Feb 25 15:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K 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 18K Feb 25 15:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 10K Feb 26 13:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 107K Feb 26 13:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 13:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K 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.1K 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-N0002P0-CTLFireability-00
FORMULA_NAME ClientsAndServers-PT-N0002P0-CTLFireability-01
FORMULA_NAME ClientsAndServers-PT-N0002P0-CTLFireability-02
FORMULA_NAME ClientsAndServers-PT-N0002P0-CTLFireability-03
FORMULA_NAME ClientsAndServers-PT-N0002P0-CTLFireability-04
FORMULA_NAME ClientsAndServers-PT-N0002P0-CTLFireability-05
FORMULA_NAME ClientsAndServers-PT-N0002P0-CTLFireability-06
FORMULA_NAME ClientsAndServers-PT-N0002P0-CTLFireability-07
FORMULA_NAME ClientsAndServers-PT-N0002P0-CTLFireability-08
FORMULA_NAME ClientsAndServers-PT-N0002P0-CTLFireability-09
FORMULA_NAME ClientsAndServers-PT-N0002P0-CTLFireability-10
FORMULA_NAME ClientsAndServers-PT-N0002P0-CTLFireability-11
FORMULA_NAME ClientsAndServers-PT-N0002P0-CTLFireability-12
FORMULA_NAME ClientsAndServers-PT-N0002P0-CTLFireability-13
FORMULA_NAME ClientsAndServers-PT-N0002P0-CTLFireability-14
FORMULA_NAME ClientsAndServers-PT-N0002P0-CTLFireability-15

=== Now, execution of the tool begins

BK_START 1678333702742

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

net check time: 0m 0.000sec

init dd package: 0m 3.370sec


RS generation: 0m 1.041sec


-> reachability set: #nodes 17697 (1.8e+04) #states 7,081,638 (6)



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

checking: AG [EF [p22<=0]]
normalized: ~ [E [true U ~ [E [true U p22<=0]]]]

abstracting: (p22<=0)
states: 2,570,690 (6)
-> the formula is TRUE

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

MC time: 0m 0.310sec

checking: AF [1<=p10]
normalized: ~ [EG [~ [1<=p10]]]

abstracting: (1<=p10)
states: 1,537,888 (6)
..................................................................................................................
EG iterations: 114
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0002P0-CTLFireability-13 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.603sec

checking: AX [[AG [EX [p20<=0]] | EX [0<=0]]]
normalized: ~ [EX [~ [[EX [0<=0] | ~ [E [true U ~ [EX [p20<=0]]]]]]]]

abstracting: (p20<=0)
states: 5,182,067 (6)
.abstracting: (0<=0)
states: 7,081,638 (6)
..-> the formula is TRUE

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

MC time: 0m 0.173sec

checking: AG [EF [EG [[p4<=0 | p21<=0]]]]
normalized: ~ [E [true U ~ [E [true U EG [[p4<=0 | p21<=0]]]]]]

abstracting: (p21<=0)
states: 59,885 (4)
abstracting: (p4<=0)
states: 1,437,851 (6)
..................................................................................................................................
EG iterations: 130
-> the formula is TRUE

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

MC time: 0m 2.638sec

checking: EG [[p3<=0 | p14<=0]]
normalized: EG [[p3<=0 | p14<=0]]

abstracting: (p14<=0)
states: 0
abstracting: (p3<=0)
states: 5,175,317 (6)
.........................................................................................................................................................
EG iterations: 153
-> the formula is FALSE

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

MC time: 0m 1.479sec

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

abstracting: (1<=p6)
states: 1,537,888 (6)
.
EG iterations: 1
abstracting: (1<=p12)
states: 1,537,888 (6)
................................
EG iterations: 32
..-> the formula is FALSE

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

MC time: 0m 0.090sec

checking: AG [AX [EF [[1<=p10 | [1<=p2 & 1<=p14]]]]]
normalized: ~ [E [true U EX [~ [E [true U [1<=p10 | [1<=p2 & 1<=p14]]]]]]]

abstracting: (1<=p14)
states: 7,081,638 (6)
abstracting: (1<=p2)
states: 1,537,888 (6)
abstracting: (1<=p10)
states: 1,537,888 (6)
.-> the formula is FALSE

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

MC time: 0m 0.135sec

checking: EX [EX [[EG [[p12<=0 & [p2<=0 | p14<=0]]] & [AF [[p1<=0 | p19<=0]] | 1<=p24]]]]
normalized: EX [EX [[[1<=p24 | ~ [EG [~ [[p1<=0 | p19<=0]]]]] & EG [[p12<=0 & [p2<=0 | p14<=0]]]]]]

abstracting: (p14<=0)
states: 0
abstracting: (p2<=0)
states: 5,543,750 (6)
abstracting: (p12<=0)
states: 5,543,750 (6)
..............................................................
EG iterations: 62
abstracting: (p19<=0)
states: 2,028,905 (6)
abstracting: (p1<=0)
states: 5,182,067 (6)
................................
EG iterations: 32
abstracting: (1<=p24)
states: 5,643,787 (6)
..-> the formula is FALSE

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

MC time: 0m 1.292sec

checking: AG [A [EF [[[1<=p7 & 1<=p23] | [~ [[1<=p1 & 1<=p19]] & 1<=p9]]] U ~ [[AF [1<=p12] & 1<=p12]]]]
normalized: ~ [E [true U ~ [[~ [EG [[1<=p12 & ~ [EG [~ [1<=p12]]]]]] & ~ [E [[1<=p12 & ~ [EG [~ [1<=p12]]]] U [~ [E [true U [[1<=p9 & ~ [[1<=p1 & 1<=p19]]] | [1<=p7 & 1<=p23]]]] & [1<=p12 & ~ [EG [~ [1<=p12]]]]]]]]]]]

abstracting: (1<=p12)
states: 1,537,888 (6)
............................................................................................................................
EG iterations: 124
abstracting: (1<=p12)
states: 1,537,888 (6)
abstracting: (1<=p23)
states: 7,022,428 (6)
abstracting: (1<=p7)
states: 4,510,948 (6)
abstracting: (1<=p19)
states: 5,052,733 (6)
abstracting: (1<=p1)
states: 1,899,571 (6)
abstracting: (1<=p9)
states: 1,899,571 (6)
abstracting: (1<=p12)
states: 1,537,888 (6)
............................................................................................................................
EG iterations: 124
abstracting: (1<=p12)
states: 1,537,888 (6)
abstracting: (1<=p12)
states: 1,537,888 (6)
............................................................................................................................
EG iterations: 124
abstracting: (1<=p12)
states: 1,537,888 (6)
................................
EG iterations: 32
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0002P0-CTLFireability-01 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.624sec

checking: EG [[EG [AF [p10<=0]] & [1<=p24 & [E [1<=p24 U [1<=p0 & 1<=p13]] | [1<=p16 & 1<=p6]]]]]
normalized: EG [[[1<=p24 & [[1<=p16 & 1<=p6] | E [1<=p24 U [1<=p0 & 1<=p13]]]] & EG [~ [EG [~ [p10<=0]]]]]]

abstracting: (p10<=0)
states: 5,543,750 (6)
................................
EG iterations: 32
..................................................................................................
EG iterations: 98
abstracting: (1<=p13)
states: 1,906,321 (6)
abstracting: (1<=p0)
states: 5,586,990 (6)
abstracting: (1<=p24)
states: 5,643,787 (6)
abstracting: (1<=p6)
states: 1,537,888 (6)
abstracting: (1<=p16)
states: 1,906,321 (6)
abstracting: (1<=p24)
states: 5,643,787 (6)
.
EG iterations: 1
-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0002P0-CTLFireability-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.837sec

checking: EF [[EG [[AX [1<=p9] | EX [[1<=p2 & 1<=p14]]]] & [~ [A [~ [[p4<=0 | p21<=0]] U ~ [[p2<=0 | p14<=0]]]] | EX [[p4<=0 | p21<=0]]]]]
normalized: E [true U [[EX [[p4<=0 | p21<=0]] | ~ [[~ [EG [[p2<=0 | p14<=0]]] & ~ [E [[p2<=0 | p14<=0] U [[p4<=0 | p21<=0] & [p2<=0 | p14<=0]]]]]]] & EG [[EX [[1<=p2 & 1<=p14]] | ~ [EX [~ [1<=p9]]]]]]]

abstracting: (1<=p9)
states: 1,899,571 (6)
.abstracting: (1<=p14)
states: 7,081,638 (6)
abstracting: (1<=p2)
states: 1,537,888 (6)
.................................
EG iterations: 32
abstracting: (p14<=0)
states: 0
abstracting: (p2<=0)
states: 5,543,750 (6)
abstracting: (p21<=0)
states: 59,885 (4)
abstracting: (p4<=0)
states: 1,437,851 (6)
abstracting: (p14<=0)
states: 0
abstracting: (p2<=0)
states: 5,543,750 (6)
abstracting: (p14<=0)
states: 0
abstracting: (p2<=0)
states: 5,543,750 (6)
....................................................................................................................
EG iterations: 116
abstracting: (p21<=0)
states: 59,885 (4)
abstracting: (p4<=0)
states: 1,437,851 (6)
.-> the formula is TRUE

FORMULA ClientsAndServers-PT-N0002P0-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.974sec

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

abstracting: (1<=p15)
states: 2,356,515 (6)
abstracting: (1<=p8)
states: 5,643,787 (6)
.abstracting: (1<=p19)
states: 5,052,733 (6)
abstracting: (1<=p1)
states: 1,899,571 (6)
abstracting: (1<=p14)
states: 7,081,638 (6)
abstracting: (1<=p3)
states: 1,906,321 (6)
abstracting: (p14<=0)
states: 0
abstracting: (p2<=0)
states: 5,543,750 (6)
.
EG iterations: 1
.abstracting: (1<=p23)
states: 7,022,428 (6)
abstracting: (1<=p7)
states: 4,510,948 (6)
abstracting: (1<=p6)
states: 1,537,888 (6)
abstracting: (p22<=0)
states: 2,570,690 (6)
-> the formula is TRUE

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

MC time: 0m 0.498sec

checking: AG [A [[EG [[A [1<=p12 U [1<=p14 & 1<=p3]] | EG [[1<=p11 & 1<=p17]]]] & ~ [AX [EF [1<=p6]]]] U EX [[[1<=p24 | [1<=p18 & EF [[1<=p1 & 1<=p19]]]] | [[1<=p7 & 1<=p23] | [1<=p8 & 1<=p15]]]]]]
normalized: ~ [E [true U ~ [[~ [EG [~ [EX [[[[1<=p8 & 1<=p15] | [1<=p7 & 1<=p23]] | [1<=p24 | [1<=p18 & E [true U [1<=p1 & 1<=p19]]]]]]]]] & ~ [E [~ [EX [[[[1<=p8 & 1<=p15] | [1<=p7 & 1<=p23]] | [1<=p24 | [1<=p18 & E [true U [1<=p1 & 1<=p19]]]]]]] U [~ [[EX [~ [E [true U 1<=p6]]] & EG [[EG [[1<=p11 & 1<=p17]] | [~ [EG [~ [[1<=p14 & 1<=p3]]]] & ~ [E [~ [[1<=p14 & 1<=p3]] U [~ [1<=p12] & ~ [[1<=p14 & 1<=p3]]]]]]]]]] & ~ [EX [[[[1<=p8 & 1<=p15] | [1<=p7 & 1<=p23]] | [1<=p24 | [1<=p18 & E [true U [1<=p1 & 1<=p19]]]]]]]]]]]]]]

abstracting: (1<=p19)
states: 5,052,733 (6)
abstracting: (1<=p1)
states: 1,899,571 (6)
abstracting: (1<=p18)
states: 1,537,888 (6)
abstracting: (1<=p24)
states: 5,643,787 (6)
abstracting: (1<=p23)
states: 7,022,428 (6)
abstracting: (1<=p7)
states: 4,510,948 (6)
abstracting: (1<=p15)
states: 2,356,515 (6)
abstracting: (1<=p8)
states: 5,643,787 (6)
.abstracting: (1<=p3)
states: 1,906,321 (6)
abstracting: (1<=p14)
states: 7,081,638 (6)
abstracting: (1<=p12)
states: 1,537,888 (6)
abstracting: (1<=p3)
states: 1,906,321 (6)
abstracting: (1<=p14)
states: 7,081,638 (6)
abstracting: (1<=p3)
states: 1,906,321 (6)
abstracting: (1<=p14)
states: 7,081,638 (6)
.........................................................................................................................................................
EG iterations: 153
abstracting: (1<=p17)
states: 5,062,183 (6)
abstracting: (1<=p11)
states: 1,537,888 (6)
................................
EG iterations: 32
................................
EG iterations: 32
abstracting: (1<=p6)
states: 1,537,888 (6)
.abstracting: (1<=p19)
states: 5,052,733 (6)
abstracting: (1<=p1)
states: 1,899,571 (6)
abstracting: (1<=p18)
states: 1,537,888 (6)
abstracting: (1<=p24)
states: 5,643,787 (6)
abstracting: (1<=p23)
states: 7,022,428 (6)
abstracting: (1<=p7)
states: 4,510,948 (6)
abstracting: (1<=p15)
states: 2,356,515 (6)
abstracting: (1<=p8)
states: 5,643,787 (6)
.abstracting: (1<=p19)
states: 5,052,733 (6)
abstracting: (1<=p1)
states: 1,899,571 (6)
abstracting: (1<=p18)
states: 1,537,888 (6)
abstracting: (1<=p24)
states: 5,643,787 (6)
abstracting: (1<=p23)
states: 7,022,428 (6)
abstracting: (1<=p7)
states: 4,510,948 (6)
abstracting: (1<=p15)
states: 2,356,515 (6)
abstracting: (1<=p8)
states: 5,643,787 (6)
.......................
EG iterations: 22
-> the formula is FALSE

FORMULA ClientsAndServers-PT-N0002P0-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.636sec

checking: [EF [[A [EG [[1<=p6 & [1<=p4 & 1<=p21]]] U ~ [EF [1<=p10]]] & AF [EX [p22<=0]]]] & EG [[A [E [[[1<=p3 & 1<=p14] | 1<=p24] U p18<=0] U ~ [[~ [[1<=p4 & 1<=p21]] | [1<=p4 & [1<=p21 & 1<=p22]]]]] | p20<=0]]]
normalized: [EG [[p20<=0 | [~ [EG [[[1<=p4 & [1<=p21 & 1<=p22]] | ~ [[1<=p4 & 1<=p21]]]]] & ~ [E [[[1<=p4 & [1<=p21 & 1<=p22]] | ~ [[1<=p4 & 1<=p21]]] U [~ [E [[1<=p24 | [1<=p3 & 1<=p14]] U p18<=0]] & [[1<=p4 & [1<=p21 & 1<=p22]] | ~ [[1<=p4 & 1<=p21]]]]]]]]] & E [true U [~ [EG [~ [EX [p22<=0]]]] & [~ [EG [E [true U 1<=p10]]] & ~ [E [E [true U 1<=p10] U [~ [EG [[1<=p6 & [1<=p4 & 1<=p21]]]] & E [true U 1<=p10]]]]]]]]

abstracting: (1<=p10)
states: 1,537,888 (6)
abstracting: (1<=p21)
states: 7,021,753 (6)
abstracting: (1<=p4)
states: 5,643,787 (6)
abstracting: (1<=p6)
states: 1,537,888 (6)
..............................
EG iterations: 30
abstracting: (1<=p10)
states: 1,537,888 (6)
abstracting: (1<=p10)
states: 1,537,888 (6)
.
EG iterations: 1
abstracting: (p22<=0)
states: 2,570,690 (6)
...............................
EG iterations: 30
abstracting: (1<=p21)
states: 7,021,753 (6)
abstracting: (1<=p4)
states: 5,643,787 (6)
abstracting: (1<=p22)
states: 4,510,948 (6)
abstracting: (1<=p21)
states: 7,021,753 (6)
abstracting: (1<=p4)
states: 5,643,787 (6)
abstracting: (p18<=0)
states: 5,543,750 (6)
abstracting: (1<=p14)
states: 7,081,638 (6)
abstracting: (1<=p3)
states: 1,906,321 (6)
abstracting: (1<=p24)
states: 5,643,787 (6)
abstracting: (1<=p21)
states: 7,021,753 (6)
abstracting: (1<=p4)
states: 5,643,787 (6)
abstracting: (1<=p22)
states: 4,510,948 (6)
abstracting: (1<=p21)
states: 7,021,753 (6)
abstracting: (1<=p4)
states: 5,643,787 (6)
abstracting: (1<=p21)
states: 7,021,753 (6)
abstracting: (1<=p4)
states: 5,643,787 (6)
abstracting: (1<=p22)
states: 4,510,948 (6)
abstracting: (1<=p21)
states: 7,021,753 (6)
abstracting: (1<=p4)
states: 5,643,787 (6)
..................................
EG iterations: 34
abstracting: (p20<=0)
states: 5,182,067 (6)
.
EG iterations: 1
-> the formula is TRUE

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

MC time: 0m 1.771sec

checking: E [E [EF [~ [[~ [[1<=p13 & 1<=p0]] & [[1<=p11 & 1<=p17] | [1<=p1 & 1<=p19]]]]] U AG [~ [AX [[1<=p1 & 1<=p19]]]]] U ~ [A [[[A [1<=p12 U [1<=p0 & 1<=p13]] & ~ [E [[1<=p3 & 1<=p14] U [1<=p3 & 1<=p14]]]] & [1<=p7 & 1<=p23]] U EF [[1<=p5 & 1<=p15]]]]]
normalized: E [E [E [true U ~ [[[[1<=p1 & 1<=p19] | [1<=p11 & 1<=p17]] & ~ [[1<=p13 & 1<=p0]]]]] U ~ [E [true U ~ [EX [~ [[1<=p1 & 1<=p19]]]]]]] U ~ [[~ [EG [~ [E [true U [1<=p5 & 1<=p15]]]]] & ~ [E [~ [E [true U [1<=p5 & 1<=p15]]] U [~ [[[1<=p7 & 1<=p23] & [~ [E [[1<=p3 & 1<=p14] U [1<=p3 & 1<=p14]]] & [~ [EG [~ [[1<=p0 & 1<=p13]]]] & ~ [E [~ [[1<=p0 & 1<=p13]] U [~ [1<=p12] & ~ [[1<=p0 & 1<=p13]]]]]]]]] & ~ [E [true U [1<=p5 & 1<=p15]]]]]]]]]

abstracting: (1<=p15)
states: 2,356,515 (6)
abstracting: (1<=p5)
states: 4,510,948 (6)
abstracting: (1<=p13)
states: 1,906,321 (6)
abstracting: (1<=p0)
states: 5,586,990 (6)
abstracting: (1<=p12)
states: 1,537,888 (6)
abstracting: (1<=p13)
states: 1,906,321 (6)
abstracting: (1<=p0)
states: 5,586,990 (6)
abstracting: (1<=p13)
states: 1,906,321 (6)
abstracting: (1<=p0)
states: 5,586,990 (6)
........................................................................................................................
EG iterations: 120
abstracting: (1<=p14)
states: 7,081,638 (6)
abstracting: (1<=p3)
states: 1,906,321 (6)
abstracting: (1<=p14)
states: 7,081,638 (6)
abstracting: (1<=p3)
states: 1,906,321 (6)
abstracting: (1<=p23)
states: 7,022,428 (6)
abstracting: (1<=p7)
states: 4,510,948 (6)
abstracting: (1<=p15)
states: 2,356,515 (6)
abstracting: (1<=p5)
states: 4,510,948 (6)
abstracting: (1<=p15)
states: 2,356,515 (6)
abstracting: (1<=p5)
states: 4,510,948 (6)
.
EG iterations: 1
abstracting: (1<=p19)
states: 5,052,733 (6)
abstracting: (1<=p1)
states: 1,899,571 (6)
.abstracting: (1<=p0)
states: 5,586,990 (6)
abstracting: (1<=p13)
states: 1,906,321 (6)
abstracting: (1<=p17)
states: 5,062,183 (6)
abstracting: (1<=p11)
states: 1,537,888 (6)
abstracting: (1<=p19)
states: 5,052,733 (6)
abstracting: (1<=p1)
states: 1,899,571 (6)
-> the formula is FALSE

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

MC time: 0m 0.491sec

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

abstracting: (1<=p22)
states: 4,510,948 (6)
abstracting: (1<=p23)
states: 7,022,428 (6)
abstracting: (1<=p7)
states: 4,510,948 (6)
abstracting: (1<=p10)
states: 1,537,888 (6)
abstracting: (1<=p17)
states: 5,062,183 (6)
abstracting: (1<=p11)
states: 1,537,888 (6)
abstracting: (1<=p14)
states: 7,081,638 (6)
abstracting: (1<=p2)
states: 1,537,888 (6)
abstracting: (1<=p14)
states: 7,081,638 (6)
abstracting: (1<=p2)
states: 1,537,888 (6)
abstracting: (1<=p14)
states: 7,081,638 (6)
abstracting: (1<=p3)
states: 1,906,321 (6)
abstracting: (1<=p18)
states: 1,537,888 (6)
....................................................................................................................................
EG iterations: 132
.abstracting: (1<=p15)
states: 2,356,515 (6)
abstracting: (1<=p5)
states: 4,510,948 (6)
abstracting: (1<=p13)
states: 1,906,321 (6)
abstracting: (1<=p0)
states: 5,586,990 (6)
abstracting: (1<=p13)
states: 1,906,321 (6)
abstracting: (1<=p0)
states: 5,586,990 (6)
.abstracting: (1<=p16)
states: 1,906,321 (6)
abstracting: (p14<=0)
states: 0
abstracting: (p2<=0)
states: 5,543,750 (6)
....................................................................................................................
EG iterations: 116
.abstracting: (1<=p14)
states: 7,081,638 (6)
abstracting: (1<=p2)
states: 1,537,888 (6)
abstracting: (1<=p6)
states: 1,537,888 (6)
abstracting: (1<=p21)
states: 7,021,753 (6)
abstracting: (1<=p4)
states: 5,643,787 (6)
.abstracting: (1<=p9)
states: 1,899,571 (6)
abstracting: (1<=p10)
states: 1,537,888 (6)
.abstracting: (1<=p22)
states: 4,510,948 (6)
abstracting: (1<=p19)
states: 5,052,733 (6)
abstracting: (1<=p1)
states: 1,899,571 (6)
abstracting: (1<=p18)
states: 1,537,888 (6)
abstracting: (1<=p21)
states: 7,021,753 (6)
abstracting: (1<=p4)
states: 5,643,787 (6)
abstracting: (1<=p15)
states: 2,356,515 (6)
abstracting: (1<=p8)
states: 5,643,787 (6)
abstracting: (1<=p20)
states: 1,899,571 (6)
abstracting: (1<=p21)
states: 7,021,753 (6)
abstracting: (1<=p4)
states: 5,643,787 (6)
abstracting: (1<=p13)
states: 1,906,321 (6)
abstracting: (1<=p0)
states: 5,586,990 (6)
abstracting: (1<=p15)
states: 2,356,515 (6)
abstracting: (1<=p8)
states: 5,643,787 (6)
.abstracting: (1<=p24)
states: 5,643,787 (6)
-> the formula is TRUE

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

MC time: 0m 2.126sec

totally nodes used: 5642917 (5.6e+06)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 17636368 14879952 32516320
used/not used/entry size/cache size: 16758720 50350144 16 1024MB
basic ops cache: hits/miss/sum: 3351695 3086618 6438313
used/not used/entry size/cache size: 4576252 12200964 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: 182604 139736 322340
used/not used/entry size/cache size: 138655 8249953 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 62152167
1 4525584
2 358558
3 42898
4 9298
5 4210
6 2299
7 2366
8 1726
9 1739
>= 10 8019

Total processing time: 0m24.427sec


BK_STOP 1678333733830

--------------------
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:2022 (112), effective:438 (24)

initing FirstDep: 0m 0.000sec


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

iterations count:627 (34), effective:141 (7)

iterations count:190 (10), effective:40 (2)

iterations count:163 (9), effective:29 (1)

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

iterations count:621 (34), effective:126 (7)

iterations count:102 (5), effective:21 (1)

iterations count:137 (7), effective:26 (1)

iterations count:129 (7), effective:23 (1)

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

iterations count:262 (14), effective:74 (4)

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

iterations count:54 (3), effective:4 (0)

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

iterations count:115 (6), effective:20 (1)

iterations count:653 (36), effective:143 (7)

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

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

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

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

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

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

iterations count:359 (19), effective:92 (5)

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

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

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

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

iterations count:629 (34), effective:127 (7)

iterations count:38 (2), effective:4 (0)

iterations count:242 (13), effective:39 (2)

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

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

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

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

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

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

iterations count:769 (42), effective:173 (9)

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

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

iterations count:115 (6), effective:20 (1)

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

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

iterations count:58 (3), effective:4 (0)

iterations count:115 (6), effective:20 (1)

iterations count:229 (12), effective:42 (2)

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-N0002P0"
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-N0002P0, 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-167814400000210"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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