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.r400-tall-171690533200813.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 Szymanski-PT-a02, examination is UpperBounds
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r400-tall-171690533200813
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 08:01 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 23 08:01 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 08:01 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 08:01 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 15:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 150K Apr 11 15:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Apr 11 15:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Apr 11 15:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 08:01 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 08:01 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 101K May 18 16:43 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of positive values
NUM_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME Szymanski-PT-a02-UpperBounds-00
FORMULA_NAME Szymanski-PT-a02-UpperBounds-01
FORMULA_NAME Szymanski-PT-a02-UpperBounds-02
FORMULA_NAME Szymanski-PT-a02-UpperBounds-03
FORMULA_NAME Szymanski-PT-a02-UpperBounds-04
FORMULA_NAME Szymanski-PT-a02-UpperBounds-05
FORMULA_NAME Szymanski-PT-a02-UpperBounds-06
FORMULA_NAME Szymanski-PT-a02-UpperBounds-07
FORMULA_NAME Szymanski-PT-a02-UpperBounds-08
FORMULA_NAME Szymanski-PT-a02-UpperBounds-09
FORMULA_NAME Szymanski-PT-a02-UpperBounds-10
FORMULA_NAME Szymanski-PT-a02-UpperBounds-11
FORMULA_NAME Szymanski-PT-a02-UpperBounds-12
FORMULA_NAME Szymanski-PT-a02-UpperBounds-13
FORMULA_NAME Szymanski-PT-a02-UpperBounds-14
FORMULA_NAME Szymanski-PT-a02-UpperBounds-15

=== Now, execution of the tool begins

