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-167905979000518.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r426-tajo-167905979000518
=====================================================================

--------------------
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-ReachabilityCardinality-00
FORMULA_NAME SimpleLoadBal-PT-10-ReachabilityCardinality-01
FORMULA_NAME SimpleLoadBal-PT-10-ReachabilityCardinality-02
FORMULA_NAME SimpleLoadBal-PT-10-ReachabilityCardinality-03
FORMULA_NAME SimpleLoadBal-PT-10-ReachabilityCardinality-04
FORMULA_NAME SimpleLoadBal-PT-10-ReachabilityCardinality-05
FORMULA_NAME SimpleLoadBal-PT-10-ReachabilityCardinality-06
FORMULA_NAME SimpleLoadBal-PT-10-ReachabilityCardinality-07
FORMULA_NAME SimpleLoadBal-PT-10-ReachabilityCardinality-08
FORMULA_NAME SimpleLoadBal-PT-10-ReachabilityCardinality-09
FORMULA_NAME SimpleLoadBal-PT-10-ReachabilityCardinality-10
FORMULA_NAME SimpleLoadBal-PT-10-ReachabilityCardinality-11
FORMULA_NAME SimpleLoadBal-PT-10-ReachabilityCardinality-12
FORMULA_NAME SimpleLoadBal-PT-10-ReachabilityCardinality-13
FORMULA_NAME SimpleLoadBal-PT-10-ReachabilityCardinality-14
FORMULA_NAME SimpleLoadBal-PT-10-ReachabilityCardinality-15

=== Now, execution of the tool begins

BK_START 1679359092373

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=ReachabilityCardinality
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:38:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2023-03-21 00:38:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-21 00:38:14] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2023-03-21 00:38:14] [INFO ] Transformed 104 places.
[2023-03-21 00:38:14] [INFO ] Transformed 605 transitions.
[2023-03-21 00:38:14] [INFO ] Found NUPN structural information;
[2023-03-21 00:38:14] [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:38:14] [INFO ] Parsed PT model containing 104 places and 605 transitions and 4148 arcs in 187 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA SimpleLoadBal-PT-10-ReachabilityCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-ReachabilityCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-ReachabilityCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-ReachabilityCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-10-ReachabilityCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10000 steps, including 2 resets, run finished after 171 ms. (steps per millisecond=58 ) properties (out of 11) seen :10
FORMULA SimpleLoadBal-PT-10-ReachabilityCardinality-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-10-ReachabilityCardinality-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-10-ReachabilityCardinality-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-10-ReachabilityCardinality-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-10-ReachabilityCardinality-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-10-ReachabilityCardinality-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-10-ReachabilityCardinality-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-10-ReachabilityCardinality-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-10-ReachabilityCardinality-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-10-ReachabilityCardinality-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-21 00:38:14] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
// Phase 1: matrix 475 rows 104 cols
[2023-03-21 00:38:14] [INFO ] Computed 29 place invariants in 34 ms
[2023-03-21 00:38:15] [INFO ] After 399ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 00:38:15] [INFO ] [Nat]Absence check using 25 positive place invariants in 9 ms returned sat
[2023-03-21 00:38:15] [INFO ] [Nat]Absence check using 25 positive and 4 generalized place invariants in 5 ms returned sat
[2023-03-21 00:38:15] [INFO ] After 214ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 00:38:15] [INFO ] State equation strengthened by 210 read => feed constraints.
[2023-03-21 00:38:15] [INFO ] After 89ms SMT Verify possible using 210 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 00:38:16] [INFO ] Deduced a trap composed of 18 places in 315 ms of which 33 ms to minimize.
[2023-03-21 00:38:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 358 ms
[2023-03-21 00:38:16] [INFO ] After 493ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 28 ms.
[2023-03-21 00:38:16] [INFO ] After 871ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 605/605 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 17 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 102 transition count 603
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 28 place count 86 transition count 595
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 0 with 16 rules applied. Total rules applied 44 place count 78 transition count 587
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 0 with 9 rules applied. Total rules applied 53 place count 78 transition count 578
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 62 place count 69 transition count 578
Applied a total of 62 rules in 229 ms. Remains 69 /104 variables (removed 35) and now considering 578/605 (removed 27) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 229 ms. Remains : 69/104 places, 578/605 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 938978 steps, run timeout after 3001 ms. (steps per millisecond=312 ) properties seen :{}
Probabilistic random walk after 938978 steps, saw 484626 distinct states, run finished after 3004 ms. (steps per millisecond=312 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 00:38:19] [INFO ] Flow matrix only has 448 transitions (discarded 130 similar events)
// Phase 1: matrix 448 rows 69 cols
[2023-03-21 00:38:19] [INFO ] Computed 21 place invariants in 32 ms
[2023-03-21 00:38:19] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 00:38:19] [INFO ] [Nat]Absence check using 17 positive place invariants in 2 ms returned sat
[2023-03-21 00:38:19] [INFO ] [Nat]Absence check using 17 positive and 4 generalized place invariants in 3 ms returned sat
[2023-03-21 00:38:19] [INFO ] After 79ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 00:38:19] [INFO ] State equation strengthened by 210 read => feed constraints.
[2023-03-21 00:38:19] [INFO ] After 75ms SMT Verify possible using 210 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 00:38:19] [INFO ] After 106ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-21 00:38:19] [INFO ] After 251ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 69 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 578/578 transitions.
Applied a total of 0 rules in 20 ms. Remains 69 /69 variables (removed 0) and now considering 578/578 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 69/69 places, 578/578 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 69/69 places, 578/578 transitions.
Applied a total of 0 rules in 24 ms. Remains 69 /69 variables (removed 0) and now considering 578/578 (removed 0) transitions.
[2023-03-21 00:38:19] [INFO ] Flow matrix only has 448 transitions (discarded 130 similar events)
[2023-03-21 00:38:19] [INFO ] Invariant cache hit.
[2023-03-21 00:38:20] [INFO ] Implicit Places using invariants in 192 ms returned [18, 19]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 195 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 67/69 places, 578/578 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 65 transition count 576
Applied a total of 4 rules in 28 ms. Remains 65 /67 variables (removed 2) and now considering 576/578 (removed 2) transitions.
[2023-03-21 00:38:20] [INFO ] Flow matrix only has 446 transitions (discarded 130 similar events)
// Phase 1: matrix 446 rows 65 cols
[2023-03-21 00:38:20] [INFO ] Computed 19 place invariants in 15 ms
[2023-03-21 00:38:20] [INFO ] Implicit Places using invariants in 168 ms returned []
[2023-03-21 00:38:20] [INFO ] Flow matrix only has 446 transitions (discarded 130 similar events)
[2023-03-21 00:38:20] [INFO ] Invariant cache hit.
[2023-03-21 00:38:20] [INFO ] State equation strengthened by 210 read => feed constraints.
[2023-03-21 00:38:20] [INFO ] Implicit Places using invariants and state equation in 467 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 65/69 places, 576/578 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 884 ms. Remains : 65/69 places, 576/578 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 1) 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 1) seen :0
Interrupted probabilistic random walk after 854576 steps, run timeout after 3001 ms. (steps per millisecond=284 ) properties seen :{}
Probabilistic random walk after 854576 steps, saw 304425 distinct states, run finished after 3001 ms. (steps per millisecond=284 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-21 00:38:23] [INFO ] Flow matrix only has 446 transitions (discarded 130 similar events)
[2023-03-21 00:38:23] [INFO ] Invariant cache hit.
[2023-03-21 00:38:24] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-21 00:38:24] [INFO ] [Nat]Absence check using 15 positive place invariants in 3 ms returned sat
[2023-03-21 00:38:24] [INFO ] [Nat]Absence check using 15 positive and 4 generalized place invariants in 5 ms returned sat
[2023-03-21 00:38:24] [INFO ] After 112ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-21 00:38:24] [INFO ] State equation strengthened by 210 read => feed constraints.
[2023-03-21 00:38:24] [INFO ] After 64ms SMT Verify possible using 210 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-21 00:38:24] [INFO ] Deduced a trap composed of 14 places in 95 ms of which 1 ms to minimize.
[2023-03-21 00:38:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 121 ms
[2023-03-21 00:38:24] [INFO ] After 204ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-21 00:38:24] [INFO ] After 396ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 65 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 576/576 transitions.
Applied a total of 0 rules in 24 ms. Remains 65 /65 variables (removed 0) and now considering 576/576 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 65/65 places, 576/576 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 65/65 places, 576/576 transitions.
Applied a total of 0 rules in 23 ms. Remains 65 /65 variables (removed 0) and now considering 576/576 (removed 0) transitions.
[2023-03-21 00:38:24] [INFO ] Flow matrix only has 446 transitions (discarded 130 similar events)
[2023-03-21 00:38:24] [INFO ] Invariant cache hit.
[2023-03-21 00:38:24] [INFO ] Implicit Places using invariants in 203 ms returned []
[2023-03-21 00:38:24] [INFO ] Flow matrix only has 446 transitions (discarded 130 similar events)
[2023-03-21 00:38:24] [INFO ] Invariant cache hit.
[2023-03-21 00:38:24] [INFO ] State equation strengthened by 210 read => feed constraints.
[2023-03-21 00:38:25] [INFO ] Implicit Places using invariants and state equation in 494 ms returned []
Implicit Place search using SMT with State Equation took 700 ms to find 0 implicit places.
[2023-03-21 00:38:25] [INFO ] Redundant transitions in 25 ms returned []
[2023-03-21 00:38:25] [INFO ] Flow matrix only has 446 transitions (discarded 130 similar events)
[2023-03-21 00:38:25] [INFO ] Invariant cache hit.
[2023-03-21 00:38:25] [INFO ] Dead Transitions using invariants and state equation in 315 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 : 65/65 places, 384/576 transitions.
Reduce places removed 2 places and 4 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 63 transition count 380
Reduce places removed 1 places and 4 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 62 transition count 376
Reduce places removed 2 places and 4 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 5 place count 60 transition count 372
Reduce places removed 2 places and 24 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 7 place count 58 transition count 348
Deduced a syphon composed of 1 places in 1 ms
Applied a total of 7 rules in 15 ms. Remains 58 /65 variables (removed 7) and now considering 348/384 (removed 36) transitions.
[2023-03-21 00:38:25] [INFO ] Flow matrix only has 270 transitions (discarded 78 similar events)
// Phase 1: matrix 270 rows 58 cols
[2023-03-21 00:38:25] [INFO ] Computed 20 place invariants in 4 ms
[2023-03-21 00:38:25] [INFO ] Implicit Places using invariants in 108 ms returned []
[2023-03-21 00:38:25] [INFO ] Flow matrix only has 270 transitions (discarded 78 similar events)
[2023-03-21 00:38:25] [INFO ] Invariant cache hit.
[2023-03-21 00:38:25] [INFO ] State equation strengthened by 122 read => feed constraints.
[2023-03-21 00:38:25] [INFO ] Implicit Places using invariants and state equation in 263 ms returned []
Implicit Place search using SMT with State Equation took 373 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 58/65 places, 348/576 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1460 ms. Remains : 58/65 places, 348/576 transitions.
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
FORMULA SimpleLoadBal-PT-10-ReachabilityCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 11586 ms.
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=ReachabilityCardinality.xml --memory=6 --mcc-mode

