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.r197-tall-171640625200236.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 GPPP-PT-C0010N0000000010, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640625200236
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Apr 22 14:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 09:03 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K Apr 12 09:03 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 09:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Apr 12 09:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 17 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 1 May 18 16:42 large_marking
-rw-r--r-- 1 mcc users 21K May 18 16:42 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 GPPP-PT-C0010N0000000010-UpperBounds-00
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-01
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-02
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-03
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-04
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-05
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-06
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-07
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-08
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-09
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-10
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-11
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-12
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-13
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-14
FORMULA_NAME GPPP-PT-C0010N0000000010-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716543901837

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=GPPP-PT-C0010N0000000010
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202304061127
[2024-05-24 09:45:03] [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-24 09:45:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 09:45:03] [INFO ] Load time of PNML (sax parser for PT used): 25 ms
[2024-05-24 09:45:03] [INFO ] Transformed 33 places.
[2024-05-24 09:45:03] [INFO ] Transformed 22 transitions.
[2024-05-24 09:45:03] [INFO ] Parsed PT model containing 33 places and 22 transitions and 83 arcs in 82 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 5 ms.
// Phase 1: matrix 22 rows 33 cols
[2024-05-24 09:45:03] [INFO ] Computed 12 invariants in 15 ms
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-14 20 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-02 10 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Incomplete random walk after 10005 steps, including 23 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 13) seen :351
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-08 70 TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-03 20 TECHNIQUES TOPOLOGICAL RANDOM_WALK
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 11) seen :217
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 11) seen :221
Incomplete Best-First random walk after 10001 steps, including 6 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 11) seen :216
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 11) seen :153
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 11) seen :228
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 11) seen :218
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 11) seen :211
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 11) seen :223
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 11) seen :199
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 11) seen :153
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 11) seen :212
[2024-05-24 09:45:03] [INFO ] Invariant cache hit.
[2024-05-24 09:45:03] [INFO ] [Real]Absence check using 6 positive place invariants in 7 ms returned sat
[2024-05-24 09:45:03] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 6 ms returned sat
[2024-05-24 09:45:03] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 09:45:03] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-24 09:45:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 09:45:03] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-24 09:45:03] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 237 ms returned sat
[2024-05-24 09:45:03] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 09:45:04] [INFO ] [Nat]Absence check using state equation in 221 ms returned unsat
[2024-05-24 09:45:04] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-24 09:45:04] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-24 09:45:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 09:45:04] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2024-05-24 09:45:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 09:45:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-24 09:45:04] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 9 ms returned sat
[2024-05-24 09:45:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 09:45:04] [INFO ] [Nat]Absence check using state equation in 413 ms returned unsat
[2024-05-24 09:45:04] [INFO ] [Real]Absence check using 6 positive place invariants in 5 ms returned sat
[2024-05-24 09:45:04] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned unsat
[2024-05-24 09:45:04] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-24 09:45:04] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-24 09:45:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 09:45:04] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-24 09:45:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 09:45:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-24 09:45:04] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned unsat
[2024-05-24 09:45:04] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-24 09:45:04] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-24 09:45:04] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 09:45:04] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2024-05-24 09:45:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 09:45:04] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-24 09:45:04] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 4 ms returned sat
[2024-05-24 09:45:04] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 09:45:04] [INFO ] [Nat]Absence check using state equation in 128 ms returned sat
[2024-05-24 09:45:04] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-24 09:45:04] [INFO ] Added : 5 causal constraints over 1 iterations in 15 ms. Result :sat
Minimization took 60 ms.
[2024-05-24 09:45:05] [INFO ] [Real]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-24 09:45:05] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-24 09:45:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 09:45:05] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-24 09:45:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 09:45:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-24 09:45:05] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 225 ms returned sat
[2024-05-24 09:45:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 09:45:05] [INFO ] [Nat]Absence check using state equation in 240 ms returned unsat
[2024-05-24 09:45:05] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-24 09:45:05] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-24 09:45:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 09:45:05] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-24 09:45:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 09:45:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 3 ms returned sat
[2024-05-24 09:45:05] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 6 ms returned sat
[2024-05-24 09:45:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 09:45:05] [INFO ] [Nat]Absence check using state equation in 32 ms returned unsat
[2024-05-24 09:45:05] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-24 09:45:05] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-24 09:45:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 09:45:05] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-24 09:45:05] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 09:45:05] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-24 09:45:05] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 229 ms returned sat
[2024-05-24 09:45:05] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 09:45:06] [INFO ] [Nat]Absence check using state equation in 373 ms returned unsat
[2024-05-24 09:45:06] [INFO ] [Real]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-24 09:45:06] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-24 09:45:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 09:45:06] [INFO ] [Real]Absence check using state equation in 14 ms returned sat
[2024-05-24 09:45:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 09:45:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-24 09:45:06] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 1 ms returned unsat
[2024-05-24 09:45:06] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-24 09:45:06] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-24 09:45:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 09:45:06] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2024-05-24 09:45:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 09:45:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-24 09:45:06] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 7 ms returned sat
[2024-05-24 09:45:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 09:45:06] [INFO ] [Nat]Absence check using state equation in 118 ms returned sat
[2024-05-24 09:45:06] [INFO ] Computed and/alt/rep : 21/49/21 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-24 09:45:06] [INFO ] Added : 17 causal constraints over 4 iterations in 40 ms. Result :sat
Minimization took 55 ms.
[2024-05-24 09:45:06] [INFO ] [Real]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-24 09:45:06] [INFO ] [Real]Absence check using 6 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-24 09:45:06] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 09:45:06] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2024-05-24 09:45:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 09:45:06] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-24 09:45:06] [INFO ] [Nat]Absence check using 6 positive and 6 generalized place invariants in 11 ms returned sat
[2024-05-24 09:45:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 09:45:07] [INFO ] [Nat]Absence check using state equation in 354 ms returned unsat
Current structural bounds on expressions (after SMT) : [10, 4, 110, 40, 45, 10, 1, 10, 2, 130, 10] Max seen :[10, 4, 110, 40, 37, 10, 1, 10, 2, 40, 10]
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-15 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-12 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-11 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-09 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-05 40 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-04 110 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-01 4 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-00 10 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Support contains 2 out of 33 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 33/33 places, 22/22 transitions.
Graph (trivial) has 4 edges and 33 vertex of which 2 / 33 are part of one of the 1 SCC in 2 ms
Free SCC test removed 1 places
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 32 transition count 19
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 31 transition count 19
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 3 place count 31 transition count 18
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 5 place count 30 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 10 place count 27 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 25 transition count 15
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 15 place count 24 transition count 14
Applied a total of 15 rules in 19 ms. Remains 24 /33 variables (removed 9) and now considering 14/22 (removed 8) transitions.
// Phase 1: matrix 14 rows 24 cols
[2024-05-24 09:45:07] [INFO ] Computed 10 invariants in 2 ms
[2024-05-24 09:45:07] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 24/33 places, 14/22 transitions.
[2024-05-24 09:45:07] [INFO ] Invariant cache hit.
Incomplete random walk after 1000004 steps, including 5487 resets, run finished after 397 ms. (steps per millisecond=2518 ) properties (out of 2) seen :78
Incomplete Best-First random walk after 1000000 steps, including 1902 resets, run finished after 369 ms. (steps per millisecond=2710 ) properties (out of 2) seen :77
Incomplete Best-First random walk after 1000000 steps, including 2152 resets, run finished after 386 ms. (steps per millisecond=2590 ) properties (out of 2) seen :48
[2024-05-24 09:45:08] [INFO ] Invariant cache hit.
[2024-05-24 09:45:08] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-24 09:45:08] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-24 09:45:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 09:45:08] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-24 09:45:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 09:45:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-24 09:45:08] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 24 ms returned sat
[2024-05-24 09:45:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 09:45:08] [INFO ] [Nat]Absence check using state equation in 21 ms returned unsat
[2024-05-24 09:45:08] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-24 09:45:08] [INFO ] [Real]Absence check using 4 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-24 09:45:08] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 09:45:08] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2024-05-24 09:45:08] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 09:45:08] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-24 09:45:08] [INFO ] [Nat]Absence check using 4 positive and 6 generalized place invariants in 12 ms returned sat
[2024-05-24 09:45:08] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 09:45:08] [INFO ] [Nat]Absence check using state equation in 357 ms returned unsat
Current structural bounds on expressions (after SMT) : [38, 47] Max seen :[38, 47]
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-13 47 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA GPPP-PT-C0010N0000000010-UpperBounds-07 38 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 5689 ms.

BK_STOP 1716543909979

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ 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="GPPP-PT-C0010N0000000010"
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 GPPP-PT-C0010N0000000010, 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 r197-tall-171640625200236"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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