BK_START 1717085873210

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=UpperBounds
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Szymanski-PT-a02
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
UpperBounds PT
Running Version 202405141337
[2024-05-30 16:17:54] [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-30 16:17:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 16:17:54] [INFO ] Load time of PNML (sax parser for PT used): 71 ms
[2024-05-30 16:17:54] [INFO ] Transformed 61 places.
[2024-05-30 16:17:54] [INFO ] Transformed 224 transitions.
[2024-05-30 16:17:54] [INFO ] Parsed PT model containing 61 places and 224 transitions and 900 arcs in 161 ms.
Parsed 16 properties from file /home/mcc/execution/UpperBounds.xml in 7 ms.
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 8 transitions.
FORMULA Szymanski-PT-a02-UpperBounds-04 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a02-UpperBounds-06 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a02-UpperBounds-09 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Szymanski-PT-a02-UpperBounds-11 0 TECHNIQUES TOPOLOGICAL INITIAL_STATE
Current structural bounds on expressions (Initially) : Max Seen:[0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
Current structural bounds on expressions (Before main loop) : Max Seen:[0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[+inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf, +inf]
[2024-05-30 16:17:54] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
// Phase 1: matrix 79 rows 49 cols
[2024-05-30 16:17:54] [INFO ] Computed 3 invariants in 9 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0, 0, 1, 0, 0, 0, 0, 0, 0, 0, 0, 0] Max Struct:[5, 5, 1, 1, 5, 1, 2, 5, 1, 1, 5, 1]
FORMULA Szymanski-PT-a02-UpperBounds-02 1 TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 10000 steps (30 resets) in 29 ms. (333 steps per ms)
FORMULA Szymanski-PT-a02-UpperBounds-15 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-a02-UpperBounds-13 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-a02-UpperBounds-12 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-a02-UpperBounds-08 2 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Szymanski-PT-a02-UpperBounds-03 1 TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 60005 steps (27 resets) in 55 ms. (1071 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[2, 2, 2, 0, 2, 2] Max Struct:[5, 5, 5, 1, 5, 5]
[2024-05-30 16:17:54] [INFO ] Flow matrix only has 79 transitions (discarded 137 similar events)
[2024-05-30 16:17:54] [INFO ] Invariant cache hit.
[2024-05-30 16:17:54] [INFO ] [Real]Absence check using 2 positive place invariants in 5 ms returned sat
[2024-05-30 16:17:54] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-30 16:17:54] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2024-05-30 16:17:54] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-30 16:17:54] [INFO ] [Real]Added 9 Read/Feed constraints in 3 ms returned sat
[2024-05-30 16:17:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 16:17:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-30 16:17:54] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-30 16:17:54] [INFO ] [Nat]Absence check using state equation in 21 ms returned sat
[2024-05-30 16:17:54] [INFO ] [Nat]Added 9 Read/Feed constraints in 2 ms returned sat
[2024-05-30 16:17:54] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 7 ms to minimize.
[2024-05-30 16:17:55] [INFO ] Deduced a trap composed of 6 places in 48 ms of which 2 ms to minimize.
[2024-05-30 16:17:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 125 ms
[2024-05-30 16:17:55] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-30 16:17:55] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-30 16:17:55] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
[2024-05-30 16:17:55] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-30 16:17:55] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-30 16:17:55] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
[2024-05-30 16:17:55] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-30 16:17:55] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-30 16:17:55] [INFO ] [Real]Absence check using state equation in 20 ms returned sat
[2024-05-30 16:17:55] [INFO ] [Real]Added 9 Read/Feed constraints in 2 ms returned sat
[2024-05-30 16:17:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 16:17:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-30 16:17:55] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-30 16:17:55] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-30 16:17:55] [INFO ] [Nat]Added 9 Read/Feed constraints in 3 ms returned sat
[2024-05-30 16:17:55] [INFO ] Deduced a trap composed of 8 places in 38 ms of which 1 ms to minimize.
[2024-05-30 16:17:55] [INFO ] Deduced a trap composed of 23 places in 33 ms of which 0 ms to minimize.
[2024-05-30 16:17:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 83 ms
[2024-05-30 16:17:55] [INFO ] Computed and/alt/rep : 21/107/21 causal constraints (skipped 56 transitions) in 9 ms.
[2024-05-30 16:17:55] [INFO ] Deduced a trap composed of 7 places in 36 ms of which 0 ms to minimize.
[2024-05-30 16:17:55] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-05-30 16:17:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 90 ms
[2024-05-30 16:17:55] [INFO ] Added : 11 causal constraints over 3 iterations in 134 ms. Result :sat
Minimization took 22 ms.
[2024-05-30 16:17:55] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-30 16:17:55] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-30 16:17:55] [INFO ] [Real]Absence check using state equation in 15 ms returned unsat
[2024-05-30 16:17:55] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-30 16:17:55] [INFO ] [Real]Absence check using 2 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-30 16:17:55] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-30 16:17:55] [INFO ] [Real]Added 9 Read/Feed constraints in 2 ms returned sat
[2024-05-30 16:17:55] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 16:17:55] [INFO ] [Nat]Absence check using 2 positive place invariants in 2 ms returned sat
[2024-05-30 16:17:55] [INFO ] [Nat]Absence check using 2 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-30 16:17:55] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-30 16:17:55] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2024-05-30 16:17:55] [INFO ] Deduced a trap composed of 8 places in 44 ms of which 1 ms to minimize.
[2024-05-30 16:17:55] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2024-05-30 16:17:55] [INFO ] Trap strengthening procedure managed to obtain unsat after adding 2 trap constraints in 90 ms
Current structural bounds on expressions (after SMT) : Max Seen:[2, 2, 2, 0, 2, 2] Max Struct:[2, 2, 2, 1, 2, 2]
FORMULA Szymanski-PT-a02-UpperBounds-14 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-a02-UpperBounds-10 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-a02-UpperBounds-05 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-a02-UpperBounds-01 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
FORMULA Szymanski-PT-a02-UpperBounds-00 2 TECHNIQUES TOPOLOGICAL SAT_SMT RANDOM_WALK
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 49 places. Attempting structural reductions.
Drop transitions (Removing consumers from one bounded place s5) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 0 : 49/49 places, 215/215 transitions.
Graph (complete) has 248 edges and 49 vertex of which 47 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 47 transition count 211
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 10 place count 42 transition count 191
Iterating global reduction 1 with 5 rules applied. Total rules applied 15 place count 42 transition count 191
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 1 with 16 rules applied. Total rules applied 31 place count 42 transition count 175
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 40 transition count 167
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 40 transition count 167
Applied a total of 35 rules in 50 ms. Remains 40 /49 variables (removed 9) and now considering 167/215 (removed 48) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60 ms. Remains : 40/49 places, 167/215 transitions.
[2024-05-30 16:17:55] [INFO ] Flow matrix only has 63 transitions (discarded 104 similar events)
// Phase 1: matrix 63 rows 40 cols
[2024-05-30 16:17:55] [INFO ] Computed 3 invariants in 3 ms
Current structural bounds on expressions (after invariants) : Max Seen:[0] Max Struct:[1]
RANDOM walk for 1000000 steps (2 resets) in 461 ms. (2164 steps per ms)
BEST_FIRST walk for 1000000 steps (2 resets) in 281 ms. (3546 steps per ms)
Current structural bounds on expressions (after WALK) : Max Seen:[0] Max Struct:[1]
[2024-05-30 16:17:56] [INFO ] Flow matrix only has 63 transitions (discarded 104 similar events)
[2024-05-30 16:17:56] [INFO ] Invariant cache hit.
[2024-05-30 16:17:56] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-30 16:17:56] [INFO ] [Real]Absence check using state equation in 21 ms returned sat
[2024-05-30 16:17:56] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-30 16:17:56] [INFO ] [Real]Added 9 Read/Feed constraints in 2 ms returned sat
[2024-05-30 16:17:56] [INFO ] Solution in real domain found non-integer solution.
[2024-05-30 16:17:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 4 ms returned sat
[2024-05-30 16:17:56] [INFO ] [Nat]Absence check using state equation in 19 ms returned sat
[2024-05-30 16:17:56] [INFO ] [Nat]Added 9 Read/Feed constraints in 1 ms returned sat
[2024-05-30 16:17:56] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
[2024-05-30 16:17:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 49 ms
[2024-05-30 16:17:56] [INFO ] Computed and/alt/rep : 19/100/19 causal constraints (skipped 42 transitions) in 6 ms.
[2024-05-30 16:17:56] [INFO ] Added : 15 causal constraints over 4 iterations in 32 ms. Result :sat
Minimization took 14 ms.
Current structural bounds on expressions (after SMT) : Max Seen:[0] Max Struct:[1]
Current structural bounds on expressions (After Parikh guided walk) : Max Seen:[0] Max Struct:[1]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 167/167 transitions.
Applied a total of 0 rules in 5 ms. Remains 40 /40 variables (removed 0) and now considering 167/167 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 40/40 places, 167/167 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 167/167 transitions.
Applied a total of 0 rules in 6 ms. Remains 40 /40 variables (removed 0) and now considering 167/167 (removed 0) transitions.
[2024-05-30 16:17:56] [INFO ] Flow matrix only has 63 transitions (discarded 104 similar events)
[2024-05-30 16:17:56] [INFO ] Invariant cache hit.
[2024-05-30 16:17:56] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-30 16:17:56] [INFO ] Flow matrix only has 63 transitions (discarded 104 similar events)
[2024-05-30 16:17:56] [INFO ] Invariant cache hit.
[2024-05-30 16:17:56] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-30 16:17:56] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
[2024-05-30 16:17:56] [INFO ] Redundant transitions in 3 ms returned []
Running 165 sub problems to find dead transitions.
[2024-05-30 16:17:56] [INFO ] Flow matrix only has 63 transitions (discarded 104 similar events)
[2024-05-30 16:17:56] [INFO ] Invariant cache hit.
[2024-05-30 16:17:56] [INFO ] State equation strengthened by 9 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-30 16:17:57] [INFO ] Deduced a trap composed of 13 places in 31 ms of which 1 ms to minimize.
[2024-05-30 16:17:57] [INFO ] Deduced a trap composed of 15 places in 33 ms of which 1 ms to minimize.
[2024-05-30 16:17:57] [INFO ] Deduced a trap composed of 25 places in 48 ms of which 1 ms to minimize.
[2024-05-30 16:17:57] [INFO ] Deduced a trap composed of 28 places in 35 ms of which 0 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (OVERLAPS) 1/40 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-30 16:17:58] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 1 ms to minimize.
[2024-05-30 16:17:58] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-05-30 16:17:58] [INFO ] Deduced a trap composed of 8 places in 22 ms of which 1 ms to minimize.
[2024-05-30 16:17:58] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 63/103 variables, 40/51 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 9/60 constraints. Problems are: Problem set: 0 solved, 165 unsolved
[2024-05-30 16:17:59] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/103 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 10 (OVERLAPS) 0/103 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Real declared 103/103 variables, and 61 constraints, problems are : Problem set: 0 solved, 165 unsolved in 3333 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 40/40 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 165 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 3 (OVERLAPS) 1/40 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 6 (OVERLAPS) 63/103 variables, 40/52 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 9/61 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 165/226 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/103 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 10 (OVERLAPS) 0/103 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 165 unsolved
No progress, stopping.
After SMT solving in domain Int declared 103/103 variables, and 226 constraints, problems are : Problem set: 0 solved, 165 unsolved in 3022 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 40/40 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 9/9 constraints]
After SMT, in 6476ms problems are : Problem set: 0 solved, 165 unsolved
Search for dead transitions found 0 dead transitions in 6494ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6620 ms. Remains : 40/40 places, 167/167 transitions.
RANDOM walk for 40002 steps (8 resets) in 382 ms. (104 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 92 ms. (430 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 196 ms. (203 steps per ms) remains 2/2 properties
[2024-05-30 16:18:03] [INFO ] Flatten gal took : 83 ms
[2024-05-30 16:18:03] [INFO ] Flatten gal took : 44 ms
[2024-05-30 16:18:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5485036672146084793.gal : 9 ms
[2024-05-30 16:18:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6439615332793689541.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5485036672146084793.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6439615332793689541.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 ...328
Loading property file /tmp/ReachabilityCardinality6439615332793689541.prop.
SDD proceeding with computation,2 properties remain. new max is 4
SDD size :1 after 10
SDD proceeding with computation,2 properties remain. new max is 8
SDD size :10 after 22
Invariant property MIN0 does not hold.
Reachability property MAX0 is true.
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 9 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst,33,0.040033,4920,2,123,8,1092,6,0,326,685,0
Total reachable state count : 33

Verifying 2 reachability properties.
Reachability property MAX0 is true.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MAX0,1,0.040319,4920,2,41,8,1092,7,0,329,685,0
Invariant property MIN0 does not hold.

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
MIN0,1,0.040456,4920,2,41,8,1092,8,0,330,685,0
Finished probabilistic random walk after 109842 steps, run visited all 2 properties in 303 ms. (steps per millisecond=362 )
Probabilistic random walk after 109842 steps, saw 22395 distinct states, run finished after 306 ms. (steps per millisecond=358 ) properties seen :2
FORMULA Szymanski-PT-a02-UpperBounds-07 1 TECHNIQUES REACHABILITY_MAX
Current structural bounds on expressions (After reachability solving 1 queries.) : Max Seen:[] Max Struct:[]
All properties solved without resorting to model-checking.
Total runtime 9623 ms.

BK_STOP 1717085883968

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="Szymanski-PT-a02"
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 Szymanski-PT-a02, examination is UpperBounds"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r400-tall-171690533200813"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Szymanski-PT-a02.tgz
mv Szymanski-PT-a02 execution
cd execution
if [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "UpperBounds" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] || [ "UpperBounds" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "UpperBounds" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "UpperBounds" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "UpperBounds.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property UpperBounds.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "UpperBounds.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' UpperBounds.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "UpperBounds" = "ReachabilityDeadlock" ] || [ "UpperBounds" = "QuasiLiveness" ] || [ "UpperBounds" = "StableMarking" ] || [ "UpperBounds" = "Liveness" ] || [ "UpperBounds" = "OneSafe" ] ; then
echo "FORMULA_NAME UpperBounds"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;