Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r217-tall-174902002900319.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5832
Executing tool itstools
Input is SimpleLoadBal-PT-05, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r217-tall-174902002900319
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 5.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 19K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 155K May 29 14:33 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 1749074395264

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=Liveness
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=1800
BK_INPUT=SimpleLoadBal-PT-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
Liveness PT
Running Version 202505121319
[2025-06-04 21:59:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2025-06-04 21:59:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-04 21:59:56] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2025-06-04 21:59:56] [INFO ] Transformed 59 places.
[2025-06-04 21:59:56] [INFO ] Transformed 180 transitions.
[2025-06-04 21:59:56] [INFO ] Found NUPN structural information;
[2025-06-04 21:59:56] [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_waiting_1, P_client_waiting_2, P_client_waiting_3, P_client_waiting_4, P_client_waiting_5, P_client_request_1, P_client_request_2, P_client_request_3, P_client_request_4, P_client_request_5, P_client_ack_1, P_client_ack_2, P_client_ack_3, P_client_ack_4, P_client_ack_5, 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_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_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_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]
[2025-06-04 21:59:56] [INFO ] Parsed PT model containing 59 places and 180 transitions and 1158 arcs in 196 ms.
Built sparse matrix representations for Structural reductions in 7 ms.19503KB memory used
Starting structural reductions in DEADLOCK mode, iteration 0 : 59/59 places, 180/180 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 27 ms. Remains 59 /59 variables (removed 0) and now considering 180/180 (removed 0) transitions.
Finished structural reductions in DEADLOCK mode , in 1 iterations and 49 ms. Remains : 59/59 places, 180/180 transitions.
Starting structural reductions in DEADLOCK mode, iteration 0 : 59/59 places, 180/180 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 14 ms. Remains 59 /59 variables (removed 0) and now considering 180/180 (removed 0) transitions.
[2025-06-04 21:59:57] [INFO ] Flow matrix only has 140 transitions (discarded 40 similar events)
// Phase 1: matrix 140 rows 59 cols
[2025-06-04 21:59:57] [INFO ] Computed 19 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:59:57] [INFO ] Implicit Places using invariants in 230 ms returned []
[2025-06-04 21:59:57] [INFO ] Flow matrix only has 140 transitions (discarded 40 similar events)
[2025-06-04 21:59:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 21:59:57] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-04 21:59:57] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-04 21:59:57] [INFO ] Redundant transitions in 5 ms returned []
Running 175 sub problems to find dead transitions.
[2025-06-04 21:59:57] [INFO ] Flow matrix only has 140 transitions (discarded 40 similar events)
[2025-06-04 21:59:57] [INFO ] Invariant cache hit.
[2025-06-04 21:59:57] [INFO ] State equation strengthened by 55 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 175 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 175 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 21:59:58] [INFO ] Deduced a trap composed of 16 places in 55 ms of which 8 ms to minimize.
Problem TDEAD129 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 1/63 constraints. Problems are: Problem set: 1 solved, 174 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/63 constraints. Problems are: Problem set: 1 solved, 174 unsolved
At refinement iteration 5 (OVERLAPS) 5/59 variables, 9/72 constraints. Problems are: Problem set: 1 solved, 174 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 5/77 constraints. Problems are: Problem set: 1 solved, 174 unsolved
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 2/79 constraints. Problems are: Problem set: 39 solved, 136 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:00:00] [INFO ] Deduced a trap composed of 11 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:00:00] [INFO ] Deduced a trap composed of 11 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:00:00] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:00:00] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 5 ms to minimize.
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD108 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/59 variables, 4/83 constraints. Problems are: Problem set: 42 solved, 133 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:00:00] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:00:01] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:00:01] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:00:01] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 5 ms to minimize.
Problem TDEAD113 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:00:01] [INFO ] Deduced a trap composed of 28 places in 57 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:00:01] [INFO ] Deduced a trap composed of 29 places in 53 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/59 variables, 6/89 constraints. Problems are: Problem set: 43 solved, 132 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:00:01] [INFO ] Deduced a trap composed of 11 places in 67 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:00:01] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 3 ms to minimize.
Problem TDEAD112 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/59 variables, 2/91 constraints. Problems are: Problem set: 44 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/59 variables, 0/91 constraints. Problems are: Problem set: 44 solved, 131 unsolved
At refinement iteration 12 (OVERLAPS) 140/199 variables, 59/150 constraints. Problems are: Problem set: 44 solved, 131 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/199 variables, 55/205 constraints. Problems are: Problem set: 44 solved, 131 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/199 variables, 0/205 constraints. Problems are: Problem set: 44 solved, 131 unsolved
At refinement iteration 15 (OVERLAPS) 0/199 variables, 0/205 constraints. Problems are: Problem set: 44 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 199/199 variables, and 205 constraints, problems are : Problem set: 44 solved, 131 unsolved in 9490 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 175/175 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 44 solved, 131 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/54 variables, 54/54 constraints. Problems are: Problem set: 44 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/54 variables, 7/61 constraints. Problems are: Problem set: 44 solved, 131 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 1/62 constraints. Problems are: Problem set: 44 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/54 variables, 5/67 constraints. Problems are: Problem set: 44 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/67 constraints. Problems are: Problem set: 44 solved, 131 unsolved
At refinement iteration 5 (OVERLAPS) 5/59 variables, 9/76 constraints. Problems are: Problem set: 44 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 5/81 constraints. Problems are: Problem set: 44 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 2/83 constraints. Problems are: Problem set: 44 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/59 variables, 8/91 constraints. Problems are: Problem set: 44 solved, 131 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/59 variables, 0/91 constraints. Problems are: Problem set: 44 solved, 131 unsolved
At refinement iteration 10 (OVERLAPS) 140/199 variables, 59/150 constraints. Problems are: Problem set: 44 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/199 variables, 55/205 constraints. Problems are: Problem set: 44 solved, 131 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/199 variables, 131/336 constraints. Problems are: Problem set: 44 solved, 131 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/199 variables, 0/336 constraints. Problems are: Problem set: 44 solved, 131 unsolved
At refinement iteration 14 (OVERLAPS) 0/199 variables, 0/336 constraints. Problems are: Problem set: 44 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 199/199 variables, and 336 constraints, problems are : Problem set: 44 solved, 131 unsolved in 10280 ms.
Refiners :[Domain max(s): 59/59 constraints, Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 59/59 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 131/175 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 20014ms problems are : Problem set: 44 solved, 131 unsolved
Search for dead transitions found 44 dead transitions in 20024ms
Found 44 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 44 transitions
Dead transitions reduction (with SMT) removed 44 transitions
Starting structural reductions in DEADLOCK mode, iteration 1 : 59/59 places, 136/180 transitions.
Computed a total of 3 stabilizing places and 8 stable transitions
Reduce places removed 0 places and 2 transitions.
Computed a total of 3 stabilizing places and 6 stable transitions
Graph (complete) has 401 edges and 59 vertex of which 57 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 57 transition count 134
Reduce places removed 0 places and 6 transitions.
Computed a total of 1 stabilizing places and 0 stable transitions
Graph (complete) has 380 edges and 57 vertex of which 56 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 56 transition count 128
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 2 rules in 19 ms. Remains 56 /59 variables (removed 3) and now considering 128/136 (removed 8) transitions.
[2025-06-04 22:00:17] [INFO ] Flow matrix only has 104 transitions (discarded 24 similar events)
// Phase 1: matrix 104 rows 56 cols
[2025-06-04 22:00:17] [INFO ] Computed 19 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:00:17] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-04 22:00:17] [INFO ] Flow matrix only has 104 transitions (discarded 24 similar events)
[2025-06-04 22:00:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:00:17] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-06-04 22:00:17] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 108 ms to find 0 implicit places.
Starting structural reductions in DEADLOCK mode, iteration 2 : 56/59 places, 128/180 transitions.
Finished structural reductions in DEADLOCK mode , in 2 iterations and 20607 ms. Remains : 56/59 places, 128/180 transitions.
Random walk for 1250000 steps, including 0 resets, run took 3527 ms (no deadlock found). (steps per millisecond=354 )
Random directed walk for 1250000 steps, including 0 resets, run took 2150 ms (no deadlock found). (steps per millisecond=581 )
[2025-06-04 22:00:23] [INFO ] Flow matrix only has 104 transitions (discarded 24 similar events)
[2025-06-04 22:00:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 300.0 s and query timeout 30000.0 ms
[2025-06-04 22:00:23] [INFO ] [Real]Absence check using 17 positive place invariants in 13 ms returned sat
[2025-06-04 22:00:23] [INFO ] [Real]Absence check using 17 positive and 2 generalized place invariants in 7 ms returned sat
[2025-06-04 22:00:23] [INFO ] [Real]Absence check using state equation in 118 ms returned sat
[2025-06-04 22:00:23] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 300.0 s and query timeout 30000.0 ms
[2025-06-04 22:00:23] [INFO ] [Nat]Absence check using 17 positive place invariants in 6 ms returned sat
[2025-06-04 22:00:23] [INFO ] [Nat]Absence check using 17 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-04 22:00:23] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2025-06-04 22:00:23] [INFO ] State equation strengthened by 37 read => feed constraints.
[2025-06-04 22:00:23] [INFO ] [Nat]Added 37 Read/Feed constraints in 23 ms returned sat
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:00:23] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:00:23] [INFO ] Deduced a trap composed of 7 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:00:23] [INFO ] Deduced a trap composed of 7 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:00:23] [INFO ] Deduced a trap composed of 6 places in 42 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:00:24] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-04 22:00:24] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 2 ms to minimize.
[2025-06-04 22:00:24] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 6 trap constraints in 377 ms
Starting structural reductions in LIVENESS mode, iteration 0 : 59/59 places, 180/180 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 57 transition count 178
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 10 places and 0 transitions.
Iterating global reduction 0 with 15 rules applied. Total rules applied 19 place count 47 transition count 173
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 29 place count 42 transition count 168
Applied a total of 29 rules in 13 ms. Remains 42 /59 variables (removed 17) and now considering 168/180 (removed 12) transitions.
[2025-06-04 22:00:24] [INFO ] Flow matrix only has 128 transitions (discarded 40 similar events)
// Phase 1: matrix 128 rows 42 cols
[2025-06-04 22:00:24] [INFO ] Computed 14 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:00:24] [INFO ] Implicit Places using invariants in 95 ms returned [7, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 98 ms to find 2 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 40/59 places, 168/180 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 38 transition count 166
Applied a total of 4 rules in 6 ms. Remains 38 /40 variables (removed 2) and now considering 166/168 (removed 2) transitions.
[2025-06-04 22:00:24] [INFO ] Flow matrix only has 126 transitions (discarded 40 similar events)
// Phase 1: matrix 126 rows 38 cols
[2025-06-04 22:00:24] [INFO ] Computed 12 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:00:24] [INFO ] Implicit Places using invariants in 81 ms returned []
[2025-06-04 22:00:24] [INFO ] Flow matrix only has 126 transitions (discarded 40 similar events)
[2025-06-04 22:00:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-04 22:00:24] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-04 22:00:24] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 38/59 places, 166/180 transitions.
Finished structural reductions in LIVENESS mode , in 2 iterations and 358 ms. Remains : 38/59 places, 166/180 transitions.
Initial state reduction rules removed 5 formulas.
RANDOM walk for 40000 steps (8 resets) in 1554 ms. (25 steps per ms) remains 52/161 properties
[2025-06-04 22:00:25] [INFO ] Flatten gal took : 78 ms
BEST_FIRST walk for 4002 steps (8 resets) in 50 ms. (78 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 36 ms. (108 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 52/52 properties
[2025-06-04 22:00:25] [INFO ] Flatten gal took : 44 ms
BEST_FIRST walk for 4004 steps (8 resets) in 58 ms. (67 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (8 resets) in 48 ms. (81 steps per ms) remains 52/52 properties
[2025-06-04 22:00:25] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality4429660308905058531.gal : 21 ms
BEST_FIRST walk for 4004 steps (8 resets) in 45 ms. (87 steps per ms) remains 52/52 properties
[2025-06-04 22:00:25] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16308951890440991640.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality4429660308905058531.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16308951890440991640.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 4004 steps (8 resets) in 54 ms. (72 steps per ms) remains 52/52 properties

BEST_FIRST walk for 4003 steps (8 resets) in 55 ms. (71 steps per ms) remains 52/52 properties
its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 63 ms. (62 steps per ms) remains 52/52 properties
Loading property file /tmp/ReachabilityCardinality16308951890440991640.prop.
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 53 ms. (74 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 32 ms. (121 steps per ms) remains 52/52 properties
SDD proceeding with computation,52 properties remain. new max is 4
SDD size :1 after 6
BEST_FIRST walk for 4003 steps (8 resets) in 19 ms. (200 steps per ms) remains 52/52 properties
SDD proceeding with computation,52 properties remain. new max is 8
SDD size :6 after 27
SDD proceeding with computation,52 properties remain. new max is 16
SDD size :27 after 56
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 19 ms. (200 steps per ms) remains 52/52 properties
SDD proceeding with computation,52 properties remain. new max is 32
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
SDD size :56 after 96
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 15 ms. (250 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
SDD proceeding with computation,52 properties remain. new max is 64
SDD size :96 after 227
BEST_FIRST walk for 4002 steps (8 resets) in 39 ms. (100 steps per ms) remains 52/52 properties
SDD proceeding with computation,52 properties remain. new max is 128
SDD size :227 after 569
BEST_FIRST walk for 4003 steps (8 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 26 ms. (148 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 22 ms. (174 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 15 ms. (250 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 52/52 properties
SDD proceeding with computation,52 properties remain. new max is 256
SDD size :569 after 1096
BEST_FIRST walk for 4002 steps (8 resets) in 21 ms. (181 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 28 ms. (138 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 27 ms. (142 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 18 ms. (210 steps per ms) remains 52/52 properties
SDD proceeding with computation,52 properties remain. new max is 512
SDD size :1096 after 2144
BEST_FIRST walk for 4002 steps (8 resets) in 28 ms. (138 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 27 ms. (142 steps per ms) remains 52/52 properties
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,2268,0.197864,10368,2,2409,13,19325,58,0,399,13602,0
Total reachable state count : 2268

Verifying 52 reachability properties.
Reachability property qltransition_12 does not hold.
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
ITS tools runner thread asked to quit. Dying gracefully.
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 16 ms. (235 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (8 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (8 resets) in 22 ms. (174 steps per ms) remains 52/52 properties
FORMULA Liveness FALSE TECHNIQUES QUASILIVENESS_TEST
Total runtime 28832 ms.

BK_STOP 1749074425619

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ Liveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution Liveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination Liveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800

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-05"
export BK_EXAMINATION="Liveness"
export BK_TOOL="itstools"
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-5832"
echo " Executing tool itstools"
echo " Input is SimpleLoadBal-PT-05, 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 r217-tall-174902002900319"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SimpleLoadBal-PT-05.tgz
mv SimpleLoadBal-PT-05 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.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 '' Liveness.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;