parse successfull
net created successfully

Net: SimpleLoadBal_PT_10
(NrP: 104 NrTr: 605 NrArc: 4148)

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

net check time: 0m 0.000sec

init dd package: 0m 3.192sec


RS generation: 1m30.689sec


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



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

checking: AG [P_client_ack_3<=1]
normalized: ~ [E [true U ~ [P_client_ack_3<=1]]]

abstracting: (P_client_ack_3<=1)
states: 406,034,376 (8)
-> the formula is TRUE

FORMULA SimpleLoadBal-PT-10-ReachabilityCardinality-01 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.589sec

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

abstracting: (P_server_processed_2<=0)
states: 304,526,034 (8)
-> the formula is FALSE

FORMULA SimpleLoadBal-PT-10-ReachabilityCardinality-09 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m21.467sec

checking: EF [~ [P_client_idle_1<=1]]
normalized: E [true U ~ [P_client_idle_1<=1]]

abstracting: (P_client_idle_1<=1)
states: 406,034,376 (8)
-> the formula is FALSE

FORMULA SimpleLoadBal-PT-10-ReachabilityCardinality-11 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 0.769sec

checking: EF [1<=P_lb_load_1_6]
normalized: E [true U 1<=P_lb_load_1_6]

abstracting: (1<=P_lb_load_1_6)
states: 2,515,632 (6)
-> the formula is TRUE

FORMULA SimpleLoadBal-PT-10-ReachabilityCardinality-14 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m24.330sec

checking: AG [P_lb_load_2_3<=P_lb_load_1_1]
normalized: ~ [E [true U ~ [P_lb_load_2_3<=P_lb_load_1_1]]]

abstracting: (P_lb_load_2_3<=P_lb_load_1_1)
states: 298,950,396 (8)
-> the formula is FALSE

FORMULA SimpleLoadBal-PT-10-ReachabilityCardinality-05 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m16.798sec

checking: AG [P_lb_load_1_5<=P_client_waiting_3]
normalized: ~ [E [true U ~ [P_lb_load_1_5<=P_client_waiting_3]]]

