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-167905979000513.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-10, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905979000513
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 976K
-rw-r--r-- 1 mcc users 8.8K Feb 26 03:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 03:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 03:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 26 03:49 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.6K Feb 25 17:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 17:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 03:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 26 03:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 03:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 03:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:07 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 535K 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-10-CTLCardinality-00
FORMULA_NAME SimpleLoadBal-PT-10-CTLCardinality-01
FORMULA_NAME SimpleLoadBal-PT-10-CTLCardinality-02
FORMULA_NAME SimpleLoadBal-PT-10-CTLCardinality-03
FORMULA_NAME SimpleLoadBal-PT-10-CTLCardinality-04
FORMULA_NAME SimpleLoadBal-PT-10-CTLCardinality-05
FORMULA_NAME SimpleLoadBal-PT-10-CTLCardinality-06
FORMULA_NAME SimpleLoadBal-PT-10-CTLCardinality-07
FORMULA_NAME SimpleLoadBal-PT-10-CTLCardinality-08
FORMULA_NAME SimpleLoadBal-PT-10-CTLCardinality-09
FORMULA_NAME SimpleLoadBal-PT-10-CTLCardinality-10
FORMULA_NAME SimpleLoadBal-PT-10-CTLCardinality-11
FORMULA_NAME SimpleLoadBal-PT-10-CTLCardinality-12
FORMULA_NAME SimpleLoadBal-PT-10-CTLCardinality-13
FORMULA_NAME SimpleLoadBal-PT-10-CTLCardinality-14
FORMULA_NAME SimpleLoadBal-PT-10-CTLCardinality-15

=== Now, execution of the tool begins

