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-171620399600462.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399600462
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-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 6.8K May 18 16:42 GenericPropertiesVerdict.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 booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716333662184

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
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
ReachabilityCardinality PT
Running Version 202405141337
[2024-05-21 23:21:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 23:21:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:21:03] [INFO ] Load time of PNML (sax parser for PT used): 83 ms
[2024-05-21 23:21:03] [INFO ] Transformed 262 places.
[2024-05-21 23:21:03] [INFO ] Transformed 219 transitions.
[2024-05-21 23:21:03] [INFO ] Found NUPN structural information;
[2024-05-21 23:21:03] [INFO ] Parsed PT model containing 262 places and 219 transitions and 576 arcs in 216 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 17 places in 3 ms
Reduce places removed 17 places and 15 transitions.
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 23:21:04] [INFO ] Flatten gal took : 102 ms
[2024-05-21 23:21:04] [INFO ] Flatten gal took : 49 ms
[2024-05-21 23:21:04] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8845506271962771846.gal : 26 ms
RANDOM walk for 40000 steps (541 resets) in 1799 ms. (22 steps per ms) remains 3/13 properties
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-21 23:21:04] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15119435562031464507.prop : 2 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/ReachabilityCardinality8845506271962771846.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15119435562031464507.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
Loading property file /tmp/ReachabilityCardinality15119435562031464507.prop.
BEST_FIRST walk for 40004 steps (109 resets) in 448 ms. (89 steps per ms) remains 3/3 properties
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,13 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,13 properties remain. new max is 16
SDD size :10 after 14
BEST_FIRST walk for 40002 steps (95 resets) in 135 ms. (294 steps per ms) remains 3/3 properties
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :14 after 17
SDD proceeding with computation,13 properties remain. new max is 64
SDD size :17 after 31
Invariant property BusinessProcesses-PT-02-ReachabilityCardinality-2024-13 does not hold.
BEST_FIRST walk for 40003 steps (95 resets) in 428 ms. (93 steps per ms) remains 3/3 properties
// Phase 1: matrix 204 rows 245 cols
[2024-05-21 23:21:04] [INFO ] Computed 43 invariants in 14 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 147/182 variables, 22/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 147/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 36/218 variables, 8/212 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 36/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 1/249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 27/245 variables, 12/261 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 27/288 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 204/449 variables, 245/533 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/449 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/449 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 449/449 variables, and 533 constraints, problems are : Problem set: 0 solved, 3 unsolved in 460 ms.
Refiners :[Domain max(s): 245/245 constraints, Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 147/182 variables, 22/57 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/182 variables, 147/204 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 23:21:05] [INFO ] Deduced a trap composed of 16 places in 95 ms of which 10 ms to minimize.
[2024-05-21 23:21:05] [INFO ] Deduced a trap composed of 10 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:21:05] [INFO ] Deduced a trap composed of 11 places in 76 ms of which 2 ms to minimize.
[2024-05-21 23:21:05] [INFO ] Deduced a trap composed of 11 places in 72 ms of which 1 ms to minimize.
[2024-05-21 23:21:05] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:21:05] [INFO ] Deduced a trap composed of 61 places in 68 ms of which 1 ms to minimize.
[2024-05-21 23:21:05] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:21:06] [INFO ] Deduced a trap composed of 67 places in 54 ms of which 2 ms to minimize.
[2024-05-21 23:21:06] [INFO ] Deduced a trap composed of 67 places in 49 ms of which 7 ms to minimize.
[2024-05-21 23:21:06] [INFO ] Deduced a trap composed of 73 places in 58 ms of which 1 ms to minimize.
[2024-05-21 23:21:06] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:21:06] [INFO ] Deduced a trap composed of 58 places in 48 ms of which 1 ms to minimize.
[2024-05-21 23:21:06] [INFO ] Deduced a trap composed of 59 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:21:06] [INFO ] Deduced a trap composed of 57 places in 63 ms of which 1 ms to minimize.
[2024-05-21 23:21:06] [INFO ] Deduced a trap composed of 59 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:21:06] [INFO ] Deduced a trap composed of 62 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:21:06] [INFO ] Deduced a trap composed of 57 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:21:06] [INFO ] Deduced a trap composed of 67 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:21:06] [INFO ] Deduced a trap composed of 68 places in 44 ms of which 2 ms to minimize.
[2024-05-21 23:21:06] [INFO ] Deduced a trap composed of 69 places in 70 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 20/224 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 23:21:06] [INFO ] Deduced a trap composed of 60 places in 53 ms of which 2 ms to minimize.
[2024-05-21 23:21:06] [INFO ] Deduced a trap composed of 52 places in 40 ms of which 1 ms to minimize.
[2024-05-21 23:21:06] [INFO ] Deduced a trap composed of 57 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:21:06] [INFO ] Deduced a trap composed of 57 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:21:07] [INFO ] Deduced a trap composed of 68 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:21:07] [INFO ] Deduced a trap composed of 55 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:21:07] [INFO ] Deduced a trap composed of 56 places in 42 ms of which 1 ms to minimize.
[2024-05-21 23:21:07] [INFO ] Deduced a trap composed of 55 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:21:07] [INFO ] Deduced a trap composed of 55 places in 39 ms of which 1 ms to minimize.
[2024-05-21 23:21:07] [INFO ] Deduced a trap composed of 58 places in 42 ms of which 2 ms to minimize.
[2024-05-21 23:21:07] [INFO ] Deduced a trap composed of 57 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:21:07] [INFO ] Deduced a trap composed of 55 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:21:07] [INFO ] Deduced a trap composed of 54 places in 41 ms of which 1 ms to minimize.
[2024-05-21 23:21:07] [INFO ] Deduced a trap composed of 59 places in 79 ms of which 11 ms to minimize.
[2024-05-21 23:21:07] [INFO ] Deduced a trap composed of 64 places in 60 ms of which 1 ms to minimize.
[2024-05-21 23:21:07] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 1 ms to minimize.
[2024-05-21 23:21:07] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 1 ms to minimize.
[2024-05-21 23:21:07] [INFO ] Deduced a trap composed of 58 places in 68 ms of which 2 ms to minimize.
[2024-05-21 23:21:07] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 1 ms to minimize.
[2024-05-21 23:21:07] [INFO ] Deduced a trap composed of 55 places in 54 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/182 variables, 20/244 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 23:21:07] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
[2024-05-21 23:21:08] [INFO ] Deduced a trap composed of 15 places in 22 ms of which 1 ms to minimize.
[2024-05-21 23:21:08] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 2 ms to minimize.
[2024-05-21 23:21:08] [INFO ] Deduced a trap composed of 69 places in 80 ms of which 1 ms to minimize.
[2024-05-21 23:21:08] [INFO ] Deduced a trap composed of 61 places in 45 ms of which 1 ms to minimize.
[2024-05-21 23:21:08] [INFO ] Deduced a trap composed of 62 places in 39 ms of which 2 ms to minimize.
[2024-05-21 23:21:08] [INFO ] Deduced a trap composed of 59 places in 53 ms of which 1 ms to minimize.
[2024-05-21 23:21:08] [INFO ] Deduced a trap composed of 55 places in 38 ms of which 1 ms to minimize.
[2024-05-21 23:21:08] [INFO ] Deduced a trap composed of 66 places in 44 ms of which 1 ms to minimize.
[2024-05-21 23:21:08] [INFO ] Deduced a trap composed of 64 places in 43 ms of which 2 ms to minimize.
[2024-05-21 23:21:08] [INFO ] Deduced a trap composed of 63 places in 52 ms of which 2 ms to minimize.
[2024-05-21 23:21:08] [INFO ] Deduced a trap composed of 60 places in 41 ms of which 1 ms to minimize.
Problem BusinessProcesses-PT-02-ReachabilityCardinality-2024-14 is UNSAT
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (INCLUDED_ONLY) 0/182 variables, 12/256 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/182 variables, 0/256 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 36/218 variables, 8/264 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 36/300 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/218 variables, 1/301 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-21 23:21:08] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-21 23:21:08] [INFO ] Deduced a trap composed of 14 places in 29 ms of which 1 ms to minimize.
[2024-05-21 23:21:08] [INFO ] Deduced a trap composed of 31 places in 51 ms of which 1 ms to minimize.
[2024-05-21 23:21:08] [INFO ] Deduced a trap composed of 28 places in 41 ms of which 10 ms to minimize.
[2024-05-21 23:21:08] [INFO ] Deduced a trap composed of 27 places in 43 ms of which 1 ms to minimize.
[2024-05-21 23:21:08] [INFO ] Deduced a trap composed of 19 places in 25 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/218 variables, 6/307 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/218 variables, 0/307 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 27/245 variables, 12/319 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/245 variables, 27/346 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-21 23:21:09] [INFO ] Deduced a trap composed of 16 places in 20 ms of which 0 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/245 variables, 1/347 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/245 variables, 0/347 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 204/449 variables, 245/592 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/449 variables, 2/594 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-05-21 23:21:09] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 2 ms to minimize.
[2024-05-21 23:21:09] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 0 ms to minimize.
[2024-05-21 23:21:09] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 0 ms to minimize.
[2024-05-21 23:21:09] [INFO ] Deduced a trap composed of 24 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:21:09] [INFO ] Deduced a trap composed of 14 places in 27 ms of which 1 ms to minimize.
[2024-05-21 23:21:09] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/449 variables, 6/600 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/449 variables, 0/600 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/449 variables, 0/600 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 449/449 variables, and 600 constraints, problems are : Problem set: 1 solved, 2 unsolved in 4437 ms.
Refiners :[Domain max(s): 245/245 constraints, Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 245/245 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 65/65 constraints]
After SMT, in 4953ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 151 ms.
Support contains 30 out of 245 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 245/245 places, 204/204 transitions.
Graph (trivial) has 114 edges and 245 vertex of which 7 / 245 are part of one of the 1 SCC in 10 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 230 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 36 rules applied. Total rules applied 38 place count 230 transition count 157
Reduce places removed 35 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 41 rules applied. Total rules applied 79 place count 195 transition count 151
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 85 place count 189 transition count 151
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 85 place count 189 transition count 122
Deduced a syphon composed of 29 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 63 rules applied. Total rules applied 148 place count 155 transition count 122
Discarding 21 places :
Symmetric choice reduction at 3 with 21 rule applications. Total rules 169 place count 134 transition count 101
Iterating global reduction 3 with 21 rules applied. Total rules applied 190 place count 134 transition count 101
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 250 place count 104 transition count 71
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 251 place count 104 transition count 70
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 252 place count 103 transition count 70
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 253 place count 103 transition count 70
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 254 place count 102 transition count 69
Applied a total of 254 rules in 98 ms. Remains 102 /245 variables (removed 143) and now considering 69/204 (removed 135) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 107 ms. Remains : 102/245 places, 69/204 transitions.
RANDOM walk for 40000 steps (741 resets) in 387 ms. (103 steps per ms) remains 1/2 properties
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 22091 steps (105 resets) in 92 ms. (237 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-02-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 6680 ms.

BK_STOP 1716333670212

--------------------
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
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -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 ReachabilityCardinality -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="ReachabilityCardinality"
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 ReachabilityCardinality"
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-171620399600462"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;