Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r240-smll-165303241300029.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is SimpleLoadBal-PT-15, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r240-smll-165303241300029
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 11K Apr 29 14:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Apr 29 14:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 29 14:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 29 14:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:34 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.3K May 9 09:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 9 09:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K May 9 09:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 09:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.9K May 9 09:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 09:03 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 3 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 1.2M May 10 09:34 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

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

=== Now, execution of the tool begins

BK_START 1653037933552

Running Version 202205111006
[2022-05-20 09:12:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -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, 3600]
[2022-05-20 09:12:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-20 09:12:16] [INFO ] Load time of PNML (sax parser for PT used): 412 ms
[2022-05-20 09:12:16] [INFO ] Transformed 149 places.
[2022-05-20 09:12:16] [INFO ] Transformed 1280 transitions.
[2022-05-20 09:12:16] [INFO ] Found NUPN structural information;
[2022-05-20 09:12:16] [INFO ] Completing missing partition info from NUPN : creating a component with [P_client_idle_1, P_client_idle_2, P_client_idle_3, P_client_idle_4, P_client_idle_5, P_client_idle_6, P_client_idle_7, P_client_idle_8, P_client_idle_9, P_client_idle_10, P_client_idle_11, P_client_idle_12, P_client_idle_13, P_client_idle_14, P_client_idle_15, P_client_waiting_1, P_client_waiting_2, P_client_waiting_3, P_client_waiting_4, P_client_waiting_5, P_client_waiting_6, P_client_waiting_7, P_client_waiting_8, P_client_waiting_9, P_client_waiting_10, P_client_waiting_11, P_client_waiting_12, P_client_waiting_13, P_client_waiting_14, P_client_waiting_15, P_client_request_1, P_client_request_2, P_client_request_3, P_client_request_4, P_client_request_5, P_client_request_6, P_client_request_7, P_client_request_8, P_client_request_9, P_client_request_10, P_client_request_11, P_client_request_12, P_client_request_13, P_client_request_14, P_client_request_15, P_client_ack_1, P_client_ack_2, P_client_ack_3, P_client_ack_4, P_client_ack_5, P_client_ack_6, P_client_ack_7, P_client_ack_8, P_client_ack_9, P_client_ack_10, P_client_ack_11, P_client_ack_12, P_client_ack_13, P_client_ack_14, P_client_ack_15, P_server_idle_1, P_server_idle_2, P_server_waiting_1, P_server_waiting_2, P_server_processed_1, P_server_processed_2, P_server_notification_1, P_server_notification_2, P_server_notification_ack_1, P_server_notification_ack_2, P_server_request_1_1, P_server_request_1_2, P_server_request_2_1, P_server_request_2_2, P_server_request_3_1, P_server_request_3_2, P_server_request_4_1, P_server_request_4_2, P_server_request_5_1, P_server_request_5_2, P_server_request_6_1, P_server_request_6_2, P_server_request_7_1, P_server_request_7_2, P_server_request_8_1, P_server_request_8_2, P_server_request_9_1, P_server_request_9_2, P_server_request_10_1, P_server_request_10_2, P_server_request_11_1, P_server_request_11_2, P_server_request_12_1, P_server_request_12_2, P_server_request_13_1, P_server_request_13_2, P_server_request_14_1, P_server_request_14_2, P_server_request_15_1, P_server_request_15_2, P_lb_idle_1, P_lb_routing_1_1, P_lb_routing_1_2, P_lb_routing_1_3, P_lb_routing_1_4, P_lb_routing_1_5, P_lb_routing_1_6, P_lb_routing_1_7, P_lb_routing_1_8, P_lb_routing_1_9, P_lb_routing_1_10, P_lb_routing_1_11, P_lb_routing_1_12, P_lb_routing_1_13, P_lb_routing_1_14, P_lb_routing_1_15, P_lb_balancing_1, P_lb_load_1_0, P_lb_load_1_1, P_lb_load_1_2, P_lb_load_1_3, P_lb_load_1_4, P_lb_load_1_5, P_lb_load_1_6, P_lb_load_1_7, P_lb_load_1_8, P_lb_load_1_9, P_lb_load_1_10, P_lb_load_1_11, P_lb_load_1_12, P_lb_load_1_13, P_lb_load_1_14, P_lb_load_1_15, P_lb_load_2_0, P_lb_load_2_1, P_lb_load_2_2, P_lb_load_2_3, P_lb_load_2_4, P_lb_load_2_5, P_lb_load_2_6, P_lb_load_2_7, P_lb_load_2_8, P_lb_load_2_9, P_lb_load_2_10, P_lb_load_2_11, P_lb_load_2_12, P_lb_load_2_13, P_lb_load_2_14, P_lb_load_2_15]
[2022-05-20 09:12:16] [INFO ] Parsed PT model containing 149 places and 1280 transitions in 820 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 14 ms.
FORMULA SimpleLoadBal-PT-15-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-15-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 1010 out of 1280 initially.
// Phase 1: matrix 1010 rows 149 cols
[2022-05-20 09:12:17] [INFO ] Computed 39 place invariants in 74 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 253 ms. (steps per millisecond=39 ) properties (out of 14) seen :13
FORMULA SimpleLoadBal-PT-15-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-15-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-15-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-15-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-15-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-15-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-15-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-15-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-15-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-15-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-15-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-15-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-15-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 1) seen :0
[2022-05-20 09:12:17] [INFO ] Flow matrix only has 1010 transitions (discarded 270 similar events)
// Phase 1: matrix 1010 rows 149 cols
[2022-05-20 09:12:17] [INFO ] Computed 39 place invariants in 34 ms
[2022-05-20 09:12:17] [INFO ] [Real]Absence check using 35 positive place invariants in 35 ms returned sat
[2022-05-20 09:12:17] [INFO ] [Real]Absence check using 35 positive and 4 generalized place invariants in 9 ms returned sat
[2022-05-20 09:12:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 09:12:18] [INFO ] [Real]Absence check using state equation in 488 ms returned sat
[2022-05-20 09:12:18] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 09:12:18] [INFO ] [Nat]Absence check using 35 positive place invariants in 11 ms returned sat
[2022-05-20 09:12:18] [INFO ] [Nat]Absence check using 35 positive and 4 generalized place invariants in 9 ms returned sat
[2022-05-20 09:12:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 09:12:18] [INFO ] [Nat]Absence check using state equation in 288 ms returned sat
[2022-05-20 09:12:19] [INFO ] State equation strengthened by 465 read => feed constraints.
[2022-05-20 09:12:19] [INFO ] [Nat]Added 465 Read/Feed constraints in 234 ms returned sat
[2022-05-20 09:12:19] [INFO ] Deduced a trap composed of 23 places in 464 ms of which 8 ms to minimize.
[2022-05-20 09:12:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 609 ms
[2022-05-20 09:12:20] [INFO ] Computed and/alt/rep : 30/60/30 causal constraints (skipped 965 transitions) in 284 ms.
[2022-05-20 09:12:20] [INFO ] Added : 16 causal constraints over 4 iterations in 708 ms. Result :sat
Minimization took 604 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 149 places. Attempting structural reductions.
Drop transitions removed 34 transitions
Starting structural reductions in SAFETY mode, iteration 0 : 149/149 places, 1246/1246 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 147 transition count 1244
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 4 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 0 with 45 rules applied. Total rules applied 49 place count 117 transition count 1229
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 3 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 0 with 30 rules applied. Total rules applied 79 place count 102 transition count 1214
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 0 with 15 rules applied. Total rules applied 94 place count 102 transition count 1199
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 109 place count 87 transition count 1199
Applied a total of 109 rules in 362 ms. Remains 87 /149 variables (removed 62) and now considering 1199/1246 (removed 47) transitions.
Finished structural reductions, in 1 iterations. Remains : 87/149 places, 1199/1246 transitions.
Normalized transition count is 946 out of 1199 initially.
// Phase 1: matrix 946 rows 87 cols
[2022-05-20 09:12:22] [INFO ] Computed 24 place invariants in 18 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 12308 ms. (steps per millisecond=81 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2077 ms. (steps per millisecond=481 ) properties (out of 1) seen :0
[2022-05-20 09:12:36] [INFO ] Flow matrix only has 946 transitions (discarded 253 similar events)
// Phase 1: matrix 946 rows 87 cols
[2022-05-20 09:12:36] [INFO ] Computed 24 place invariants in 12 ms
[2022-05-20 09:12:36] [INFO ] [Real]Absence check using 20 positive place invariants in 7 ms returned sat
[2022-05-20 09:12:36] [INFO ] [Real]Absence check using 20 positive and 4 generalized place invariants in 5 ms returned sat
[2022-05-20 09:12:36] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 09:12:37] [INFO ] [Real]Absence check using state equation in 306 ms returned sat
[2022-05-20 09:12:37] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 09:12:37] [INFO ] [Nat]Absence check using 20 positive place invariants in 14 ms returned sat
[2022-05-20 09:12:37] [INFO ] [Nat]Absence check using 20 positive and 4 generalized place invariants in 6 ms returned sat
[2022-05-20 09:12:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 09:12:37] [INFO ] [Nat]Absence check using state equation in 283 ms returned sat
[2022-05-20 09:12:37] [INFO ] State equation strengthened by 464 read => feed constraints.
[2022-05-20 09:12:37] [INFO ] [Nat]Added 464 Read/Feed constraints in 262 ms returned sat
[2022-05-20 09:12:38] [INFO ] Deduced a trap composed of 19 places in 426 ms of which 3 ms to minimize.
[2022-05-20 09:12:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 534 ms
[2022-05-20 09:12:38] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 931 transitions) in 405 ms.
[2022-05-20 09:12:38] [INFO ] Added : 0 causal constraints over 0 iterations in 532 ms. Result :sat
Minimization took 402 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 87 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 87/87 places, 1199/1199 transitions.
Applied a total of 0 rules in 86 ms. Remains 87 /87 variables (removed 0) and now considering 1199/1199 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 87/87 places, 1199/1199 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 87/87 places, 1199/1199 transitions.
Applied a total of 0 rules in 86 ms. Remains 87 /87 variables (removed 0) and now considering 1199/1199 (removed 0) transitions.
[2022-05-20 09:12:40] [INFO ] Flow matrix only has 946 transitions (discarded 253 similar events)
// Phase 1: matrix 946 rows 87 cols
[2022-05-20 09:12:40] [INFO ] Computed 24 place invariants in 16 ms
[2022-05-20 09:12:40] [INFO ] Implicit Places using invariants in 687 ms returned [17, 18]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 697 ms to find 2 implicit places.
Starting structural reductions in SAFETY mode, iteration 1 : 85/87 places, 1199/1199 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 83 transition count 1197
Applied a total of 4 rules in 164 ms. Remains 83 /85 variables (removed 2) and now considering 1197/1199 (removed 2) transitions.
[2022-05-20 09:12:40] [INFO ] Flow matrix only has 944 transitions (discarded 253 similar events)
// Phase 1: matrix 944 rows 83 cols
[2022-05-20 09:12:40] [INFO ] Computed 22 place invariants in 11 ms
[2022-05-20 09:12:41] [INFO ] Implicit Places using invariants in 474 ms returned []
[2022-05-20 09:12:41] [INFO ] Flow matrix only has 944 transitions (discarded 253 similar events)
// Phase 1: matrix 944 rows 83 cols
[2022-05-20 09:12:41] [INFO ] Computed 22 place invariants in 10 ms
[2022-05-20 09:12:41] [INFO ] State equation strengthened by 464 read => feed constraints.
[2022-05-20 09:12:42] [INFO ] Implicit Places using invariants and state equation in 1524 ms returned []
Implicit Place search using SMT with State Equation took 2007 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 83/87 places, 1197/1199 transitions.
Finished structural reductions, in 2 iterations. Remains : 83/87 places, 1197/1199 transitions.
Normalized transition count is 944 out of 1197 initially.
// Phase 1: matrix 944 rows 83 cols
[2022-05-20 09:12:42] [INFO ] Computed 22 place invariants in 9 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 13649 ms. (steps per millisecond=73 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 2168 ms. (steps per millisecond=461 ) properties (out of 1) seen :0
[2022-05-20 09:12:58] [INFO ] Flow matrix only has 944 transitions (discarded 253 similar events)
// Phase 1: matrix 944 rows 83 cols
[2022-05-20 09:12:58] [INFO ] Computed 22 place invariants in 8 ms
[2022-05-20 09:12:58] [INFO ] [Real]Absence check using 18 positive place invariants in 13 ms returned sat
[2022-05-20 09:12:58] [INFO ] [Real]Absence check using 18 positive and 4 generalized place invariants in 4 ms returned sat
[2022-05-20 09:12:58] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2022-05-20 09:12:59] [INFO ] [Real]Absence check using state equation in 319 ms returned sat
[2022-05-20 09:12:59] [INFO ] Solution in real domain found non-integer solution.
[2022-05-20 09:12:59] [INFO ] [Nat]Absence check using 18 positive place invariants in 14 ms returned sat
[2022-05-20 09:12:59] [INFO ] [Nat]Absence check using 18 positive and 4 generalized place invariants in 7 ms returned sat
[2022-05-20 09:12:59] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2022-05-20 09:12:59] [INFO ] [Nat]Absence check using state equation in 305 ms returned sat
[2022-05-20 09:12:59] [INFO ] State equation strengthened by 464 read => feed constraints.
[2022-05-20 09:12:59] [INFO ] [Nat]Added 464 Read/Feed constraints in 201 ms returned sat
[2022-05-20 09:13:00] [INFO ] Deduced a trap composed of 19 places in 433 ms of which 2 ms to minimize.
[2022-05-20 09:13:00] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 505 ms
[2022-05-20 09:13:00] [INFO ] Computed and/alt/rep : 0/0/0 causal constraints (skipped 929 transitions) in 163 ms.
[2022-05-20 09:13:00] [INFO ] Added : 0 causal constraints over 0 iterations in 252 ms. Result :sat
Minimization took 257 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 83 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 83/83 places, 1197/1197 transitions.
Applied a total of 0 rules in 81 ms. Remains 83 /83 variables (removed 0) and now considering 1197/1197 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 83/83 places, 1197/1197 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 83/83 places, 1197/1197 transitions.
Applied a total of 0 rules in 81 ms. Remains 83 /83 variables (removed 0) and now considering 1197/1197 (removed 0) transitions.
[2022-05-20 09:13:01] [INFO ] Flow matrix only has 944 transitions (discarded 253 similar events)
// Phase 1: matrix 944 rows 83 cols
[2022-05-20 09:13:01] [INFO ] Computed 22 place invariants in 13 ms
[2022-05-20 09:13:02] [INFO ] Implicit Places using invariants in 575 ms returned []
[2022-05-20 09:13:02] [INFO ] Flow matrix only has 944 transitions (discarded 253 similar events)
// Phase 1: matrix 944 rows 83 cols
[2022-05-20 09:13:02] [INFO ] Computed 22 place invariants in 12 ms
[2022-05-20 09:13:02] [INFO ] State equation strengthened by 464 read => feed constraints.
[2022-05-20 09:13:04] [INFO ] Implicit Places using invariants and state equation in 2096 ms returned []
Implicit Place search using SMT with State Equation took 2674 ms to find 0 implicit places.
[2022-05-20 09:13:04] [INFO ] Redundant transitions in 106 ms returned []
[2022-05-20 09:13:04] [INFO ] Flow matrix only has 944 transitions (discarded 253 similar events)
// Phase 1: matrix 944 rows 83 cols
[2022-05-20 09:13:04] [INFO ] Computed 22 place invariants in 9 ms
[2022-05-20 09:13:05] [INFO ] Dead Transitions using invariants and state equation in 1342 ms found 467 transitions.
Found 467 dead transitions using SMT.
Drop transitions removed 467 transitions
Dead transitions reduction (with SMT) removed 467 transitions
Starting structural reductions in SAFETY mode, iteration 1 : 83/83 places, 730/1197 transitions.
Graph (complete) has 1787 edges and 83 vertex of which 1 are kept as prefixes of interest. Removing 82 places using SCC suffix rule.8 ms
Discarding 82 places :
Also discarding 730 output transitions
Drop transitions removed 730 transitions
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 11 ms. Remains 1 /83 variables (removed 82) and now considering 0/730 (removed 730) transitions.
[2022-05-20 09:13:05] [INFO ] Computed 0 place invariants in 0 ms
[2022-05-20 09:13:05] [INFO ] Implicit Places using invariants in 16 ms returned []
[2022-05-20 09:13:05] [INFO ] Computed 0 place invariants in 1 ms
[2022-05-20 09:13:05] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
Starting structural reductions in SAFETY mode, iteration 2 : 1/83 places, 0/1197 transitions.
Finished structural reductions, in 2 iterations. Remains : 1/83 places, 0/1197 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
FORMULA SimpleLoadBal-PT-15-UpperBounds-14 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.
Total runtime 49811 ms.

BK_STOP 1653037985953

--------------------
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
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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 UpperBounds -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 3600 -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-15"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is SimpleLoadBal-PT-15, 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 r240-smll-165303241300029"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SimpleLoadBal-PT-15.tgz
mv SimpleLoadBal-PT-15 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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;