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.r576-smll-171734919800029.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 itstools
Input is MedleyA-PT-04, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734919800029
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 28K Jun 2 16:33 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 MedleyA-PT-04-UpperBounds-00
FORMULA_NAME MedleyA-PT-04-UpperBounds-01
FORMULA_NAME MedleyA-PT-04-UpperBounds-02
FORMULA_NAME MedleyA-PT-04-UpperBounds-03
FORMULA_NAME MedleyA-PT-04-UpperBounds-04
FORMULA_NAME MedleyA-PT-04-UpperBounds-05
FORMULA_NAME MedleyA-PT-04-UpperBounds-06
FORMULA_NAME MedleyA-PT-04-UpperBounds-07
FORMULA_NAME MedleyA-PT-04-UpperBounds-08
FORMULA_NAME MedleyA-PT-04-UpperBounds-09
FORMULA_NAME MedleyA-PT-04-UpperBounds-10
FORMULA_NAME MedleyA-PT-04-UpperBounds-11
FORMULA_NAME MedleyA-PT-04-UpperBounds-12
FORMULA_NAME MedleyA-PT-04-UpperBounds-13
FORMULA_NAME MedleyA-PT-04-UpperBounds-14
FORMULA_NAME MedleyA-PT-04-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717352928127

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-06-02 18:28: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-06-02 18:28:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:28:50] [INFO ] Load time of PNML (sax parser for PT used): 121 ms
[2024-06-02 18:28:50] [INFO ] Transformed 115 places.
[2024-06-02 18:28:50] [INFO ] Transformed 107 transitions.
[2024-06-02 18:28:50] [INFO ] Found NUPN structural information;
[2024-06-02 18:28:50] [INFO ] Parsed PT model containing 115 places and 107 transitions and 300 arcs in 344 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 17 ms.
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 107 rows 115 cols
[2024-06-02 18:28:51] [INFO ] Computed 9 invariants in 20 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 (286 resets) in 66 ms. (149 steps per ms)
FORMULA MedleyA-PT-04-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-04-UpperBounds-14 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-04-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-04-UpperBounds-11 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-04-UpperBounds-08 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-04-UpperBounds-06 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-04-UpperBounds-05 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-04-UpperBounds-04 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-04-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-04-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-04-UpperBounds-00 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-04-UpperBounds-10 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-04-UpperBounds-01 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (307 resets) in 83 ms. (476 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
[2024-06-02 18:28:51] [INFO ] Invariant cache hit.
[2024-06-02 18:28:51] [INFO ] [Real]Absence check using 9 positive place invariants in 15 ms returned sat
[2024-06-02 18:28:51] [INFO ] [Real]Absence check using state equation in 127 ms returned sat
[2024-06-02 18:28:52] [INFO ] Deduced a trap composed of 20 places in 164 ms of which 19 ms to minimize.
[2024-06-02 18:28:52] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:28:52] [INFO ] [Nat]Absence check using 9 positive place invariants in 10 ms returned sat
[2024-06-02 18:28:52] [INFO ] [Nat]Absence check using state equation in 116 ms returned sat
[2024-06-02 18:28:52] [INFO ] Deduced a trap composed of 20 places in 122 ms of which 6 ms to minimize.
[2024-06-02 18:28:52] [INFO ] Deduced a trap composed of 17 places in 114 ms of which 3 ms to minimize.
[2024-06-02 18:28:52] [INFO ] Deduced a trap composed of 11 places in 58 ms of which 2 ms to minimize.
[2024-06-02 18:28:52] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 352 ms
[2024-06-02 18:28:52] [INFO ] Computed and/alt/rep : 104/183/104 causal constraints (skipped 2 transitions) in 22 ms.
[2024-06-02 18:28:53] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 3 ms to minimize.
[2024-06-02 18:28:53] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
[2024-06-02 18:28:53] [INFO ] Deduced a trap composed of 21 places in 81 ms of which 2 ms to minimize.
[2024-06-02 18:28:53] [INFO ] Deduced a trap composed of 22 places in 84 ms of which 2 ms to minimize.
[2024-06-02 18:28:53] [INFO ] Deduced a trap composed of 34 places in 118 ms of which 3 ms to minimize.
[2024-06-02 18:28:53] [INFO ] Deduced a trap composed of 24 places in 51 ms of which 2 ms to minimize.
[2024-06-02 18:28:53] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 630 ms
[2024-06-02 18:28:53] [INFO ] Added : 95 causal constraints over 19 iterations in 1057 ms. Result :sat
Minimization took 91 ms.
[2024-06-02 18:28:53] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-06-02 18:28:53] [INFO ] [Real]Absence check using state equation in 88 ms returned sat
[2024-06-02 18:28:54] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 2 ms to minimize.
[2024-06-02 18:28:54] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:28:54] [INFO ] [Nat]Absence check using 9 positive place invariants in 7 ms returned sat
[2024-06-02 18:28:54] [INFO ] [Nat]Absence check using state equation in 90 ms returned sat
[2024-06-02 18:28:54] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 2 ms to minimize.
[2024-06-02 18:28:54] [INFO ] Deduced a trap composed of 23 places in 70 ms of which 2 ms to minimize.
[2024-06-02 18:28:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 160 ms
[2024-06-02 18:28:54] [INFO ] Computed and/alt/rep : 104/183/104 causal constraints (skipped 2 transitions) in 21 ms.
[2024-06-02 18:28:54] [INFO ] Deduced a trap composed of 11 places in 62 ms of which 2 ms to minimize.
[2024-06-02 18:28:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2024-06-02 18:28:54] [INFO ] Added : 75 causal constraints over 15 iterations in 372 ms. Result :sat
Minimization took 86 ms.
[2024-06-02 18:28:54] [INFO ] [Real]Absence check using 9 positive place invariants in 9 ms returned sat
[2024-06-02 18:28:55] [INFO ] [Real]Absence check using state equation in 82 ms returned sat
[2024-06-02 18:28:55] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
[2024-06-02 18:28:55] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:28:55] [INFO ] [Nat]Absence check using 9 positive place invariants in 10 ms returned sat
[2024-06-02 18:28:55] [INFO ] [Nat]Absence check using state equation in 91 ms returned sat
[2024-06-02 18:28:55] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 4 ms to minimize.
[2024-06-02 18:28:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 98 ms
[2024-06-02 18:28:55] [INFO ] Computed and/alt/rep : 104/183/104 causal constraints (skipped 2 transitions) in 18 ms.
[2024-06-02 18:28:55] [INFO ] Added : 89 causal constraints over 18 iterations in 331 ms. Result :sat
Minimization took 81 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
Support contains 3 out of 115 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 115/115 places, 107/107 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 115 transition count 83
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 48 place count 91 transition count 83
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 48 place count 91 transition count 77
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 60 place count 85 transition count 77
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 67 place count 78 transition count 70
Iterating global reduction 2 with 7 rules applied. Total rules applied 74 place count 78 transition count 70
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 74 place count 78 transition count 69
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 77 transition count 69
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 1 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 118 place count 56 transition count 48
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 119 place count 56 transition count 47
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 120 place count 55 transition count 47
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 121 place count 54 transition count 46
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 122 place count 53 transition count 46
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 123 place count 53 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 124 place count 52 transition count 45
Applied a total of 124 rules in 126 ms. Remains 52 /115 variables (removed 63) and now considering 45/107 (removed 62) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 52/115 places, 45/107 transitions.
// Phase 1: matrix 45 rows 52 cols
[2024-06-02 18:28:56] [INFO ] Computed 8 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 0] Max Struct:[1, 1, 1]
RANDOM walk for 1000000 steps (108883 resets) in 1029 ms. (970 steps per ms)
FORMULA MedleyA-PT-04-UpperBounds-09 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 2000000 steps (104081 resets) in 901 ms. (2217 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-06-02 18:28:58] [INFO ] Invariant cache hit.
[2024-06-02 18:28:58] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 18:28:58] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-06-02 18:28:58] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-06-02 18:28:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:28:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:28:58] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-06-02 18:28:58] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-02 18:28:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2024-06-02 18:28:58] [INFO ] Computed and/alt/rep : 42/59/42 causal constraints (skipped 2 transitions) in 6 ms.
[2024-06-02 18:28:58] [INFO ] Added : 33 causal constraints over 7 iterations in 54 ms. Result :sat
Minimization took 21 ms.
[2024-06-02 18:28:58] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:28:58] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-06-02 18:28:58] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-02 18:28:58] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:28:58] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:28:58] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-06-02 18:28:58] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-02 18:28:58] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 29 ms
[2024-06-02 18:28:58] [INFO ] Computed and/alt/rep : 42/59/42 causal constraints (skipped 2 transitions) in 6 ms.
[2024-06-02 18:28:58] [INFO ] Added : 42 causal constraints over 9 iterations in 67 ms. Result :sat
Minimization took 22 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 45/45 transitions.
Applied a total of 0 rules in 3 ms. Remains 52 /52 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 52/52 places, 45/45 transitions.
[2024-06-02 18:28:59] [INFO ] Invariant cache hit.
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0] Max Struct:[1, 1]
RANDOM walk for 1000000 steps (108972 resets) in 937 ms. (1066 steps per ms)
BEST_FIRST walk for 2000002 steps (103386 resets) in 868 ms. (2301 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0, 0] Max Struct:[1, 1]
[2024-06-02 18:29:00] [INFO ] Invariant cache hit.
[2024-06-02 18:29:00] [INFO ] [Real]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:29:00] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2024-06-02 18:29:00] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-06-02 18:29:00] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:29:00] [INFO ] [Nat]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 18:29:01] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-06-02 18:29:01] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:29:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2024-06-02 18:29:01] [INFO ] Computed and/alt/rep : 42/59/42 causal constraints (skipped 2 transitions) in 5 ms.
[2024-06-02 18:29:01] [INFO ] Added : 33 causal constraints over 7 iterations in 51 ms. Result :sat
Minimization took 18 ms.
[2024-06-02 18:29:01] [INFO ] [Real]Absence check using 8 positive place invariants in 4 ms returned sat
[2024-06-02 18:29:01] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2024-06-02 18:29:01] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-06-02 18:29:01] [INFO ] Solution in real domain found non-integer solution.
[2024-06-02 18:29:01] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 18:29:01] [INFO ] [Nat]Absence check using state equation in 22 ms returned sat
[2024-06-02 18:29:01] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-02 18:29:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 28 ms
[2024-06-02 18:29:01] [INFO ] Computed and/alt/rep : 42/59/42 causal constraints (skipped 2 transitions) in 4 ms.
[2024-06-02 18:29:01] [INFO ] Added : 42 causal constraints over 9 iterations in 51 ms. Result :sat
Minimization took 19 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0, 0] Max Struct:[1, 1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0, 0] Max Struct:[1, 1]
Support contains 2 out of 52 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 45/45 transitions.
Applied a total of 0 rules in 5 ms. Remains 52 /52 variables (removed 0) and now considering 45/45 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 52/52 places, 45/45 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 52/52 places, 45/45 transitions.
Applied a total of 0 rules in 4 ms. Remains 52 /52 variables (removed 0) and now considering 45/45 (removed 0) transitions.
[2024-06-02 18:29:01] [INFO ] Invariant cache hit.
[2024-06-02 18:29:01] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 18:29:01] [INFO ] Invariant cache hit.
[2024-06-02 18:29:01] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 169 ms to find 0 implicit places.
[2024-06-02 18:29:01] [INFO ] Redundant transitions in 1 ms returned []
Running 44 sub problems to find dead transitions.
[2024-06-02 18:29:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-06-02 18:29:02] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-06-02 18:29:02] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:29:02] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-06-02 18:29:02] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:29:02] [INFO ] Deduced a trap composed of 4 places in 41 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 2/52 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 45/97 variables, 52/65 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 7 (OVERLAPS) 0/97 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 97/97 variables, and 65 constraints, problems are : Problem set: 0 solved, 44 unsolved in 1718 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 44 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 2/52 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 45/97 variables, 52/65 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 44/109 constraints. Problems are: Problem set: 0 solved, 44 unsolved
[2024-06-02 18:29:04] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 0/97 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 97/97 variables, and 110 constraints, problems are : Problem set: 0 solved, 44 unsolved in 2035 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 52/52 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 6/6 constraints]
After SMT, in 3875ms problems are : Problem set: 0 solved, 44 unsolved
Search for dead transitions found 0 dead transitions in 3885ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4084 ms. Remains : 52/52 places, 45/45 transitions.
RANDOM walk for 40000 steps (4359 resets) in 949 ms. (42 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (2107 resets) in 341 ms. (116 steps per ms) remains 4/4 properties
[2024-06-02 18:29:05] [INFO ] Flatten gal took : 62 ms
BEST_FIRST walk for 40000 steps (2067 resets) in 292 ms. (136 steps per ms) remains 4/4 properties
[2024-06-02 18:29:06] [INFO ] Flatten gal took : 46 ms
BEST_FIRST walk for 40001 steps (2060 resets) in 165 ms. (240 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (2113 resets) in 125 ms. (317 steps per ms) remains 4/4 properties
[2024-06-02 18:29:06] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13313497236303427553.gal : 16 ms
[2024-06-02 18:29:06] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3383933737719986527.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/ReachabilityCardinality13313497236303427553.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3383933737719986527.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Finished probabilistic random walk after 2204 steps, run visited all 4 properties in 64 ms. (steps per millisecond=34 )
Probabilistic random walk after 2204 steps, saw 1070 distinct states, run finished after 69 ms. (steps per millisecond=31 ) properties seen :4
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
FORMULA MedleyA-PT-04-UpperBounds-12 1 TECHNIQUES REACHABILITY_MAX
FORMULA MedleyA-PT-04-UpperBounds-07 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 2 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 15559 ms.

BK_STOP 1717352946230

--------------------
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="MedleyA-PT-04"
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 MedleyA-PT-04, 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 r576-smll-171734919800029"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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