abstracting: (P_lb_load_1_5<=P_client_waiting_3)
states: 404,638,296 (8)
-> the formula is FALSE

FORMULA SimpleLoadBal-PT-10-ReachabilityCardinality-07 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m29.037sec

checking: EF [[1<=P_lb_balancing_1 | 1<=P_server_request_2_2]]
normalized: E [true U [1<=P_lb_balancing_1 | 1<=P_server_request_2_2]]

abstracting: (1<=P_server_request_2_2)
states: 74,486,724 (7)
abstracting: (1<=P_lb_balancing_1)
states: 154,687,800 (8)
-> the formula is TRUE

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

MC time: 0m19.592sec

checking: AG [[[1<=P_client_waiting_9 & P_client_waiting_4<=0] | [P_lb_load_1_9<=P_lb_routing_1_4 & P_lb_load_1_9<=1]]]
normalized: ~ [E [true U ~ [[[P_lb_load_1_9<=P_lb_routing_1_4 & P_lb_load_1_9<=1] | [1<=P_client_waiting_9 & P_client_waiting_4<=0]]]]]

abstracting: (P_client_waiting_4<=0)
states: 79,957,176 (7)
abstracting: (1<=P_client_waiting_9)
states: 326,077,200 (8)
abstracting: (P_lb_load_1_9<=1)
states: 406,034,376 (8)
abstracting: (P_lb_load_1_9<=P_lb_routing_1_4)
states: 406,034,376 (8)
-> the formula is TRUE

FORMULA SimpleLoadBal-PT-10-ReachabilityCardinality-03 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.314sec

checking: AG [~ [[[~ [[P_lb_load_2_2<=1 | P_lb_load_1_9<=P_client_idle_7]] & 1<=P_client_idle_3] & ~ [[1<=P_server_idle_1 & [P_lb_load_1_6<=P_lb_load_2_5 & 1<=P_server_request_10_2]]]]]]
normalized: ~ [E [true U [~ [[1<=P_server_idle_1 & [P_lb_load_1_6<=P_lb_load_2_5 & 1<=P_server_request_10_2]]] & [1<=P_client_idle_3 & ~ [[P_lb_load_2_2<=1 | P_lb_load_1_9<=P_client_idle_7]]]]]]

abstracting: (P_lb_load_1_9<=P_client_idle_7)
states: 406,034,376 (8)
abstracting: (P_lb_load_2_2<=1)
states: 406,034,376 (8)
abstracting: (1<=P_client_idle_3)
states: 79,957,176 (7)
abstracting: (1<=P_server_request_10_2)
states: 74,486,724 (7)
abstracting: (P_lb_load_1_6<=P_lb_load_2_5)
states: 403,556,880 (8)
abstracting: (1<=P_server_idle_1)
states: 101,616,366 (8)
-> the formula is TRUE

FORMULA SimpleLoadBal-PT-10-ReachabilityCardinality-10 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m 1.992sec

checking: EF [[[[[~ [[[P_lb_routing_1_3<=P_server_request_8_2 | [[P_client_waiting_8<=1 & P_server_request_8_1<=P_lb_load_2_5] | ~ [P_lb_load_1_10<=1]]] | P_client_request_7<=P_lb_load_1_3]] | [~ [1<=P_client_request_8] & ~ [P_client_waiting_7<=P_server_request_1_1]]] | P_lb_load_2_9<=0] & [1<=P_client_request_2 & 1<=P_server_notification_ack_2]] & P_server_request_3_1<=P_client_request_9]]
normalized: E [true U [P_server_request_3_1<=P_client_request_9 & [[1<=P_client_request_2 & 1<=P_server_notification_ack_2] & [P_lb_load_2_9<=0 | [[~ [P_client_waiting_7<=P_server_request_1_1] & ~ [1<=P_client_request_8]] | ~ [[P_client_request_7<=P_lb_load_1_3 | [P_lb_routing_1_3<=P_server_request_8_2 | [~ [P_lb_load_1_10<=1] | [P_client_waiting_8<=1 & P_server_request_8_1<=P_lb_load_2_5]]]]]]]]]]

abstracting: (P_server_request_8_1<=P_lb_load_2_5)
states: 333,128,364 (8)
abstracting: (P_client_waiting_8<=1)
states: 406,034,376 (8)
abstracting: (P_lb_load_1_10<=1)
states: 406,034,376 (8)
abstracting: (P_lb_routing_1_3<=P_server_request_8_2)
states: 392,233,620 (8)
abstracting: (P_client_request_7<=P_lb_load_1_3)
states: 345,855,024 (8)
abstracting: (1<=P_client_request_8)
states: 79,957,176 (7)
abstracting: (P_client_waiting_7<=P_server_request_1_1)
states: 140,015,112 (8)
abstracting: (P_lb_load_2_9<=0)
states: 406,034,376 (8)
abstracting: (1<=P_server_notification_ack_2)
states: 101,508,846 (8)
abstracting: (1<=P_client_request_2)
states: 79,957,176 (7)
abstracting: (P_server_request_3_1<=P_client_request_9)
states: 345,976,440 (8)
-> the formula is TRUE

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

MC time: 0m54.314sec

checking: AG [~ [[[[[~ [P_client_idle_9<=P_server_request_9_1] & ~ [P_server_idle_1<=P_lb_routing_1_3]] & [[1<=P_client_idle_5 | 1<=P_client_ack_6] | P_server_request_1_2<=P_client_idle_2]] & ~ [[1<=P_lb_load_1_4 | ~ [1<=P_server_notification_2]]]] | ~ [[[[P_client_request_4<=0 | P_lb_load_2_5<=P_server_notification_2] | [P_client_idle_2<=P_client_request_9 & 1<=P_server_request_8_2]] | ~ [[1<=P_server_request_7_1 & P_server_notification_ack_2<=1]]]]]]]
normalized: ~ [E [true U [~ [[~ [[1<=P_server_request_7_1 & P_server_notification_ack_2<=1]] | [[P_client_idle_2<=P_client_request_9 & 1<=P_server_request_8_2] | [P_client_request_4<=0 | P_lb_load_2_5<=P_server_notification_2]]]] | [~ [[1<=P_lb_load_1_4 | ~ [1<=P_server_notification_2]]] & [[P_server_request_1_2<=P_client_idle_2 | [1<=P_client_idle_5 | 1<=P_client_ack_6]] & [~ [P_server_idle_1<=P_lb_routing_1_3] & ~ [P_client_idle_9<=P_server_request_9_1]]]]]]]

