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.r448-tajo-167905990000324.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 gold2022
Input is SimpleLoadBal-PT-10, examination is Liveness
Time confinement is 1800 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r448-tajo-167905990000324
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 968K
-rw-r--r-- 1 mcc users 8.8K Feb 26 03:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 03:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K Feb 26 03:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Feb 26 03:49 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.6K Feb 25 17:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 17:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Feb 25 17:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Feb 25 17:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 03:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Feb 26 03:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Feb 26 03:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Feb 26 03:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 535K Mar 5 18:23 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

FORMULA_NAME Liveness

=== Now, execution of the tool begins

BK_START 1679477069477

Running Version 202205111006
[2023-03-22 09:24:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, Liveness, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 1800]
[2023-03-22 09:24:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-22 09:24:30] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2023-03-22 09:24:30] [INFO ] Transformed 104 places.
[2023-03-22 09:24:31] [INFO ] Transformed 605 transitions.
[2023-03-22 09:24:31] [INFO ] Found NUPN structural information;
[2023-03-22 09:24:31] [INFO ] Completing missing partition info from NUPN : creating a component with [P_client_idle_1, P_client_idle_2, P_client_idle_3, P_client_idle_4, P_client_idle_5, P_client_idle_6, P_client_idle_7, P_client_idle_8, P_client_idle_9, P_client_idle_10, P_client_waiting_1, P_client_waiting_2, P_client_waiting_3, P_client_waiting_4, P_client_waiting_5, P_client_waiting_6, P_client_waiting_7, P_client_waiting_8, P_client_waiting_9, P_client_waiting_10, P_client_request_1, P_client_request_2, P_client_request_3, P_client_request_4, P_client_request_5, P_client_request_6, P_client_request_7, P_client_request_8, P_client_request_9, P_client_request_10, P_client_ack_1, P_client_ack_2, P_client_ack_3, P_client_ack_4, P_client_ack_5, P_client_ack_6, P_client_ack_7, P_client_ack_8, P_client_ack_9, P_client_ack_10, P_server_idle_1, P_server_idle_2, P_server_waiting_1, P_server_waiting_2, P_server_processed_1, P_server_processed_2, P_server_notification_1, P_server_notification_2, P_server_notification_ack_1, P_server_notification_ack_2, P_server_request_1_1, P_server_request_1_2, P_server_request_2_1, P_server_request_2_2, P_server_request_3_1, P_server_request_3_2, P_server_request_4_1, P_server_request_4_2, P_server_request_5_1, P_server_request_5_2, P_server_request_6_1, P_server_request_6_2, P_server_request_7_1, P_server_request_7_2, P_server_request_8_1, P_server_request_8_2, P_server_request_9_1, P_server_request_9_2, P_server_request_10_1, P_server_request_10_2, P_lb_idle_1, P_lb_routing_1_1, P_lb_routing_1_2, P_lb_routing_1_3, P_lb_routing_1_4, P_lb_routing_1_5, P_lb_routing_1_6, P_lb_routing_1_7, P_lb_routing_1_8, P_lb_routing_1_9, P_lb_routing_1_10, P_lb_balancing_1, P_lb_load_1_0, P_lb_load_1_1, P_lb_load_1_2, P_lb_load_1_3, P_lb_load_1_4, P_lb_load_1_5, P_lb_load_1_6, P_lb_load_1_7, P_lb_load_1_8, P_lb_load_1_9, P_lb_load_1_10, P_lb_load_2_0, P_lb_load_2_1, P_lb_load_2_2, P_lb_load_2_3, P_lb_load_2_4, P_lb_load_2_5, P_lb_load_2_6, P_lb_load_2_7, P_lb_load_2_8, P_lb_load_2_9, P_lb_load_2_10]
[2023-03-22 09:24:31] [INFO ] Parsed PT model containing 104 places and 605 transitions in 260 ms.
Built sparse matrix representations for Structural reductions in 8 ms.14343KB memory used
Starting structural reductions in DEADLOCKS mode, iteration 0 : 104/104 places, 605/605 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 60 ms. Remains 104 /104 variables (removed 0) and now considering 605/605 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 104/104 places, 605/605 transitions.
Starting structural reductions in DEADLOCKS mode, iteration 0 : 104/104 places, 605/605 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 23 ms. Remains 104 /104 variables (removed 0) and now considering 605/605 (removed 0) transitions.
[2023-03-22 09:24:31] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
// Phase 1: matrix 475 rows 104 cols
[2023-03-22 09:24:31] [INFO ] Computed 29 place invariants in 24 ms
[2023-03-22 09:24:31] [INFO ] Implicit Places using invariants in 194 ms returned []
[2023-03-22 09:24:31] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
// Phase 1: matrix 475 rows 104 cols
[2023-03-22 09:24:31] [INFO ] Computed 29 place invariants in 8 ms
[2023-03-22 09:24:31] [INFO ] State equation strengthened by 210 read => feed constraints.
[2023-03-22 09:24:31] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
[2023-03-22 09:24:31] [INFO ] Redundant transitions in 31 ms returned []
[2023-03-22 09:24:31] [INFO ] Flow matrix only has 475 transitions (discarded 130 similar events)
// Phase 1: matrix 475 rows 104 cols
[2023-03-22 09:24:31] [INFO ] Computed 29 place invariants in 7 ms
[2023-03-22 09:24:32] [INFO ] Dead Transitions using invariants and state equation in 333 ms found 192 transitions.
Found 192 dead transitions using SMT.
Drop transitions removed 192 transitions
Dead transitions reduction (with SMT) removed 192 transitions
Starting structural reductions in DEADLOCKS mode, iteration 1 : 104/104 places, 413/605 transitions.
Computed a total of 8 stabilizing places and 36 stable transitions
Reduce places removed 0 places and 4 transitions.
Computed a total of 8 stabilizing places and 32 stable transitions
Graph (complete) has 1061 edges and 104 vertex of which 102 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 102 transition count 409
Reduce places removed 0 places and 4 transitions.
Computed a total of 6 stabilizing places and 28 stable transitions
Graph (complete) has 1049 edges and 102 vertex of which 100 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 100 transition count 405
Reduce places removed 0 places and 4 transitions.
Computed a total of 4 stabilizing places and 24 stable transitions
Graph (complete) has 1037 edges and 100 vertex of which 98 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.8 ms
Discarding 2 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 1 rules applied. Total rules applied 3 place count 98 transition count 401
Reduce places removed 0 places and 24 transitions.
Computed a total of 2 stabilizing places and 0 stable transitions
Graph (complete) has 963 edges and 98 vertex of which 96 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 3 with 1 rules applied. Total rules applied 4 place count 96 transition count 377
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 4 rules in 69 ms. Remains 96 /104 variables (removed 8) and now considering 377/413 (removed 36) transitions.
[2023-03-22 09:24:32] [INFO ] Flow matrix only has 299 transitions (discarded 78 similar events)
// Phase 1: matrix 299 rows 96 cols
[2023-03-22 09:24:32] [INFO ] Computed 29 place invariants in 5 ms
[2023-03-22 09:24:32] [INFO ] Implicit Places using invariants in 37 ms returned []
[2023-03-22 09:24:32] [INFO ] Flow matrix only has 299 transitions (discarded 78 similar events)
// Phase 1: matrix 299 rows 96 cols
[2023-03-22 09:24:32] [INFO ] Computed 29 place invariants in 4 ms
[2023-03-22 09:24:32] [INFO ] State equation strengthened by 122 read => feed constraints.
[2023-03-22 09:24:32] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 134 ms to find 0 implicit places.
Starting structural reductions in DEADLOCKS mode, iteration 2 : 96/104 places, 377/605 transitions.
Finished structural reductions, in 2 iterations. Remains : 96/104 places, 377/605 transitions.
Random walk for 1250000 steps, including 0 resets, run took 3540 ms (no deadlock found). (steps per millisecond=353 )
Random directed walk for 1250003 steps, including 0 resets, run took 3680 ms (no deadlock found). (steps per millisecond=339 )
[2023-03-22 09:24:39] [INFO ] Flow matrix only has 299 transitions (discarded 78 similar events)
// Phase 1: matrix 299 rows 96 cols
[2023-03-22 09:24:39] [INFO ] Computed 29 place invariants in 3 ms
[2023-03-22 09:24:40] [INFO ] [Real]Absence check using 27 positive place invariants in 14 ms returned sat
[2023-03-22 09:24:40] [INFO ] [Real]Absence check using 27 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-22 09:24:40] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-22 09:24:40] [INFO ] [Real]Absence check using state equation in 105 ms returned sat
[2023-03-22 09:24:40] [INFO ] Solution in real domain found non-integer solution.
[2023-03-22 09:24:40] [INFO ] [Nat]Absence check using 27 positive place invariants in 9 ms returned sat
[2023-03-22 09:24:40] [INFO ] [Nat]Absence check using 27 positive and 2 generalized place invariants in 2 ms returned sat
[2023-03-22 09:24:40] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-22 09:24:40] [INFO ] [Nat]Absence check using state equation in 153 ms returned sat
[2023-03-22 09:24:40] [INFO ] State equation strengthened by 122 read => feed constraints.
[2023-03-22 09:24:40] [INFO ] [Nat]Added 122 Read/Feed constraints in 42 ms returned sat
[2023-03-22 09:24:40] [INFO ] Deduced a trap composed of 9 places in 144 ms of which 5 ms to minimize.
[2023-03-22 09:24:40] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 1 ms to minimize.
[2023-03-22 09:24:41] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 1 ms to minimize.
[2023-03-22 09:24:41] [INFO ] Deduced a trap composed of 9 places in 85 ms of which 1 ms to minimize.
[2023-03-22 09:24:41] [INFO ] Deduced a trap composed of 12 places in 103 ms of which 2 ms to minimize.
[2023-03-22 09:24:41] [INFO ] Deduced a trap composed of 12 places in 97 ms of which 0 ms to minimize.
[2023-03-22 09:24:41] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 0 ms to minimize.
[2023-03-22 09:24:41] [INFO ] Deduced a trap composed of 13 places in 75 ms of which 1 ms to minimize.
[2023-03-22 09:24:41] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 1 ms to minimize.
[2023-03-22 09:24:41] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 0 ms to minimize.
[2023-03-22 09:24:42] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 1 ms to minimize.
[2023-03-22 09:24:42] [INFO ] Deduced a trap composed of 12 places in 75 ms of which 0 ms to minimize.
[2023-03-22 09:24:42] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2023-03-22 09:24:42] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 1 ms to minimize.
[2023-03-22 09:24:42] [INFO ] Deduced a trap composed of 12 places in 106 ms of which 1 ms to minimize.
[2023-03-22 09:24:42] [INFO ] Deduced a trap composed of 9 places in 62 ms of which 1 ms to minimize.
[2023-03-22 09:24:42] [INFO ] Deduced a trap composed of 12 places in 104 ms of which 0 ms to minimize.
[2023-03-22 09:24:42] [INFO ] Deduced a trap composed of 9 places in 90 ms of which 1 ms to minimize.
[2023-03-22 09:24:42] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 0 ms to minimize.
[2023-03-22 09:24:43] [INFO ] Deduced a trap composed of 14 places in 89 ms of which 0 ms to minimize.
[2023-03-22 09:24:43] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 1 ms to minimize.
[2023-03-22 09:24:43] [INFO ] Deduced a trap composed of 15 places in 89 ms of which 2 ms to minimize.
[2023-03-22 09:24:43] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 1 ms to minimize.
[2023-03-22 09:24:43] [INFO ] Deduced a trap composed of 10 places in 75 ms of which 1 ms to minimize.
[2023-03-22 09:24:43] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 24 trap constraints in 2949 ms
Starting structural reductions in LIVENESS mode, iteration 0 : 104/104 places, 605/605 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 102 transition count 603
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 34 place count 82 transition count 593
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 20 rules applied. Total rules applied 54 place count 72 transition count 583
Applied a total of 54 rules in 96 ms. Remains 72 /104 variables (removed 32) and now considering 583/605 (removed 22) transitions.
[2023-03-22 09:24:43] [INFO ] Flow matrix only has 453 transitions (discarded 130 similar events)
// Phase 1: matrix 453 rows 72 cols
[2023-03-22 09:24:43] [INFO ] Computed 19 place invariants in 9 ms
[2023-03-22 09:24:43] [INFO ] Implicit Places using invariants in 249 ms returned [12, 13]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 253 ms to find 2 implicit places.
Starting structural reductions in LIVENESS mode, iteration 1 : 70/104 places, 583/605 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 68 transition count 581
Applied a total of 4 rules in 11 ms. Remains 68 /70 variables (removed 2) and now considering 581/583 (removed 2) transitions.
[2023-03-22 09:24:43] [INFO ] Flow matrix only has 451 transitions (discarded 130 similar events)
// Phase 1: matrix 451 rows 68 cols
[2023-03-22 09:24:43] [INFO ] Computed 17 place invariants in 6 ms
[2023-03-22 09:24:44] [INFO ] Implicit Places using invariants in 990 ms returned []
[2023-03-22 09:24:44] [INFO ] Flow matrix only has 451 transitions (discarded 130 similar events)
// Phase 1: matrix 451 rows 68 cols
[2023-03-22 09:24:44] [INFO ] Computed 17 place invariants in 5 ms
[2023-03-22 09:24:45] [INFO ] State equation strengthened by 210 read => feed constraints.
[2023-03-22 09:24:45] [INFO ] Implicit Places using invariants and state equation in 746 ms returned []
Implicit Place search using SMT with State Equation took 1753 ms to find 0 implicit places.
Starting structural reductions in LIVENESS mode, iteration 2 : 68/104 places, 581/605 transitions.
Finished structural reductions, in 2 iterations. Remains : 68/104 places, 581/605 transitions.
Initial state reduction rules removed 10 formulas.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1372 ms. (steps per millisecond=7 ) properties (out of 571) seen :327
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 244) seen :1
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 243) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 243) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 243) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 243) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 243) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 243) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 243) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 243) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 243) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 243) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 243) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 243) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 243) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 243) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 243) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 243) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 243) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 243) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 243) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 243) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 243) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 243) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 243) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 243) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 243) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 243) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 243) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 243) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 243) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 243) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 243) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 243) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 243) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 243) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=12 ) properties (out of 243) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 243) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 243) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=6 ) properties (out of 243) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=25 ) properties (out of 243) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 243) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 243) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 243) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 243) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 243) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 243) seen :0
Incomplete Best-First random walk after 100 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 243) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 243) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 2 ms. (steps per millisecond=50 ) properties (out of 243) seen :0
Incomplete Best-First random walk after 101 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=33 ) properties (out of 243) seen :0
Running SMT prover for 243 properties.
[2023-03-22 09:24:47] [INFO ] Flow matrix only has 451 transitions (discarded 130 similar events)
// Phase 1: matrix 451 rows 68 cols
[2023-03-22 09:24:47] [INFO ] Computed 17 place invariants in 4 ms
[2023-03-22 09:24:48] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-03-22 09:24:48] [INFO ] [Real]Absence check using 13 positive and 4 generalized place invariants in 5 ms returned sat
[2023-03-22 09:24:49] [INFO ] After 1462ms SMT Verify possible using all constraints in real domain returned unsat :213 sat :0 real:30
[2023-03-22 09:24:50] [INFO ] [Nat]Absence check using 13 positive place invariants in 2 ms returned sat
[2023-03-22 09:24:50] [INFO ] [Nat]Absence check using 13 positive and 4 generalized place invariants in 10 ms returned sat
[2023-03-22 09:24:50] [INFO ] After 841ms SMT Verify possible using state equation in natural domain returned unsat :213 sat :30
[2023-03-22 09:24:50] [INFO ] State equation strengthened by 210 read => feed constraints.
[2023-03-22 09:24:51] [INFO ] After 1013ms SMT Verify possible using 210 Read/Feed constraints in natural domain returned unsat :213 sat :30
[2023-03-22 09:24:52] [INFO ] Deduced a trap composed of 13 places in 153 ms of which 0 ms to minimize.
[2023-03-22 09:24:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 190 ms
[2023-03-22 09:24:53] [INFO ] Deduced a trap composed of 13 places in 173 ms of which 1 ms to minimize.
[2023-03-22 09:24:53] [INFO ] Deduced a trap composed of 14 places in 104 ms of which 0 ms to minimize.
[2023-03-22 09:24:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 332 ms
[2023-03-22 09:24:53] [INFO ] Deduced a trap composed of 13 places in 123 ms of which 1 ms to minimize.
[2023-03-22 09:24:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 1 trap constraints in 133 ms
[2023-03-22 09:24:54] [INFO ] After 3203ms SMT Verify possible using trap constraints in natural domain returned unsat :221 sat :22
Attempting to minimize the solution found.
Minimization took 923 ms.
[2023-03-22 09:24:55] [INFO ] After 5126ms SMT Verify possible using all constraints in natural domain returned unsat :221 sat :22
FORMULA Liveness FALSE TECHNIQUES QUASILIVENESS_TEST
Total runtime 24334 ms.

BK_STOP 1679477095213

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ Liveness = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution Liveness -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination Liveness -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 1800 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="SimpleLoadBal-PT-10"
export BK_EXAMINATION="Liveness"
export BK_TOOL="gold2022"
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 gold2022"
echo " Input is SimpleLoadBal-PT-10, 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 r448-tajo-167905990000324"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SimpleLoadBal-PT-10.tgz
mv SimpleLoadBal-PT-10 execution
cd execution
if [ "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 '' 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 ;