About the Execution of Smart+red for SimpleLoadBal-PT-20
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5473.315 | 161530.00 | 200968.00 | 91.60 | F | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2023-input.r441-tajo-167905987200334.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 smartxred
Input is SimpleLoadBal-PT-20, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r441-tajo-167905987200334
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.5M
-rw-r--r-- 1 mcc users 8.5K Feb 26 03:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 03:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 03:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K 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 4.6K Feb 25 17:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 17:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 17:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K Feb 26 03:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 172K Feb 26 03:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Feb 26 03:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Feb 26 03:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K 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 2.0M 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
FORMULA_NAME Liveness
=== Now, execution of the tool begins
BK_START 1679558157759
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=smartxred
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=SimpleLoadBal-PT-20
Applying reductions before tool smart
Invoking reducer
Running Version 202303021504
[2023-03-23 07:56:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -timeout, 180, -rebuildPNML]
[2023-03-23 07:56:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 07:56:00] [INFO ] Load time of PNML (sax parser for PT used): 243 ms
[2023-03-23 07:56:00] [INFO ] Transformed 194 places.
[2023-03-23 07:56:00] [INFO ] Transformed 2205 transitions.
[2023-03-23 07:56:00] [INFO ] Found NUPN structural information;
[2023-03-23 07:56:00] [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_idle_11, P_client_idle_12, P_client_idle_13, P_client_idle_14, P_client_idle_15, P_client_idle_16, P_client_idle_17, P_client_idle_18, P_client_idle_19, P_client_idle_20, 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_waiting_11, P_client_waiting_12, P_client_waiting_13, P_client_waiting_14, P_client_waiting_15, P_client_waiting_16, P_client_waiting_17, P_client_waiting_18, P_client_waiting_19, P_client_waiting_20, 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_request_11, P_client_request_12, P_client_request_13, P_client_request_14, P_client_request_15, P_client_request_16, P_client_request_17, P_client_request_18, P_client_request_19, P_client_request_20, 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_client_ack_11, P_client_ack_12, P_client_ack_13, P_client_ack_14, P_client_ack_15, P_client_ack_16, P_client_ack_17, P_client_ack_18, P_client_ack_19, P_client_ack_20, 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_server_request_11_1, P_server_request_11_2, P_server_request_12_1, P_server_request_12_2, P_server_request_13_1, P_server_request_13_2, P_server_request_14_1, P_server_request_14_2, P_server_request_15_1, P_server_request_15_2, P_server_request_16_1, P_server_request_16_2, P_server_request_17_1, P_server_request_17_2, P_server_request_18_1, P_server_request_18_2, P_server_request_19_1, P_server_request_19_2, P_server_request_20_1, P_server_request_20_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_routing_1_11, P_lb_routing_1_12, P_lb_routing_1_13, P_lb_routing_1_14, P_lb_routing_1_15, P_lb_routing_1_16, P_lb_routing_1_17, P_lb_routing_1_18, P_lb_routing_1_19, P_lb_routing_1_20, 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_1_11, P_lb_load_1_12, P_lb_load_1_13, P_lb_load_1_14, P_lb_load_1_15, P_lb_load_1_16, P_lb_load_1_17, P_lb_load_1_18, P_lb_load_1_19, P_lb_load_1_20, 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, P_lb_load_2_11, P_lb_load_2_12, P_lb_load_2_13, P_lb_load_2_14, P_lb_load_2_15, P_lb_load_2_16, P_lb_load_2_17, P_lb_load_2_18, P_lb_load_2_19, P_lb_load_2_20]
[2023-03-23 07:56:00] [INFO ] Parsed PT model containing 194 places and 2205 transitions and 15678 arcs in 413 ms.
Built sparse matrix representations for Structural reductions in 100 ms.19633KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 194/194 places, 2205/2205 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 292 ms. Remains 194 /194 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 293 ms. Remains : 194/194 places, 2205/2205 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 194/194 places, 2205/2205 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 203 ms. Remains 194 /194 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
[2023-03-23 07:56:01] [INFO ] Flow matrix only has 1745 transitions (discarded 460 similar events)
// Phase 1: matrix 1745 rows 194 cols
[2023-03-23 07:56:01] [INFO ] Invariants computation overflowed in 54 ms
[2023-03-23 07:56:01] [INFO ] Implicit Places using invariants in 297 ms returned []
[2023-03-23 07:56:01] [INFO ] Flow matrix only has 1745 transitions (discarded 460 similar events)
// Phase 1: matrix 1745 rows 194 cols
[2023-03-23 07:56:01] [INFO ] Invariants computation overflowed in 21 ms
[2023-03-23 07:56:02] [INFO ] State equation strengthened by 820 read => feed constraints.
[2023-03-23 07:56:02] [INFO ] Implicit Places using invariants and state equation in 1021 ms returned []
Implicit Place search using SMT with State Equation took 1354 ms to find 0 implicit places.
[2023-03-23 07:56:03] [INFO ] Redundant transitions in 112 ms returned []
[2023-03-23 07:56:03] [INFO ] Flow matrix only has 1745 transitions (discarded 460 similar events)
// Phase 1: matrix 1745 rows 194 cols
[2023-03-23 07:56:03] [INFO ] Invariants computation overflowed in 8 ms
[2023-03-23 07:56:04] [INFO ] Dead Transitions using invariants and state equation in 1060 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 2790 ms. Remains : 194/194 places, 2205/2205 transitions.
Random walk for 1250000 steps, including 0 resets, run took 10822 ms (no deadlock found). (steps per millisecond=115 )
Random directed walk for 1250003 steps, including 0 resets, run took 10691 ms (no deadlock found). (steps per millisecond=116 )
[2023-03-23 07:56:25] [INFO ] Flow matrix only has 1745 transitions (discarded 460 similar events)
// Phase 1: matrix 1745 rows 194 cols
[2023-03-23 07:56:25] [INFO ] Invariants computation overflowed in 20 ms
[2023-03-23 07:56:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 07:56:26] [INFO ] [Real]Absence check using state equation in 292 ms returned sat
[2023-03-23 07:56:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 07:56:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 07:56:27] [INFO ] [Nat]Absence check using state equation in 473 ms returned sat
[2023-03-23 07:56:27] [INFO ] State equation strengthened by 820 read => feed constraints.
[2023-03-23 07:56:27] [INFO ] [Nat]Added 820 Read/Feed constraints in 319 ms returned sat
[2023-03-23 07:56:28] [INFO ] Deduced a trap composed of 24 places in 380 ms of which 5 ms to minimize.
[2023-03-23 07:56:28] [INFO ] Deduced a trap composed of 24 places in 366 ms of which 1 ms to minimize.
[2023-03-23 07:56:28] [INFO ] Deduced a trap composed of 25 places in 338 ms of which 1 ms to minimize.
[2023-03-23 07:56:29] [INFO ] Deduced a trap composed of 25 places in 399 ms of which 1 ms to minimize.
[2023-03-23 07:56:29] [INFO ] Deduced a trap composed of 27 places in 433 ms of which 0 ms to minimize.
[2023-03-23 07:56:30] [INFO ] Deduced a trap composed of 25 places in 321 ms of which 0 ms to minimize.
[2023-03-23 07:56:30] [INFO ] Deduced a trap composed of 29 places in 394 ms of which 0 ms to minimize.
[2023-03-23 07:56:31] [INFO ] Deduced a trap composed of 30 places in 247 ms of which 1 ms to minimize.
[2023-03-23 07:56:31] [INFO ] Deduced a trap composed of 24 places in 240 ms of which 0 ms to minimize.
[2023-03-23 07:56:31] [INFO ] Deduced a trap composed of 27 places in 293 ms of which 1 ms to minimize.
[2023-03-23 07:56:31] [INFO ] Deduced a trap composed of 24 places in 234 ms of which 1 ms to minimize.
[2023-03-23 07:56:32] [INFO ] Deduced a trap composed of 26 places in 244 ms of which 0 ms to minimize.
[2023-03-23 07:56:32] [INFO ] Deduced a trap composed of 28 places in 271 ms of which 0 ms to minimize.
[2023-03-23 07:56:32] [INFO ] Deduced a trap composed of 26 places in 216 ms of which 0 ms to minimize.
[2023-03-23 07:56:33] [INFO ] Deduced a trap composed of 30 places in 296 ms of which 1 ms to minimize.
[2023-03-23 07:56:33] [INFO ] Deduced a trap composed of 28 places in 287 ms of which 1 ms to minimize.
[2023-03-23 07:56:34] [INFO ] Deduced a trap composed of 24 places in 270 ms of which 1 ms to minimize.
[2023-03-23 07:56:34] [INFO ] Deduced a trap composed of 30 places in 254 ms of which 1 ms to minimize.
[2023-03-23 07:56:34] [INFO ] Deduced a trap composed of 30 places in 185 ms of which 1 ms to minimize.
[2023-03-23 07:56:34] [INFO ] Deduced a trap composed of 30 places in 212 ms of which 0 ms to minimize.
[2023-03-23 07:56:35] [INFO ] Deduced a trap composed of 30 places in 214 ms of which 0 ms to minimize.
[2023-03-23 07:56:35] [INFO ] Deduced a trap composed of 30 places in 201 ms of which 2 ms to minimize.
[2023-03-23 07:56:35] [INFO ] Deduced a trap composed of 26 places in 243 ms of which 0 ms to minimize.
[2023-03-23 07:56:36] [INFO ] Deduced a trap composed of 30 places in 247 ms of which 0 ms to minimize.
[2023-03-23 07:56:36] [INFO ] Deduced a trap composed of 30 places in 224 ms of which 1 ms to minimize.
[2023-03-23 07:56:36] [INFO ] Deduced a trap composed of 30 places in 206 ms of which 0 ms to minimize.
[2023-03-23 07:56:36] [INFO ] Deduced a trap composed of 26 places in 220 ms of which 1 ms to minimize.
[2023-03-23 07:56:37] [INFO ] Deduced a trap composed of 30 places in 206 ms of which 1 ms to minimize.
[2023-03-23 07:56:37] [INFO ] Deduced a trap composed of 30 places in 227 ms of which 0 ms to minimize.
[2023-03-23 07:56:37] [INFO ] Deduced a trap composed of 30 places in 202 ms of which 0 ms to minimize.
[2023-03-23 07:56:38] [INFO ] Deduced a trap composed of 26 places in 227 ms of which 1 ms to minimize.
[2023-03-23 07:56:38] [INFO ] Deduced a trap composed of 30 places in 196 ms of which 0 ms to minimize.
[2023-03-23 07:56:38] [INFO ] Deduced a trap composed of 26 places in 254 ms of which 0 ms to minimize.
[2023-03-23 07:56:39] [INFO ] Deduced a trap composed of 27 places in 253 ms of which 12 ms to minimize.
[2023-03-23 07:56:40] [INFO ] Deduced a trap composed of 27 places in 273 ms of which 4 ms to minimize.
[2023-03-23 07:56:43] [INFO ] Trap strengthening (SAT) tested/added 35/35 trap constraints in 15587 ms
Parikh directed walk for 34800 steps, including 1000 resets, run took 307 ms. (steps per millisecond=113 )
Random directed walk for 500003 steps, including 0 resets, run took 3964 ms (no deadlock found). (steps per millisecond=126 )
Random walk for 500000 steps, including 0 resets, run took 3098 ms (no deadlock found). (steps per millisecond=161 )
Random directed walk for 500003 steps, including 0 resets, run took 4102 ms (no deadlock found). (steps per millisecond=121 )
Random walk for 500000 steps, including 0 resets, run took 3262 ms (no deadlock found). (steps per millisecond=153 )
Starting structural reductions in DEADLOCK mode, iteration 0 : 194/194 places, 2205/2205 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Applied a total of 0 rules in 97 ms. Remains 194 /194 variables (removed 0) and now considering 2205/2205 (removed 0) transitions.
[2023-03-23 07:56:58] [INFO ] Flow matrix only has 1745 transitions (discarded 460 similar events)
// Phase 1: matrix 1745 rows 194 cols
[2023-03-23 07:56:58] [INFO ] Invariants computation overflowed in 6 ms
[2023-03-23 07:56:58] [INFO ] Implicit Places using invariants in 83 ms returned []
[2023-03-23 07:56:58] [INFO ] Flow matrix only has 1745 transitions (discarded 460 similar events)
// Phase 1: matrix 1745 rows 194 cols
[2023-03-23 07:56:58] [INFO ] Invariants computation overflowed in 8 ms
[2023-03-23 07:56:58] [INFO ] State equation strengthened by 820 read => feed constraints.
[2023-03-23 07:56:58] [INFO ] Implicit Places using invariants and state equation in 571 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
[2023-03-23 07:56:58] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-23 07:56:58] [INFO ] Flow matrix only has 1745 transitions (discarded 460 similar events)
// Phase 1: matrix 1745 rows 194 cols
[2023-03-23 07:56:58] [INFO ] Invariants computation overflowed in 6 ms
[2023-03-23 07:56:59] [INFO ] Dead Transitions using invariants and state equation in 669 ms found 0 transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 1484 ms. Remains : 194/194 places, 2205/2205 transitions.
Random walk for 1250000 steps, including 0 resets, run took 8797 ms (no deadlock found). (steps per millisecond=142 )
Random directed walk for 1250002 steps, including 0 resets, run took 10570 ms (no deadlock found). (steps per millisecond=118 )
[2023-03-23 07:57:18] [INFO ] Flow matrix only has 1745 transitions (discarded 460 similar events)
// Phase 1: matrix 1745 rows 194 cols
[2023-03-23 07:57:18] [INFO ] Invariants computation overflowed in 13 ms
[2023-03-23 07:57:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 07:57:19] [INFO ] [Real]Absence check using state equation in 315 ms returned sat
[2023-03-23 07:57:19] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 07:57:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 07:57:20] [INFO ] [Nat]Absence check using state equation in 345 ms returned sat
[2023-03-23 07:57:20] [INFO ] State equation strengthened by 820 read => feed constraints.
[2023-03-23 07:57:20] [INFO ] [Nat]Added 820 Read/Feed constraints in 356 ms returned sat
[2023-03-23 07:57:20] [INFO ] Deduced a trap composed of 24 places in 282 ms of which 0 ms to minimize.
[2023-03-23 07:57:21] [INFO ] Deduced a trap composed of 24 places in 237 ms of which 1 ms to minimize.
[2023-03-23 07:57:21] [INFO ] Deduced a trap composed of 25 places in 239 ms of which 0 ms to minimize.
[2023-03-23 07:57:21] [INFO ] Deduced a trap composed of 25 places in 225 ms of which 1 ms to minimize.
[2023-03-23 07:57:21] [INFO ] Deduced a trap composed of 27 places in 237 ms of which 1 ms to minimize.
[2023-03-23 07:57:22] [INFO ] Deduced a trap composed of 25 places in 258 ms of which 0 ms to minimize.
[2023-03-23 07:57:22] [INFO ] Deduced a trap composed of 29 places in 213 ms of which 1 ms to minimize.
[2023-03-23 07:57:22] [INFO ] Deduced a trap composed of 30 places in 229 ms of which 0 ms to minimize.
[2023-03-23 07:57:23] [INFO ] Deduced a trap composed of 24 places in 231 ms of which 0 ms to minimize.
[2023-03-23 07:57:23] [INFO ] Deduced a trap composed of 27 places in 244 ms of which 0 ms to minimize.
[2023-03-23 07:57:23] [INFO ] Deduced a trap composed of 24 places in 228 ms of which 0 ms to minimize.
[2023-03-23 07:57:24] [INFO ] Deduced a trap composed of 26 places in 229 ms of which 0 ms to minimize.
[2023-03-23 07:57:24] [INFO ] Deduced a trap composed of 28 places in 271 ms of which 0 ms to minimize.
[2023-03-23 07:57:24] [INFO ] Deduced a trap composed of 26 places in 203 ms of which 12 ms to minimize.
[2023-03-23 07:57:25] [INFO ] Deduced a trap composed of 30 places in 219 ms of which 0 ms to minimize.
[2023-03-23 07:57:25] [INFO ] Deduced a trap composed of 28 places in 242 ms of which 1 ms to minimize.
[2023-03-23 07:57:25] [INFO ] Deduced a trap composed of 24 places in 198 ms of which 0 ms to minimize.
[2023-03-23 07:57:26] [INFO ] Deduced a trap composed of 30 places in 279 ms of which 0 ms to minimize.
[2023-03-23 07:57:26] [INFO ] Deduced a trap composed of 30 places in 211 ms of which 1 ms to minimize.
[2023-03-23 07:57:26] [INFO ] Deduced a trap composed of 30 places in 287 ms of which 0 ms to minimize.
[2023-03-23 07:57:26] [INFO ] Deduced a trap composed of 30 places in 200 ms of which 10 ms to minimize.
[2023-03-23 07:57:27] [INFO ] Deduced a trap composed of 30 places in 223 ms of which 0 ms to minimize.
[2023-03-23 07:57:27] [INFO ] Deduced a trap composed of 26 places in 269 ms of which 0 ms to minimize.
[2023-03-23 07:57:27] [INFO ] Deduced a trap composed of 30 places in 225 ms of which 0 ms to minimize.
[2023-03-23 07:57:28] [INFO ] Deduced a trap composed of 30 places in 213 ms of which 1 ms to minimize.
[2023-03-23 07:57:28] [INFO ] Deduced a trap composed of 30 places in 226 ms of which 1 ms to minimize.
[2023-03-23 07:57:28] [INFO ] Deduced a trap composed of 26 places in 223 ms of which 0 ms to minimize.
[2023-03-23 07:57:28] [INFO ] Deduced a trap composed of 30 places in 214 ms of which 0 ms to minimize.
[2023-03-23 07:57:29] [INFO ] Deduced a trap composed of 30 places in 196 ms of which 1 ms to minimize.
[2023-03-23 07:57:29] [INFO ] Deduced a trap composed of 30 places in 212 ms of which 12 ms to minimize.
[2023-03-23 07:57:29] [INFO ] Deduced a trap composed of 26 places in 223 ms of which 0 ms to minimize.
[2023-03-23 07:57:29] [INFO ] Deduced a trap composed of 30 places in 258 ms of which 1 ms to minimize.
[2023-03-23 07:57:30] [INFO ] Deduced a trap composed of 26 places in 256 ms of which 8 ms to minimize.
[2023-03-23 07:57:31] [INFO ] Deduced a trap composed of 27 places in 274 ms of which 1 ms to minimize.
[2023-03-23 07:57:31] [INFO ] Deduced a trap composed of 27 places in 267 ms of which 0 ms to minimize.
[2023-03-23 07:57:34] [INFO ] Trap strengthening (SAT) tested/added 35/35 trap constraints in 14253 ms
Parikh directed walk for 34800 steps, including 1000 resets, run took 288 ms. (steps per millisecond=120 )
Random directed walk for 500004 steps, including 0 resets, run took 4160 ms (no deadlock found). (steps per millisecond=120 )
Random walk for 500000 steps, including 0 resets, run took 4026 ms (no deadlock found). (steps per millisecond=124 )
Random directed walk for 500004 steps, including 0 resets, run took 4177 ms (no deadlock found). (steps per millisecond=119 )
Random walk for 500000 steps, including 0 resets, run took 3356 ms (no deadlock found). (steps per millisecond=148 )
[2023-03-23 07:57:51] [INFO ] Flatten gal took : 434 ms
Starting structural reductions in LIVENESS mode, iteration 0 : 194/194 places, 2205/2205 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 192 transition count 2203
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 5 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 0 with 60 rules applied. Total rules applied 64 place count 152 transition count 2183
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 4 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 40 rules applied. Total rules applied 104 place count 132 transition count 2163
Applied a total of 104 rules in 72 ms. Remains 132 /194 variables (removed 62) and now considering 2163/2205 (removed 42) transitions.
[2023-03-23 07:57:51] [INFO ] Flow matrix only has 1703 transitions (discarded 460 similar events)
// Phase 1: matrix 1703 rows 132 cols
[2023-03-23 07:57:51] [INFO ] Invariants computation overflowed in 4 ms
[2023-03-23 07:57:52] [INFO ] Implicit Places using invariants in 427 ms returned []
[2023-03-23 07:57:52] [INFO ] Flow matrix only has 1703 transitions (discarded 460 similar events)
// Phase 1: matrix 1703 rows 132 cols
[2023-03-23 07:57:52] [INFO ] Invariants computation overflowed in 5 ms
[2023-03-23 07:57:52] [INFO ] State equation strengthened by 820 read => feed constraints.
[2023-03-23 07:57:55] [INFO ] Implicit Places using invariants and state equation in 3290 ms returned [22, 23]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 3738 ms to find 2 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 130/194 places, 2163/2205 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 128 transition count 2161
Applied a total of 4 rules in 15 ms. Remains 128 /130 variables (removed 2) and now considering 2161/2163 (removed 2) transitions.
[2023-03-23 07:57:55] [INFO ] Flow matrix only has 1701 transitions (discarded 460 similar events)
// Phase 1: matrix 1701 rows 128 cols
[2023-03-23 07:57:55] [INFO ] Invariants computation overflowed in 4 ms
[2023-03-23 07:57:55] [INFO ] Implicit Places using invariants in 465 ms returned []
[2023-03-23 07:57:55] [INFO ] Flow matrix only has 1701 transitions (discarded 460 similar events)
// Phase 1: matrix 1701 rows 128 cols
[2023-03-23 07:57:55] [INFO ] Invariants computation overflowed in 7 ms
[2023-03-23 07:57:56] [INFO ] State equation strengthened by 820 read => feed constraints.
[2023-03-23 07:57:58] [INFO ] Implicit Places using invariants and state equation in 2738 ms returned []
Implicit Place search using SMT with State Equation took 3214 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 128/194 places, 2161/2205 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 7042 ms. Remains : 128/194 places, 2161/2205 transitions.
Initial state reduction rules removed 20 formulas.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1831 ms. (steps per millisecond=5 ) properties (out of 2141) seen :850
Running SMT prover for 1290 properties.
[2023-03-23 07:58:00] [INFO ] Flow matrix only has 1701 transitions (discarded 460 similar events)
// Phase 1: matrix 1701 rows 128 cols
[2023-03-23 07:58:00] [INFO ] Invariants computation overflowed in 4 ms
[2023-03-23 07:58:38] [INFO ] After 20277ms SMT Verify possible using state equation in real domain returned unsat :486 sat :588 real:216
[2023-03-23 07:58:39] [INFO ] State equation strengthened by 820 read => feed constraints.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:642)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMTIncremental(DeadlockTester.java:339)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testUnreachableWithSMT(DeadlockTester.java:223)
at fr.lip6.move.gal.application.solver.ReachabilitySolver.applyReductions(ReachabilitySolver.java:95)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.applyReachabilitySolver(GlobalPropertySolver.java:724)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:558)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preSolveLiveness(GlobalPropertySolver.java:399)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.preStableMarking(GlobalPropertySolver.java:321)
at fr.lip6.move.gal.application.solver.global.GlobalPropertySolver.solveProperty(GlobalPropertySolver.java:294)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:386)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-23 07:58:39] [WARNING] SMT solver failed with error :SMT solver raised an error when submitting script.... while checking expressions.
[2023-03-23 07:58:39] [INFO ] After 25072ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
FORMULA Liveness FALSE TECHNIQUES QUASILIVENESS_TEST
Total runtime 159026 ms.
ITS solved all properties within timeout
BK_STOP 1679558319289
--------------------
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 Liveness -timeout 180 -rebuildPNML
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-20"
export BK_EXAMINATION="Liveness"
export BK_TOOL="smartxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="1800"
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 smartxred"
echo " Input is SimpleLoadBal-PT-20, examination is Liveness"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r441-tajo-167905987200334"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/SimpleLoadBal-PT-20.tgz
mv SimpleLoadBal-PT-20 execution
cd execution
if [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "UpperBounds" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] || [ "Liveness" = "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 [ "Liveness" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "Liveness" != "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 "Liveness.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property Liveness.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "Liveness.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "Liveness" = "ReachabilityDeadlock" ] || [ "Liveness" = "QuasiLiveness" ] || [ "Liveness" = "StableMarking" ] || [ "Liveness" = "Liveness" ] || [ "Liveness" = "OneSafe" ] ; then
echo "FORMULA_NAME Liveness"
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 ;