abstracting: (P_client_idle_9<=P_server_request_9_1)
states: 326,077,200 (8)
abstracting: (P_server_idle_1<=P_lb_routing_1_3)
states: 308,661,600 (8)
abstracting: (1<=P_client_ack_6)
states: 79,957,176 (7)
abstracting: (1<=P_client_idle_5)
states: 79,957,176 (7)
abstracting: (P_server_request_1_2<=P_client_idle_2)
states: 346,166,392 (8)
abstracting: (1<=P_server_notification_2)
states: 101,508,342 (8)
abstracting: (1<=P_lb_load_1_4)
states: 42,028,920 (7)
abstracting: (P_lb_load_2_5<=P_server_notification_2)
states: 399,673,476 (8)
abstracting: (P_client_request_4<=0)
states: 326,077,200 (8)
abstracting: (1<=P_server_request_8_2)
states: 74,486,724 (7)
abstracting: (P_client_idle_2<=P_client_request_9)
states: 341,794,608 (8)
abstracting: (P_server_notification_ack_2<=1)
states: 406,034,376 (8)
abstracting: (1<=P_server_request_7_1)
states: 74,701,764 (7)
-> the formula is FALSE

FORMULA SimpleLoadBal-PT-10-ReachabilityCardinality-08 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m36.654sec

checking: EF [[1<=P_server_request_9_2 & [[~ [[P_client_waiting_4<=0 | ~ [1<=P_server_processed_2]]] | [[~ [[~ [[P_server_processed_1<=P_server_request_7_2 & P_lb_load_2_4<=1]] | 1<=P_server_request_3_2]] & P_lb_routing_1_5<=P_server_request_4_2] & [~ [P_lb_load_2_2<=0] & [~ [[P_server_request_2_2<=P_lb_routing_1_7 & [1<=P_lb_routing_1_8 & P_server_request_7_1<=P_lb_routing_1_7]]] | [[P_lb_load_2_0<=1 | ~ [P_lb_idle_1<=1]] | ~ [[1<=P_server_request_10_2 | P_server_request_9_1<=P_lb_routing_1_2]]]]]]] & ~ [P_server_processed_2<=0]]]]
normalized: E [true U [1<=P_server_request_9_2 & [[~ [[P_client_waiting_4<=0 | ~ [1<=P_server_processed_2]]] | [[~ [P_lb_load_2_2<=0] & [[~ [[1<=P_server_request_10_2 | P_server_request_9_1<=P_lb_routing_1_2]] | [P_lb_load_2_0<=1 | ~ [P_lb_idle_1<=1]]] | ~ [[P_server_request_2_2<=P_lb_routing_1_7 & [1<=P_lb_routing_1_8 & P_server_request_7_1<=P_lb_routing_1_7]]]]] & [P_lb_routing_1_5<=P_server_request_4_2 & ~ [[1<=P_server_request_3_2 | ~ [[P_server_processed_1<=P_server_request_7_2 & P_lb_load_2_4<=1]]]]]]] & ~ [P_server_processed_2<=0]]]]

abstracting: (P_server_processed_2<=0)
states: 304,526,034 (8)
abstracting: (P_lb_load_2_4<=1)
states: 406,034,376 (8)
abstracting: (P_server_processed_1<=P_server_request_7_2)
states: 324,482,568 (8)
abstracting: (1<=P_server_request_3_2)
states: 74,486,724 (7)
abstracting: (P_lb_routing_1_5<=P_server_request_4_2)
states: 392,233,620 (8)
abstracting: (P_server_request_7_1<=P_lb_routing_1_7)
states: 331,332,612 (8)
abstracting: (1<=P_lb_routing_1_8)
states: 16,974,360 (7)
abstracting: (P_server_request_2_2<=P_lb_routing_1_7)
states: 334,721,256 (8)
abstracting: (P_lb_idle_1<=1)
states: 406,034,376 (8)
abstracting: (P_lb_load_2_0<=1)
states: 406,034,376 (8)
abstracting: (P_server_request_9_1<=P_lb_routing_1_2)
states: 334,506,216 (8)
abstracting: (1<=P_server_request_10_2)
states: 74,486,724 (7)
abstracting: (P_lb_load_2_2<=0)
states: 258,927,036 (8)
abstracting: (1<=P_server_processed_2)
states: 101,508,342 (8)
abstracting: (P_client_waiting_4<=0)
states: 79,957,176 (7)
abstracting: (1<=P_server_request_9_2)
states: 74,486,724 (7)
-> the formula is TRUE

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

MC time: 0m53.106sec

checking: EF [[[[~ [P_client_waiting_9<=P_server_processed_2] & [[[~ [[[P_client_idle_8<=1 & P_client_ack_1<=0] & ~ [P_client_idle_9<=0]]] & 1<=P_server_request_5_2] | [P_client_ack_7<=0 & ~ [[P_client_request_4<=P_lb_load_2_6 | 1<=P_client_idle_5]]]] & P_server_waiting_2<=1]] | [~ [P_client_ack_1<=P_server_request_5_2] & [P_client_ack_9<=P_client_ack_8 | [[[~ [1<=P_server_request_9_1] & ~ [[P_lb_idle_1<=P_server_request_4_2 | 1<=P_lb_load_1_1]]] | ~ [P_lb_load_1_3<=0]] | P_lb_load_2_10<=P_lb_routing_1_8]]]] & [~ [P_server_request_4_2<=0] | ~ [[~ [[1<=P_client_idle_6 & 1<=P_server_request_4_2]] & [P_server_request_3_1<=P_lb_load_1_10 | [~ [1<=P_lb_load_1_1] | [P_lb_routing_1_8<=0 | 1<=P_lb_load_1_2]]]]]]]]
normalized: E [true U [[[[P_server_waiting_2<=1 & [[1<=P_server_request_5_2 & ~ [[~ [P_client_idle_9<=0] & [P_client_idle_8<=1 & P_client_ack_1<=0]]]] | [P_client_ack_7<=0 & ~ [[P_client_request_4<=P_lb_load_2_6 | 1<=P_client_idle_5]]]]] & ~ [P_client_waiting_9<=P_server_processed_2]] | [[P_client_ack_9<=P_client_ack_8 | [P_lb_load_2_10<=P_lb_routing_1_8 | [[~ [[P_lb_idle_1<=P_server_request_4_2 | 1<=P_lb_load_1_1]] & ~ [1<=P_server_request_9_1]] | ~ [P_lb_load_1_3<=0]]]] & ~ [P_client_ack_1<=P_server_request_5_2]]] & [~ [P_server_request_4_2<=0] | ~ [[~ [[1<=P_client_idle_6 & 1<=P_server_request_4_2]] & [P_server_request_3_1<=P_lb_load_1_10 | [~ [1<=P_lb_load_1_1] | [P_lb_routing_1_8<=0 | 1<=P_lb_load_1_2]]]]]]]]