BK_START 1679358861674

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=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SimpleLoadBal-PT-10
Applying reductions before tool marcie
Invoking reducer
Running Version 202303021504
[2023-03-21 00:34:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 00:34:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 00:34:23] [INFO ] Load time of PNML (sax parser for PT used): 74 ms
[2023-03-21 00:34:23] [INFO ] Transformed 104 places.
[2023-03-21 00:34:23] [INFO ] Transformed 605 transitions.
[2023-03-21 00:34:23] [INFO ] Found NUPN structural information;
[2023-03-21 00:34:23] [INFO ] Completing missing partition info from NUPN : creating a component with [P_client_idle_1, P_client_idle_2, P_client_idle_3, P_client_idle_4, P_client_idle_5, P_client_idle_6, P_client_idle_7, P_client_idle_8, P_client_idle_9, P_client_idle_10, P_client_waiting_1, P_client_waiting_2, P_client_waiting_3, P_client_waiting_4, P_client_waiting_5, P_client_waiting_6, P_client_waiting_7, P_client_waiting_8, P_client_waiting_9, P_client_waiting_10, P_client_request_1, P_client_request_2, P_client_request_3, P_client_request_4, P_client_request_5, P_client_request_6, P_client_request_7, P_client_request_8, P_client_request_9, P_client_request_10, P_client_ack_1, P_client_ack_2, P_client_ack_3, P_client_ack_4, P_client_ack_5, P_client_ack_6, P_client_ack_7, P_client_ack_8, P_client_ack_9, P_client_ack_10, 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_server_request_3_1, P_server_request_3_2, P_server_request_4_1, P_server_request_4_2, P_server_request_5_1, P_server_request_5_2, P_server_request_6_1, P_server_request_6_2, P_server_request_7_1, P_server_request_7_2, P_server_request_8_1, P_server_request_8_2, P_server_request_9_1, P_server_request_9_2, P_server_request_10_1, P_server_request_10_2, P_lb_idle_1, P_lb_routing_1_1, P_lb_routing_1_2, P_lb_routing_1_3, P_lb_routing_1_4, P_lb_routing_1_5, P_lb_routing_1_6, P_lb_routing_1_7, P_lb_routing_1_8, P_lb_routing_1_9, P_lb_routing_1_10, P_lb_balancing_1, P_lb_load_1_0, P_lb_load_1_1, P_lb_load_1_2, P_lb_load_1_3, P_lb_load_1_4, P_lb_load_1_5, P_lb_load_1_6, P_lb_load_1_7, P_lb_load_1_8, P_lb_load_1_9, P_lb_load_1_10, P_lb_load_2_0, P_lb_load_2_1, P_lb_load_2_2, P_lb_load_2_3, P_lb_load_2_4, P_lb_load_2_5, P_lb_load_2_6, P_lb_load_2_7, P_lb_load_2_8, P_lb_load_2_9, P_lb_load_2_10]
[2023-03-21 00:34:23] [INFO ] Parsed PT model containing 104 places and 605 transitions and 4148 arcs in 169 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 11 ms.
Support contains 75 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 605/605 transitions.
Applied a total of 0 rules in 18 ms. Remains 104 /104 variables (removed 0) and now considering 605/605 (removed 0) transitions.
[2023-03-21 00:34:23] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
// Phase 1: matrix 475 rows 104 cols
[2023-03-21 00:34:23] [INFO ] Computed 29 place invariants in 23 ms
[2023-03-21 00:34:24] [INFO ] Implicit Places using invariants in 245 ms returned [15, 17, 19, 43]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 272 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 100/104 places, 605/605 transitions.
Applied a total of 0 rules in 5 ms. Remains 100 /100 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 298 ms. Remains : 100/104 places, 605/605 transitions.
Support contains 75 out of 100 places after structural reductions.
[2023-03-21 00:34:24] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2023-03-21 00:34:24] [INFO ] Flatten gal took : 92 ms
FORMULA SimpleLoadBal-PT-10-CTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-21 00:34:24] [INFO ] Flatten gal took : 49 ms
[2023-03-21 00:34:24] [INFO ] Input system was already deterministic with 605 transitions.
Support contains 61 out of 100 places (down from 75) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 378 ms. (steps per millisecond=26 ) properties (out of 51) seen :47
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2023-03-21 00:34:25] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
// Phase 1: matrix 475 rows 100 cols
[2023-03-21 00:34:25] [INFO ] Computed 25 place invariants in 14 ms
[2023-03-21 00:34:25] [INFO ] [Real]Absence check using 21 positive place invariants in 9 ms returned sat
[2023-03-21 00:34:25] [INFO ] [Real]Absence check using 21 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-21 00:34:25] [INFO ] After 160ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 00:34:25] [INFO ] [Nat]Absence check using 21 positive place invariants in 3 ms returned sat
[2023-03-21 00:34:25] [INFO ] [Nat]Absence check using 21 positive and 4 generalized place invariants in 5 ms returned sat
[2023-03-21 00:34:25] [INFO ] After 333ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 00:34:25] [INFO ] State equation strengthened by 210 read => feed constraints.
[2023-03-21 00:34:26] [INFO ] After 387ms SMT Verify possible using 210 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 00:34:26] [INFO ] Deduced a trap composed of 17 places in 148 ms of which 26 ms to minimize.
[2023-03-21 00:34:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 184 ms
[2023-03-21 00:34:26] [INFO ] Deduced a trap composed of 16 places in 139 ms of which 1 ms to minimize.
[2023-03-21 00:34:26] [INFO ] Deduced a trap composed of 14 places in 175 ms of which 1 ms to minimize.
[2023-03-21 00:34:26] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 370 ms
[2023-03-21 00:34:26] [INFO ] After 1134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 134 ms.
[2023-03-21 00:34:27] [INFO ] After 1700ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 46 ms.
Support contains 5 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 605/605 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 100 transition count 602
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 97 transition count 602
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 94 transition count 599
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 21 rules applied. Total rules applied 33 place count 80 transition count 592
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 47 place count 73 transition count 585
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 57 place count 73 transition count 575
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 67 place count 63 transition count 575
Applied a total of 67 rules in 139 ms. Remains 63 /100 variables (removed 37) and now considering 575/605 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 139 ms. Remains : 63/100 places, 575/605 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 302 ms. (steps per millisecond=33 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 267831 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 267831 steps, saw 145197 distinct states, run finished after 3017 ms. (steps per millisecond=88 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-21 00:34:30] [INFO ] Flow matrix only has 445 transitions (discarded 130 similar events)
// Phase 1: matrix 445 rows 63 cols
[2023-03-21 00:34:30] [INFO ] Computed 18 place invariants in 12 ms
[2023-03-21 00:34:30] [INFO ] [Real]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-21 00:34:30] [INFO ] [Real]Absence check using 14 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-21 00:34:30] [INFO ] After 152ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 00:34:31] [INFO ] [Nat]Absence check using 14 positive place invariants in 2 ms returned sat
[2023-03-21 00:34:31] [INFO ] [Nat]Absence check using 14 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-21 00:34:31] [INFO ] After 162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 00:34:31] [INFO ] State equation strengthened by 210 read => feed constraints.
[2023-03-21 00:34:31] [INFO ] After 116ms SMT Verify possible using 210 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 00:34:31] [INFO ] Deduced a trap composed of 15 places in 118 ms of which 1 ms to minimize.
[2023-03-21 00:34:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 174 ms
[2023-03-21 00:34:31] [INFO ] Deduced a trap composed of 14 places in 111 ms of which 1 ms to minimize.
[2023-03-21 00:34:31] [INFO ] Deduced a trap composed of 14 places in 133 ms of which 1 ms to minimize.
[2023-03-21 00:34:31] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 334 ms
[2023-03-21 00:34:32] [INFO ] After 828ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 160 ms.
[2023-03-21 00:34:32] [INFO ] After 1220ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 34 ms.
Support contains 5 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 575/575 transitions.
Applied a total of 0 rules in 46 ms. Remains 63 /63 variables (removed 0) and now considering 575/575 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 63/63 places, 575/575 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 575/575 transitions.
Applied a total of 0 rules in 44 ms. Remains 63 /63 variables (removed 0) and now considering 575/575 (removed 0) transitions.
[2023-03-21 00:34:32] [INFO ] Flow matrix only has 445 transitions (discarded 130 similar events)
[2023-03-21 00:34:32] [INFO ] Invariant cache hit.
[2023-03-21 00:34:32] [INFO ] Implicit Places using invariants in 201 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 205 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 62/63 places, 575/575 transitions.
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 0 with 2 rules applied. Total rules applied 2 place count 61 transition count 574
Applied a total of 2 rules in 49 ms. Remains 61 /62 variables (removed 1) and now considering 574/575 (removed 1) transitions.
[2023-03-21 00:34:32] [INFO ] Flow matrix only has 444 transitions (discarded 130 similar events)
// Phase 1: matrix 444 rows 61 cols
[2023-03-21 00:34:32] [INFO ] Computed 17 place invariants in 6 ms
[2023-03-21 00:34:32] [INFO ] Implicit Places using invariants in 200 ms returned []
[2023-03-21 00:34:32] [INFO ] Flow matrix only has 444 transitions (discarded 130 similar events)
[2023-03-21 00:34:32] [INFO ] Invariant cache hit.
[2023-03-21 00:34:32] [INFO ] State equation strengthened by 210 read => feed constraints.
[2023-03-21 00:34:33] [INFO ] Implicit Places using invariants and state equation in 517 ms returned []
Implicit Place search using SMT with State Equation took 721 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 61/63 places, 574/575 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1021 ms. Remains : 61/63 places, 574/575 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 278 ms. (steps per millisecond=35 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 284680 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :{}
Probabilistic random walk after 284680 steps, saw 141950 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-21 00:34:36] [INFO ] Flow matrix only has 444 transitions (discarded 130 similar events)
[2023-03-21 00:34:36] [INFO ] Invariant cache hit.
[2023-03-21 00:34:36] [INFO ] [Real]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-21 00:34:36] [INFO ] [Real]Absence check using 13 positive and 4 generalized place invariants in 2 ms returned sat
[2023-03-21 00:34:36] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-21 00:34:36] [INFO ] [Nat]Absence check using 13 positive place invariants in 1 ms returned sat
[2023-03-21 00:34:36] [INFO ] [Nat]Absence check using 13 positive and 4 generalized place invariants in 1 ms returned sat
[2023-03-21 00:34:36] [INFO ] After 128ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-21 00:34:36] [INFO ] State equation strengthened by 210 read => feed constraints.
[2023-03-21 00:34:37] [INFO ] After 109ms SMT Verify possible using 210 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2023-03-21 00:34:37] [INFO ] After 215ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 102 ms.
[2023-03-21 00:34:37] [INFO ] After 492ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 18 ms.
Support contains 5 out of 61 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 574/574 transitions.
Applied a total of 0 rules in 23 ms. Remains 61 /61 variables (removed 0) and now considering 574/574 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 61/61 places, 574/574 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 61/61 places, 574/574 transitions.
Applied a total of 0 rules in 22 ms. Remains 61 /61 variables (removed 0) and now considering 574/574 (removed 0) transitions.
[2023-03-21 00:34:37] [INFO ] Flow matrix only has 444 transitions (discarded 130 similar events)
[2023-03-21 00:34:37] [INFO ] Invariant cache hit.
[2023-03-21 00:34:37] [INFO ] Implicit Places using invariants in 189 ms returned []
[2023-03-21 00:34:37] [INFO ] Flow matrix only has 444 transitions (discarded 130 similar events)
[2023-03-21 00:34:37] [INFO ] Invariant cache hit.
[2023-03-21 00:34:37] [INFO ] State equation strengthened by 210 read => feed constraints.
[2023-03-21 00:34:38] [INFO ] Implicit Places using invariants and state equation in 462 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
[2023-03-21 00:34:38] [INFO ] Redundant transitions in 39 ms returned []
[2023-03-21 00:34:38] [INFO ] Flow matrix only has 444 transitions (discarded 130 similar events)
[2023-03-21 00:34:38] [INFO ] Invariant cache hit.
[2023-03-21 00:34:38] [INFO ] Dead Transitions using invariants and state equation in 278 ms found 192 transitions.
Found 192 dead transitions using SMT.
Drop transitions removed 192 transitions
Dead transitions reduction (with SMT) removed 192 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 61/61 places, 382/574 transitions.
Reduce places removed 2 places and 4 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 59 transition count 378
Reduce places removed 2 places and 4 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 57 transition count 374
Reduce places removed 0 places and 4 transitions.
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 2 places and 24 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 55 transition count 346
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 6 rules in 20 ms. Remains 55 /61 variables (removed 6) and now considering 346/382 (removed 36) transitions.
[2023-03-21 00:34:38] [INFO ] Flow matrix only has 268 transitions (discarded 78 similar events)
// Phase 1: matrix 268 rows 55 cols
[2023-03-21 00:34:38] [INFO ] Computed 19 place invariants in 7 ms
[2023-03-21 00:34:38] [INFO ] Implicit Places using invariants in 122 ms returned []
[2023-03-21 00:34:38] [INFO ] Flow matrix only has 268 transitions (discarded 78 similar events)
[2023-03-21 00:34:38] [INFO ] Invariant cache hit.
[2023-03-21 00:34:38] [INFO ] State equation strengthened by 122 read => feed constraints.
[2023-03-21 00:34:38] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 55/61 places, 346/574 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1358 ms. Remains : 55/61 places, 346/574 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Successfully simplified 4 atomic propositions for a total of 14 simplifications.
FORMULA SimpleLoadBal-PT-10-CTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2023-03-21 00:34:38] [INFO ] Flatten gal took : 33 ms
[2023-03-21 00:34:38] [INFO ] Flatten gal took : 32 ms
[2023-03-21 00:34:38] [INFO ] Input system was already deterministic with 605 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 605/605 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 100/100 places, 605/605 transitions.
[2023-03-21 00:34:38] [INFO ] Flatten gal took : 26 ms
[2023-03-21 00:34:38] [INFO ] Flatten gal took : 26 ms
[2023-03-21 00:34:38] [INFO ] Input system was already deterministic with 605 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 605/605 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 100/100 places, 605/605 transitions.
[2023-03-21 00:34:39] [INFO ] Flatten gal took : 24 ms
[2023-03-21 00:34:39] [INFO ] Flatten gal took : 26 ms
[2023-03-21 00:34:39] [INFO ] Input system was already deterministic with 605 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 100/100 places, 605/605 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 100 transition count 601
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 96 transition count 601
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 18 place count 91 transition count 596
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 21 rules applied. Total rules applied 39 place count 77 transition count 589
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 53 place count 70 transition count 582
Applied a total of 53 rules in 35 ms. Remains 70 /100 variables (removed 30) and now considering 582/605 (removed 23) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 36 ms. Remains : 70/100 places, 582/605 transitions.
[2023-03-21 00:34:39] [INFO ] Flatten gal took : 24 ms
[2023-03-21 00:34:39] [INFO ] Flatten gal took : 27 ms
[2023-03-21 00:34:39] [INFO ] Input system was already deterministic with 582 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 605/605 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 100/100 places, 605/605 transitions.
[2023-03-21 00:34:39] [INFO ] Flatten gal took : 22 ms
[2023-03-21 00:34:39] [INFO ] Flatten gal took : 22 ms
[2023-03-21 00:34:39] [INFO ] Input system was already deterministic with 605 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 100/100 places, 605/605 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 100 transition count 601
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 96 transition count 601
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 12 place count 94 transition count 599
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 15 rules applied. Total rules applied 27 place count 84 transition count 594
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 37 place count 79 transition count 589
Applied a total of 37 rules in 31 ms. Remains 79 /100 variables (removed 21) and now considering 589/605 (removed 16) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 31 ms. Remains : 79/100 places, 589/605 transitions.
[2023-03-21 00:34:39] [INFO ] Flatten gal took : 23 ms
[2023-03-21 00:34:39] [INFO ] Flatten gal took : 24 ms
[2023-03-21 00:34:39] [INFO ] Input system was already deterministic with 589 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 605/605 transitions.
Applied a total of 0 rules in 1 ms. Remains 100 /100 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 100/100 places, 605/605 transitions.
[2023-03-21 00:34:39] [INFO ] Flatten gal took : 20 ms
[2023-03-21 00:34:39] [INFO ] Flatten gal took : 21 ms
[2023-03-21 00:34:39] [INFO ] Input system was already deterministic with 605 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 605/605 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 100/100 places, 605/605 transitions.
[2023-03-21 00:34:39] [INFO ] Flatten gal took : 21 ms
[2023-03-21 00:34:39] [INFO ] Flatten gal took : 24 ms
[2023-03-21 00:34:39] [INFO ] Input system was already deterministic with 605 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 605/605 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 100/100 places, 605/605 transitions.
[2023-03-21 00:34:39] [INFO ] Flatten gal took : 20 ms
[2023-03-21 00:34:39] [INFO ] Flatten gal took : 21 ms
[2023-03-21 00:34:39] [INFO ] Input system was already deterministic with 605 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 100/100 places, 605/605 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 100 transition count 601
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 96 transition count 601
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 18 place count 91 transition count 596
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 0 with 21 rules applied. Total rules applied 39 place count 77 transition count 589
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 53 place count 70 transition count 582
Applied a total of 53 rules in 27 ms. Remains 70 /100 variables (removed 30) and now considering 582/605 (removed 23) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 27 ms. Remains : 70/100 places, 582/605 transitions.
[2023-03-21 00:34:39] [INFO ] Flatten gal took : 22 ms
[2023-03-21 00:34:39] [INFO ] Flatten gal took : 23 ms
[2023-03-21 00:34:39] [INFO ] Input system was already deterministic with 582 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 100/100 places, 605/605 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 100 transition count 601
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 96 transition count 601
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 18 place count 91 transition count 596
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 79 transition count 590
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 74 transition count 585
Applied a total of 46 rules in 24 ms. Remains 74 /100 variables (removed 26) and now considering 585/605 (removed 20) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 24 ms. Remains : 74/100 places, 585/605 transitions.
[2023-03-21 00:34:40] [INFO ] Flatten gal took : 20 ms
[2023-03-21 00:34:40] [INFO ] Flatten gal took : 22 ms
[2023-03-21 00:34:40] [INFO ] Input system was already deterministic with 585 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 605/605 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 100/100 places, 605/605 transitions.
[2023-03-21 00:34:40] [INFO ] Flatten gal took : 18 ms
[2023-03-21 00:34:40] [INFO ] Flatten gal took : 19 ms
[2023-03-21 00:34:40] [INFO ] Input system was already deterministic with 605 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 100/100 places, 605/605 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 100 transition count 602
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 97 transition count 602
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 0 with 8 rules applied. Total rules applied 14 place count 93 transition count 598
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 18 rules applied. Total rules applied 32 place count 81 transition count 592
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 44 place count 75 transition count 586
Applied a total of 44 rules in 22 ms. Remains 75 /100 variables (removed 25) and now considering 586/605 (removed 19) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 22 ms. Remains : 75/100 places, 586/605 transitions.
[2023-03-21 00:34:40] [INFO ] Flatten gal took : 19 ms
[2023-03-21 00:34:40] [INFO ] Flatten gal took : 20 ms
[2023-03-21 00:34:40] [INFO ] Input system was already deterministic with 586 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 605/605 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 100/100 places, 605/605 transitions.
[2023-03-21 00:34:40] [INFO ] Flatten gal took : 16 ms
[2023-03-21 00:34:40] [INFO ] Flatten gal took : 18 ms
[2023-03-21 00:34:40] [INFO ] Input system was already deterministic with 605 transitions.
Starting structural reductions in LTL mode, iteration 0 : 100/100 places, 605/605 transitions.
Applied a total of 0 rules in 2 ms. Remains 100 /100 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 100/100 places, 605/605 transitions.
[2023-03-21 00:34:40] [INFO ] Flatten gal took : 16 ms
[2023-03-21 00:34:40] [INFO ] Flatten gal took : 17 ms
[2023-03-21 00:34:40] [INFO ] Input system was already deterministic with 605 transitions.
[2023-03-21 00:34:40] [INFO ] Flatten gal took : 17 ms
[2023-03-21 00:34:40] [INFO ] Flatten gal took : 17 ms
[2023-03-21 00:34:40] [INFO ] Export to MCC of 14 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 2 ms.
[2023-03-21 00:34:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 100 places, 605 transitions and 4140 arcs took 3 ms.
Total runtime 17033 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=CTLCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: Petri
(NrP: 100 NrTr: 605 NrArc: 4140)

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

net check time: 0m 0.000sec

init dd package: 0m 3.308sec


RS generation: 1m25.702sec


-> reachability set: #nodes 543986 (5.4e+05) #states 406,034,376 (8)



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

checking: AX [1<=0]
normalized: ~ [EX [~ [1<=0]]]

abstracting: (1<=0)
states: 0
.-> the formula is FALSE

FORMULA SimpleLoadBal-PT-10-CTLCardinality-14 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m37.577sec

checking: AG [EX [EF [[p42<=1 & 1<=p42]]]]
normalized: ~ [E [true U ~ [EX [E [true U [p42<=1 & 1<=p42]]]]]]

abstracting: (1<=p42)
states: 101,400,822 (8)
abstracting: (p42<=1)
states: 406,034,376 (8)
.-> the formula is TRUE

FORMULA SimpleLoadBal-PT-10-CTLCardinality-08 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m40.316sec

checking: AG [EF [[p71<=1 & 1<=p71]]]
normalized: ~ [E [true U ~ [E [true U [p71<=1 & 1<=p71]]]]]

abstracting: (1<=p71)
states: 16,974,360 (7)
abstracting: (p71<=1)
states: 406,034,376 (8)
-> the formula is TRUE

FORMULA SimpleLoadBal-PT-10-CTLCardinality-09 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m20.721sec

checking: AX [EG [EF [[p2<=0 & 0<=p2]]]]
normalized: ~ [EX [~ [EG [E [true U [p2<=0 & 0<=p2]]]]]]

abstracting: (0<=p2)
states: 406,034,376 (8)
abstracting: (p2<=0)
states: 326,077,200 (8)

EG iterations: 0
.-> the formula is TRUE

FORMULA SimpleLoadBal-PT-10-CTLCardinality-12 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 2.500sec

checking: AG [EF [[[0<=p63 & p63<=0] & [p49<=1 & 1<=p49]]]]
normalized: ~ [E [true U ~ [E [true U [[p49<=1 & 1<=p49] & [0<=p63 & p63<=0]]]]]]

abstracting: (p63<=0)
states: 331,547,652 (8)
abstracting: (0<=p63)
states: 406,034,376 (8)
abstracting: (1<=p49)
states: 74,486,724 (7)
abstracting: (p49<=1)
states: 406,034,376 (8)
-> the formula is TRUE

FORMULA SimpleLoadBal-PT-10-CTLCardinality-02 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m26.888sec

checking: EG [A [EF [[[p83<=1 & 1<=p83] & [p30<=1 & 1<=p30]]] U ~ [AF [[p23<=0 & 0<=p23]]]]]
normalized: EG [[~ [EG [~ [EG [~ [[p23<=0 & 0<=p23]]]]]] & ~ [E [~ [EG [~ [[p23<=0 & 0<=p23]]]] U [~ [E [true U [[p30<=1 & 1<=p30] & [p83<=1 & 1<=p83]]]] & ~ [EG [~ [[p23<=0 & 0<=p23]]]]]]]]]

abstracting: (0<=p23)
states: 406,034,376 (8)
abstracting: (p23<=0)
states: 326,077,200 (8)
.
EG iterations: 1
abstracting: (1<=p83)
states: 10,463,040 (7)
abstracting: (p83<=1)
states: 406,034,376 (8)
abstracting: (1<=p30)
states: 79,957,176 (7)
abstracting: (p30<=1)
states: 406,034,376 (8)
abstracting: (0<=p23)
states: 406,034,376 (8)
abstracting: (p23<=0)
states: 326,077,200 (8)
.
EG iterations: 1
abstracting: (0<=p23)
states: 406,034,376 (8)
abstracting: (p23<=0)
states: 326,077,200 (8)
.
EG iterations: 1
.
EG iterations: 1
.
EG iterations: 1
-> the formula is FALSE

FORMULA SimpleLoadBal-PT-10-CTLCardinality-10 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m31.758sec

checking: EF [EG [[[~ [[p57<=1 & 1<=p57]] & ~ [[p19<=0 & 0<=p19]]] & [p7<=1 & 1<=p7]]]]
normalized: E [true U EG [[[p7<=1 & 1<=p7] & [~ [[p19<=0 & 0<=p19]] & ~ [[p57<=1 & 1<=p57]]]]]]

abstracting: (1<=p57)
states: 74,486,724 (7)
abstracting: (p57<=1)
states: 406,034,376 (8)
abstracting: (0<=p19)
states: 406,034,376 (8)
abstracting: (p19<=0)
states: 326,077,200 (8)
abstracting: (1<=p7)
states: 79,957,176 (7)
abstracting: (p7<=1)
states: 406,034,376 (8)
....................
EG iterations: 20
-> the formula is TRUE

FORMULA SimpleLoadBal-PT-10-CTLCardinality-13 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m22.784sec

checking: AF [AG [AX [[[~ [[p12<=1 & 1<=p12]] & ~ [[p24<=0 & 0<=p24]]] & [~ [[p22<=1 & 1<=p22]] & [p24<=1 & 1<=p24]]]]]]
normalized: ~ [EG [E [true U EX [~ [[[[p24<=1 & 1<=p24] & ~ [[p22<=1 & 1<=p22]]] & [~ [[p24<=0 & 0<=p24]] & ~ [[p12<=1 & 1<=p12]]]]]]]]]

abstracting: (1<=p12)
states: 326,077,200 (8)
abstracting: (p12<=1)
states: 406,034,376 (8)
abstracting: (0<=p24)
states: 406,034,376 (8)
abstracting: (p24<=0)
states: 326,077,200 (8)
abstracting: (1<=p22)
states: 79,957,176 (7)
abstracting: (p22<=1)
states: 406,034,376 (8)
abstracting: (1<=p24)
states: 79,957,176 (7)
abstracting: (p24<=1)
states: 406,034,376 (8)
.
EG iterations: 0
-> the formula is FALSE

FORMULA SimpleLoadBal-PT-10-CTLCardinality-03 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m27.162sec

checking: EG [[A [AG [[0<=p4 & p4<=0]] U [AX [[[p4<=1 & 1<=p4] | [p1<=0 & 0<=p1]]] & AX [[[p13<=0 & 0<=p13] | [p92<=1 & 1<=p92]]]]] | AX [[EG [[p64<=0 & 0<=p64]] & [p45<=0 & 0<=p45]]]]]
normalized: EG [[[~ [EG [~ [[~ [EX [~ [[[p1<=0 & 0<=p1] | [p4<=1 & 1<=p4]]]]] & ~ [EX [~ [[[p92<=1 & 1<=p92] | [p13<=0 & 0<=p13]]]]]]]]] & ~ [E [~ [[~ [EX [~ [[[p1<=0 & 0<=p1] | [p4<=1 & 1<=p4]]]]] & ~ [EX [~ [[[p92<=1 & 1<=p92] | [p13<=0 & 0<=p13]]]]]]] U [~ [[~ [EX [~ [[[p1<=0 & 0<=p1] | [p4<=1 & 1<=p4]]]]] & ~ [EX [~ [[[p92<=1 & 1<=p92] | [p13<=0 & 0<=p13]]]]]]] & E [true U ~ [[0<=p4 & p4<=0]]]]]]] | ~ [EX [~ [[[p45<=0 & 0<=p45] & EG [[p64<=0 & 0<=p64]]]]]]]]

abstracting: (0<=p64)
states: 406,034,376 (8)
abstracting: (p64<=0)
states: 331,332,612 (8)
..........................
EG iterations: 26
abstracting: (0<=p45)
states: 406,034,376 (8)
abstracting: (p45<=0)
states: 304,525,530 (8)
.abstracting: (p4<=0)
states: 326,077,200 (8)
abstracting: (0<=p4)
states: 406,034,376 (8)
abstracting: (0<=p13)
states: 406,034,376 (8)
abstracting: (p13<=0)
states: 79,957,176 (7)
abstracting: (1<=p92)
states: 114,913,440 (8)
abstracting: (p92<=1)
states: 406,034,376 (8)
.abstracting: (1<=p4)
states: 79,957,176 (7)
abstracting: (p4<=1)
states: 406,034,376 (8)
abstracting: (0<=p1)
states: 406,034,376 (8)
abstracting: (p1<=0)
states: 326,077,200 (8)
.abstracting: (0<=p13)
states: 406,034,376 (8)
abstracting: (p13<=0)
states: 79,957,176 (7)
abstracting: (1<=p92)
states: 114,913,440 (8)
abstracting: (p92<=1)
states: 406,034,376 (8)
.abstracting: (1<=p4)
states: 79,957,176 (7)
abstracting: (p4<=1)
states: 406,034,376 (8)
abstracting: (0<=p1)
states: 406,034,376 (8)
abstracting: (p1<=0)
states: 326,077,200 (8)
.abstracting: (0<=p13)
states: 406,034,376 (8)
abstracting: (p13<=0)
states: 79,957,176 (7)
abstracting: (1<=p92)
states: 114,913,440 (8)
abstracting: (p92<=1)
states: 406,034,376 (8)
.abstracting: (1<=p4)
states: 79,957,176 (7)
abstracting: (p4<=1)
states: 406,034,376 (8)
abstracting: (0<=p1)
states: 406,034,376 (8)
abstracting: (p1<=0)
states: 326,077,200 (8)
.........
before gc: list nodes free: 985225

after gc: idd nodes used:4729129, unused:59270871; list nodes free:270278522
...............
EG iterations: 23
.......MC time: 8m51.270sec

checking: [AX [[EG [AF [[1<=p70 & p70<=1]]] & AF [[p39<=0 & 0<=p39]]]] & [EF [[[1<=p41 & p41<=1] & [0<=p15 & p15<=0]]] & AF [[AF [EG [[0<=p65 & p65<=0]]] | [EG [EX [0<=0]] | [~ [[0<=p60 & p60<=0]] & ~ [[p39<=1 & 1<=p39]]]]]]]]
normalized: [[~ [EG [~ [[[[~ [[p39<=1 & 1<=p39]] & ~ [[0<=p60 & p60<=0]]] | EG [EX [0<=0]]] | ~ [EG [~ [EG [[0<=p65 & p65<=0]]]]]]]]] & E [true U [[0<=p15 & p15<=0] & [1<=p41 & p41<=1]]]] & ~ [EX [~ [[~ [EG [~ [[p39<=0 & 0<=p39]]]] & EG [~ [EG [~ [[1<=p70 & p70<=1]]]]]]]]]]

abstracting: (p70<=1)
states: 406,034,376 (8)
abstracting: (1<=p70)
states: 16,974,360 (7)
.
EG iterations: 1
..........................
EG iterations: 26
abstracting: (0<=p39)
states: 406,034,376 (8)
abstracting: (p39<=0)
states: 203,017,188 (8)
.......................
EG iterations: 23
.abstracting: (p41<=1)
states: 406,034,376 (8)
abstracting: (1<=p41)
states: 101,508,342 (8)
abstracting: (p15<=0)

before gc: list nodes free: 1960019

after gc: idd nodes used:4143491, unused:59856509; list nodes free:275068526
states: 79,957,176 (7)
abstracting: (0<=p15)
states: 406,034,376 (8)
abstracting: (p65<=0)
states: 331,547,652 (8)
abstracting: (0<=p65)
states: 406,034,376 (8)
..........MC time: 7m22.086sec

checking: AX [EX [A [~ [[[[1<=p25 & p25<=1] | [p12<=0 & 0<=p12]] & [[[1<=p85 & p85<=1] | [0<=p79 & p79<=0]] | [[1<=p44 & p44<=1] | [0<=p91 & p91<=0]]]]] U EG [[[1<=p6 & p6<=1] | [p80<=0 & 0<=p80]]]]]]
normalized: ~ [EX [~ [EX [[~ [EG [~ [EG [[[p80<=0 & 0<=p80] | [1<=p6 & p6<=1]]]]]] & ~ [E [~ [EG [[[p80<=0 & 0<=p80] | [1<=p6 & p6<=1]]]] U [[[[[0<=p79 & p79<=0] | [1<=p85 & p85<=1]] | [[0<=p91 & p91<=0] | [1<=p44 & p44<=1]]] & [[p12<=0 & 0<=p12] | [1<=p25 & p25<=1]]] & ~ [EG [[[p80<=0 & 0<=p80] | [1<=p6 & p6<=1]]]]]]]]]]]]

abstracting: (p6<=1)
states: 406,034,376 (8)
abstracting: (1<=p6)
states: 79,957,176 (7)
abstracting: (0<=p80)
states: 406,034,376 (8)
abstracting: (p80<=0)
states: 259,063,116 (8)
....................................
EG iterations: 36
abstracting: (p25<=1)
states: 406,034,376 (8)
abstracting: (1<=p25)
states: 79,957,176 (7)
abstracting: (0<=p12)
states: 406,034,376 (8)
abstracting: (p12<=0)
states: 79,957,176 (7)
abstracting: (p44<=1)
states: 406,034,376 (8)
abstracting: (1<=p44)
states: 101,616,366 (8)
abstracting: (p91<=0)
states: 258,927,036 (8)
abstracting: (0<=p91)
states: 406,034,376 (8)
abstracting: (p85<=1)
states: 406,034,376 (8)
abstracting: (1<=p85)
states: 0
abstracting: (p79<=0)
states: 330,256,284 (8)
abstracting: (0<=p79)
states: 406,034,376 (8)
abstracting: (p6<=1)
states: 406,034,376 (8)
abstracting: (1<=p6)
states: 79,957,176 (7)
abstracting: (0<=p80)
states: 406,034,376 (8)
abstracting: (p80<=0)
states: 259,063,116 (8)
....................................
EG iterations: 36
abstracting: (p6<=1)
states: 406,034,376 (8)
abstracting: (1<=p6)
states: 79,957,176 (7)
abstracting: (0<=p80)
states: 406,034,376 (8)
abstracting: (p80<=0)
states: 259,063,116 (8)
....................................
EG iterations: 36
................................MC time: 6m 8.000sec

checking: AF [[[1<=p35 & p35<=1] & [[[EG [[0<=p54 & p54<=0]] | AX [[1<=p10 & p10<=1]]] | [p63<=0 & 0<=p63]] | [[AF [[[0<=p29 & p29<=0] & [[1<=p7 & p7<=1] | [p32<=0 & 0<=p32]]]] | [EG [[p20<=1 & 1<=p20]] & AG [[1<=p82 & p82<=1]]]] | AG [[1<=p27 & p27<=1]]]]]]
normalized: ~ [EG [~ [[[[[p63<=0 & 0<=p63] | [~ [EX [~ [[1<=p10 & p10<=1]]]] | EG [[0<=p54 & p54<=0]]]] | [~ [E [true U ~ [[1<=p27 & p27<=1]]]] | [[~ [E [true U ~ [[1<=p82 & p82<=1]]]] & EG [[p20<=1 & 1<=p20]]] | ~ [EG [~ [[[[p32<=0 & 0<=p32] | [1<=p7 & p7<=1]] & [0<=p29 & p29<=0]]]]]]]] & [1<=p35 & p35<=1]]]]]

abstracting: (p35<=1)
states: 406,034,376 (8)
abstracting: (1<=p35)
states: 79,957,176 (7)
abstracting: (p29<=0)
states: 326,077,200 (8)
abstracting: (0<=p29)
states: 406,034,376 (8)
abstracting: (p7<=1)
states: 406,034,376 (8)
abstracting: (1<=p7)
states: 79,957,176 (7)
abstracting: (0<=p32)
states: 406,034,376 (8)
abstracting: (p32<=0)
states: 326,077,200 (8)

before gc: list nodes free: 812197

after gc: idd nodes used:6286806, unused:57713194; list nodes free:265448631
.
EG iterations: 1
abstracting: (1<=p20)
states: 79,957,176 (7)
abstracting: (p20<=1)
states: 406,034,376 (8)
.
EG iterations: 1
abstracting: (p82<=1)
states: 406,034,376 (8)
abstracting: (1<=p82)
states: 42,028,920 (7)
abstracting: (p27<=1)
states: 406,034,376 (8)
abstracting: (1<=p27)
states: 79,957,176 (7)
abstracting: (p54<=0)
states: 331,332,612 (8)
abstracting: (0<=p54)
states: 406,034,376 (8)
..........................
EG iterations: 26
abstracting: (p10<=1)
states: 406,034,376 (8)
abstracting: (1<=p10)
states: 326,077,200 (8)
.abstracting: (0<=p63)
states: 406,034,376 (8)
abstracting: (p63<=0)
states: 331,547,652 (8)
.
EG iterations: 1
-> the formula is FALSE

FORMULA SimpleLoadBal-PT-10-CTLCardinality-06 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 4m53.410sec

checking: A [~ [[E [[A [[1<=p38 & p38<=1] U [[1<=p58 & p58<=1] | [0<=p62 & p62<=0]]] & E [[[p36<=0 & 0<=p36] | [p63<=1 & 1<=p63]] U [0<=p60 & p60<=0]]] U ~ [[[0<=p34 & p34<=0] & [[1<=p51 & p51<=1] | [0<=p25 & p25<=0]]]]] & AG [[p56<=1 & 1<=p56]]]] U AG [~ [AG [[0<=p21 & p21<=0]]]]]
normalized: [~ [EG [E [true U ~ [E [true U ~ [[0<=p21 & p21<=0]]]]]]] & ~ [E [E [true U ~ [E [true U ~ [[0<=p21 & p21<=0]]]]] U [[~ [E [true U ~ [[p56<=1 & 1<=p56]]]] & E [[E [[[p63<=1 & 1<=p63] | [p36<=0 & 0<=p36]] U [0<=p60 & p60<=0]] & [~ [EG [~ [[[0<=p62 & p62<=0] | [1<=p58 & p58<=1]]]]] & ~ [E [~ [[[0<=p62 & p62<=0] | [1<=p58 & p58<=1]]] U [~ [[1<=p38 & p38<=1]] & ~ [[[0<=p62 & p62<=0] | [1<=p58 & p58<=1]]]]]]]] U ~ [[[[0<=p25 & p25<=0] | [1<=p51 & p51<=1]] & [0<=p34 & p34<=0]]]]] & E [true U ~ [E [true U ~ [[0<=p21 & p21<=0]]]]]]]]]

abstracting: (p21<=0)
states: 326,077,200 (8)
abstracting: (0<=p21)
states: 406,034,376 (8)
abstracting: (p34<=0)
states: 326,077,200 (8)
abstracting: (0<=p34)
states: 406,034,376 (8)
abstracting: (p51<=1)
states: 406,034,376 (8)
abstracting: (1<=p51)
states: 74,486,724 (7)
abstracting: (p25<=0)
states: 326,077,200 (8)
abstracting: (0<=p25)
states: 406,034,376 (8)
abstracting: (p58<=1)
states: 406,034,376 (8)
abstracting: (1<=p58)
states: 74,701,764 (7)
abstracting: (p62<=0)
states: 331,332,612 (8)
abstracting: (0<=p62)
states: 406,034,376 (8)
abstracting: (p38<=1)
states: 406,034,376 (8)
abstracting: (1<=p38)
states: 101,508,846 (8)
abstracting: (p58<=1)
states: 406,034,376 (8)
abstracting: (1<=p58)
states: 74,701,764 (7)
abstracting: (p62<=0)
states: 331,332,612 (8)
abstracting: (0<=p62)
states: 406,034,376 (8)
abstracting: (p58<=1)
states: 406,034,376 (8)
abstracting: (1<=p58)
states: 74,701,764 (7)
abstracting: (p62<=0)
states: 331,332,612 (8)
abstracting: (0<=p62)
states: 406,034,376 (8)
......................
EG iterations: 22
abstracting: (p60<=0)
states: 331,332,612 (8)
abstracting: (0<=p60)
states: 406,034,376 (8)
abstracting: (0<=p36)
states: 406,034,376 (8)
abstracting: (p36<=0)
states: 326,077,200 (8)
abstracting: (1<=p63)
states: 74,486,724 (7)
abstracting: (p63<=1)
states: 406,034,376 (8)
abstracting: (1<=p56)
states: 74,701,764 (7)
abstracting: (p56<=1)
states: 406,034,376 (8)
abstracting: (p21<=0)
states: 326,077,200 (8)
abstracting: (0<=p21)
states: 406,034,376 (8)
abstracting: (p21<=0)
states: 326,077,200 (8)
abstracting: (0<=p21)
states: 406,034,376 (8)
.
EG iterations: 1
-> the formula is TRUE

FORMULA SimpleLoadBal-PT-10-CTLCardinality-04 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 3m11.056sec

checking: A [[AG [E [E [[[p2<=0 & 0<=p2] | [p72<=1 & 1<=p72]] U [p54<=1 & 1<=p54]] U EF [[[0<=p67 & p67<=0] | [p40<=1 & 1<=p40]]]]] & E [AX [~ [[1<=p30 & p30<=1]]] U AF [[[0<=p89 & p89<=0] | [p30<=1 & 1<=p30]]]]] U ~ [[[[[1<=p18 & p18<=1] | [1<=p50 & p50<=1]] | [p42<=0 & 0<=p42]] | [~ [AG [[1<=p83 & p83<=1]]] | [~ [A [[p34<=1 & 1<=p34] U [p80<=0 & 0<=p80]]] | [[[p93<=0 & 0<=p93] | [p80<=1 & 1<=p80]] & AX [[p78<=1 & 1<=p78]]]]]]]]
normalized: [~ [EG [[[[[~ [EX [~ [[p78<=1 & 1<=p78]]]] & [[p80<=1 & 1<=p80] | [p93<=0 & 0<=p93]]] | ~ [[~ [EG [~ [[p80<=0 & 0<=p80]]]] & ~ [E [~ [[p80<=0 & 0<=p80]] U [~ [[p34<=1 & 1<=p34]] & ~ [[p80<=0 & 0<=p80]]]]]]]] | E [true U ~ [[1<=p83 & p83<=1]]]] | [[p42<=0 & 0<=p42] | [[1<=p50 & p50<=1] | [1<=p18 & p18<=1]]]]]] & ~ [E [[[[[~ [EX [~ [[p78<=1 & 1<=p78]]]] & [[p80<=1 & 1<=p80] | [p93<=0 & 0<=p93]]] | ~ [[~ [EG [~ [[p80<=0 & 0<=p80]]]] & ~ [E [~ [[p80<=0 & 0<=p80]] U [~ [[p34<=1 & 1<=p34]] & ~ [[p80<=0 & 0<=p80]]]]]]]] | E [true U ~ [[1<=p83 & p83<=1]]]] | [[p42<=0 & 0<=p42] | [[1<=p50 & p50<=1] | [1<=p18 & p18<=1]]]] U [~ [[E [~ [EX [[1<=p30 & p30<=1]]] U ~ [EG [~ [[[p30<=1 & 1<=p30] | [0<=p89 & p89<=0]]]]]] & ~ [E [true U ~ [E [E [[[p72<=1 & 1<=p72] | [p2<=0 & 0<=p2]] U [p54<=1 & 1<=p54]] U E [true U [[p40<=1 & 1<=p40] | [0<=p67 & p67<=0]]]]]]]]] & [[[[~ [EX [~ [[p78<=1 & 1<=p78]]]] & [[p80<=1 & 1<=p80] | [p93<=0 & 0<=p93]]] | ~ [[~ [EG [~ [[p80<=0 & 0<=p80]]]] & ~ [E [~ [[p80<=0 & 0<=p80]] U [~ [[p34<=1 & 1<=p34]] & ~ [[p80<=0 & 0<=p80]]]]]]]] | E [true U ~ [[1<=p83 & p83<=1]]]] | [[p42<=0 & 0<=p42] | [[1<=p50 & p50<=1] | [1<=p18 & p18<=1]]]]]]]]

abstracting: (p18<=1)
states: 406,034,376 (8)
abstracting: (1<=p18)
states: 79,957,176 (7)
abstracting: (p50<=1)
states: 406,034,376 (8)
abstracting: (1<=p50)
states: 74,701,764 (7)
abstracting: (0<=p42)
states: 406,034,376 (8)
abstracting: (p42<=0)
states: 304,633,554 (8)
abstracting: (p83<=1)
states: 406,034,376 (8)
abstracting: (1<=p83)
states: 10,463,040 (7)
abstracting: (0<=p80)
states: 406,034,376 (8)
abstracting: (p80<=0)
states: 259,063,116 (8)
abstracting: (1<=p34)
states: 79,957,176 (7)
abstracting: (p34<=1)
states: 406,034,376 (8)
abstracting: (0<=p80)
states: 406,034,376 (8)
abstracting: (p80<=0)
states: 259,063,116 (8)
abstracting: (0<=p80)
states: 406,034,376 (8)
abstracting: (p80<=0)
states: 259,063,116 (8)
........................
EG iterations: 24
abstracting: (0<=p93)
states: 406,034,376 (8)
abstracting: (p93<=0)
states: 363,994,536 (8)
abstracting: (1<=p80)
states: 146,971,260 (8)
abstracting: (p80<=1)
states: 406,034,376 (8)
abstracting: (1<=p78)
states: 13,419,432 (7)
abstracting: (p78<=1)
states: 406,034,376 (8)
.abstracting: (p67<=0)
states: 389,060,016 (8)
abstracting: (0<=p67)
states: 406,034,376 (8)
abstracting: (1<=p40)
states: 101,400,822 (8)
abstracting: (p40<=1)
states: 406,034,376 (8)
abstracting: (1<=p54)
states: 74,701,764 (7)
abstracting: (p54<=1)
states: 406,034,376 (8)
abstracting: (0<=p2)
states: 406,034,376 (8)
abstracting: (p2<=0)
states: 326,077,200 (8)
abstracting: (1<=p72)
states: 16,974,360 (7)
abstracting: (p72<=1)
states: 406,034,376 (8)
abstracting: (p89<=0)
states: 392,546,904 (8)
abstracting: (0<=p89)
states: 406,034,376 (8)
abstracting: (1<=p30)
states: 79,957,176 (7)
abstracting: (p30<=1)
states: 406,034,376 (8)
............................................
EG iterations: 44
abstracting: (p30<=1)
states: 406,034,376 (8)
abstracting: (1<=p30)
states: 79,957,176 (7)
MC time: 5m39.072sec

checking: EG [[A [AG [[0<=p4 & p4<=0]] U [AX [[[p4<=1 & 1<=p4] | [p1<=0 & 0<=p1]]] & AX [[[p13<=0 & 0<=p13] | [p92<=1 & 1<=p92]]]]] | AX [[EG [[p64<=0 & 0<=p64]] & [p45<=0 & 0<=p45]]]]]
normalized: EG [[~ [EX [~ [[[p45<=0 & 0<=p45] & EG [[p64<=0 & 0<=p64]]]]]] | [~ [EG [~ [[~ [EX [~ [[[p92<=1 & 1<=p92] | [p13<=0 & 0<=p13]]]]] & ~ [EX [~ [[[p1<=0 & 0<=p1] | [p4<=1 & 1<=p4]]]]]]]]] & ~ [E [~ [[~ [EX [~ [[[p92<=1 & 1<=p92] | [p13<=0 & 0<=p13]]]]] & ~ [EX [~ [[[p1<=0 & 0<=p1] | [p4<=1 & 1<=p4]]]]]]] U [E [true U ~ [[0<=p4 & p4<=0]]] & ~ [[~ [EX [~ [[[p92<=1 & 1<=p92] | [p13<=0 & 0<=p13]]]]] & ~ [EX [~ [[[p1<=0 & 0<=p1] | [p4<=1 & 1<=p4]]]]]]]]]]]]]

abstracting: (1<=p4)
states: 79,957,176 (7)
abstracting: (p4<=1)
states: 406,034,376 (8)
abstracting: (0<=p1)
states: 406,034,376 (8)
abstracting: (p1<=0)
states: 326,077,200 (8)

before gc: list nodes free: 2913515

after gc: idd nodes used:8725860, unused:55274140; list nodes free:254352316
.abstracting: (0<=p13)
states: 406,034,376 (8)
abstracting: (p13<=0)
states: 79,957,176 (7)
abstracting: (1<=p92)
states: 114,913,440 (8)
abstracting: (p92<=1)
states: 406,034,376 (8)
.abstracting: (p4<=0)
states: 326,077,200 (8)
abstracting: (0<=p4)
states: 406,034,376 (8)
abstracting: (1<=p4)
states: 79,957,176 (7)
abstracting: (p4<=1)
states: 406,034,376 (8)
abstracting: (0<=p1)
states: 406,034,376 (8)
abstracting: (p1<=0)
states: 326,077,200 (8)
.abstracting: (0<=p13)
states: 406,034,376 (8)
abstracting: (p13<=0)
states: 79,957,176 (7)
abstracting: (1<=p92)
states: 114,913,440 (8)
abstracting: (p92<=1)
states: 406,034,376 (8)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393340 kB
MemFree: 5962756 kB
After kill :
MemTotal: 16393340 kB
MemFree: 16096220 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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 CTLCardinality -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

40121 60142 109750 118026 124421 127700 128618 163364 172263 177666 185361 193157 198022 253609 255217 255839 255136 257203 440410 449419 454811 463321 470468 474770 481841 490114 495588 505412 516038 520168 523410 524827 526446 535061 536651 537177 538211 538993 539144 538998 539441 541449 541782
iterations count:4387638 (7252), effective:160530 (265)

initing FirstDep: 0m 0.001sec


iterations count:25833 (42), effective:370 (0)

iterations count:55653 (91), effective:653 (1)

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

iterations count:87166 (144), effective:1142 (1)
511033
iterations count:151977 (251), effective:2883 (4)
613235 681723 680101
iterations count:316831 (523), effective:3843 (6)

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

iterations count:98480 (162), effective:1640 (2)

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

net_ddint.h:600: Timeout: after 530 sec

628780 646651
iterations count:239327 (395), effective:3550 (5)

net_ddint.h:600: Timeout: after 441 sec


iterations count:12825 (21), effective:201 (0)

net_ddint.h:600: Timeout: after 367 sec


iterations count:9938 (16), effective:101 (0)

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

iterations count:37209 (61), effective:259 (0)

iterations count:18403 (30), effective:311 (0)

iterations count:25093 (41), effective:139 (0)
779354 810709
iterations count:229398 (379), effective:2629 (4)

iterations count:26085 (43), effective:139 (0)

iterations count:37209 (61), effective:259 (0)

iterations count:37209 (61), effective:259 (0)

iterations count:9314 (15), effective:56 (0)

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

iterations count:2806 (4), effective:28 (0)
677314
iterations count:117563 (194), effective:2308 (3)

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

net_ddint.h:600: Timeout: after 338 sec


iterations count:98480 (162), effective:1640 (2)

iterations count:605 (1), effective:0 (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-10"
export BK_EXAMINATION="CTLCardinality"
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-10, examination is CTLCardinality"
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-167905979000513"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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