Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r223-tall-174902009300064.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 gold2024
Input is SimpleLoadBal-PT-05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r223-tall-174902009300064
=====================================================================

--------------------
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 positive values
NUM_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME SimpleLoadBal-PT-05-UpperBounds-00
FORMULA_NAME SimpleLoadBal-PT-05-UpperBounds-01
FORMULA_NAME SimpleLoadBal-PT-05-UpperBounds-02
FORMULA_NAME SimpleLoadBal-PT-05-UpperBounds-03
FORMULA_NAME SimpleLoadBal-PT-05-UpperBounds-04
FORMULA_NAME SimpleLoadBal-PT-05-UpperBounds-05
FORMULA_NAME SimpleLoadBal-PT-05-UpperBounds-06
FORMULA_NAME SimpleLoadBal-PT-05-UpperBounds-07
FORMULA_NAME SimpleLoadBal-PT-05-UpperBounds-08
FORMULA_NAME SimpleLoadBal-PT-05-UpperBounds-09
FORMULA_NAME SimpleLoadBal-PT-05-UpperBounds-10
FORMULA_NAME SimpleLoadBal-PT-05-UpperBounds-11
FORMULA_NAME SimpleLoadBal-PT-05-UpperBounds-12
FORMULA_NAME SimpleLoadBal-PT-05-UpperBounds-13
FORMULA_NAME SimpleLoadBal-PT-05-UpperBounds-14
FORMULA_NAME SimpleLoadBal-PT-05-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1749107718066