abstracting: (1<=P_lb_load_1_2)
states: 146,971,260 (8)
abstracting: (P_lb_routing_1_8<=0)
states: 389,060,016 (8)
abstracting: (1<=P_lb_load_1_1)
states: 75,778,092 (7)
abstracting: (P_server_request_3_1<=P_lb_load_1_10)
states: 331,332,612 (8)
abstracting: (1<=P_server_request_4_2)
states: 74,486,724 (7)
abstracting: (1<=P_client_idle_6)
states: 79,957,176 (7)
abstracting: (P_server_request_4_2<=0)
states: 331,547,652 (8)
abstracting: (P_client_ack_1<=P_server_request_5_2)
states: 340,695,940 (8)
abstracting: (P_lb_load_1_3<=0)
states: 291,176,376 (8)
abstracting: (1<=P_server_request_9_1)
states: 74,701,764 (7)
abstracting: (1<=P_lb_load_1_1)
states: 75,778,092 (7)
abstracting: (P_lb_idle_1<=P_server_request_4_2)
states: 339,771,264 (8)
abstracting: (P_lb_load_2_10<=P_lb_routing_1_8)
states: 406,034,376 (8)
abstracting: (P_client_ack_9<=P_client_ack_8)
states: 341,794,608 (8)
abstracting: (P_client_waiting_9<=P_server_processed_2)
states: 161,476,224 (8)
abstracting: (1<=P_client_idle_5)
states: 79,957,176 (7)
abstracting: (P_client_request_4<=P_lb_load_2_6)
states: 326,335,752 (8)
abstracting: (P_client_ack_7<=0)
states: 326,077,200 (8)
abstracting: (P_client_ack_1<=0)
states: 326,077,200 (8)
abstracting: (P_client_idle_8<=1)
states: 406,034,376 (8)
abstracting: (P_client_idle_9<=0)
states: 326,077,200 (8)
abstracting: (1<=P_server_request_5_2)
states: 74,486,724 (7)
abstracting: (P_server_waiting_2<=1)
states: 406,034,376 (8)
-> the formula is TRUE

FORMULA SimpleLoadBal-PT-10-ReachabilityCardinality-00 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 1m12.842sec

checking: AG [[1<=P_server_idle_2 & ~ [[~ [[[[[[P_lb_load_1_4<=P_lb_balancing_1 & P_client_waiting_8<=P_lb_load_2_1] | ~ [1<=P_client_request_9]] | ~ [P_server_notification_ack_2<=P_server_processed_1]] & [[[P_server_request_6_1<=0 & P_server_request_3_2<=0] & 1<=P_client_waiting_7] | [[P_lb_load_2_0<=0 & P_client_waiting_10<=P_client_request_7] & [P_client_ack_7<=P_lb_routing_1_9 & 1<=P_lb_load_2_8]]]] | [P_client_waiting_3<=0 & [[[P_lb_routing_1_3<=P_lb_load_2_3 | P_server_notification_2<=1] & P_server_request_2_2<=P_lb_load_1_0] & ~ [[1<=P_server_request_7_2 & P_client_request_4<=P_client_waiting_8]]]]]] & [[~ [[[~ [1<=P_client_idle_2] | 1<=P_client_ack_6] & ~ [[1<=P_client_waiting_1 & P_server_request_1_2<=0]]]] & ~ [[[~ [1<=P_server_waiting_2] | P_server_request_3_2<=P_client_waiting_5] | P_lb_routing_1_7<=P_client_request_8]]] | ~ [[~ [[P_server_request_10_1<=0 & 1<=P_lb_load_2_5]] | 1<=P_client_waiting_5]]]]]]]
normalized: ~ [E [true U ~ [[1<=P_server_idle_2 & ~ [[~ [[[P_client_waiting_3<=0 & [[P_server_request_2_2<=P_lb_load_1_0 & [P_lb_routing_1_3<=P_lb_load_2_3 | P_server_notification_2<=1]] & ~ [[1<=P_server_request_7_2 & P_client_request_4<=P_client_waiting_8]]]] | [[[~ [1<=P_client_request_9] | [P_lb_load_1_4<=P_lb_balancing_1 & P_client_waiting_8<=P_lb_load_2_1]] | ~ [P_server_notification_ack_2<=P_server_processed_1]] & [[1<=P_client_waiting_7 & [P_server_request_6_1<=0 & P_server_request_3_2<=0]] | [[P_lb_load_2_0<=0 & P_client_waiting_10<=P_client_request_7] & [P_client_ack_7<=P_lb_routing_1_9 & 1<=P_lb_load_2_8]]]]]] & [~ [[1<=P_client_waiting_5 | ~ [[P_server_request_10_1<=0 & 1<=P_lb_load_2_5]]]] | [~ [[P_lb_routing_1_7<=P_client_request_8 | [P_server_request_3_2<=P_client_waiting_5 | ~ [1<=P_server_waiting_2]]]] & ~ [[[1<=P_client_ack_6 | ~ [1<=P_client_idle_2]] & ~ [[1<=P_client_waiting_1 & P_server_request_1_2<=0]]]]]]]]]]]]

abstracting: (P_server_request_1_2<=0)
states: 331,547,652 (8)
abstracting: (1<=P_client_waiting_1)
states: 326,077,200 (8)
abstracting: (1<=P_client_idle_2)
states: 79,957,176 (7)
abstracting: (1<=P_client_ack_6)
states: 79,957,176 (7)
abstracting: (1<=P_server_waiting_2)
states: 203,017,188 (8)
abstracting: (P_server_request_3_2<=P_client_waiting_5)
states: 391,415,636 (8)
abstracting: (P_lb_routing_1_7<=P_client_request_8)
states: 392,602,400 (8)
abstracting: (1<=P_lb_load_2_5)
states: 10,463,880 (7)
abstracting: (P_server_request_10_1<=0)
states: 331,332,612 (8)
abstracting: (1<=P_client_waiting_5)
states: 326,077,200 (8)
abstracting: (1<=P_lb_load_2_8)
states: 0
abstracting: (P_client_ack_7<=P_lb_routing_1_9)
states: 329,619,584 (8)
abstracting: (P_client_waiting_10<=P_client_request_7)
states: 144,196,944 (8)
abstracting: (P_lb_load_2_0<=0)
states: 392,546,904 (8)
abstracting: (P_server_request_3_2<=0)
states: 331,547,652 (8)
abstracting: (P_server_request_6_1<=0)
states: 331,332,612 (8)
abstracting: (1<=P_client_waiting_7)
states: 326,077,200 (8)
abstracting: (P_server_notification_ack_2<=P_server_processed_1)
states: 329,013,999 (8)
abstracting: (P_client_waiting_8<=P_lb_load_2_1)
states: 137,553,684 (8)
abstracting: (P_lb_load_1_4<=P_lb_balancing_1)
states: 386,592,576 (8)
abstracting: (1<=P_client_request_9)
states: 79,957,176 (7)
abstracting: (P_client_request_4<=P_client_waiting_8)
states: 390,316,968 (8)
abstracting: (1<=P_server_request_7_2)
states: 74,486,724 (7)
abstracting: (P_server_notification_2<=1)
states: 406,034,376 (8)
abstracting: (P_lb_routing_1_3<=P_lb_load_2_3)
states: 393,931,680 (8)
abstracting: (P_server_request_2_2<=P_lb_load_1_0)
states: 333,857,124 (8)
abstracting: (P_client_waiting_3<=0)
states: 79,957,176 (7)
abstracting: (1<=P_server_idle_2)
states: 101,508,846 (8)
-> the formula is FALSE

