About the Execution of Marcie+red for SimpleLoadBal-PT-02
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 5450.504 | 11276.00 | 19383.00 | 136.70 | FTFFTFTFTFTFTTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2023-input.r426-tajo-167905979000498.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
........................
=====================================================================
Generated by BenchKit 2-5348
Executing tool marciexred
Input is SimpleLoadBal-PT-02, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905979000498
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 524K
-rw-r--r-- 1 mcc users 7.9K Feb 26 03:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 66K Feb 26 03:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Feb 26 03:46 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 03:46 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.7K Feb 25 17:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 17:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Feb 26 03:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 173K Feb 26 03:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 03:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 03:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 17:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 38K Mar 5 18:23 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 SimpleLoadBal-PT-02-CTLFireability-00
FORMULA_NAME SimpleLoadBal-PT-02-CTLFireability-01
FORMULA_NAME SimpleLoadBal-PT-02-CTLFireability-02
FORMULA_NAME SimpleLoadBal-PT-02-CTLFireability-03
FORMULA_NAME SimpleLoadBal-PT-02-CTLFireability-04
FORMULA_NAME SimpleLoadBal-PT-02-CTLFireability-05
FORMULA_NAME SimpleLoadBal-PT-02-CTLFireability-06
FORMULA_NAME SimpleLoadBal-PT-02-CTLFireability-07
FORMULA_NAME SimpleLoadBal-PT-02-CTLFireability-08
FORMULA_NAME SimpleLoadBal-PT-02-CTLFireability-09
FORMULA_NAME SimpleLoadBal-PT-02-CTLFireability-10
FORMULA_NAME SimpleLoadBal-PT-02-CTLFireability-11
FORMULA_NAME SimpleLoadBal-PT-02-CTLFireability-12
FORMULA_NAME SimpleLoadBal-PT-02-CTLFireability-13
FORMULA_NAME SimpleLoadBal-PT-02-CTLFireability-14
FORMULA_NAME SimpleLoadBal-PT-02-CTLFireability-15
=== Now, execution of the tool begins
BK_START 1679358608100
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=SimpleLoadBal-PT-02
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-21 00:30:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-21 00:30:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 00:30:10] [INFO ] Load time of PNML (sax parser for PT used): 47 ms
[2023-03-21 00:30:10] [INFO ] Transformed 32 places.
[2023-03-21 00:30:10] [INFO ] Transformed 45 transitions.
[2023-03-21 00:30:10] [INFO ] Found NUPN structural information;
[2023-03-21 00:30:10] [INFO ] Completing missing partition info from NUPN : creating a component with [P_client_idle_1, P_client_idle_2, P_client_waiting_1, P_client_waiting_2, P_client_request_1, P_client_request_2, P_client_ack_1, P_client_ack_2, P_server_idle_1, P_server_idle_2, P_server_waiting_1, P_server_waiting_2, P_server_processed_1, P_server_processed_2, P_server_notification_1, P_server_notification_2, P_server_notification_ack_1, P_server_notification_ack_2, P_server_request_1_1, P_server_request_1_2, P_server_request_2_1, P_server_request_2_2, P_lb_idle_1, P_lb_routing_1_1, P_lb_routing_1_2, P_lb_balancing_1, P_lb_load_1_0, P_lb_load_1_1, P_lb_load_1_2, P_lb_load_2_0, P_lb_load_2_1, P_lb_load_2_2]
[2023-03-21 00:30:10] [INFO ] Parsed PT model containing 32 places and 45 transitions and 252 arcs in 166 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 24 ms.
Initial state reduction rules removed 5 formulas.
FORMULA SimpleLoadBal-PT-02-CTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-02-CTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-02-CTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-02-CTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-02-CTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 28 out of 32 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 32/32 places, 45/45 transitions.
Applied a total of 0 rules in 25 ms. Remains 32 /32 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2023-03-21 00:30:10] [INFO ] Flow matrix only has 35 transitions (discarded 10 similar events)
// Phase 1: matrix 35 rows 32 cols
[2023-03-21 00:30:10] [INFO ] Computed 13 place invariants in 5 ms
[2023-03-21 00:30:11] [INFO ] Implicit Places using invariants in 219 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 244 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 31/32 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 31 /31 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 273 ms. Remains : 31/32 places, 45/45 transitions.
Support contains 28 out of 31 places after structural reductions.
[2023-03-21 00:30:11] [INFO ] Flatten gal took : 40 ms
[2023-03-21 00:30:11] [INFO ] Flatten gal took : 7 ms
[2023-03-21 00:30:11] [INFO ] Input system was already deterministic with 45 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 595 ms. (steps per millisecond=16 ) properties (out of 53) seen :46
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 109 ms. (steps per millisecond=91 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-21 00:30:12] [INFO ] Flow matrix only has 35 transitions (discarded 10 similar events)
// Phase 1: matrix 35 rows 31 cols
[2023-03-21 00:30:12] [INFO ] Computed 12 place invariants in 5 ms
[2023-03-21 00:30:12] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2023-03-21 00:30:12] [INFO ] [Real]Absence check using 8 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-21 00:30:12] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:6
[2023-03-21 00:30:12] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2023-03-21 00:30:12] [INFO ] [Nat]Absence check using 8 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-21 00:30:12] [INFO ] After 74ms SMT Verify possible using state equation in natural domain returned unsat :6 sat :1
[2023-03-21 00:30:12] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-21 00:30:12] [INFO ] After 9ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :6 sat :1
[2023-03-21 00:30:12] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :6 sat :1
Attempting to minimize the solution found.
Minimization took 26 ms.
[2023-03-21 00:30:12] [INFO ] After 213ms SMT Verify possible using all constraints in natural domain returned unsat :6 sat :1
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 31 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 31/31 places, 45/45 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 31 transition count 44
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 44
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 0 with 4 rules applied. Total rules applied 6 place count 28 transition count 42
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 24 transition count 40
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 22 transition count 38
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 17 place count 22 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 18 place count 21 transition count 37
Applied a total of 18 rules in 22 ms. Remains 21 /31 variables (removed 10) and now considering 37/45 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 21/31 places, 37/45 transitions.
Finished random walk after 7188 steps, including 2 resets, run visited all 1 properties in 12 ms. (steps per millisecond=599 )
Successfully simplified 6 atomic propositions for a total of 11 simplifications.
[2023-03-21 00:30:13] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-21 00:30:13] [INFO ] Flatten gal took : 17 ms
FORMULA SimpleLoadBal-PT-02-CTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-21 00:30:13] [INFO ] Flatten gal took : 7 ms
[2023-03-21 00:30:13] [INFO ] Input system was already deterministic with 45 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 45/45 transitions.
Applied a total of 0 rules in 0 ms. Remains 31 /31 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 0 ms. Remains : 31/31 places, 45/45 transitions.
[2023-03-21 00:30:13] [INFO ] Flatten gal took : 17 ms
[2023-03-21 00:30:13] [INFO ] Flatten gal took : 4 ms
[2023-03-21 00:30:13] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/31 places, 45/45 transitions.
[2023-03-21 00:30:13] [INFO ] Flatten gal took : 3 ms
[2023-03-21 00:30:13] [INFO ] Flatten gal took : 4 ms
[2023-03-21 00:30:13] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 31/31 places, 45/45 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 29 transition count 43
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 27 transition count 42
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 26 transition count 41
Applied a total of 9 rules in 11 ms. Remains 26 /31 variables (removed 5) and now considering 41/45 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 26/31 places, 41/45 transitions.
[2023-03-21 00:30:13] [INFO ] Flatten gal took : 5 ms
[2023-03-21 00:30:13] [INFO ] Flatten gal took : 4 ms
[2023-03-21 00:30:13] [INFO ] Input system was already deterministic with 41 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 31/31 places, 45/45 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 29 transition count 43
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 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 25 transition count 41
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 0 with 4 rules applied. Total rules applied 14 place count 23 transition count 39
Applied a total of 14 rules in 11 ms. Remains 23 /31 variables (removed 8) and now considering 39/45 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 11 ms. Remains : 23/31 places, 39/45 transitions.
[2023-03-21 00:30:13] [INFO ] Flatten gal took : 2 ms
[2023-03-21 00:30:13] [INFO ] Flatten gal took : 6 ms
[2023-03-21 00:30:13] [INFO ] Input system was already deterministic with 39 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 45/45 transitions.
Applied a total of 0 rules in 2 ms. Remains 31 /31 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 31/31 places, 45/45 transitions.
[2023-03-21 00:30:13] [INFO ] Flatten gal took : 2 ms
[2023-03-21 00:30:13] [INFO ] Flatten gal took : 3 ms
[2023-03-21 00:30:13] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/31 places, 45/45 transitions.
[2023-03-21 00:30:13] [INFO ] Flatten gal took : 2 ms
[2023-03-21 00:30:13] [INFO ] Flatten gal took : 3 ms
[2023-03-21 00:30:13] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 31/31 places, 45/45 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 29 transition count 43
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 25 transition count 41
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 0 with 4 rules applied. Total rules applied 14 place count 23 transition count 39
Applied a total of 14 rules in 10 ms. Remains 23 /31 variables (removed 8) and now considering 39/45 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 10 ms. Remains : 23/31 places, 39/45 transitions.
[2023-03-21 00:30:13] [INFO ] Flatten gal took : 8 ms
[2023-03-21 00:30:13] [INFO ] Flatten gal took : 4 ms
[2023-03-21 00:30:13] [INFO ] Input system was already deterministic with 39 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/31 places, 45/45 transitions.
[2023-03-21 00:30:13] [INFO ] Flatten gal took : 3 ms
[2023-03-21 00:30:13] [INFO ] Flatten gal took : 15 ms
[2023-03-21 00:30:13] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 45/45 transitions.
Applied a total of 0 rules in 1 ms. Remains 31 /31 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1 ms. Remains : 31/31 places, 45/45 transitions.
[2023-03-21 00:30:13] [INFO ] Flatten gal took : 2 ms
[2023-03-21 00:30:13] [INFO ] Flatten gal took : 3 ms
[2023-03-21 00:30:13] [INFO ] Input system was already deterministic with 45 transitions.
Starting structural reductions in LTL mode, iteration 0 : 31/31 places, 45/45 transitions.
Applied a total of 0 rules in 4 ms. Remains 31 /31 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 31/31 places, 45/45 transitions.
[2023-03-21 00:30:13] [INFO ] Flatten gal took : 3 ms
[2023-03-21 00:30:13] [INFO ] Flatten gal took : 3 ms
[2023-03-21 00:30:13] [INFO ] Input system was already deterministic with 45 transitions.
[2023-03-21 00:30:13] [INFO ] Flatten gal took : 3 ms
[2023-03-21 00:30:13] [INFO ] Flatten gal took : 2 ms
[2023-03-21 00:30:13] [INFO ] Export to MCC of 10 properties in file /home/mcc/execution/CTLFireability.sr.xml took 17 ms.
[2023-03-21 00:30:13] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 31 places, 45 transitions and 250 arcs took 0 ms.
Total runtime 2884 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: 31 NrTr: 45 NrArc: 250)
parse formulas
formulas created successfully
place and transition orderings generation:0m 0.000sec
net check time: 0m 0.000sec
init dd package: 0m 3.271sec
RS generation: 0m 0.005sec
-> reachability set: #nodes 676 (6.8e+02) #states 832
starting MCC model checker
--------------------------
checking: AG [AX [EF [EG [[[p8<=0 & 0<=p8] | [p19<=0 & 0<=p19]]]]]]
normalized: ~ [E [true U EX [~ [E [true U EG [[[p19<=0 & 0<=p19] | [p8<=0 & 0<=p8]]]]]]]]
abstracting: (0<=p8)
states: 832
abstracting: (p8<=0)
states: 620
abstracting: (0<=p19)
states: 832
abstracting: (p19<=0)
states: 700
.......
EG iterations: 7
.-> the formula is TRUE
FORMULA SimpleLoadBal-PT-02-CTLFireability-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.008sec
checking: AF [~ [E [[[p24<=1 & 1<=p24] & [[p26<=1 & 1<=p26] & [p30<=1 & 1<=p30]]] U ~ [AX [AX [[[p8<=1 & 1<=p8] & [p19<=1 & 1<=p19]]]]]]]]
normalized: ~ [EG [E [[[[p30<=1 & 1<=p30] & [p26<=1 & 1<=p26]] & [p24<=1 & 1<=p24]] U EX [EX [~ [[[p19<=1 & 1<=p19] & [p8<=1 & 1<=p8]]]]]]]]
abstracting: (1<=p8)
states: 212
abstracting: (p8<=1)
states: 832
abstracting: (1<=p19)
states: 132
abstracting: (p19<=1)
states: 832
..abstracting: (1<=p24)
states: 364
abstracting: (p24<=1)
states: 832
abstracting: (1<=p26)
states: 448
abstracting: (p26<=1)
states: 832
abstracting: (1<=p30)
states: 104
abstracting: (p30<=1)
states: 832
EG iterations: 0
-> the formula is FALSE
FORMULA SimpleLoadBal-PT-02-CTLFireability-00 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: AF [[AF [[[p14<=1 & 1<=p14] & [[p24<=1 & 1<=p24] & [p30<=1 & 1<=p30]]]] & [[p4<=0 & 0<=p4] | [p21<=0 & 0<=p21]]]]
normalized: ~ [EG [~ [[[[p21<=0 & 0<=p21] | [p4<=0 & 0<=p4]] & ~ [EG [~ [[[[p30<=1 & 1<=p30] & [p24<=1 & 1<=p24]] & [p14<=1 & 1<=p14]]]]]]]]]
abstracting: (1<=p14)
states: 206
abstracting: (p14<=1)
states: 832
abstracting: (1<=p24)
states: 364
abstracting: (p24<=1)
states: 832
abstracting: (1<=p30)
states: 104
abstracting: (p30<=1)
states: 832
.
EG iterations: 1
abstracting: (0<=p4)
states: 832
abstracting: (p4<=0)
states: 664
abstracting: (0<=p21)
states: 832
abstracting: (p21<=0)
states: 508
.
EG iterations: 1
-> the formula is FALSE
FORMULA SimpleLoadBal-PT-02-CTLFireability-02 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.001sec
checking: EF [AG [[[[p14<=1 & 1<=p14] & [[p24<=1 & 1<=p24] & [p29<=1 & 1<=p29]]] | [[p23<=1 & 1<=p23] & [[p26<=1 & 1<=p26] & [p29<=1 & 1<=p29]]]]]]
normalized: E [true U ~ [E [true U ~ [[[[[p29<=1 & 1<=p29] & [p26<=1 & 1<=p26]] & [p23<=1 & 1<=p23]] | [[[p29<=1 & 1<=p29] & [p24<=1 & 1<=p24]] & [p14<=1 & 1<=p14]]]]]]]
abstracting: (1<=p14)
states: 206
abstracting: (p14<=1)
states: 832
abstracting: (1<=p24)
states: 364
abstracting: (p24<=1)
states: 832
abstracting: (1<=p29)
states: 452
abstracting: (p29<=1)
states: 832
abstracting: (1<=p23)
states: 72
abstracting: (p23<=1)
states: 832
abstracting: (1<=p26)
states: 448
abstracting: (p26<=1)
states: 832
abstracting: (1<=p29)
states: 452
abstracting: (p29<=1)
states: 832
-> the formula is FALSE
FORMULA SimpleLoadBal-PT-02-CTLFireability-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.000sec
checking: EF [EG [AF [[[AF [[[p14<=1 & 1<=p14] & [[p21<=1 & 1<=p21] & [p29<=1 & 1<=p29]]]] | ~ [[p23<=1 & 1<=p23]]] | [~ [[p26<=1 & 1<=p26]] | [~ [[p30<=1 & 1<=p30]] | EG [[[p14<=1 & 1<=p14] & [[p24<=1 & 1<=p24] & [p30<=1 & 1<=p30]]]]]]]]]]
normalized: E [true U EG [~ [EG [~ [[[[EG [[[[p30<=1 & 1<=p30] & [p24<=1 & 1<=p24]] & [p14<=1 & 1<=p14]]] | ~ [[p30<=1 & 1<=p30]]] | ~ [[p26<=1 & 1<=p26]]] | [~ [[p23<=1 & 1<=p23]] | ~ [EG [~ [[[[p29<=1 & 1<=p29] & [p21<=1 & 1<=p21]] & [p14<=1 & 1<=p14]]]]]]]]]]]]
abstracting: (1<=p14)
states: 206
abstracting: (p14<=1)
states: 832
abstracting: (1<=p21)
states: 324
abstracting: (p21<=1)
states: 832
abstracting: (1<=p29)
states: 452
abstracting: (p29<=1)
states: 832
.......
EG iterations: 7
abstracting: (1<=p23)
states: 72
abstracting: (p23<=1)
states: 832
abstracting: (1<=p26)
states: 448
abstracting: (p26<=1)
states: 832
abstracting: (1<=p30)
states: 104
abstracting: (p30<=1)
states: 832
abstracting: (1<=p14)
states: 206
abstracting: (p14<=1)
states: 832
abstracting: (1<=p24)
states: 364
abstracting: (p24<=1)
states: 832
abstracting: (1<=p30)
states: 104
abstracting: (p30<=1)
states: 832
.........
EG iterations: 9
....
EG iterations: 4
EG iterations: 0
-> the formula is TRUE
FORMULA SimpleLoadBal-PT-02-CTLFireability-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.005sec
checking: A [[AG [[A [~ [[[p22<=1 & 1<=p22] & [[p27<=1 & 1<=p27] & [p29<=1 & 1<=p29]]]] U AF [[[[p17<=1 & 1<=p17] & [p24<=1 & 1<=p24]] & [[p27<=1 & 1<=p27] & [p28<=1 & 1<=p28]]]]] | [[p24<=1 & 1<=p24] & [[p25<=1 & 1<=p25] & [p28<=1 & 1<=p28]]]]] & [AX [[[p10<=1 & 1<=p10] & [p15<=1 & 1<=p15]]] | [[p9<=1 & 1<=p9] & [p20<=1 & 1<=p20]]]] U [[p24<=1 & 1<=p24] & [[p26<=1 & 1<=p26] & [p29<=1 & 1<=p29]]]]
normalized: [~ [EG [~ [[[[p29<=1 & 1<=p29] & [p26<=1 & 1<=p26]] & [p24<=1 & 1<=p24]]]]] & ~ [E [~ [[[[p29<=1 & 1<=p29] & [p26<=1 & 1<=p26]] & [p24<=1 & 1<=p24]]] U [~ [[[[[p20<=1 & 1<=p20] & [p9<=1 & 1<=p9]] | ~ [EX [~ [[[p15<=1 & 1<=p15] & [p10<=1 & 1<=p10]]]]]] & ~ [E [true U ~ [[[[[p28<=1 & 1<=p28] & [p25<=1 & 1<=p25]] & [p24<=1 & 1<=p24]] | [~ [EG [EG [~ [[[[p28<=1 & 1<=p28] & [p27<=1 & 1<=p27]] & [[p24<=1 & 1<=p24] & [p17<=1 & 1<=p17]]]]]]] & ~ [E [EG [~ [[[[p28<=1 & 1<=p28] & [p27<=1 & 1<=p27]] & [[p24<=1 & 1<=p24] & [p17<=1 & 1<=p17]]]]] U [[[[p29<=1 & 1<=p29] & [p27<=1 & 1<=p27]] & [p22<=1 & 1<=p22]] & EG [~ [[[[p28<=1 & 1<=p28] & [p27<=1 & 1<=p27]] & [[p24<=1 & 1<=p24] & [p17<=1 & 1<=p17]]]]]]]]]]]]]]] & ~ [[[[p29<=1 & 1<=p29] & [p26<=1 & 1<=p26]] & [p24<=1 & 1<=p24]]]]]]]
abstracting: (1<=p24)
states: 364
abstracting: (p24<=1)
states: 832
abstracting: (1<=p26)
states: 448
abstracting: (p26<=1)
states: 832
abstracting: (1<=p29)
states: 452
abstracting: (p29<=1)
states: 832
abstracting: (1<=p17)
states: 132
abstracting: (p17<=1)
states: 832
abstracting: (1<=p24)
states: 364
abstracting: (p24<=1)
states: 832
abstracting: (1<=p27)
states: 112
abstracting: (p27<=1)
states: 832
abstracting: (1<=p28)
states: 276
abstracting: (p28<=1)
states: 832
.
EG iterations: 1
abstracting: (1<=p22)
states: 72
abstracting: (p22<=1)
states: 832
abstracting: (1<=p27)
states: 112
abstracting: (p27<=1)
states: 832
abstracting: (1<=p29)
states: 452
abstracting: (p29<=1)
states: 832
abstracting: (1<=p17)
states: 132
abstracting: (p17<=1)
states: 832
abstracting: (1<=p24)
states: 364
abstracting: (p24<=1)
states: 832
abstracting: (1<=p27)
states: 112
abstracting: (p27<=1)
states: 832
abstracting: (1<=p28)
states: 276
abstracting: (p28<=1)
states: 832
.
EG iterations: 1
abstracting: (1<=p17)
states: 132
abstracting: (p17<=1)
states: 832
abstracting: (1<=p24)
states: 364
abstracting: (p24<=1)
states: 832
abstracting: (1<=p27)
states: 112
abstracting: (p27<=1)
states: 832
abstracting: (1<=p28)
states: 276
abstracting: (p28<=1)
states: 832
.
EG iterations: 1
.
EG iterations: 1
abstracting: (1<=p24)
states: 364
abstracting: (p24<=1)
states: 832
abstracting: (1<=p25)
states: 272
abstracting: (p25<=1)
states: 832
abstracting: (1<=p28)
states: 276
abstracting: (p28<=1)
states: 832
abstracting: (1<=p10)
states: 416
abstracting: (p10<=1)
states: 832
abstracting: (1<=p15)
states: 212
abstracting: (p15<=1)
states: 832
.abstracting: (1<=p9)
states: 210
abstracting: (p9<=1)
states: 832
abstracting: (1<=p20)
states: 124
abstracting: (p20<=1)
states: 832
abstracting: (1<=p24)
states: 364
abstracting: (p24<=1)
states: 832
abstracting: (1<=p26)
states: 448
abstracting: (p26<=1)
states: 832
abstracting: (1<=p29)
states: 452
abstracting: (p29<=1)
states: 832
abstracting: (1<=p24)
states: 364
abstracting: (p24<=1)
states: 832
abstracting: (1<=p26)
states: 448
abstracting: (p26<=1)
states: 832
abstracting: (1<=p29)
states: 452
abstracting: (p29<=1)
states: 832
.
EG iterations: 1
-> the formula is FALSE
FORMULA SimpleLoadBal-PT-02-CTLFireability-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.009sec
checking: EG [[EX [[AF [[[[p19<=0 & 0<=p19] | [p24<=0 & 0<=p24]] | [[p27<=0 & 0<=p27] | [p28<=0 & 0<=p28]]]] & AX [[[p8<=0 & 0<=p8] | [p19<=0 & 0<=p19]]]]] & [E [EF [[[p24<=1 & 1<=p24] & [[p26<=1 & 1<=p26] & [p30<=1 & 1<=p30]]]] U [[[p2<=1 & 1<=p2] & [p6<=1 & 1<=p6]] & [[p3<=1 & 1<=p3] & [p7<=1 & 1<=p7]]]] | [AG [[[p23<=0 & 0<=p23] | [[p26<=0 & 0<=p26] | [p28<=0 & 0<=p28]]]] & [EF [[[p10<=0 & 0<=p10] | [p15<=0 & 0<=p15]]] & [[p8<=0 & 0<=p8] | [p19<=0 & 0<=p19]]]]]]]
normalized: EG [[[[[[[p19<=0 & 0<=p19] | [p8<=0 & 0<=p8]] & E [true U [[p15<=0 & 0<=p15] | [p10<=0 & 0<=p10]]]] & ~ [E [true U ~ [[[[p28<=0 & 0<=p28] | [p26<=0 & 0<=p26]] | [p23<=0 & 0<=p23]]]]]] | E [E [true U [[[p30<=1 & 1<=p30] & [p26<=1 & 1<=p26]] & [p24<=1 & 1<=p24]]] U [[[p7<=1 & 1<=p7] & [p3<=1 & 1<=p3]] & [[p6<=1 & 1<=p6] & [p2<=1 & 1<=p2]]]]] & EX [[~ [EX [~ [[[p19<=0 & 0<=p19] | [p8<=0 & 0<=p8]]]]] & ~ [EG [~ [[[[p28<=0 & 0<=p28] | [p27<=0 & 0<=p27]] | [[p24<=0 & 0<=p24] | [p19<=0 & 0<=p19]]]]]]]]]]
abstracting: (0<=p19)
states: 832
abstracting: (p19<=0)
states: 700
abstracting: (0<=p24)
states: 832
abstracting: (p24<=0)
states: 468
abstracting: (0<=p27)
states: 832
abstracting: (p27<=0)
states: 720
abstracting: (0<=p28)
states: 832
abstracting: (p28<=0)
states: 556
........
EG iterations: 8
abstracting: (0<=p8)
states: 832
abstracting: (p8<=0)
states: 620
abstracting: (0<=p19)
states: 832
abstracting: (p19<=0)
states: 700
..abstracting: (1<=p2)
states: 664
abstracting: (p2<=1)
states: 832
abstracting: (1<=p6)
states: 168
abstracting: (p6<=1)
states: 832
abstracting: (1<=p3)
states: 664
abstracting: (p3<=1)
states: 832
abstracting: (1<=p7)
states: 168
abstracting: (p7<=1)
states: 832
abstracting: (1<=p24)
states: 364
abstracting: (p24<=1)
states: 832
abstracting: (1<=p26)
states: 448
abstracting: (p26<=1)
states: 832
abstracting: (1<=p30)
states: 104
abstracting: (p30<=1)
states: 832
abstracting: (0<=p23)
states: 832
abstracting: (p23<=0)
states: 760
abstracting: (0<=p26)
states: 832
abstracting: (p26<=0)
states: 384
abstracting: (0<=p28)
states: 832
abstracting: (p28<=0)
states: 556
abstracting: (0<=p10)
states: 832
abstracting: (p10<=0)
states: 416
abstracting: (0<=p15)
states: 832
abstracting: (p15<=0)
states: 620
abstracting: (0<=p8)
states: 832
abstracting: (p8<=0)
states: 620
abstracting: (0<=p19)
states: 832
abstracting: (p19<=0)
states: 700
......
EG iterations: 6
-> the formula is TRUE
FORMULA SimpleLoadBal-PT-02-CTLFireability-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.016sec
checking: A [AX [1<=0] U [[~ [[[p3<=1 & 1<=p3] & [p7<=1 & 1<=p7]]] | EX [[[p22<=1 & 1<=p22] & [[p26<=1 & 1<=p26] & [p28<=1 & 1<=p28]]]]] & [[[p0<=1 & 1<=p0] | [[[[p20<=1 & 1<=p20] & [p24<=1 & 1<=p24]] & [[p25<=1 & 1<=p25] & [p30<=1 & 1<=p30]]] | [[p14<=1 & 1<=p14] & [[p21<=1 & 1<=p21] & [p30<=1 & 1<=p30]]]]] & [~ [AF [AG [[[p13<=1 & 1<=p13] & [[p21<=1 & 1<=p21] & [p27<=1 & 1<=p27]]]]]] | [[[p20<=1 & 1<=p20] & [p24<=1 & 1<=p24]] & [[p25<=1 & 1<=p25] & [p30<=1 & 1<=p30]]]]]]]
normalized: [~ [EG [~ [[[[[[[p30<=1 & 1<=p30] & [p25<=1 & 1<=p25]] & [[p24<=1 & 1<=p24] & [p20<=1 & 1<=p20]]] | EG [E [true U ~ [[[[p27<=1 & 1<=p27] & [p21<=1 & 1<=p21]] & [p13<=1 & 1<=p13]]]]]] & [[[[[p30<=1 & 1<=p30] & [p21<=1 & 1<=p21]] & [p14<=1 & 1<=p14]] | [[[p30<=1 & 1<=p30] & [p25<=1 & 1<=p25]] & [[p24<=1 & 1<=p24] & [p20<=1 & 1<=p20]]]] | [p0<=1 & 1<=p0]]] & [EX [[[[p28<=1 & 1<=p28] & [p26<=1 & 1<=p26]] & [p22<=1 & 1<=p22]]] | ~ [[[p7<=1 & 1<=p7] & [p3<=1 & 1<=p3]]]]]]]] & ~ [E [~ [[[[[[[p30<=1 & 1<=p30] & [p25<=1 & 1<=p25]] & [[p24<=1 & 1<=p24] & [p20<=1 & 1<=p20]]] | EG [E [true U ~ [[[[p27<=1 & 1<=p27] & [p21<=1 & 1<=p21]] & [p13<=1 & 1<=p13]]]]]] & [[[[[p30<=1 & 1<=p30] & [p21<=1 & 1<=p21]] & [p14<=1 & 1<=p14]] | [[[p30<=1 & 1<=p30] & [p25<=1 & 1<=p25]] & [[p24<=1 & 1<=p24] & [p20<=1 & 1<=p20]]]] | [p0<=1 & 1<=p0]]] & [EX [[[[p28<=1 & 1<=p28] & [p26<=1 & 1<=p26]] & [p22<=1 & 1<=p22]]] | ~ [[[p7<=1 & 1<=p7] & [p3<=1 & 1<=p3]]]]]] U [EX [~ [1<=0]] & ~ [[[[[[[p30<=1 & 1<=p30] & [p25<=1 & 1<=p25]] & [[p24<=1 & 1<=p24] & [p20<=1 & 1<=p20]]] | EG [E [true U ~ [[[[p27<=1 & 1<=p27] & [p21<=1 & 1<=p21]] & [p13<=1 & 1<=p13]]]]]] & [[[[[p30<=1 & 1<=p30] & [p21<=1 & 1<=p21]] & [p14<=1 & 1<=p14]] | [[[p30<=1 & 1<=p30] & [p25<=1 & 1<=p25]] & [[p24<=1 & 1<=p24] & [p20<=1 & 1<=p20]]]] | [p0<=1 & 1<=p0]]] & [EX [[[[p28<=1 & 1<=p28] & [p26<=1 & 1<=p26]] & [p22<=1 & 1<=p22]]] | ~ [[[p7<=1 & 1<=p7] & [p3<=1 & 1<=p3]]]]]]]]]]
abstracting: (1<=p3)
states: 664
abstracting: (p3<=1)
states: 832
abstracting: (1<=p7)
states: 168
abstracting: (p7<=1)
states: 832
abstracting: (1<=p22)
states: 72
abstracting: (p22<=1)
states: 832
abstracting: (1<=p26)
states: 448
abstracting: (p26<=1)
states: 832
abstracting: (1<=p28)
states: 276
abstracting: (p28<=1)
states: 832
.abstracting: (1<=p0)
states: 168
abstracting: (p0<=1)
states: 832
abstracting: (1<=p20)
states: 124
abstracting: (p20<=1)
states: 832
abstracting: (1<=p24)
states: 364
abstracting: (p24<=1)
states: 832
abstracting: (1<=p25)
states: 272
abstracting: (p25<=1)
states: 832
abstracting: (1<=p30)
states: 104
abstracting: (p30<=1)
states: 832
abstracting: (1<=p14)
states: 206
abstracting: (p14<=1)
states: 832
abstracting: (1<=p21)
states: 324
abstracting: (p21<=1)
states: 832
abstracting: (1<=p30)
states: 104
abstracting: (p30<=1)
states: 832
abstracting: (1<=p13)
states: 204
abstracting: (p13<=1)
states: 832
abstracting: (1<=p21)
states: 324
abstracting: (p21<=1)
states: 832
abstracting: (1<=p27)
states: 112
abstracting: (p27<=1)
states: 832
EG iterations: 0
abstracting: (1<=p20)
states: 124
abstracting: (p20<=1)
states: 832
abstracting: (1<=p24)
states: 364
abstracting: (p24<=1)
states: 832
abstracting: (1<=p25)
states: 272
abstracting: (p25<=1)
states: 832
abstracting: (1<=p30)
states: 104
abstracting: (p30<=1)
states: 832
abstracting: (1<=0)
states: 0
.abstracting: (1<=p3)
states: 664
abstracting: (p3<=1)
states: 832
abstracting: (1<=p7)
states: 168
abstracting: (p7<=1)
states: 832
abstracting: (1<=p22)
states: 72
abstracting: (p22<=1)
states: 832
abstracting: (1<=p26)
states: 448
abstracting: (p26<=1)
states: 832
abstracting: (1<=p28)
states: 276
abstracting: (p28<=1)
states: 832
.abstracting: (1<=p0)
states: 168
abstracting: (p0<=1)
states: 832
abstracting: (1<=p20)
states: 124
abstracting: (p20<=1)
states: 832
abstracting: (1<=p24)
states: 364
abstracting: (p24<=1)
states: 832
abstracting: (1<=p25)
states: 272
abstracting: (p25<=1)
states: 832
abstracting: (1<=p30)
states: 104
abstracting: (p30<=1)
states: 832
abstracting: (1<=p14)
states: 206
abstracting: (p14<=1)
states: 832
abstracting: (1<=p21)
states: 324
abstracting: (p21<=1)
states: 832
abstracting: (1<=p30)
states: 104
abstracting: (p30<=1)
states: 832
abstracting: (1<=p13)
states: 204
abstracting: (p13<=1)
states: 832
abstracting: (1<=p21)
states: 324
abstracting: (p21<=1)
states: 832
abstracting: (1<=p27)
states: 112
abstracting: (p27<=1)
states: 832
EG iterations: 0
abstracting: (1<=p20)
states: 124
abstracting: (p20<=1)
states: 832
abstracting: (1<=p24)
states: 364
abstracting: (p24<=1)
states: 832
abstracting: (1<=p25)
states: 272
abstracting: (p25<=1)
states: 832
abstracting: (1<=p30)
states: 104
abstracting: (p30<=1)
states: 832
abstracting: (1<=p3)
states: 664
abstracting: (p3<=1)
states: 832
abstracting: (1<=p7)
states: 168
abstracting: (p7<=1)
states: 832
abstracting: (1<=p22)
states: 72
abstracting: (p22<=1)
states: 832
abstracting: (1<=p26)
states: 448
abstracting: (p26<=1)
states: 832
abstracting: (1<=p28)
states: 276
abstracting: (p28<=1)
states: 832
.abstracting: (1<=p0)
states: 168
abstracting: (p0<=1)
states: 832
abstracting: (1<=p20)
states: 124
abstracting: (p20<=1)
states: 832
abstracting: (1<=p24)
states: 364
abstracting: (p24<=1)
states: 832
abstracting: (1<=p25)
states: 272
abstracting: (p25<=1)
states: 832
abstracting: (1<=p30)
states: 104
abstracting: (p30<=1)
states: 832
abstracting: (1<=p14)
states: 206
abstracting: (p14<=1)
states: 832
abstracting: (1<=p21)
states: 324
abstracting: (p21<=1)
states: 832
abstracting: (1<=p30)
states: 104
abstracting: (p30<=1)
states: 832
abstracting: (1<=p13)
states: 204
abstracting: (p13<=1)
states: 832
abstracting: (1<=p21)
states: 324
abstracting: (p21<=1)
states: 832
abstracting: (1<=p27)
states: 112
abstracting: (p27<=1)
states: 832
EG iterations: 0
abstracting: (1<=p20)
states: 124
abstracting: (p20<=1)
states: 832
abstracting: (1<=p24)
states: 364
abstracting: (p24<=1)
states: 832
abstracting: (1<=p25)
states: 272
abstracting: (p25<=1)
states: 832
abstracting: (1<=p30)
states: 104
abstracting: (p30<=1)
states: 832
.....
EG iterations: 5
-> the formula is TRUE
FORMULA SimpleLoadBal-PT-02-CTLFireability-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.044sec
checking: [EG [~ [E [[p11<=1 & 1<=p11] U AF [[[[p3<=1 & 1<=p3] & [p7<=1 & 1<=p7]] | [[p14<=1 & 1<=p14] & [[p21<=1 & 1<=p21] & [p29<=1 & 1<=p29]]]]]]]] & AX [E [[~ [E [[[p14<=1 & 1<=p14] & [[p21<=1 & 1<=p21] & [p29<=1 & 1<=p29]]] U [[p13<=1 & 1<=p13] & [[p24<=1 & 1<=p24] & [p26<=1 & 1<=p26]]]]] | ~ [[[[p14<=1 & 1<=p14] & [[p24<=1 & 1<=p24] & [p29<=1 & 1<=p29]]] | [[p24<=1 & 1<=p24] & [[p26<=1 & 1<=p26] & [p29<=1 & 1<=p29]]]]]] U [A [AX [[[p22<=1 & 1<=p22] & [[p26<=1 & 1<=p26] & [p28<=1 & 1<=p28]]]] U E [[[p13<=1 & 1<=p13] & [[p24<=1 & 1<=p24] & [p26<=1 & 1<=p26]]] U [[p22<=1 & 1<=p22] & [[p25<=1 & 1<=p25] & [p28<=1 & 1<=p28]]]]] & [[p3<=1 & 1<=p3] & [p7<=1 & 1<=p7]]]]]]
normalized: [~ [EX [~ [E [[~ [[[[[p29<=1 & 1<=p29] & [p26<=1 & 1<=p26]] & [p24<=1 & 1<=p24]] | [[[p29<=1 & 1<=p29] & [p24<=1 & 1<=p24]] & [p14<=1 & 1<=p14]]]] | ~ [E [[[[p29<=1 & 1<=p29] & [p21<=1 & 1<=p21]] & [p14<=1 & 1<=p14]] U [[[p26<=1 & 1<=p26] & [p24<=1 & 1<=p24]] & [p13<=1 & 1<=p13]]]]] U [[[p7<=1 & 1<=p7] & [p3<=1 & 1<=p3]] & [~ [EG [~ [E [[[[p26<=1 & 1<=p26] & [p24<=1 & 1<=p24]] & [p13<=1 & 1<=p13]] U [[[p28<=1 & 1<=p28] & [p25<=1 & 1<=p25]] & [p22<=1 & 1<=p22]]]]]] & ~ [E [~ [E [[[[p26<=1 & 1<=p26] & [p24<=1 & 1<=p24]] & [p13<=1 & 1<=p13]] U [[[p28<=1 & 1<=p28] & [p25<=1 & 1<=p25]] & [p22<=1 & 1<=p22]]]] U [EX [~ [[[[p28<=1 & 1<=p28] & [p26<=1 & 1<=p26]] & [p22<=1 & 1<=p22]]]] & ~ [E [[[[p26<=1 & 1<=p26] & [p24<=1 & 1<=p24]] & [p13<=1 & 1<=p13]] U [[[p28<=1 & 1<=p28] & [p25<=1 & 1<=p25]] & [p22<=1 & 1<=p22]]]]]]]]]]]]] & EG [~ [E [[p11<=1 & 1<=p11] U ~ [EG [~ [[[[[p29<=1 & 1<=p29] & [p21<=1 & 1<=p21]] & [p14<=1 & 1<=p14]] | [[p7<=1 & 1<=p7] & [p3<=1 & 1<=p3]]]]]]]]]]
abstracting: (1<=p3)
states: 664
abstracting: (p3<=1)
states: 832
abstracting: (1<=p7)
states: 168
abstracting: (p7<=1)
states: 832
abstracting: (1<=p14)
states: 206
abstracting: (p14<=1)
states: 832
abstracting: (1<=p21)
states: 324
abstracting: (p21<=1)
states: 832
abstracting: (1<=p29)
states: 452
abstracting: (p29<=1)
states: 832
.......
EG iterations: 7
abstracting: (1<=p11)
states: 204
abstracting: (p11<=1)
states: 832
.......................
EG iterations: 23
abstracting: (1<=p22)
states: 72
abstracting: (p22<=1)
states: 832
abstracting: (1<=p25)
states: 272
abstracting: (p25<=1)
states: 832
abstracting: (1<=p28)
states: 276
abstracting: (p28<=1)
states: 832
abstracting: (1<=p13)
states: 204
abstracting: (p13<=1)
states: 832
abstracting: (1<=p24)
states: 364
abstracting: (p24<=1)
states: 832
abstracting: (1<=p26)
states: 448
abstracting: (p26<=1)
states: 832
abstracting: (1<=p22)
states: 72
abstracting: (p22<=1)
states: 832
abstracting: (1<=p26)
states: 448
abstracting: (p26<=1)
states: 832
abstracting: (1<=p28)
states: 276
abstracting: (p28<=1)
states: 832
.abstracting: (1<=p22)
states: 72
abstracting: (p22<=1)
states: 832
abstracting: (1<=p25)
states: 272
abstracting: (p25<=1)
states: 832
abstracting: (1<=p28)
states: 276
abstracting: (p28<=1)
states: 832
abstracting: (1<=p13)
states: 204
abstracting: (p13<=1)
states: 832
abstracting: (1<=p24)
states: 364
abstracting: (p24<=1)
states: 832
abstracting: (1<=p26)
states: 448
abstracting: (p26<=1)
states: 832
abstracting: (1<=p22)
states: 72
abstracting: (p22<=1)
states: 832
abstracting: (1<=p25)
states: 272
abstracting: (p25<=1)
states: 832
abstracting: (1<=p28)
states: 276
abstracting: (p28<=1)
states: 832
abstracting: (1<=p13)
states: 204
abstracting: (p13<=1)
states: 832
abstracting: (1<=p24)
states: 364
abstracting: (p24<=1)
states: 832
abstracting: (1<=p26)
states: 448
abstracting: (p26<=1)
states: 832
.
EG iterations: 1
abstracting: (1<=p3)
states: 664
abstracting: (p3<=1)
states: 832
abstracting: (1<=p7)
states: 168
abstracting: (p7<=1)
states: 832
abstracting: (1<=p13)
states: 204
abstracting: (p13<=1)
states: 832
abstracting: (1<=p24)
states: 364
abstracting: (p24<=1)
states: 832
abstracting: (1<=p26)
states: 448
abstracting: (p26<=1)
states: 832
abstracting: (1<=p14)
states: 206
abstracting: (p14<=1)
states: 832
abstracting: (1<=p21)
states: 324
abstracting: (p21<=1)
states: 832
abstracting: (1<=p29)
states: 452
abstracting: (p29<=1)
states: 832
abstracting: (1<=p14)
states: 206
abstracting: (p14<=1)
states: 832
abstracting: (1<=p24)
states: 364
abstracting: (p24<=1)
states: 832
abstracting: (1<=p29)
states: 452
abstracting: (p29<=1)
states: 832
abstracting: (1<=p24)
states: 364
abstracting: (p24<=1)
states: 832
abstracting: (1<=p26)
states: 448
abstracting: (p26<=1)
states: 832
abstracting: (1<=p29)
states: 452
abstracting: (p29<=1)
states: 832
.-> the formula is FALSE
FORMULA SimpleLoadBal-PT-02-CTLFireability-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.029sec
checking: A [[[E [~ [[[[p22<=1 & 1<=p22] & [p26<=1 & 1<=p26]] & [[p29<=1 & 1<=p29] & [[p8<=1 & 1<=p8] & [p19<=1 & 1<=p19]]]]] U EF [[[[[p20<=1 & 1<=p20] & [p24<=1 & 1<=p24]] & [[p25<=1 & 1<=p25] & [p30<=1 & 1<=p30]]] | [[p22<=1 & 1<=p22] & [[p25<=1 & 1<=p25] & [p29<=1 & 1<=p29]]]]]] | ~ [EG [[[A [[p11<=1 & 1<=p11] U [[[p18<=1 & 1<=p18] & [p24<=1 & 1<=p24]] & [[p25<=1 & 1<=p25] & [p30<=1 & 1<=p30]]]] & [p24<=1 & 1<=p24]] & [[p26<=1 & 1<=p26] & [p29<=1 & 1<=p29]]]]]] | [[[p23<=1 & 1<=p23] & [[p27<=1 & 1<=p27] & [p29<=1 & 1<=p29]]] | [[EX [[[p14<=1 & 1<=p14] & [[p24<=1 & 1<=p24] & [p29<=1 & 1<=p29]]]] & [p13<=1 & 1<=p13]] & [[p21<=1 & 1<=p21] & [[p27<=1 & 1<=p27] & [EG [[[p22<=1 & 1<=p22] & [[p26<=1 & 1<=p26] & [p29<=1 & 1<=p29]]]] | [[p22<=1 & 1<=p22] & [[p25<=1 & 1<=p25] & [p29<=1 & 1<=p29]]]]]]]]] U EG [[p11<=1 & 1<=p11]]]
normalized: [~ [EG [~ [EG [[p11<=1 & 1<=p11]]]]] & ~ [E [~ [EG [[p11<=1 & 1<=p11]]] U [~ [[[[[[[[[[p29<=1 & 1<=p29] & [p25<=1 & 1<=p25]] & [p22<=1 & 1<=p22]] | EG [[[[p29<=1 & 1<=p29] & [p26<=1 & 1<=p26]] & [p22<=1 & 1<=p22]]]] & [p27<=1 & 1<=p27]] & [p21<=1 & 1<=p21]] & [[p13<=1 & 1<=p13] & EX [[[[p29<=1 & 1<=p29] & [p24<=1 & 1<=p24]] & [p14<=1 & 1<=p14]]]]] | [[[p29<=1 & 1<=p29] & [p27<=1 & 1<=p27]] & [p23<=1 & 1<=p23]]] | [~ [EG [[[[p29<=1 & 1<=p29] & [p26<=1 & 1<=p26]] & [[p24<=1 & 1<=p24] & [~ [EG [~ [[[[p30<=1 & 1<=p30] & [p25<=1 & 1<=p25]] & [[p24<=1 & 1<=p24] & [p18<=1 & 1<=p18]]]]]] & ~ [E [~ [[[[p30<=1 & 1<=p30] & [p25<=1 & 1<=p25]] & [[p24<=1 & 1<=p24] & [p18<=1 & 1<=p18]]]] U [~ [[p11<=1 & 1<=p11]] & ~ [[[[p30<=1 & 1<=p30] & [p25<=1 & 1<=p25]] & [[p24<=1 & 1<=p24] & [p18<=1 & 1<=p18]]]]]]]]]]]] | E [~ [[[[[p19<=1 & 1<=p19] & [p8<=1 & 1<=p8]] & [p29<=1 & 1<=p29]] & [[p26<=1 & 1<=p26] & [p22<=1 & 1<=p22]]]] U E [true U [[[[p29<=1 & 1<=p29] & [p25<=1 & 1<=p25]] & [p22<=1 & 1<=p22]] | [[[p30<=1 & 1<=p30] & [p25<=1 & 1<=p25]] & [[p24<=1 & 1<=p24] & [p20<=1 & 1<=p20]]]]]]]]] & ~ [EG [[p11<=1 & 1<=p11]]]]]]]
abstracting: (1<=p11)
states: 204
abstracting: (p11<=1)
states: 832
.
EG iterations: 1
abstracting: (1<=p20)
states: 124
abstracting: (p20<=1)
states: 832
abstracting: (1<=p24)
states: 364
abstracting: (p24<=1)
states: 832
abstracting: (1<=p25)
states: 272
abstracting: (p25<=1)
states: 832
abstracting: (1<=p30)
states: 104
abstracting: (p30<=1)
states: 832
abstracting: (1<=p22)
states: 72
abstracting: (p22<=1)
states: 832
abstracting: (1<=p25)
states: 272
abstracting: (p25<=1)
states: 832
abstracting: (1<=p29)
states: 452
abstracting: (p29<=1)
states: 832
abstracting: (1<=p22)
states: 72
abstracting: (p22<=1)
states: 832
abstracting: (1<=p26)
states: 448
abstracting: (p26<=1)
states: 832
abstracting: (1<=p29)
states: 452
abstracting: (p29<=1)
states: 832
abstracting: (1<=p8)
states: 212
abstracting: (p8<=1)
states: 832
abstracting: (1<=p19)
states: 132
abstracting: (p19<=1)
states: 832
abstracting: (1<=p18)
states: 124
abstracting: (p18<=1)
states: 832
abstracting: (1<=p24)
states: 364
abstracting: (p24<=1)
states: 832
abstracting: (1<=p25)
states: 272
abstracting: (p25<=1)
states: 832
abstracting: (1<=p30)
states: 104
abstracting: (p30<=1)
states: 832
abstracting: (1<=p11)
states: 204
abstracting: (p11<=1)
states: 832
abstracting: (1<=p18)
states: 124
abstracting: (p18<=1)
states: 832
abstracting: (1<=p24)
states: 364
abstracting: (p24<=1)
states: 832
abstracting: (1<=p25)
states: 272
abstracting: (p25<=1)
states: 832
abstracting: (1<=p30)
states: 104
abstracting: (p30<=1)
states: 832
abstracting: (1<=p18)
states: 124
abstracting: (p18<=1)
states: 832
abstracting: (1<=p24)
states: 364
abstracting: (p24<=1)
states: 832
abstracting: (1<=p25)
states: 272
abstracting: (p25<=1)
states: 832
abstracting: (1<=p30)
states: 104
abstracting: (p30<=1)
states: 832
.
EG iterations: 1
abstracting: (1<=p24)
states: 364
abstracting: (p24<=1)
states: 832
abstracting: (1<=p26)
states: 448
abstracting: (p26<=1)
states: 832
abstracting: (1<=p29)
states: 452
abstracting: (p29<=1)
states: 832
.
EG iterations: 1
abstracting: (1<=p23)
states: 72
abstracting: (p23<=1)
states: 832
abstracting: (1<=p27)
states: 112
abstracting: (p27<=1)
states: 832
abstracting: (1<=p29)
states: 452
abstracting: (p29<=1)
states: 832
abstracting: (1<=p14)
states: 206
abstracting: (p14<=1)
states: 832
abstracting: (1<=p24)
states: 364
abstracting: (p24<=1)
states: 832
abstracting: (1<=p29)
states: 452
abstracting: (p29<=1)
states: 832
.abstracting: (1<=p13)
states: 204
abstracting: (p13<=1)
states: 832
abstracting: (1<=p21)
states: 324
abstracting: (p21<=1)
states: 832
abstracting: (1<=p27)
states: 112
abstracting: (p27<=1)
states: 832
abstracting: (1<=p22)
states: 72
abstracting: (p22<=1)
states: 832
abstracting: (1<=p26)
states: 448
abstracting: (p26<=1)
states: 832
abstracting: (1<=p29)
states: 452
abstracting: (p29<=1)
states: 832
........
EG iterations: 8
abstracting: (1<=p22)
states: 72
abstracting: (p22<=1)
states: 832
abstracting: (1<=p25)
states: 272
abstracting: (p25<=1)
states: 832
abstracting: (1<=p29)
states: 452
abstracting: (p29<=1)
states: 832
abstracting: (1<=p11)
states: 204
abstracting: (p11<=1)
states: 832
.
EG iterations: 1
abstracting: (1<=p11)
states: 204
abstracting: (p11<=1)
states: 832
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE
FORMULA SimpleLoadBal-PT-02-CTLFireability-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT
MC time: 0m 0.007sec
totally nodes used: 39610 (4.0e+04)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 63197 191763 254960
used/not used/entry size/cache size: 225954 66882910 16 1024MB
basic ops cache: hits/miss/sum: 15516 42089 57605
used/not used/entry size/cache size: 70596 16706620 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: 1583 4314 5897
used/not used/entry size/cache size: 4314 8384294 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 67069872
1 38396
2 574
3 22
4 0
5 0
6 0
7 0
8 0
9 0
>= 10 0
Total processing time: 0m 5.563sec
BK_STOP 1679358619376
--------------------
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:1071 (23), effective:115 (2)
initing FirstDep: 0m 0.000sec
iterations count:112 (2), effective:4 (0)
iterations count:45 (1), effective:0 (0)
iterations count:79 (1), effective:2 (0)
iterations count:45 (1), effective:0 (0)
iterations count:827 (18), effective:73 (1)
iterations count:91 (2), effective:5 (0)
iterations count:45 (1), effective:0 (0)
iterations count:831 (18), effective:70 (1)
iterations count:963 (21), effective:93 (2)
iterations count:758 (16), effective:67 (1)
iterations count:47 (1), effective:1 (0)
iterations count:97 (2), effective:6 (0)
iterations count:97 (2), effective:6 (0)
iterations count:45 (1), effective:0 (0)
iterations count:97 (2), effective:6 (0)
iterations count:427 (9), effective:28 (0)
iterations count:45 (1), effective:0 (0)
iterations count:45 (1), effective:0 (0)
iterations count:45 (1), effective:0 (0)
iterations count:45 (1), effective:0 (0)
iterations count:53 (1), effective:1 (0)
iterations count:897 (19), effective:85 (1)
iterations count:684 (15), effective:58 (1)
iterations count:45 (1), effective:0 (0)
iterations count:46 (1), effective:1 (0)
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SimpleLoadBal-PT-02"
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 SimpleLoadBal-PT-02, 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 r426-tajo-167905979000498"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SimpleLoadBal-PT-02.tgz
mv SimpleLoadBal-PT-02 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 '
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 ;