Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399600461.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is BusinessProcesses-PT-02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399600461
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 8.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K 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:30 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 16:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Apr 11 16:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 11 16:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K Apr 11 16:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 59K 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 BusinessProcesses-PT-02-UpperBounds-00
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-01
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-02
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-03
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-04
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-05
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-06
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-07
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-08
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-09
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-10
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-11
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-12
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-13
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-14
FORMULA_NAME BusinessProcesses-PT-02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1716333650532

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-21 23:20:51] [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-21 23:20:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:20:52] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2024-05-21 23:20:52] [INFO ] Transformed 262 places.
[2024-05-21 23:20:52] [INFO ] Transformed 219 transitions.
[2024-05-21 23:20:52] [INFO ] Found NUPN structural information;
[2024-05-21 23:20:52] [INFO ] Parsed PT model containing 262 places and 219 transitions and 576 arcs in 208 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 9 ms.
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 15 transitions.
Current structural bounds on expressions (Initiallly, because the net is safe) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
// Phase 1: matrix 204 rows 245 cols
[2024-05-21 23:20:52] [INFO ] Computed 43 invariants in 26 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 10000 steps (136 resets) in 59 ms. (166 steps per ms)
FORMULA BusinessProcesses-PT-02-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-07 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 70005 steps (173 resets) in 85 ms. (814 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
[2024-05-21 23:20:52] [INFO ] Invariant cache hit.
[2024-05-21 23:20:52] [INFO ] [Real]Absence check using 30 positive place invariants in 20 ms returned sat
[2024-05-21 23:20:52] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2024-05-21 23:20:52] [INFO ] [Real]Absence check using state equation in 69 ms returned sat
[2024-05-21 23:20:52] [INFO ] Deduced a trap composed of 12 places in 118 ms of which 10 ms to minimize.
[2024-05-21 23:20:52] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:20:53] [INFO ] [Nat]Absence check using 30 positive place invariants in 11 ms returned sat
[2024-05-21 23:20:53] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 5 ms returned sat
[2024-05-21 23:20:53] [INFO ] [Nat]Absence check using state equation in 80 ms returned sat
[2024-05-21 23:20:53] [INFO ] Deduced a trap composed of 12 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:20:53] [INFO ] Deduced a trap composed of 14 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:20:53] [INFO ] Deduced a trap composed of 36 places in 58 ms of which 2 ms to minimize.
[2024-05-21 23:20:53] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 2 ms to minimize.
[2024-05-21 23:20:53] [INFO ] Deduced a trap composed of 18 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:20:53] [INFO ] Deduced a trap composed of 30 places in 50 ms of which 2 ms to minimize.
[2024-05-21 23:20:53] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:20:53] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 1 ms to minimize.
[2024-05-21 23:20:53] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-05-21 23:20:53] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 538 ms
[2024-05-21 23:20:53] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 11 ms.
[2024-05-21 23:20:54] [INFO ] Added : 117 causal constraints over 24 iterations in 356 ms. Result :sat
Minimization took 90 ms.
[2024-05-21 23:20:54] [INFO ] [Real]Absence check using 30 positive place invariants in 15 ms returned sat
[2024-05-21 23:20:54] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2024-05-21 23:20:54] [INFO ] [Real]Absence check using state equation in 89 ms returned sat
[2024-05-21 23:20:54] [INFO ] Deduced a trap composed of 62 places in 62 ms of which 5 ms to minimize.
[2024-05-21 23:20:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:20:54] [INFO ] [Nat]Absence check using 30 positive place invariants in 9 ms returned sat
[2024-05-21 23:20:54] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 7 ms returned sat
[2024-05-21 23:20:54] [INFO ] [Nat]Absence check using state equation in 93 ms returned sat
[2024-05-21 23:20:54] [INFO ] Deduced a trap composed of 62 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:20:54] [INFO ] Deduced a trap composed of 16 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:20:54] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:20:54] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:20:55] [INFO ] Deduced a trap composed of 35 places in 81 ms of which 2 ms to minimize.
[2024-05-21 23:20:55] [INFO ] Deduced a trap composed of 37 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:20:55] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:20:55] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:20:55] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:20:55] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 738 ms
[2024-05-21 23:20:55] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 18 ms.
[2024-05-21 23:20:55] [INFO ] Deduced a trap composed of 26 places in 82 ms of which 2 ms to minimize.
[2024-05-21 23:20:55] [INFO ] Deduced a trap composed of 58 places in 65 ms of which 2 ms to minimize.
[2024-05-21 23:20:55] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 2 ms to minimize.
[2024-05-21 23:20:56] [INFO ] Deduced a trap composed of 59 places in 64 ms of which 1 ms to minimize.
[2024-05-21 23:20:56] [INFO ] Deduced a trap composed of 65 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:20:56] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
[2024-05-21 23:20:56] [INFO ] Deduced a trap composed of 60 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:20:56] [INFO ] Deduced a trap composed of 61 places in 50 ms of which 1 ms to minimize.
[2024-05-21 23:20:56] [INFO ] Deduced a trap composed of 40 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:20:56] [INFO ] Trap strengthening (SAT) tested/added 10/9 trap constraints in 724 ms
[2024-05-21 23:20:56] [INFO ] Added : 130 causal constraints over 27 iterations in 1114 ms. Result :sat
Minimization took 100 ms.
[2024-05-21 23:20:56] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2024-05-21 23:20:56] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2024-05-21 23:20:56] [INFO ] [Real]Absence check using state equation in 72 ms returned sat
[2024-05-21 23:20:56] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:20:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:20:56] [INFO ] [Nat]Absence check using 30 positive place invariants in 14 ms returned sat
[2024-05-21 23:20:56] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2024-05-21 23:20:57] [INFO ] [Nat]Absence check using state equation in 71 ms returned sat
[2024-05-21 23:20:57] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:20:57] [INFO ] Deduced a trap composed of 12 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:20:57] [INFO ] Deduced a trap composed of 17 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:20:57] [INFO ] Deduced a trap composed of 60 places in 89 ms of which 2 ms to minimize.
[2024-05-21 23:20:57] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 2 ms to minimize.
[2024-05-21 23:20:57] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 410 ms
[2024-05-21 23:20:57] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 12 ms.
[2024-05-21 23:20:57] [INFO ] Added : 136 causal constraints over 28 iterations in 377 ms. Result :sat
Minimization took 90 ms.
[2024-05-21 23:20:58] [INFO ] [Real]Absence check using 30 positive place invariants in 12 ms returned sat
[2024-05-21 23:20:58] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2024-05-21 23:20:58] [INFO ] [Real]Absence check using state equation in 76 ms returned sat
[2024-05-21 23:20:58] [INFO ] Deduced a trap composed of 60 places in 70 ms of which 1 ms to minimize.
[2024-05-21 23:20:58] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:20:58] [INFO ] [Nat]Absence check using 30 positive place invariants in 11 ms returned sat
[2024-05-21 23:20:58] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-21 23:20:58] [INFO ] [Nat]Absence check using state equation in 72 ms returned sat
[2024-05-21 23:20:58] [INFO ] Deduced a trap composed of 60 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:20:58] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:20:58] [INFO ] Deduced a trap composed of 8 places in 61 ms of which 1 ms to minimize.
[2024-05-21 23:20:58] [INFO ] Deduced a trap composed of 14 places in 90 ms of which 2 ms to minimize.
[2024-05-21 23:20:58] [INFO ] Deduced a trap composed of 12 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:20:58] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:20:58] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:20:59] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:20:59] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:20:59] [INFO ] Deduced a trap composed of 26 places in 73 ms of which 2 ms to minimize.
[2024-05-21 23:20:59] [INFO ] Deduced a trap composed of 19 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:20:59] [INFO ] Deduced a trap composed of 20 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:20:59] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 2 ms to minimize.
[2024-05-21 23:20:59] [INFO ] Deduced a trap composed of 60 places in 74 ms of which 3 ms to minimize.
[2024-05-21 23:20:59] [INFO ] Deduced a trap composed of 57 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:20:59] [INFO ] Deduced a trap composed of 60 places in 65 ms of which 1 ms to minimize.
[2024-05-21 23:20:59] [INFO ] Deduced a trap composed of 63 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:20:59] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 3 ms to minimize.
[2024-05-21 23:20:59] [INFO ] Deduced a trap composed of 57 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:21:00] [INFO ] Trap strengthening (SAT) tested/added 20/19 trap constraints in 1628 ms
[2024-05-21 23:21:00] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 18 ms.
[2024-05-21 23:21:00] [INFO ] Added : 120 causal constraints over 25 iterations in 389 ms. Result :sat
Minimization took 97 ms.
[2024-05-21 23:21:00] [INFO ] [Real]Absence check using 30 positive place invariants in 12 ms returned sat
[2024-05-21 23:21:00] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 6 ms returned sat
[2024-05-21 23:21:00] [INFO ] [Real]Absence check using state equation in 77 ms returned sat
[2024-05-21 23:21:00] [INFO ] Deduced a trap composed of 12 places in 80 ms of which 2 ms to minimize.
[2024-05-21 23:21:00] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:21:00] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned sat
[2024-05-21 23:21:00] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2024-05-21 23:21:00] [INFO ] [Nat]Absence check using state equation in 73 ms returned sat
[2024-05-21 23:21:01] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 6 ms to minimize.
[2024-05-21 23:21:01] [INFO ] Deduced a trap composed of 8 places in 71 ms of which 2 ms to minimize.
[2024-05-21 23:21:01] [INFO ] Deduced a trap composed of 19 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:21:01] [INFO ] Deduced a trap composed of 15 places in 69 ms of which 2 ms to minimize.
[2024-05-21 23:21:01] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:21:01] [INFO ] Deduced a trap composed of 20 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:21:01] [INFO ] Deduced a trap composed of 31 places in 72 ms of which 2 ms to minimize.
[2024-05-21 23:21:01] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 2 ms to minimize.
[2024-05-21 23:21:01] [INFO ] Deduced a trap composed of 15 places in 66 ms of which 2 ms to minimize.
[2024-05-21 23:21:01] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 1 ms to minimize.
[2024-05-21 23:21:01] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:21:01] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 2 ms to minimize.
[2024-05-21 23:21:02] [INFO ] Deduced a trap composed of 60 places in 66 ms of which 1 ms to minimize.
[2024-05-21 23:21:02] [INFO ] Deduced a trap composed of 60 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:21:02] [INFO ] Deduced a trap composed of 61 places in 67 ms of which 1 ms to minimize.
[2024-05-21 23:21:02] [INFO ] Deduced a trap composed of 65 places in 79 ms of which 2 ms to minimize.
[2024-05-21 23:21:02] [INFO ] Trap strengthening (SAT) tested/added 17/16 trap constraints in 1359 ms
[2024-05-21 23:21:02] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 17 ms.
[2024-05-21 23:21:02] [INFO ] Added : 126 causal constraints over 26 iterations in 394 ms. Result :sat
Minimization took 94 ms.
[2024-05-21 23:21:02] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2024-05-21 23:21:02] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2024-05-21 23:21:02] [INFO ] [Real]Absence check using state equation in 85 ms returned sat
[2024-05-21 23:21:03] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 2 ms to minimize.
[2024-05-21 23:21:03] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:21:03] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned sat
[2024-05-21 23:21:03] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2024-05-21 23:21:03] [INFO ] [Nat]Absence check using state equation in 64 ms returned sat
[2024-05-21 23:21:03] [INFO ] Deduced a trap composed of 20 places in 61 ms of which 2 ms to minimize.
[2024-05-21 23:21:03] [INFO ] Deduced a trap composed of 14 places in 91 ms of which 2 ms to minimize.
[2024-05-21 23:21:03] [INFO ] Deduced a trap composed of 23 places in 78 ms of which 2 ms to minimize.
[2024-05-21 23:21:03] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:21:03] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 334 ms
[2024-05-21 23:21:03] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 11 ms.
[2024-05-21 23:21:03] [INFO ] Added : 126 causal constraints over 26 iterations in 346 ms. Result :sat
Minimization took 111 ms.
[2024-05-21 23:21:04] [INFO ] [Real]Absence check using 30 positive place invariants in 13 ms returned sat
[2024-05-21 23:21:04] [INFO ] [Real]Absence check using 30 positive and 13 generalized place invariants in 4 ms returned sat
[2024-05-21 23:21:04] [INFO ] [Real]Absence check using state equation in 73 ms returned sat
[2024-05-21 23:21:04] [INFO ] Deduced a trap composed of 56 places in 95 ms of which 2 ms to minimize.
[2024-05-21 23:21:04] [INFO ] Solution in real domain found non-integer solution.
[2024-05-21 23:21:04] [INFO ] [Nat]Absence check using 30 positive place invariants in 10 ms returned sat
[2024-05-21 23:21:04] [INFO ] [Nat]Absence check using 30 positive and 13 generalized place invariants in 3 ms returned sat
[2024-05-21 23:21:04] [INFO ] [Nat]Absence check using state equation in 67 ms returned sat
[2024-05-21 23:21:04] [INFO ] Deduced a trap composed of 56 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:21:04] [INFO ] Deduced a trap composed of 11 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:21:04] [INFO ] Deduced a trap composed of 8 places in 63 ms of which 2 ms to minimize.
[2024-05-21 23:21:04] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:21:04] [INFO ] Deduced a trap composed of 20 places in 59 ms of which 2 ms to minimize.
[2024-05-21 23:21:04] [INFO ] Deduced a trap composed of 55 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:21:05] [INFO ] Deduced a trap composed of 56 places in 104 ms of which 2 ms to minimize.
[2024-05-21 23:21:05] [INFO ] Deduced a trap composed of 59 places in 84 ms of which 2 ms to minimize.
[2024-05-21 23:21:05] [INFO ] Deduced a trap composed of 17 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:21:05] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 1 ms to minimize.
[2024-05-21 23:21:05] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:21:05] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 812 ms
[2024-05-21 23:21:05] [INFO ] Computed and/alt/rep : 188/229/188 causal constraints (skipped 15 transitions) in 12 ms.
[2024-05-21 23:21:05] [INFO ] Added : 135 causal constraints over 27 iterations in 322 ms. Result :sat
Minimization took 91 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
Support contains 7 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 204/204 transitions.
Graph (trivial) has 135 edges and 245 vertex of which 7 / 245 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 438 edges and 239 vertex of which 227 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 49 rules applied. Total rules applied 51 place count 227 transition count 141
Reduce places removed 48 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 50 rules applied. Total rules applied 101 place count 179 transition count 139
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 103 place count 177 transition count 139
Performed 37 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 37 Pre rules applied. Total rules applied 103 place count 177 transition count 102
Deduced a syphon composed of 37 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 81 rules applied. Total rules applied 184 place count 133 transition count 102
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 209 place count 108 transition count 77
Iterating global reduction 3 with 25 rules applied. Total rules applied 234 place count 108 transition count 77
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 312 place count 68 transition count 39
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 313 place count 68 transition count 38
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 314 place count 67 transition count 38
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 315 place count 67 transition count 38
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 316 place count 66 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 317 place count 65 transition count 37
Applied a total of 317 rules in 72 ms. Remains 65 /245 variables (removed 180) and now considering 37/204 (removed 167) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 65/245 places, 37/204 transitions.
// Phase 1: matrix 37 rows 65 cols
[2024-05-21 23:21:06] [INFO ] Computed 28 invariants in 2 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0, 0, 0, 0, 0] Max Struct:[1, 1, 1, 1, 1, 1, 1]
RANDOM walk for 1000000 steps (40829 resets) in 1045 ms. (956 steps per ms)
FORMULA BusinessProcesses-PT-02-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-02-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 1000000 steps (27688 resets) in 787 ms. (1269 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[] Max Struct:[]
RANDOM walk for 0 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-05-21 23:21:08] [INFO ] Flatten gal took : 32 ms
[2024-05-21 23:21:08] [INFO ] Flatten gal took : 9 ms
[2024-05-21 23:21:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18148814754033005229.gal : 7 ms
[2024-05-21 23:21:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12697861339178990133.prop : 1 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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality18148814754033005229.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12697861339178990133.prop' '--nowitness' '--gen-order' 'FOLLOW'
ITS runner timed out or was interrupted.

its-reach command run as :

ITS tools runner thread asked to quit. Dying gracefully.
java.io.IOException: Stream closed
at java.base/java.io.BufferedInputStream.getBufIfOpen(BufferedInputStream.java:168)
at java.base/java.io.BufferedInputStream.read(BufferedInputStream.java:334)
at java.base/sun.nio.cs.StreamDecoder.readBytes(StreamDecoder.java:270)
at java.base/sun.nio.cs.StreamDecoder.implRead(StreamDecoder.java:313)
at java.base/sun.nio.cs.StreamDecoder.read(StreamDecoder.java:188)
at java.base/java.io.InputStreamReader.read(InputStreamReader.java:177)
at java.base/java.io.BufferedReader.fill(BufferedReader.java:162)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:329)
at java.base/java.io.BufferedReader.readLine(BufferedReader.java:396)
at fr.lip6.move.gal.application.runner.its.ITSRunner$ITSInterpreter.run(ITSRunner.java:211)
at java.base/java.lang.Thread.run(Thread.java:840)
Current structural bounds on expressions (After reachability solving 0 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 16334 ms.

BK_STOP 1716333668316

--------------------
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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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="BusinessProcesses-PT-02"
export BK_EXAMINATION="UpperBounds"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-02, 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 r048-tajo-171620399600461"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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