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.r447-tajo-167905989400048.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 SieveSingleMsgMbox-PT-d0m36, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r447-tajo-167905989400048
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 564K
-rw-r--r-- 1 mcc users 7.3K Feb 26 10:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Feb 26 10:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Feb 26 10:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Feb 26 10:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 17:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:05 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:05 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:05 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Feb 26 10:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 188K Feb 26 10:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Feb 26 10:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Feb 26 10:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Feb 25 17:05 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 17:05 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 57K 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 positive values
NUM_VECTOR

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

=== Now, execution of the tool begins

BK_START 1679573601310

Running Version 202205111006
[2023-03-23 12:13:22] [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]
[2023-03-23 12:13:22] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-23 12:13:22] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2023-03-23 12:13:22] [INFO ] Transformed 262 places.
[2023-03-23 12:13:22] [INFO ] Transformed 73 transitions.
[2023-03-23 12:13:22] [INFO ] Parsed PT model containing 262 places and 73 transitions in 185 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 190 places in 0 ms
Reduce places removed 190 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-00 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-01 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-02 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-03 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-07 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-08 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-10 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-12 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-13 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-15 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
// Phase 1: matrix 73 rows 72 cols
[2023-03-23 12:13:22] [INFO ] Computed 6 place invariants in 15 ms
Incomplete random walk after 10000 steps, including 2247 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :1
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10000 steps, including 1021 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 1008 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
// Phase 1: matrix 73 rows 72 cols
[2023-03-23 12:13:23] [INFO ] Computed 6 place invariants in 10 ms
[2023-03-23 12:13:23] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2023-03-23 12:13:23] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-23 12:13:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:23] [INFO ] [Real]Absence check using state equation in 45 ms returned sat
[2023-03-23 12:13:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:13:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2023-03-23 12:13:23] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:23] [INFO ] [Nat]Absence check using state equation in 31 ms returned sat
[2023-03-23 12:13:23] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-23 12:13:23] [INFO ] [Nat]Added 31 Read/Feed constraints in 8 ms returned sat
[2023-03-23 12:13:23] [INFO ] Deduced a trap composed of 38 places in 38 ms of which 2 ms to minimize.
[2023-03-23 12:13:23] [INFO ] Deduced a trap composed of 28 places in 34 ms of which 2 ms to minimize.
[2023-03-23 12:13:23] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 100 ms
[2023-03-23 12:13:23] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 8 ms.
[2023-03-23 12:13:23] [INFO ] Added : 8 causal constraints over 2 iterations in 30 ms. Result :sat
Minimization took 11 ms.
[2023-03-23 12:13:23] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 12:13:23] [INFO ] [Real]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:23] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:23] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2023-03-23 12:13:23] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:13:23] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-23 12:13:23] [INFO ] [Nat]Absence check using 3 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:23] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:23] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-23 12:13:23] [INFO ] [Nat]Added 31 Read/Feed constraints in 3 ms returned sat
[2023-03-23 12:13:23] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 1 ms to minimize.
[2023-03-23 12:13:23] [INFO ] Deduced a trap composed of 20 places in 46 ms of which 2 ms to minimize.
[2023-03-23 12:13:23] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2023-03-23 12:13:23] [INFO ] Deduced a trap composed of 40 places in 32 ms of which 0 ms to minimize.
[2023-03-23 12:13:23] [INFO ] Deduced a trap composed of 21 places in 36 ms of which 0 ms to minimize.
[2023-03-23 12:13:23] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 248 ms
[2023-03-23 12:13:23] [INFO ] Computed and/alt/rep : 22/34/22 causal constraints (skipped 50 transitions) in 8 ms.
[2023-03-23 12:13:23] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2023-03-23 12:13:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2023-03-23 12:13:23] [INFO ] Added : 16 causal constraints over 4 iterations in 92 ms. Result :sat
Minimization took 12 ms.
Current structural bounds on expressions (after SMT) : [1, 1] Max seen :[0, 0]
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL PARIKH_WALK
Support contains 1 out of 72 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 72/72 places, 73/73 transitions.
Graph (complete) has 192 edges and 72 vertex of which 70 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 10 place count 61 transition count 64
Iterating global reduction 0 with 9 rules applied. Total rules applied 19 place count 61 transition count 64
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 20 place count 60 transition count 63
Iterating global reduction 0 with 1 rules applied. Total rules applied 21 place count 60 transition count 63
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 22 place count 59 transition count 62
Iterating global reduction 0 with 1 rules applied. Total rules applied 23 place count 59 transition count 62
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 24 place count 59 transition count 61
Applied a total of 24 rules in 48 ms. Remains 59 /72 variables (removed 13) and now considering 61/73 (removed 12) transitions.
Finished structural reductions, in 1 iterations. Remains : 59/72 places, 61/73 transitions.
// Phase 1: matrix 61 rows 59 cols
[2023-03-23 12:13:24] [INFO ] Computed 5 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 223962 resets, run finished after 725 ms. (steps per millisecond=1379 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 102946 resets, run finished after 360 ms. (steps per millisecond=2777 ) properties (out of 1) seen :0
// Phase 1: matrix 61 rows 59 cols
[2023-03-23 12:13:25] [INFO ] Computed 5 place invariants in 2 ms
[2023-03-23 12:13:25] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 12:13:25] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-23 12:13:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:25] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-23 12:13:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:13:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 12:13:25] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-23 12:13:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:25] [INFO ] [Nat]Absence check using state equation in 20 ms returned sat
[2023-03-23 12:13:25] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-23 12:13:25] [INFO ] [Nat]Added 25 Read/Feed constraints in 5 ms returned sat
[2023-03-23 12:13:25] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2023-03-23 12:13:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-23 12:13:25] [INFO ] Computed and/alt/rep : 17/32/17 causal constraints (skipped 43 transitions) in 5 ms.
[2023-03-23 12:13:25] [INFO ] Added : 7 causal constraints over 2 iterations in 23 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 3 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 59/59 places, 61/61 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 4 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
// Phase 1: matrix 61 rows 59 cols
[2023-03-23 12:13:25] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-23 12:13:25] [INFO ] Implicit Places using invariants in 46 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2023-03-23 12:13:25] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-23 12:13:25] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-23 12:13:25] [INFO ] Implicit Places using invariants and state equation in 89 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2023-03-23 12:13:25] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2023-03-23 12:13:25] [INFO ] Computed 5 place invariants in 3 ms
[2023-03-23 12:13:25] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/59 places, 61/61 transitions.
Starting property specific reduction for SieveSingleMsgMbox-PT-d0m36-UpperBounds-09
// Phase 1: matrix 61 rows 59 cols
[2023-03-23 12:13:25] [INFO ] Computed 5 place invariants in 3 ms
Incomplete random walk after 10000 steps, including 2294 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1010 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 1) seen :0
// Phase 1: matrix 61 rows 59 cols
[2023-03-23 12:13:25] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-23 12:13:25] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-23 12:13:25] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:25] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:25] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2023-03-23 12:13:25] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:13:25] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-23 12:13:25] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-23 12:13:25] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:25] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2023-03-23 12:13:25] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-23 12:13:25] [INFO ] [Nat]Added 25 Read/Feed constraints in 12 ms returned sat
[2023-03-23 12:13:25] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2023-03-23 12:13:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2023-03-23 12:13:25] [INFO ] Computed and/alt/rep : 17/32/17 causal constraints (skipped 43 transitions) in 4 ms.
[2023-03-23 12:13:25] [INFO ] Added : 7 causal constraints over 2 iterations in 19 ms. Result :sat
Minimization took 9 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 5 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 59/59 places, 61/61 transitions.
// Phase 1: matrix 61 rows 59 cols
[2023-03-23 12:13:25] [INFO ] Computed 5 place invariants in 2 ms
Incomplete random walk after 1000000 steps, including 223336 resets, run finished after 559 ms. (steps per millisecond=1788 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 102960 resets, run finished after 293 ms. (steps per millisecond=3412 ) properties (out of 1) seen :0
// Phase 1: matrix 61 rows 59 cols
[2023-03-23 12:13:26] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-23 12:13:26] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2023-03-23 12:13:26] [INFO ] [Real]Absence check using 2 positive and 3 generalized place invariants in 2 ms returned sat
[2023-03-23 12:13:26] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:26] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2023-03-23 12:13:26] [INFO ] Solution in real domain found non-integer solution.
[2023-03-23 12:13:26] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2023-03-23 12:13:26] [INFO ] [Nat]Absence check using 2 positive and 3 generalized place invariants in 1 ms returned sat
[2023-03-23 12:13:26] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-23 12:13:26] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2023-03-23 12:13:26] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-23 12:13:26] [INFO ] [Nat]Added 25 Read/Feed constraints in 6 ms returned sat
[2023-03-23 12:13:26] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 0 ms to minimize.
[2023-03-23 12:13:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2023-03-23 12:13:26] [INFO ] Computed and/alt/rep : 17/32/17 causal constraints (skipped 43 transitions) in 5 ms.
[2023-03-23 12:13:26] [INFO ] Added : 7 causal constraints over 2 iterations in 24 ms. Result :sat
Minimization took 11 ms.
Current structural bounds on expressions (after SMT) : [-1] Max seen :[0]
Support contains 1 out of 59 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 3 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
Finished structural reductions, in 1 iterations. Remains : 59/59 places, 61/61 transitions.
Starting structural reductions in SAFETY mode, iteration 0 : 59/59 places, 61/61 transitions.
Applied a total of 0 rules in 4 ms. Remains 59 /59 variables (removed 0) and now considering 61/61 (removed 0) transitions.
// Phase 1: matrix 61 rows 59 cols
[2023-03-23 12:13:26] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-23 12:13:26] [INFO ] Implicit Places using invariants in 50 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2023-03-23 12:13:26] [INFO ] Computed 5 place invariants in 0 ms
[2023-03-23 12:13:26] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-23 12:13:26] [INFO ] Implicit Places using invariants and state equation in 88 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
[2023-03-23 12:13:26] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 61 rows 59 cols
[2023-03-23 12:13:26] [INFO ] Computed 5 place invariants in 1 ms
[2023-03-23 12:13:27] [INFO ] Dead Transitions using invariants and state equation in 67 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 59/59 places, 61/61 transitions.
Ending property specific reduction for SieveSingleMsgMbox-PT-d0m36-UpperBounds-09 in 1525 ms.
[2023-03-23 12:13:27] [INFO ] Flatten gal took : 30 ms
[2023-03-23 12:13:27] [INFO ] Applying decomposition
[2023-03-23 12:13:27] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph1094941205009750888.txt' '-o' '/tmp/graph1094941205009750888.bin' '-w' '/tmp/graph1094941205009750888.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph1094941205009750888.bin' '-l' '-1' '-v' '-w' '/tmp/graph1094941205009750888.weights' '-q' '0' '-e' '0.001'
[2023-03-23 12:13:27] [INFO ] Decomposing Gal with order
[2023-03-23 12:13:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-23 12:13:27] [INFO ] Removed a total of 57 redundant transitions.
[2023-03-23 12:13:27] [INFO ] Flatten gal took : 40 ms
[2023-03-23 12:13:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 38 labels/synchronizations in 6 ms.
[2023-03-23 12:13:27] [INFO ] Time to serialize gal into /tmp/UpperBounds16026282832876346715.gal : 4 ms
[2023-03-23 12:13:27] [INFO ] Time to serialize properties into /tmp/UpperBounds1629398195901908990.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds16026282832876346715.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds1629398195901908990.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-reach-linux64 --gc-threshold 2000000 --quiet -i /tmp...275
Loading property file /tmp/UpperBounds1629398195901908990.prop.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,3.50158e+09,18.1596,343992,3552,836,160182,37468,209,3.02745e+06,54,1.42074e+06,0
Total reachable state count : 3501583837

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property SieveSingleMsgMbox-PT-d0m36-UpperBounds-09 :0 <= i5.u8.l128 <= 1
FORMULA SieveSingleMsgMbox-PT-d0m36-UpperBounds-09 1 TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
SieveSingleMsgMbox-PT-d0m36-UpperBounds-09,0,19.7354,343992,1,0,160182,37468,288,3.02745e+06,67,1.42074e+06,1412
Total runtime 24611 ms.

BK_STOP 1679573627348

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="SieveSingleMsgMbox-PT-d0m36"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2022"
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-5348"
echo " Executing tool gold2022"
echo " Input is SieveSingleMsgMbox-PT-d0m36, 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 r447-tajo-167905989400048"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/SieveSingleMsgMbox-PT-d0m36.tgz
mv SieveSingleMsgMbox-PT-d0m36 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 ;