FORMULA SimpleLoadBal-PT-10-ReachabilityCardinality-15 FALSE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m51.681sec

checking: AG [[[[[~ [[P_server_waiting_2<=0 & [[[P_client_request_1<=0 | 1<=P_lb_load_1_5] | 1<=P_lb_load_2_4] | ~ [1<=P_client_idle_8]]]] | ~ [[[[[1<=P_lb_balancing_1 & P_server_request_8_2<=1] & ~ [P_client_idle_6<=0]] & [~ [P_lb_routing_1_3<=0] | ~ [P_client_ack_2<=1]]] & [~ [[P_client_idle_7<=1 & P_lb_load_1_5<=P_server_request_9_1]] & ~ [[P_client_waiting_1<=1 | P_server_processed_2<=0]]]]]] | P_server_request_9_2<=P_client_idle_7] | P_client_request_7<=1] | ~ [[[[[[~ [[1<=P_client_request_4 & P_client_request_9<=0]] & [[P_client_request_5<=P_lb_load_1_7 & P_client_idle_6<=1] | P_client_idle_2<=P_server_request_7_1]] & ~ [[P_client_request_2<=P_lb_load_1_9 | [P_lb_routing_1_10<=P_server_request_10_1 | 1<=P_client_waiting_1]]]] | [[~ [1<=P_server_request_7_1] & 1<=P_server_request_10_1] | ~ [P_lb_load_2_3<=P_server_request_9_2]]] & [~ [[[[1<=P_lb_load_2_2 & 1<=P_client_request_8] | [P_client_request_7<=P_client_request_10 | P_server_request_1_1<=P_server_waiting_2]] & [[P_server_notification_1<=1 | 1<=P_lb_load_1_9] | [P_server_request_6_1<=P_server_notification_2 | P_client_idle_3<=0]]]] | [P_client_request_9<=P_server_notification_1 & ~ [P_lb_load_1_2<=0]]]] | [~ [P_lb_load_2_2<=0] & ~ [[[[P_lb_balancing_1<=P_lb_load_2_8 & P_client_idle_2<=P_server_request_6_1] & [P_client_request_2<=1 & 1<=P_client_request_6]] & 1<=P_server_request_4_1]]]]]]]
normalized: ~ [E [true U ~ [[~ [[[~ [[1<=P_server_request_4_1 & [[P_client_request_2<=1 & 1<=P_client_request_6] & [P_lb_balancing_1<=P_lb_load_2_8 & P_client_idle_2<=P_server_request_6_1]]]] & ~ [P_lb_load_2_2<=0]] | [[[P_client_request_9<=P_server_notification_1 & ~ [P_lb_load_1_2<=0]] | ~ [[[[P_server_request_6_1<=P_server_notification_2 | P_client_idle_3<=0] | [P_server_notification_1<=1 | 1<=P_lb_load_1_9]] & [[P_client_request_7<=P_client_request_10 | P_server_request_1_1<=P_server_waiting_2] | [1<=P_lb_load_2_2 & 1<=P_client_request_8]]]]] & [[~ [P_lb_load_2_3<=P_server_request_9_2] | [1<=P_server_request_10_1 & ~ [1<=P_server_request_7_1]]] | [~ [[P_client_request_2<=P_lb_load_1_9 | [P_lb_routing_1_10<=P_server_request_10_1 | 1<=P_client_waiting_1]]] & [[P_client_idle_2<=P_server_request_7_1 | [P_client_request_5<=P_lb_load_1_7 & P_client_idle_6<=1]] & ~ [[1<=P_client_request_4 & P_client_request_9<=0]]]]]]]] | [P_client_request_7<=1 | [P_server_request_9_2<=P_client_idle_7 | [~ [[[~ [[P_client_waiting_1<=1 | P_server_processed_2<=0]] & ~ [[P_client_idle_7<=1 & P_lb_load_1_5<=P_server_request_9_1]]] & [[~ [P_client_ack_2<=1] | ~ [P_lb_routing_1_3<=0]] & [~ [P_client_idle_6<=0] & [1<=P_lb_balancing_1 & P_server_request_8_2<=1]]]]] | ~ [[P_server_waiting_2<=0 & [~ [1<=P_client_idle_8] | [1<=P_lb_load_2_4 | [P_client_request_1<=0 | 1<=P_lb_load_1_5]]]]]]]]]]]]

