Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2021-input.r235-smll-162106564800363.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2021-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-05, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r235-smll-162106564800363
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 27K May 5 16:58 CTLCardinality.txt
-rw-r--r-- 1 mcc users 152K May 10 09:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 22K May 5 16:58 CTLFireability.txt
-rw-r--r-- 1 mcc users 100K May 10 09:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 6 14:48 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 4.5K Apr 26 07:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 26 07:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.2K Apr 26 07:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 26 07:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 4.4K Mar 27 13:39 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 20K Mar 27 13:39 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 3.6K Mar 25 19:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 25 19:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 22 08:16 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Mar 22 08:16 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 5 16:52 equiv_col
-rw-r--r-- 1 mcc users 3 May 5 16:52 instance
-rw-r--r-- 1 mcc users 6 May 5 16:52 iscolored
-rw-r--r-- 1 mcc users 155K May 5 16:52 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-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 1621304295911

Running Version 0
[2021-05-18 02:18:18] [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]
[2021-05-18 02:18:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2021-05-18 02:18:18] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2021-05-18 02:18:19] [INFO ] Transformed 59 places.
[2021-05-18 02:18:19] [INFO ] Transformed 180 transitions.
[2021-05-18 02:18:19] [INFO ] Found NUPN structural information;
[2021-05-18 02:18: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]
[2021-05-18 02:18:19] [INFO ] Parsed PT model containing 59 places and 180 transitions in 168 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
FORMULA SimpleLoadBal-PT-05-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-05-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 140 out of 180 initially.
// Phase 1: matrix 140 rows 59 cols
[2021-05-18 02:18:19] [INFO ] Computed 19 place invariants in 16 ms
Incomplete random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 14) seen :12
FORMULA SimpleLoadBal-PT-05-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-05-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-05-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-05-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-05-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-05-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-05-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-05-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-05-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-05-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-05-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA SimpleLoadBal-PT-05-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
[2021-05-18 02:18:19] [INFO ] Flow matrix only has 140 transitions (discarded 40 similar events)
// Phase 1: matrix 140 rows 59 cols
[2021-05-18 02:18:19] [INFO ] Computed 19 place invariants in 17 ms
[2021-05-18 02:18:19] [INFO ] [Real]Absence check using 16 positive place invariants in 14 ms returned sat
[2021-05-18 02:18:19] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-18 02:18:19] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 02:18:19] [INFO ] [Real]Absence check using state equation in 99 ms returned sat
[2021-05-18 02:18:19] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 02:18:19] [INFO ] [Nat]Absence check using 16 positive place invariants in 9 ms returned sat
[2021-05-18 02:18:19] [INFO ] [Nat]Absence check using 16 positive and 3 generalized place invariants in 3 ms returned sat
[2021-05-18 02:18:19] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 02:18:19] [INFO ] [Nat]Absence check using state equation in 63 ms returned sat
[2021-05-18 02:18:19] [INFO ] State equation strengthened by 61 read => feed constraints.
[2021-05-18 02:18:19] [INFO ] [Nat]Added 61 Read/Feed constraints in 22 ms returned sat
[2021-05-18 02:18:19] [INFO ] Deduced a trap composed of 8 places in 93 ms of which 4 ms to minimize.
[2021-05-18 02:18:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2021-05-18 02:18:19] [INFO ] Computed and/alt/rep : 24/132/24 causal constraints (skipped 111 transitions) in 49 ms.
[2021-05-18 02:18:20] [INFO ] Added : 17 causal constraints over 4 iterations in 207 ms. Result :sat
Minimization took 44 ms.
[2021-05-18 02:18:20] [INFO ] [Real]Absence check using 16 positive place invariants in 8 ms returned sat
[2021-05-18 02:18:20] [INFO ] [Real]Absence check using 16 positive and 3 generalized place invariants in 2 ms returned sat
[2021-05-18 02:18:20] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 02:18:20] [INFO ] [Real]Absence check using state equation in 68 ms returned sat
[2021-05-18 02:18:20] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 02:18:20] [INFO ] [Nat]Absence check using 16 positive place invariants in 8 ms returned sat
[2021-05-18 02:18:20] [INFO ] [Nat]Absence check using 16 positive and 3 generalized place invariants in 3 ms returned sat
[2021-05-18 02:18:20] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 02:18:20] [INFO ] [Nat]Absence check using state equation in 62 ms returned sat
[2021-05-18 02:18:20] [INFO ] [Nat]Added 61 Read/Feed constraints in 24 ms returned sat
[2021-05-18 02:18:20] [INFO ] Deduced a trap composed of 9 places in 74 ms of which 1 ms to minimize.
[2021-05-18 02:18:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2021-05-18 02:18:20] [INFO ] Computed and/alt/rep : 24/132/24 causal constraints (skipped 111 transitions) in 36 ms.
[2021-05-18 02:18:20] [INFO ] Deduced a trap composed of 28 places in 60 ms of which 2 ms to minimize.
[2021-05-18 02:18:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 176 ms
[2021-05-18 02:18:20] [INFO ] Added : 16 causal constraints over 4 iterations in 360 ms. Result :sat
Minimization took 39 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Incomplete Parikh walk after 64500 steps, including 1000 resets, run finished after 179 ms. (steps per millisecond=360 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 67100 steps, including 998 resets, run finished after 148 ms. (steps per millisecond=453 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 59 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 59/59 places, 180/180 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 57 transition count 178
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 15 rules applied. Total rules applied 19 place count 47 transition count 173
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 0 with 10 rules applied. Total rules applied 29 place count 42 transition count 168
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 34 place count 42 transition count 163
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 39 place count 37 transition count 163
Applied a total of 39 rules in 61 ms. Remains 37 /59 variables (removed 22) and now considering 163/180 (removed 17) transitions.
Finished structural reductions, in 1 iterations. Remains : 37/59 places, 163/180 transitions.
Normalized transition count is 123 out of 163 initially.
// Phase 1: matrix 123 rows 37 cols
[2021-05-18 02:18:21] [INFO ] Computed 14 place invariants in 5 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 3348 ms. (steps per millisecond=298 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 931 ms. (steps per millisecond=1074 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 915 ms. (steps per millisecond=1092 ) properties (out of 2) seen :0
[2021-05-18 02:18:26] [INFO ] Flow matrix only has 123 transitions (discarded 40 similar events)
// Phase 1: matrix 123 rows 37 cols
[2021-05-18 02:18:26] [INFO ] Computed 14 place invariants in 3 ms
[2021-05-18 02:18:26] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-18 02:18:26] [INFO ] [Real]Absence check using 10 positive and 4 generalized place invariants in 3 ms returned sat
[2021-05-18 02:18:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 02:18:26] [INFO ] [Real]Absence check using state equation in 42 ms returned sat
[2021-05-18 02:18:26] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 02:18:26] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-18 02:18:26] [INFO ] [Nat]Absence check using 10 positive and 4 generalized place invariants in 3 ms returned sat
[2021-05-18 02:18:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 02:18:26] [INFO ] [Nat]Absence check using state equation in 43 ms returned sat
[2021-05-18 02:18:26] [INFO ] State equation strengthened by 61 read => feed constraints.
[2021-05-18 02:18:26] [INFO ] [Nat]Added 61 Read/Feed constraints in 23 ms returned sat
[2021-05-18 02:18:26] [INFO ] Deduced a trap composed of 8 places in 57 ms of which 3 ms to minimize.
[2021-05-18 02:18:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2021-05-18 02:18:26] [INFO ] Computed and/alt/rep : 10/90/10 causal constraints (skipped 108 transitions) in 34 ms.
[2021-05-18 02:18:26] [INFO ] Added : 6 causal constraints over 2 iterations in 89 ms. Result :sat
Minimization took 52 ms.
[2021-05-18 02:18:26] [INFO ] [Real]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-18 02:18:26] [INFO ] [Real]Absence check using 10 positive and 4 generalized place invariants in 4 ms returned sat
[2021-05-18 02:18:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2021-05-18 02:18:27] [INFO ] [Real]Absence check using state equation in 56 ms returned sat
[2021-05-18 02:18:27] [INFO ] Solution in real domain found non-integer solution.
[2021-05-18 02:18:27] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2021-05-18 02:18:27] [INFO ] [Nat]Absence check using 10 positive and 4 generalized place invariants in 3 ms returned sat
[2021-05-18 02:18:27] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2021-05-18 02:18:27] [INFO ] [Nat]Absence check using state equation in 49 ms returned sat
[2021-05-18 02:18:27] [INFO ] [Nat]Added 61 Read/Feed constraints in 19 ms returned sat
[2021-05-18 02:18:27] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 2 ms to minimize.
[2021-05-18 02:18:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2021-05-18 02:18:27] [INFO ] Computed and/alt/rep : 10/90/10 causal constraints (skipped 108 transitions) in 35 ms.
[2021-05-18 02:18:27] [INFO ] Added : 10 causal constraints over 2 iterations in 92 ms. Result :sat
Minimization took 57 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
Incomplete Parikh walk after 46600 steps, including 808 resets, run finished after 265 ms. (steps per millisecond=175 ) properties (out of 2) seen :0 could not realise parikh vector
Incomplete Parikh walk after 40100 steps, including 822 resets, run finished after 223 ms. (steps per millisecond=179 ) properties (out of 2) seen :0 could not realise parikh vector
Support contains 2 out of 37 places. Attempting structural reductions.
Starting structural reductions, iteration 0 : 37/37 places, 163/163 transitions.
Applied a total of 0 rules in 27 ms. Remains 37 /37 variables (removed 0) and now considering 163/163 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 37/37 places, 163/163 transitions.
Starting structural reductions, iteration 0 : 37/37 places, 163/163 transitions.
Applied a total of 0 rules in 17 ms. Remains 37 /37 variables (removed 0) and now considering 163/163 (removed 0) transitions.
[2021-05-18 02:18:27] [INFO ] Flow matrix only has 123 transitions (discarded 40 similar events)
// Phase 1: matrix 123 rows 37 cols
[2021-05-18 02:18:27] [INFO ] Computed 14 place invariants in 3 ms
[2021-05-18 02:18:28] [INFO ] Implicit Places using invariants in 122 ms returned [7, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 126 ms to find 2 implicit places.
[2021-05-18 02:18:28] [INFO ] Redundant transitions in 10 ms returned []
[2021-05-18 02:18:28] [INFO ] Flow matrix only has 123 transitions (discarded 40 similar events)
// Phase 1: matrix 123 rows 35 cols
[2021-05-18 02:18:28] [INFO ] Computed 12 place invariants in 4 ms
[2021-05-18 02:18:28] [INFO ] Dead Transitions using invariants and state equation in 192 ms returned [24, 25, 26, 27, 43, 44, 45, 46, 47, 63, 64, 65, 66, 67, 95, 96, 97, 101, 102, 110, 111, 112, 116, 117, 125, 126, 127, 131, 132, 140, 141, 142, 146, 147, 155, 156, 157, 161, 162]
Found 39 dead transitions using SMT.
Drop transitions removed 39 transitions
Dead transitions reduction (with SMT) removed 39 transitions :[162, 161, 157, 156, 155, 147, 146, 142, 141, 140, 132, 131, 127, 126, 125, 117, 116, 112, 111, 110, 102, 101, 97, 96, 95, 67, 66, 65, 64, 63, 47, 46, 45, 44, 43, 27, 26, 25, 24]
Starting structural reductions, iteration 1 : 35/37 places, 124/163 transitions.
Reduce places removed 1 places and 4 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 34 transition count 120
Reduce places removed 0 places and 8 transitions.
Graph (complete) has 332 edges and 34 vertex of which 2 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.5 ms
Discarding 32 places :
Also discarding 112 output transitions
Drop transitions removed 112 transitions
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 2 transition count 0
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 12 ms. Remains 2 /35 variables (removed 33) and now considering 0/124 (removed 124) transitions.
[2021-05-18 02:18:28] [INFO ] Computed 0 place invariants in 1 ms
[2021-05-18 02:18:28] [INFO ] Implicit Places using invariants in 12 ms returned []
[2021-05-18 02:18:28] [INFO ] Computed 0 place invariants in 0 ms
[2021-05-18 02:18:28] [INFO ] Implicit Places using invariants and state equation in 13 ms returned []
Implicit Place search using SMT with State Equation took 27 ms to find 0 implicit places.
Finished structural reductions, in 2 iterations. Remains : 2/37 places, 0/163 transitions.
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
FORMULA SimpleLoadBal-PT-05-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SimpleLoadBal-PT-05-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
All properties solved without resorting to model-checking.

BK_STOP 1621304309436

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

+ 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
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ cut -d . -f 9
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202104292328.jar
+ VERSION=0
+ echo 'Running Version 0'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data /home/mcc/execution/workspace -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=/tmp/.eclipse -Xss128m -Xms40m -Xmx16000m

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="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-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 r235-smll-162106564800363"
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.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 ;