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-171690556600511.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-a04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r417-tall-171690556600511
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K 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 25K Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 15:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Apr 11 15:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 11 15:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K Apr 11 15:08 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-a04-UpperBounds-00
FORMULA_NAME Szymanski-PT-a04-UpperBounds-01
FORMULA_NAME Szymanski-PT-a04-UpperBounds-02
FORMULA_NAME Szymanski-PT-a04-UpperBounds-03
FORMULA_NAME Szymanski-PT-a04-UpperBounds-04
FORMULA_NAME Szymanski-PT-a04-UpperBounds-05
FORMULA_NAME Szymanski-PT-a04-UpperBounds-06
FORMULA_NAME Szymanski-PT-a04-UpperBounds-07
FORMULA_NAME Szymanski-PT-a04-UpperBounds-08
FORMULA_NAME Szymanski-PT-a04-UpperBounds-09
FORMULA_NAME Szymanski-PT-a04-UpperBounds-10
FORMULA_NAME Szymanski-PT-a04-UpperBounds-11
FORMULA_NAME Szymanski-PT-a04-UpperBounds-12
FORMULA_NAME Szymanski-PT-a04-UpperBounds-13
FORMULA_NAME Szymanski-PT-a04-UpperBounds-14
FORMULA_NAME Szymanski-PT-a04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717166268837

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-a04
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-31 14:37:50] [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:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 14:37:50] [INFO ] Load time of PNML (sax parser for PT used): 67 ms
[2024-05-31 14:37:50] [INFO ] Transformed 61 places.
[2024-05-31 14:37:50] [INFO ] Transformed 224 transitions.
[2024-05-31 14:37:50] [INFO ] Parsed PT model containing 61 places and 224 transitions and 900 arcs in 158 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-a04-UpperBounds-05 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a04-UpperBounds-08 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:50] [INFO ] Computed 3 invariants in 18 ms
Incomplete random walk after 10000 steps, including 15 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 14) seen :53
FORMULA Szymanski-PT-a04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 13) seen :17
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 13) seen :20
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 13) seen :26
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 13) seen :32
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 13) seen :29
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 13) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 13) seen :20
Incomplete Best-First random walk after 10001 steps, including 8 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 13) seen :33
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 13) seen :16
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 13) seen :24
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 13) seen :31
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 13) seen :27
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 4 ms. (steps per millisecond=2500 ) properties (out of 13) seen :30
[2024-05-31 14:37:51] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
// Phase 1: matrix 79 rows 49 cols
[2024-05-31 14:37:51] [INFO ] Computed 3 invariants in 1 ms
[2024-05-31 14:37:51] [INFO ] [Real]Absence check using 2 positive place invariants in 4 ms returned sat
[2024-05-31 14:37:51] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 14:37:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 14:37:51] [INFO ] [Real]Absence check using state equation in 31 ms returned sat
[2024-05-31 14:37:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 14:37:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 14:37:51] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 14:37:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 14:37:51] [INFO ] [Nat]Absence check using state equation in 32 ms returned sat
[2024-05-31 14:37:51] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-31 14:37:51] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2024-05-31 14:37:51] [INFO ] Deduced a trap composed of 8 places in 54 ms of which 2 ms to minimize.
[2024-05-31 14:37:51] [INFO ] Deduced a trap composed of 6 places in 61 ms of which 1 ms to minimize.
[2024-05-31 14:37:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 126 ms
[2024-05-31 14:37:51] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 14:37:51] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 14:37:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 14:37:51] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-31 14:37:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 14:37:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-31 14:37:51] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 14:37:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 14:37:51] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-31 14:37:51] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2024-05-31 14:37:51] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-31 14:37:51] [INFO ] Deduced a trap composed of 6 places in 45 ms of which 1 ms to minimize.
[2024-05-31 14:37:51] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 97 ms
[2024-05-31 14:37:51] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 14:37:51] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 14:37:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 14:37:51] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
[2024-05-31 14:37:51] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 14:37:51] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 14:37:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 14:37:51] [INFO ] [Real]Absence check using state equation in 14 ms returned unsat
[2024-05-31 14:37:51] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 14:37:51] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 14:37:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 14:37:51] [INFO ] [Real]Absence check using state equation in 16 ms returned unsat
[2024-05-31 14:37:51] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 14:37:51] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-31 14:37:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 14:37:51] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2024-05-31 14:37:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 14:37:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 14:37:51] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 14:37:51] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 14:37:51] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-31 14:37:51] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2024-05-31 14:37:51] [INFO ] Deduced a trap composed of 8 places in 49 ms of which 1 ms to minimize.
[2024-05-31 14:37:51] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2024-05-31 14:37:52] [INFO ] Deduced a trap composed of 17 places in 62 ms of which 1 ms to minimize.
[2024-05-31 14:37:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 165 ms
[2024-05-31 14:37:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 14:37:52] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 14:37:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 14:37:52] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-31 14:37:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 14:37:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 14:37:52] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 14:37:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 14:37:52] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-31 14:37:52] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2024-05-31 14:37:52] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
[2024-05-31 14:37:52] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-05-31 14:37:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 70 ms
[2024-05-31 14:37:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 14:37:52] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 14:37:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 14:37:52] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-31 14:37:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 14:37:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 14:37:52] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 14:37:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 14:37:52] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2024-05-31 14:37:52] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2024-05-31 14:37:52] [INFO ] Deduced a trap composed of 7 places in 41 ms of which 0 ms to minimize.
[2024-05-31 14:37:52] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 0 ms to minimize.
[2024-05-31 14:37:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 81 ms
[2024-05-31 14:37:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 14:37:52] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 14:37:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 14:37:52] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-31 14:37:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 14:37:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-31 14:37:52] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 14:37:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 14:37:52] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-31 14:37:52] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2024-05-31 14:37:52] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 0 ms to minimize.
[2024-05-31 14:37:52] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 0 ms to minimize.
[2024-05-31 14:37:52] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2024-05-31 14:37:52] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 0 ms to minimize.
[2024-05-31 14:37:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 4 trap constraints in 181 ms
[2024-05-31 14:37:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 14:37:52] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 14:37:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 14:37:52] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-31 14:37:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 14:37:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-31 14:37:52] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 14:37:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 14:37:52] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-31 14:37:52] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2024-05-31 14:37:52] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-05-31 14:37:52] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 0 ms to minimize.
[2024-05-31 14:37:52] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 94 ms
[2024-05-31 14:37:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 14:37:52] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 14:37:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 14:37:52] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
[2024-05-31 14:37:52] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 14:37:52] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 4 ms returned sat
[2024-05-31 14:37:52] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 14:37:52] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2024-05-31 14:37:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 14:37:52] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 14:37:52] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-31 14:37:52] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 14:37:52] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-31 14:37:52] [INFO ] [Nat]Added 9 Read/Feed constraints in 3 ms returned sat
[2024-05-31 14:37:53] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2024-05-31 14:37:53] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-31 14:37:53] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-05-31 14:37:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 136 ms
[2024-05-31 14:37:53] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 14:37:53] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-31 14:37:53] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-31 14:37:53] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-31 14:37:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-31 14:37:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-31 14:37:53] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-31 14:37:53] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-31 14:37:53] [INFO ] [Nat]Absence check using state equation in 18 ms returned sat
[2024-05-31 14:37:53] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2024-05-31 14:37:53] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 0 ms to minimize.
[2024-05-31 14:37:53] [INFO ] Deduced a trap composed of 8 places in 42 ms of which 1 ms to minimize.
[2024-05-31 14:37:53] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2024-05-31 14:37:53] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 3 trap constraints in 134 ms
Current structural bounds on expressions (after SMT) : [4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4] Max seen :[4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4]
FORMULA Szymanski-PT-a04-UpperBounds-15 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-a04-UpperBounds-13 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-a04-UpperBounds-12 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-a04-UpperBounds-11 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-a04-UpperBounds-10 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-a04-UpperBounds-09 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-a04-UpperBounds-07 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-a04-UpperBounds-06 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-a04-UpperBounds-04 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-a04-UpperBounds-03 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-a04-UpperBounds-02 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-a04-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-a04-UpperBounds-00 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 2744 ms.

BK_STOP 1717166274210

--------------------
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-a04"
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-a04, 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-171690556600511"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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