abstracting: (1<=P_lb_load_1_5)
states: 10,463,040 (7)
abstracting: (P_client_request_1<=0)
states: 326,077,200 (8)
abstracting: (1<=P_lb_load_2_4)
states: 42,039,840 (7)
abstracting: (1<=P_client_idle_8)
states: 79,957,176 (7)
abstracting: (P_server_waiting_2<=0)
states: 203,017,188 (8)
abstracting: (P_server_request_8_2<=1)
states: 406,034,376 (8)
abstracting: (1<=P_lb_balancing_1)
states: 154,687,800 (8)
abstracting: (P_client_idle_6<=0)
states: 326,077,200 (8)
abstracting: (P_lb_routing_1_3<=0)
states: 389,060,016 (8)
abstracting: (P_client_ack_2<=1)
states: 406,034,376 (8)
abstracting: (P_lb_load_1_5<=P_server_request_9_1)
states: 399,982,344 (8)
abstracting: (P_client_idle_7<=1)
states: 406,034,376 (8)
abstracting: (P_server_processed_2<=0)
states: 304,526,034 (8)
abstracting: (P_client_waiting_1<=1)
states: 406,034,376 (8)
abstracting: (P_server_request_9_2<=P_client_idle_7)
states: 346,166,392 (8)
abstracting: (P_client_request_7<=1)
states: 406,034,376 (8)
abstracting: (P_client_request_9<=0)
states: 326,077,200 (8)
abstracting: (1<=P_client_request_4)
states: 79,957,176 (7)
abstracting: (P_client_idle_6<=1)
states: 406,034,376 (8)
abstracting: (P_client_request_5<=P_lb_load_1_7)
states: 326,077,200 (8)
abstracting: (P_client_idle_2<=P_server_request_7_1)
states: 340,721,028 (8)
abstracting: (1<=P_client_waiting_1)
states: 326,077,200 (8)
abstracting: (P_lb_routing_1_10<=P_server_request_10_1)
states: 389,060,016 (8)
abstracting: (P_client_request_2<=P_lb_load_1_9)
states: 326,077,200 (8)
abstracting: (1<=P_server_request_7_1)
states: 74,701,764 (7)
abstracting: (1<=P_server_request_10_1)
states: 74,701,764 (7)
abstracting: (P_lb_load_2_3<=P_server_request_9_2)
states: 318,442,344 (8)
abstracting: (1<=P_client_request_8)
states: 79,957,176 (7)
abstracting: (1<=P_lb_load_2_2)
states: 147,107,340 (8)
abstracting: (P_server_request_1_1<=P_server_waiting_2)
states: 368,683,494 (8)
abstracting: (P_client_request_7<=P_client_request_10)
states: 341,794,608 (8)
abstracting: (1<=P_lb_load_1_9)
states: 0
abstracting: (P_server_notification_1<=1)
states: 406,034,376 (8)
abstracting: (P_client_idle_3<=0)
states: 326,077,200 (8)
abstracting: (P_server_request_6_1<=P_server_notification_2)
states: 351,246,138 (8)
abstracting: (P_lb_load_1_2<=0)
states: 259,063,116 (8)
abstracting: (P_client_request_9<=P_server_notification_1)
states: 346,055,742 (8)
abstracting: (P_lb_load_2_2<=0)
states: 258,927,036 (8)
abstracting: (P_client_idle_2<=P_server_request_6_1)
states: 340,721,028 (8)
abstracting: (P_lb_balancing_1<=P_lb_load_2_8)
states: 251,346,576 (8)
abstracting: (1<=P_client_request_6)
states: 79,957,176 (7)
abstracting: (P_client_request_2<=1)
states: 406,034,376 (8)
abstracting: (1<=P_server_request_4_1)
states: 74,701,764 (7)
-> the formula is TRUE

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

MC time: 0m22.271sec

checking: AG [[~ [[[[[[1<=P_lb_load_2_1 & P_client_waiting_5<=P_lb_load_1_5] & ~ [P_server_request_5_2<=1]] | ~ [P_client_idle_4<=P_server_notification_2]] | [[P_client_waiting_6<=0 | ~ [P_server_request_7_2<=P_client_request_7]] & [1<=P_client_ack_10 | P_client_idle_4<=1]]] | ~ [[1<=P_server_request_1_1 | P_lb_load_1_1<=P_lb_load_1_10]]]] | [[[P_server_request_2_1<=1 | [[P_server_request_5_1<=0 | [1<=P_client_waiting_10 | [1<=P_server_idle_2 | [P_lb_load_1_1<=0 & 1<=P_client_idle_10]]]] & [~ [P_server_idle_1<=P_client_waiting_8] & P_server_idle_1<=1]]] | [1<=P_server_notification_ack_1 & [[1<=P_server_request_6_1 & ~ [[[P_lb_routing_1_10<=0 | 1<=P_client_idle_8] | [P_server_request_2_2<=P_lb_load_1_5 | P_lb_load_2_2<=P_client_waiting_1]]]] | ~ [[[[P_client_waiting_1<=P_client_waiting_9 | P_server_processed_2<=0] & [P_client_idle_9<=0 & 1<=P_lb_routing_1_8]] | P_client_waiting_3<=P_lb_routing_1_3]]]]] | [[[P_lb_load_1_2<=P_client_ack_1 | [P_lb_routing_1_7<=0 | [P_lb_load_1_7<=1 | [[P_lb_routing_1_10<=P_client_ack_4 & P_client_ack_3<=1] & 1<=P_client_idle_6]]]] & ~ [1<=P_lb_routing_1_1]] | [~ [[[~ [[P_client_ack_7<=P_client_waiting_9 | P_server_request_10_1<=P_client_idle_6]] & [P_lb_load_2_6<=P_client_idle_1 | [P_lb_routing_1_7<=P_client_ack_3 & P_server_waiting_1<=1]]] & [P_client_request_5<=0 & [[P_client_waiting_1<=1 | P_client_request_7<=P_lb_load_2_0] | [1<=P_client_waiting_6 | 1<=P_lb_load_1_3]]]]] & ~ [[~ [[1<=P_server_request_6_2 & P_client_ack_7<=P_lb_load_1_2]] | ~ [P_client_ack_7<=0]]]]]]]]
normalized: ~ [E [true U ~ [[[[[~ [[~ [P_client_ack_7<=0] | ~ [[1<=P_server_request_6_2 & P_client_ack_7<=P_lb_load_1_2]]]] & ~ [[[P_client_request_5<=0 & [[1<=P_client_waiting_6 | 1<=P_lb_load_1_3] | [P_client_waiting_1<=1 | P_client_request_7<=P_lb_load_2_0]]] & [[P_lb_load_2_6<=P_client_idle_1 | [P_lb_routing_1_7<=P_client_ack_3 & P_server_waiting_1<=1]] & ~ [[P_client_ack_7<=P_client_waiting_9 | P_server_request_10_1<=P_client_idle_6]]]]]] | [~ [1<=P_lb_routing_1_1] & [P_lb_load_1_2<=P_client_ack_1 | [P_lb_routing_1_7<=0 | [P_lb_load_1_7<=1 | [1<=P_client_idle_6 & [P_lb_routing_1_10<=P_client_ack_4 & P_client_ack_3<=1]]]]]]] | [[1<=P_server_notification_ack_1 & [~ [[P_client_waiting_3<=P_lb_routing_1_3 | [[P_client_idle_9<=0 & 1<=P_lb_routing_1_8] & [P_client_waiting_1<=P_client_waiting_9 | P_server_processed_2<=0]]]] | [1<=P_server_request_6_1 & ~ [[[P_server_request_2_2<=P_lb_load_1_5 | P_lb_load_2_2<=P_client_waiting_1] | [P_lb_routing_1_10<=0 | 1<=P_client_idle_8]]]]]] | [P_server_request_2_1<=1 | [[P_server_idle_1<=1 & ~ [P_server_idle_1<=P_client_waiting_8]] & [P_server_request_5_1<=0 | [1<=P_client_waiting_10 | [1<=P_server_idle_2 | [P_lb_load_1_1<=0 & 1<=P_client_idle_10]]]]]]]] | ~ [[~ [[1<=P_server_request_1_1 | P_lb_load_1_1<=P_lb_load_1_10]] | [[[1<=P_client_ack_10 | P_client_idle_4<=1] & [P_client_waiting_6<=0 | ~ [P_server_request_7_2<=P_client_request_7]]] | [~ [P_client_idle_4<=P_server_notification_2] | [~ [P_server_request_5_2<=1] & [1<=P_lb_load_2_1 & P_client_waiting_5<=P_lb_load_1_5]]]]]]]]]]

