Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r417-tall-171690556600506.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
........................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is Szymanski-PT-a02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690556600506
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 15:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Apr 11 15:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 11 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 101K May 18 16:43 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 Szymanski-PT-a02-UpperBounds-00
FORMULA_NAME Szymanski-PT-a02-UpperBounds-01
FORMULA_NAME Szymanski-PT-a02-UpperBounds-02
FORMULA_NAME Szymanski-PT-a02-UpperBounds-03
FORMULA_NAME Szymanski-PT-a02-UpperBounds-04
FORMULA_NAME Szymanski-PT-a02-UpperBounds-05
FORMULA_NAME Szymanski-PT-a02-UpperBounds-06
FORMULA_NAME Szymanski-PT-a02-UpperBounds-07
FORMULA_NAME Szymanski-PT-a02-UpperBounds-08
FORMULA_NAME Szymanski-PT-a02-UpperBounds-09
FORMULA_NAME Szymanski-PT-a02-UpperBounds-10
FORMULA_NAME Szymanski-PT-a02-UpperBounds-11
FORMULA_NAME Szymanski-PT-a02-UpperBounds-12
FORMULA_NAME Szymanski-PT-a02-UpperBounds-13
FORMULA_NAME Szymanski-PT-a02-UpperBounds-14
FORMULA_NAME Szymanski-PT-a02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717166225175

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-a02
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-31 14:37:06] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, UpperBounds, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-31 14:37:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 14:37:06] [INFO ] Load time of PNML (sax parser for PT used): 55 ms
[2024-05-31 14:37:06] [INFO ] Transformed 61 places.
[2024-05-31 14:37:06] [INFO ] Transformed 224 transitions.
[2024-05-31 14:37:06] [INFO ] Parsed PT model containing 61 places and 224 transitions and 900 arcs in 329 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 6 ms.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 8 transitions.
FORMULA Szymanski-PT-a02-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a02-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a02-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a02-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Normalized transition count is 79 out of 216 initially.
// Phase 1: matrix 79 rows 49 cols
[2024-05-31 14:37:07] [INFO ] Computed 3 invariants in 13 ms
FORMULA Szymanski-PT-a02-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10001 steps, including 31 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 11) seen :15
FORMULA Szymanski-PT-a02-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-a02-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-a02-UpperBounds-08 2 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Szymanski-PT-a02-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 7) seen :8
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 7) seen :6
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 7) seen :10
FORMULA Szymanski-PT-a02-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Incomplete Best-First random walk after 10000 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 6) seen :10
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 6) seen :7
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 6) seen :8
[2024-05-31 14:37:07] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
// Phase 1: matrix 79 rows 49 cols
[2024-05-31 14:37:07] [INFO ] Computed 3 invariants in 4 ms
[2024-05-31 14:37:07] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 14:37:07] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 14:37:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 14:37:07] [INFO ] [Real]Absence check using state equation in 46 ms returned sat
[2024-05-31 14:37:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 14:37:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 14:37:07] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 14:37:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 14:37:07] [INFO ] [Nat]Absence check using state equation in 47 ms returned sat
[2024-05-31 14:37:07] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-31 14:37:07] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2024-05-31 14:37:07] [INFO ] Deduced a trap composed of 8 places in 58 ms of which 2 ms to minimize.
[2024-05-31 14:37:07] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2024-05-31 14:37:07] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 116 ms
[2024-05-31 14:37:07] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 14:37:07] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 14:37:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 14:37:07] [INFO ] [Real]Absence check using state equation in 16 ms returned unsat
[2024-05-31 14:37:07] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 14:37:07] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 14:37:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 14:37:07] [INFO ] [Real]Absence check using state equation in 17 ms returned unsat
[2024-05-31 14:37:07] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 14:37:07] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 7 ms returned sat
[2024-05-31 14:37:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 14:37:07] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-31 14:37:07] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 14:37:07] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 14:37:07] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 14:37:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 14:37:07] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-31 14:37:07] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2024-05-31 14:37:07] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 1 ms to minimize.
[2024-05-31 14:37:07] [INFO ] Deduced a trap composed of 6 places in 39 ms of which 1 ms to minimize.
[2024-05-31 14:37:07] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 114 ms
[2024-05-31 14:37:07] [INFO ] Computed and/alt/rep : 21/107/21 causal constraints (skipped 56 transitions) in 13 ms.
[2024-05-31 14:37:07] [INFO ] Added : 5 causal constraints over 2 iterations in 49 ms. Result :sat
Minimization took 18 ms.
[2024-05-31 14:37:07] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 14:37:07] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 14:37:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 14:37:07] [INFO ] [Real]Absence check using state equation in 14 ms returned unsat
[2024-05-31 14:37:08] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-31 14:37:08] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 14:37:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 14:37:08] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-31 14:37:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 14:37:08] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 14:37:08] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 14:37:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 14:37:08] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-31 14:37:08] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2024-05-31 14:37:08] [INFO ] Deduced a trap composed of 8 places in 36 ms of which 1 ms to minimize.
[2024-05-31 14:37:08] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2024-05-31 14:37:08] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 79 ms
Current structural bounds on expressions (after SMT) : [2, 2, 2, 1, 2, 2] Max seen :[2, 2, 2, 0, 2, 2]
FORMULA Szymanski-PT-a02-UpperBounds-14 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-a02-UpperBounds-10 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-a02-UpperBounds-05 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-a02-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-a02-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 1 out of 49 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 216/216 transitions.
Graph (complete) has 251 edges and 49 vertex of which 47 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 47 transition count 212
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 10 place count 42 transition count 192
Iterating global reduction 1 with 5 rules applied. Total rules applied 15 place count 42 transition count 192
Drop transitions removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 1 with 16 rules applied. Total rules applied 31 place count 42 transition count 176
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 40 transition count 168
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 40 transition count 168
Applied a total of 35 rules in 53 ms. Remains 40 /49 variables (removed 9) and now considering 168/216 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 40/49 places, 168/216 transitions.
Normalized transition count is 64 out of 168 initially.
// Phase 1: matrix 64 rows 40 cols
[2024-05-31 14:37:08] [INFO ] Computed 3 invariants in 2 ms
Incomplete random walk after 1000001 steps, including 2 resets, run finished after 406 ms. (steps per millisecond=2463 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 273 ms. (steps per millisecond=3663 ) properties (out of 1) seen :0
[2024-05-31 14:37:08] [INFO ] Flow matrix only has 64 transitions (discarded 104 similar events)
// Phase 1: matrix 64 rows 40 cols
[2024-05-31 14:37:08] [INFO ] Computed 3 invariants in 3 ms
[2024-05-31 14:37:08] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 14:37:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 14:37:08] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-31 14:37:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 14:37:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 14:37:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 14:37:08] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-31 14:37:08] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-31 14:37:08] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2024-05-31 14:37:09] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 0 ms to minimize.
[2024-05-31 14:37:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2024-05-31 14:37:09] [INFO ] Computed and/alt/rep : 19/99/19 causal constraints (skipped 43 transitions) in 6 ms.
[2024-05-31 14:37:09] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-31 14:37:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2024-05-31 14:37:09] [INFO ] Added : 9 causal constraints over 3 iterations in 75 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 168/168 transitions.
Applied a total of 0 rules in 10 ms. Remains 40 /40 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 40/40 places, 168/168 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 168/168 transitions.
Applied a total of 0 rules in 6 ms. Remains 40 /40 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2024-05-31 14:37:09] [INFO ] Flow matrix only has 64 transitions (discarded 104 similar events)
[2024-05-31 14:37:09] [INFO ] Invariant cache hit.
[2024-05-31 14:37:09] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-31 14:37:09] [INFO ] Flow matrix only has 64 transitions (discarded 104 similar events)
[2024-05-31 14:37:09] [INFO ] Invariant cache hit.
[2024-05-31 14:37:09] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-31 14:37:09] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
[2024-05-31 14:37:09] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-31 14:37:09] [INFO ] Flow matrix only has 64 transitions (discarded 104 similar events)
[2024-05-31 14:37:09] [INFO ] Invariant cache hit.
[2024-05-31 14:37:09] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 195 ms. Remains : 40/40 places, 168/168 transitions.
Starting property specific reduction for Szymanski-PT-a02-UpperBounds-07
Normalized transition count is 64 out of 168 initially.
// Phase 1: matrix 64 rows 40 cols
[2024-05-31 14:37:09] [INFO ] Computed 3 invariants in 1 ms
Incomplete random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 3 ms. (steps per millisecond=3333 ) properties (out of 1) seen :0
[2024-05-31 14:37:09] [INFO ] Flow matrix only has 64 transitions (discarded 104 similar events)
// Phase 1: matrix 64 rows 40 cols
[2024-05-31 14:37:09] [INFO ] Computed 3 invariants in 1 ms
[2024-05-31 14:37:09] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 14:37:09] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 14:37:09] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-31 14:37:09] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 14:37:09] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 14:37:09] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 14:37:09] [INFO ] [Nat]Absence check using state equation in 10 ms returned sat
[2024-05-31 14:37:09] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-31 14:37:09] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2024-05-31 14:37:09] [INFO ] Deduced a trap composed of 5 places in 38 ms of which 1 ms to minimize.
[2024-05-31 14:37:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2024-05-31 14:37:09] [INFO ] Computed and/alt/rep : 19/99/19 causal constraints (skipped 43 transitions) in 5 ms.
[2024-05-31 14:37:09] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 0 ms to minimize.
[2024-05-31 14:37:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
[2024-05-31 14:37:09] [INFO ] Added : 9 causal constraints over 3 iterations in 78 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 168/168 transitions.
Applied a total of 0 rules in 11 ms. Remains 40 /40 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 12 ms. Remains : 40/40 places, 168/168 transitions.
Normalized transition count is 64 out of 168 initially.
// Phase 1: matrix 64 rows 40 cols
[2024-05-31 14:37:09] [INFO ] Computed 3 invariants in 1 ms
Incomplete random walk after 1000000 steps, including 2 resets, run finished after 308 ms. (steps per millisecond=3246 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 1000001 steps, including 2 resets, run finished after 200 ms. (steps per millisecond=5000 ) properties (out of 1) seen :0
[2024-05-31 14:37:10] [INFO ] Flow matrix only has 64 transitions (discarded 104 similar events)
// Phase 1: matrix 64 rows 40 cols
[2024-05-31 14:37:10] [INFO ] Computed 3 invariants in 2 ms
[2024-05-31 14:37:10] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2024-05-31 14:37:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 14:37:10] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-31 14:37:10] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 14:37:10] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-31 14:37:10] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 14:37:10] [INFO ] [Nat]Absence check using state equation in 11 ms returned sat
[2024-05-31 14:37:10] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-31 14:37:10] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2024-05-31 14:37:10] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 1 ms to minimize.
[2024-05-31 14:37:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2024-05-31 14:37:10] [INFO ] Computed and/alt/rep : 19/99/19 causal constraints (skipped 43 transitions) in 7 ms.
[2024-05-31 14:37:10] [INFO ] Deduced a trap composed of 5 places in 36 ms of which 0 ms to minimize.
[2024-05-31 14:37:10] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2024-05-31 14:37:10] [INFO ] Added : 9 causal constraints over 3 iterations in 78 ms. Result :sat
Minimization took 13 ms.
Current structural bounds on expressions (after SMT) : [1] Max seen :[0]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 168/168 transitions.
Applied a total of 0 rules in 6 ms. Remains 40 /40 variables (removed 0) and now considering 168/168 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 40/40 places, 168/168 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 168/168 transitions.
Applied a total of 0 rules in 3 ms. Remains 40 /40 variables (removed 0) and now considering 168/168 (removed 0) transitions.
[2024-05-31 14:37:10] [INFO ] Flow matrix only has 64 transitions (discarded 104 similar events)
[2024-05-31 14:37:10] [INFO ] Invariant cache hit.
[2024-05-31 14:37:10] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-31 14:37:10] [INFO ] Flow matrix only has 64 transitions (discarded 104 similar events)
[2024-05-31 14:37:10] [INFO ] Invariant cache hit.
[2024-05-31 14:37:10] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-31 14:37:10] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-05-31 14:37:10] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-31 14:37:10] [INFO ] Flow matrix only has 64 transitions (discarded 104 similar events)
[2024-05-31 14:37:10] [INFO ] Invariant cache hit.
[2024-05-31 14:37:10] [INFO ] Dead Transitions using invariants and state equation in 71 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 178 ms. Remains : 40/40 places, 168/168 transitions.
Ending property specific reduction for Szymanski-PT-a02-UpperBounds-07 in 1158 ms.
[2024-05-31 14:37:10] [INFO ] Flatten gal took : 36 ms
[2024-05-31 14:37:10] [INFO ] Applying decomposition
[2024-05-31 14:37:10] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph1275872798841423497.txt' '-o' '/tmp/graph1275872798841423497.bin' '-w' '/tmp/graph1275872798841423497.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph1275872798841423497.bin' '-l' '-1' '-v' '-w' '/tmp/graph1275872798841423497.weights' '-q' '0' '-e' '0.001'
[2024-05-31 14:37:10] [INFO ] Decomposing Gal with order
[2024-05-31 14:37:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-31 14:37:10] [INFO ] Removed a total of 270 redundant transitions.
[2024-05-31 14:37:10] [INFO ] Flatten gal took : 37 ms
[2024-05-31 14:37:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 42 labels/synchronizations in 6 ms.
[2024-05-31 14:37:10] [INFO ] Time to serialize gal into /tmp/UpperBounds9546306331281537168.gal : 3 ms
[2024-05-31 14:37:10] [INFO ] Time to serialize properties into /tmp/UpperBounds16638025694720577013.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/UpperBounds9546306331281537168.gal' '-t' 'CGAL' '-reachable-file' '/tmp/UpperBounds16638025694720577013.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...284
Loading property file /tmp/UpperBounds16638025694720577013.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,24827,0.049695,5196,110,76,3123,788,245,4573,68,2498,0
Total reachable state count : 24827

Verifying 1 reachability properties.
Min sum of variable value : 0
Maximum sum along a path : 1
Bounds property Szymanski-PT-a02-UpperBounds-07 :0 <= u9.s5 <= 1
FORMULA Szymanski-PT-a02-UpperBounds-07 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
Szymanski-PT-a02-UpperBounds-07,0,0.051048,5196,1,0,3123,788,311,4573,90,2498,168
Total runtime 4311 ms.

BK_STOP 1717166231974

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ UpperBounds = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination UpperBounds -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Szymanski-PT-a02"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="gold2023"
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-5568"
echo " Executing tool gold2023"
echo " Input is Szymanski-PT-a02, 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 r417-tall-171690556600506"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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