Invoking MCC driver with
BK_TOOL=gold2024
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SimpleLoadBal-PT-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2025-06-05 07:15:19] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 07:15:19] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 07:15:19] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2025-06-05 07:15:19] [INFO ] Transformed 59 places.
[2025-06-05 07:15:19] [INFO ] Transformed 180 transitions.
[2025-06-05 07:15:19] [INFO ] Found NUPN structural information;
[2025-06-05 07:15:19] [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-05 07:15:19] [INFO ] Parsed PT model containing 59 places and 180 transitions and 1158 arcs in 169 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 1, 1, 0, 0, 1, 1] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
FORMULA SimpleLoadBal-PT-05-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-05-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-05-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-05-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2025-06-05 07:15:19] [INFO ] Flow matrix only has 140 transitions (discarded 40 similar events)
// Phase 1: matrix 140 rows 59 cols
[2025-06-05 07:15:19] [INFO ] Computed 19 invariants in 20 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (2 resets) in 56 ms. (175 steps per ms)
FORMULA SimpleLoadBal-PT-05-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SimpleLoadBal-PT-05-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SimpleLoadBal-PT-05-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SimpleLoadBal-PT-05-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SimpleLoadBal-PT-05-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SimpleLoadBal-PT-05-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SimpleLoadBal-PT-05-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SimpleLoadBal-PT-05-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SimpleLoadBal-PT-05-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SimpleLoadBal-PT-05-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA SimpleLoadBal-PT-05-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 10001 steps (2 resets) in 21 ms. (454 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-05 07:15:19] [INFO ] Flow matrix only has 140 transitions (discarded 40 similar events)
[2025-06-05 07:15:19] [INFO ] Invariant cache hit.
[2025-06-05 07:15:19] [INFO ] [Real]Absence check using 16 positive place invariants in 6 ms returned sat
[2025-06-05 07:15:19] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 10 ms returned sat
[2025-06-05 07:15:19] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2025-06-05 07:15:19] [INFO ] State equation strengthened by 55 read => feed constraints.
[2025-06-05 07:15:19] [INFO ] [Real]Added 55 Read/Feed constraints in 10 ms returned sat
[2025-06-05 07:15:19] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:15:20] [INFO ] [Nat]Absence check using 16 positive place invariants in 5 ms returned sat
[2025-06-05 07:15:20] [INFO ] [Nat]Absence check using 16 positive and 3 generalized place invariants in 2 ms returned sat
[2025-06-05 07:15:20] [INFO ] [Nat]Absence check using state equation in 34 ms returned sat
[2025-06-05 07:15:20] [INFO ] [Nat]Added 55 Read/Feed constraints in 27 ms returned sat
[2025-06-05 07:15:20] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 6 ms to minimize.
[2025-06-05 07:15:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 93 ms
[2025-06-05 07:15:20] [INFO ] Computed and/alt/rep : 24/132/24 causal constraints (skipped 111 transitions) in 24 ms.
[2025-06-05 07:15:20] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 2 ms to minimize.
[2025-06-05 07:15:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2025-06-05 07:15:20] [INFO ] Added : 19 causal constraints over 4 iterations in 189 ms. Result :sat
Minimization took 68 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 59 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place P_lb_load_1_5) removed 14 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 59/59 places, 166/166 transitions.
Reduce places removed 1 places and 13 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 58 transition count 153
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 1 with 4 rules applied. Total rules applied 5 place count 56 transition count 151
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 1 with 15 rules applied. Total rules applied 20 place count 46 transition count 146
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 1 with 10 rules applied. Total rules applied 30 place count 41 transition count 141
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 41 transition count 136
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 40 place count 36 transition count 136
Applied a total of 40 rules in 58 ms. Remains 36 /59 variables (removed 23) and now considering 136/166 (removed 30) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 36/59 places, 136/166 transitions.
[2025-06-05 07:15:20] [INFO ] Flow matrix only has 104 transitions (discarded 32 similar events)
// Phase 1: matrix 104 rows 36 cols
[2025-06-05 07:15:20] [INFO ] Computed 14 invariants in 6 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 2443 ms. (409 steps per ms)
BEST_FIRST walk for 1000001 steps (2 resets) in 684 ms. (1459 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-05 07:15:23] [INFO ] Flow matrix only has 104 transitions (discarded 32 similar events)
[2025-06-05 07:15:23] [INFO ] Invariant cache hit.
[2025-06-05 07:15:23] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2025-06-05 07:15:23] [INFO ] [Real]Absence check using 10 positive and 4 generalized place invariants in 2 ms returned sat
[2025-06-05 07:15:23] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2025-06-05 07:15:23] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-06-05 07:15:23] [INFO ] [Real]Added 48 Read/Feed constraints in 8 ms returned sat
[2025-06-05 07:15:23] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:15:23] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2025-06-05 07:15:23] [INFO ] [Nat]Absence check using 10 positive and 4 generalized place invariants in 1 ms returned sat
[2025-06-05 07:15:23] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2025-06-05 07:15:23] [INFO ] [Nat]Added 48 Read/Feed constraints in 9 ms returned sat
[2025-06-05 07:15:24] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 1 ms to minimize.
[2025-06-05 07:15:24] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 58 ms
[2025-06-05 07:15:24] [INFO ] Computed and/alt/rep : 10/75/10 causal constraints (skipped 89 transitions) in 11 ms.
[2025-06-05 07:15:24] [INFO ] Added : 2 causal constraints over 1 iterations in 25 ms. Result :sat
Minimization took 25 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 36 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 36/36 places, 136/136 transitions.
Applied a total of 0 rules in 9 ms. Remains 36 /36 variables (removed 0) and now considering 136/136 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 36/36 places, 136/136 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 36/36 places, 136/136 transitions.
Applied a total of 0 rules in 5 ms. Remains 36 /36 variables (removed 0) and now considering 136/136 (removed 0) transitions.
[2025-06-05 07:15:24] [INFO ] Flow matrix only has 104 transitions (discarded 32 similar events)
[2025-06-05 07:15:24] [INFO ] Invariant cache hit.
[2025-06-05 07:15:24] [INFO ] Implicit Places using invariants in 60 ms returned [7, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 62 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 34/36 places, 136/136 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 32 transition count 134
Applied a total of 4 rules in 7 ms. Remains 32 /34 variables (removed 2) and now considering 134/136 (removed 2) transitions.
[2025-06-05 07:15:24] [INFO ] Flow matrix only has 102 transitions (discarded 32 similar events)
// Phase 1: matrix 102 rows 32 cols
[2025-06-05 07:15:24] [INFO ] Computed 12 invariants in 4 ms
[2025-06-05 07:15:24] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-05 07:15:24] [INFO ] Flow matrix only has 102 transitions (discarded 32 similar events)
[2025-06-05 07:15:24] [INFO ] Invariant cache hit.
[2025-06-05 07:15:24] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-06-05 07:15:24] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 158 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 32/36 places, 134/136 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 234 ms. Remains : 32/36 places, 134/136 transitions.
[2025-06-05 07:15:24] [INFO ] Flow matrix only has 102 transitions (discarded 32 similar events)
[2025-06-05 07:15:24] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 2653 ms. (376 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 695 ms. (1436 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2025-06-05 07:15:27] [INFO ] Flow matrix only has 102 transitions (discarded 32 similar events)
[2025-06-05 07:15:27] [INFO ] Invariant cache hit.
[2025-06-05 07:15:27] [INFO ] [Real]Absence check using 9 positive place invariants in 1 ms returned sat
[2025-06-05 07:15:27] [INFO ] [Real]Absence check using 9 positive and 3 generalized place invariants in 3 ms returned sat
[2025-06-05 07:15:27] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2025-06-05 07:15:27] [INFO ] Solution in real domain found non-integer solution.
[2025-06-05 07:15:27] [INFO ] [Nat]Absence check using 9 positive place invariants in 3 ms returned sat
[2025-06-05 07:15:27] [INFO ] [Nat]Absence check using 9 positive and 3 generalized place invariants in 1 ms returned sat
[2025-06-05 07:15:27] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2025-06-05 07:15:27] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-06-05 07:15:27] [INFO ] [Nat]Added 48 Read/Feed constraints in 10 ms returned sat
[2025-06-05 07:15:27] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2025-06-05 07:15:27] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 1 ms to minimize.
[2025-06-05 07:15:27] [INFO ] Deduced a trap composed of 8 places in 39 ms of which 0 ms to minimize.
[2025-06-05 07:15:28] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 129 ms
[2025-06-05 07:15:28] [INFO ] Computed and/alt/rep : 10/75/10 causal constraints (skipped 87 transitions) in 12 ms.
[2025-06-05 07:15:28] [INFO ] Added : 3 causal constraints over 1 iterations in 31 ms. Result :sat
Minimization took 29 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 32 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 134/134 transitions.
Applied a total of 0 rules in 5 ms. Remains 32 /32 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 32/32 places, 134/134 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 32/32 places, 134/134 transitions.
Applied a total of 0 rules in 4 ms. Remains 32 /32 variables (removed 0) and now considering 134/134 (removed 0) transitions.
[2025-06-05 07:15:28] [INFO ] Flow matrix only has 102 transitions (discarded 32 similar events)
[2025-06-05 07:15:28] [INFO ] Invariant cache hit.
[2025-06-05 07:15:28] [INFO ] Implicit Places using invariants in 63 ms returned []
[2025-06-05 07:15:28] [INFO ] Flow matrix only has 102 transitions (discarded 32 similar events)
[2025-06-05 07:15:28] [INFO ] Invariant cache hit.
[2025-06-05 07:15:28] [INFO ] State equation strengthened by 48 read => feed constraints.
[2025-06-05 07:15:28] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2025-06-05 07:15:28] [INFO ] Redundant transitions in 3 ms returned []
Running 129 sub problems to find dead transitions.
[2025-06-05 07:15:28] [INFO ] Flow matrix only has 102 transitions (discarded 32 similar events)
[2025-06-05 07:15:28] [INFO ] Invariant cache hit.
[2025-06-05 07:15:28] [INFO ] State equation strengthened by 48 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 9/40 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 1/41 constraints. Problems are: Problem set: 0 solved, 129 unsolved
[2025-06-05 07:15:28] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 129 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 129 unsolved
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD117 is UNSAT
At refinement iteration 5 (OVERLAPS) 1/32 variables, 2/44 constraints. Problems are: Problem set: 18 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 1/45 constraints. Problems are: Problem set: 18 solved, 111 unsolved
[2025-06-05 07:15:29] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
[2025-06-05 07:15:29] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 0 ms to minimize.
[2025-06-05 07:15:30] [INFO ] Deduced a trap composed of 8 places in 544 ms of which 27 ms to minimize.
[2025-06-05 07:15:30] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 0 ms to minimize.
[2025-06-05 07:15:30] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 0 ms to minimize.
[2025-06-05 07:15:30] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 6/51 constraints. Problems are: Problem set: 18 solved, 111 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/32 variables, 0/51 constraints. Problems are: Problem set: 18 solved, 111 unsolved
At refinement iteration 9 (OVERLAPS) 102/134 variables, 32/83 constraints. Problems are: Problem set: 18 solved, 111 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/134 variables, 48/131 constraints. Problems are: Problem set: 18 solved, 111 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/134 variables, 0/131 constraints. Problems are: Problem set: 18 solved, 111 unsolved
At refinement iteration 12 (OVERLAPS) 0/134 variables, 0/131 constraints. Problems are: Problem set: 18 solved, 111 unsolved
No progress, stopping.
After SMT solving in domain Real declared 134/134 variables, and 131 constraints, problems are : Problem set: 18 solved, 111 unsolved in 3689 ms.
Refiners :[Domain max(s): 32/32 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 32/32 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 129/129 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 18 solved, 111 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 31/31 constraints. Problems are: Problem set: 18 solved, 111 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 9/40 constraints. Problems are: Problem set: 18 solved, 111 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 1/41 constraints. Problems are: Problem set: 18 solved, 111 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 6/47 constraints. Problems are: Problem set: 18 solved, 111 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/47 constraints. Problems are: Problem set: 18 solved, 111 unsolved
At refinement iteration 5 (OVERLAPS) 1/32 variables, 2/49 constraints. Problems are: Problem set: 18 solved, 111 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 1/50 constraints. Problems are: Problem set: 18 solved, 111 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 1/51 constraints. Problems are: Problem set: 18 solved, 111 unsolved
[2025-06-05 07:15:32] [INFO ] Deduced a trap composed of 7 places in 35 ms of which 1 ms to minimize.
[2025-06-05 07:15:32] [INFO ] Deduced a trap composed of 8 places in 32 ms of which 2 ms to minimize.
Problem TDEAD129 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/32 variables, 2/53 constraints. Problems are: Problem set: 19 solved, 110 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/53 constraints. Problems are: Problem set: 19 solved, 110 unsolved
At refinement iteration 10 (OVERLAPS) 102/134 variables, 32/85 constraints. Problems are: Problem set: 19 solved, 110 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/134 variables, 48/133 constraints. Problems are: Problem set: 19 solved, 110 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/134 variables, 110/243 constraints. Problems are: Problem set: 19 solved, 110 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/134 variables, 0/243 constraints. Problems are: Problem set: 19 solved, 110 unsolved
At refinement iteration 14 (OVERLAPS) 0/134 variables, 0/243 constraints. Problems are: Problem set: 19 solved, 110 unsolved
No progress, stopping.
After SMT solving in domain Int declared 134/134 variables, and 243 constraints, problems are : Problem set: 19 solved, 110 unsolved in 3669 ms.
Refiners :[Domain max(s): 32/32 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 32/32 constraints, ReadFeed: 48/48 constraints, PredecessorRefiner: 110/129 constraints, Known Traps: 9/9 constraints]
After SMT, in 7591ms problems are : Problem set: 19 solved, 110 unsolved
Search for dead transitions found 19 dead transitions in 7602ms
Found 19 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 19 transitions
Dead transitions reduction (with SMT) removed 19 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 32/32 places, 115/134 transitions.
Graph (complete) has 351 edges and 32 vertex of which 1 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.2 ms
Discarding 31 places :
Also discarding 115 output transitions
Drop transitions (Output transitions of discarded places.) removed 115 transitions
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 8 ms. Remains 1 /32 variables (removed 31) and now considering 0/115 (removed 115) transitions.
[2025-06-05 07:15:35] [INFO ] Computed 0 invariants in 0 ms
[2025-06-05 07:15:35] [INFO ] Implicit Places using invariants in 16 ms returned []
[2025-06-05 07:15:35] [INFO ] Invariant cache hit.
[2025-06-05 07:15:35] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 1/32 places, 0/134 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 7857 ms. Remains : 1/32 places, 0/134 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
FORMULA SimpleLoadBal-PT-05-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 16574 ms.

BK_STOP 1749107736012

--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="UpperBounds"
export BK_TOOL="gold2024"
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-5832"
echo " Executing tool gold2024"
echo " Input is SimpleLoadBal-PT-05, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r223-tall-174902009300064"
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 [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "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 [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "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 "UpperBounds.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 '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
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 ;