abstracting: (P_client_waiting_5<=P_lb_load_1_5)
states: 89,024,136 (7)
abstracting: (1<=P_lb_load_2_1)
states: 75,936,852 (7)
abstracting: (P_server_request_5_2<=1)
states: 406,034,376 (8)
abstracting: (P_client_idle_4<=P_server_notification_2)
states: 346,066,494 (8)
abstracting: (P_server_request_7_2<=P_client_request_7)
states: 331,547,652 (8)
abstracting: (P_client_waiting_6<=0)
states: 79,957,176 (7)
abstracting: (P_client_idle_4<=1)
states: 406,034,376 (8)
abstracting: (1<=P_client_ack_10)
states: 79,957,176 (7)
abstracting: (P_lb_load_1_1<=P_lb_load_1_10)
states: 330,256,284 (8)
abstracting: (1<=P_server_request_1_1)
states: 74,701,764 (7)
abstracting: (1<=P_client_idle_10)
states: 79,957,176 (7)
abstracting: (P_lb_load_1_1<=0)
states: 330,256,284 (8)
abstracting: (1<=P_server_idle_2)
states: 101,508,846 (8)
abstracting: (1<=P_client_waiting_10)
states: 326,077,200 (8)
abstracting: (P_server_request_5_1<=0)
states: 331,332,612 (8)
abstracting: (P_server_idle_1<=P_client_waiting_8)
states: 386,034,330 (8)
abstracting: (P_server_idle_1<=1)
states: 406,034,376 (8)
abstracting: (P_server_request_2_1<=1)
states: 406,034,376 (8)
abstracting: (1<=P_client_idle_8)
states: 79,957,176 (7)
abstracting: (P_lb_routing_1_10<=0)
states: 389,060,016 (8)
abstracting: (P_lb_load_2_2<=P_client_waiting_1)
states: 375,500,508 (8)
abstracting: (P_server_request_2_2<=P_lb_load_1_5)
states: 333,342,900 (8)
abstracting: (1<=P_server_request_6_1)
states: 74,701,764 (7)
abstracting: (P_server_processed_2<=0)
states: 304,526,034 (8)
abstracting: (P_client_waiting_1<=P_client_waiting_9)
states: 341,794,608 (8)
abstracting: (1<=P_lb_routing_1_8)
states: 16,974,360 (7)
abstracting: (P_client_idle_9<=0)
states: 326,077,200 (8)
abstracting: (P_client_waiting_3<=P_lb_routing_1_3)
states: 96,931,536 (7)
abstracting: (1<=P_server_notification_ack_1)
states: 101,616,366 (8)
abstracting: (P_client_ack_3<=1)
states: 406,034,376 (8)
abstracting: (P_lb_routing_1_10<=P_client_ack_4)
states: 392,602,400 (8)
abstracting: (1<=P_client_idle_6)
states: 79,957,176 (7)
abstracting: (P_lb_load_1_7<=1)
states: 406,034,376 (8)
abstracting: (P_lb_routing_1_7<=0)
states: 389,060,016 (8)
abstracting: (P_lb_load_1_2<=P_client_ack_1)
states: 289,584,888 (8)
abstracting: (1<=P_lb_routing_1_1)
states: 16,974,360 (7)
abstracting: (P_server_request_10_1<=P_client_idle_6)
states: 345,976,440 (8)
abstracting: (P_client_ack_7<=P_client_waiting_9)
states: 390,316,968 (8)
abstracting: (P_server_waiting_1<=1)
states: 406,034,376 (8)
abstracting: (P_lb_routing_1_7<=P_client_ack_3)
states: 392,602,400 (8)
abstracting: (P_lb_load_2_6<=P_client_idle_1)
states: 404,207,376 (8)
abstracting: (P_client_request_7<=P_lb_load_2_0)
states: 329,658,372 (8)
abstracting: (P_client_waiting_1<=1)
states: 406,034,376 (8)
abstracting: (1<=P_lb_load_1_3)
states: 114,858,000 (8)
abstracting: (1<=P_client_waiting_6)
states: 326,077,200 (8)
abstracting: (P_client_request_5<=0)
states: 326,077,200 (8)
abstracting: (P_client_ack_7<=P_lb_load_1_2)
states: 356,598,972 (8)
abstracting: (1<=P_server_request_6_2)
states: 74,486,724 (7)
abstracting: (P_client_ack_7<=0)
states: 326,077,200 (8)
-> the formula is TRUE

FORMULA SimpleLoadBal-PT-10-ReachabilityCardinality-06 TRUE TECHNIQUES SEQUENTIAL_PROCESSING DECISION_DIAGRAMS UNFOLDING_TO_PT

MC time: 0m21.392sec

totally nodes used: 47763286 (4.8e+07)
number of garbage collections: 0
fire ops cache: hits/miss/sum: 339718440 958524526 1298242966
used/not used/entry size/cache size: 67107594 1270 16 1024MB
basic ops cache: hits/miss/sum: 31432772 108017273 139450045
used/not used/entry size/cache size: 16773751 3465 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: 3345232 12591395 15936627
used/not used/entry size/cache size: 6411896 1976712 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 34114513
1 21883241
2 8206993
3 2282657
4 509389
5 94575
6 15135
7 2072
8 261
9 25
>= 10 3

Total processing time: 10m52.372sec


BK_STOP 1679359758599

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

37003 58768 98964 106093 113062 145910 146284 188095 195351 201287 207793 214932 220020 224444 290491 291926 292586 292247 294008 357503 364792 369020 376174 384403 388900 391780 398750 407192 412091 421152 430735 432353 436331 437290 602758 585126 586713 588053 587702 588956 589143 589650 589387 591027 592431 593605
iterations count:4637815 (7665), effective:160530 (265)

initing FirstDep: 0m 0.001sec


iterations count:54266 (89), effective:658 (1)
356247 476771 595961
iterations count:302525 (500), effective:4384 (7)

iterations count:47353 (78), effective:663 (1)
598797
iterations count:138092 (228), effective:2610 (4)

iterations count:39539 (65), effective:290 (0)

iterations count:55103 (91), effective:744 (1)
592068 633626 706932 636094
iterations count:405187 (669), effective:6630 (10)
317956 527824 601936
iterations count:360318 (595), effective:4111 (6)

iterations count:89514 (147), effective:1773 (2)

iterations count:27814 (45), effective:442 (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="ReachabilityCardinality"
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 ReachabilityCardinality"
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-167905979000518"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;