Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r030-smll-174853813300111.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is BusinessProcesses-PT-14, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-smll-174853813300111
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 584K
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 57K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 156K May 29 14:32 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1748591878921

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-14
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-05-30 07:58:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 07:58:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 07:58:02] [INFO ] Load time of PNML (sax parser for PT used): 237 ms
[2025-05-30 07:58:02] [INFO ] Transformed 624 places.
[2025-05-30 07:58:02] [INFO ] Transformed 564 transitions.
[2025-05-30 07:58:02] [INFO ] Found NUPN structural information;
[2025-05-30 07:58:02] [INFO ] Parsed PT model containing 624 places and 564 transitions and 1657 arcs in 572 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 27 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 24 ms
Reduce places removed 8 places and 8 transitions.
[2025-05-30 07:58:03] [INFO ] Flatten gal took : 270 ms
RANDOM walk for 40000 steps (269 resets) in 3303 ms. (12 steps per ms) remains 9/16 properties
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2025-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2025-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2025-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2025-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2025-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2025-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-05-30 07:58:03] [INFO ] Flatten gal took : 185 ms
BEST_FIRST walk for 40004 steps (44 resets) in 513 ms. (77 steps per ms) remains 9/9 properties
[2025-05-30 07:58:03] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9047930798006680209.gal : 101 ms
BEST_FIRST walk for 40004 steps (45 resets) in 349 ms. (114 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (45 resets) in 97 ms. (408 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (46 resets) in 155 ms. (256 steps per ms) remains 9/9 properties
[2025-05-30 07:58:03] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10893535875792812430.prop : 9 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality9047930798006680209.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10893535875792812430.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40002 steps (46 resets) in 136 ms. (291 steps per ms) remains 9/9 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40004 steps (50 resets) in 419 ms. (95 steps per ms) remains 9/9 properties
Loading property file /tmp/ReachabilityCardinality10893535875792812430.prop.
BEST_FIRST walk for 40003 steps (33 resets) in 172 ms. (231 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (48 resets) in 304 ms. (131 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (49 resets) in 156 ms. (254 steps per ms) remains 9/9 properties
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :10 after 19
// Phase 1: matrix 556 rows 616 cols
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :19 after 29
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :29 after 141
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :141 after 279
[2025-05-30 07:58:04] [INFO ] Computed 99 invariants in 82 ms
Excessive predecessor constraint size, skipping predecessor.
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :279 after 2.73815e+14
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/99 variables, 99/99 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/99 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem BusinessProcesses-PT-14-ReachabilityFireability-2025-07 is UNSAT
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2025-07 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 370/469 variables, 48/147 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/469 variables, 370/517 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/469 variables, 0/517 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 41/510 variables, 12/529 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/510 variables, 41/570 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/510 variables, 0/570 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 106/616 variables, 39/609 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/616 variables, 106/715 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/616 variables, 0/715 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 556/1172 variables, 616/1331 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1172/1172 variables, and 1331 constraints, problems are : Problem set: 1 solved, 8 unsolved in 5112 ms.
Refiners :[Domain max(s): 616/616 constraints, Positive P Invariants (semi-flows): 60/60 constraints, Generalized P Invariants (flows): 39/39 constraints, State Equation: 616/616 constraints, PredecessorRefiner: 9/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 8 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 85/85 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/85 variables, 0/85 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Problem BusinessProcesses-PT-14-ReachabilityFireability-2025-12 is UNSAT
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2025-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 379/464 variables, 48/133 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/464 variables, 379/512 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:10] [INFO ] Deduced a trap composed of 19 places in 293 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:10] [INFO ] Deduced a trap composed of 23 places in 222 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:10] [INFO ] Deduced a trap composed of 28 places in 368 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:11] [INFO ] Deduced a trap composed of 32 places in 121 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:11] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:11] [INFO ] Deduced a trap composed of 30 places in 252 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:11] [INFO ] Deduced a trap composed of 34 places in 72 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:11] [INFO ] Deduced a trap composed of 35 places in 292 ms of which 56 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:12] [INFO ] Deduced a trap composed of 36 places in 111 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:12] [INFO ] Deduced a trap composed of 42 places in 105 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:12] [INFO ] Deduced a trap composed of 44 places in 70 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:12] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:12] [INFO ] Deduced a trap composed of 121 places in 304 ms of which 70 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:13] [INFO ] Deduced a trap composed of 121 places in 352 ms of which 65 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:13] [INFO ] Deduced a trap composed of 121 places in 255 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:13] [INFO ] Deduced a trap composed of 120 places in 272 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:13] [INFO ] Deduced a trap composed of 17 places in 228 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:14] [INFO ] Deduced a trap composed of 121 places in 246 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:14] [INFO ] Deduced a trap composed of 120 places in 303 ms of which 45 ms to minimize.
SMT process timed out in 10490ms, After SMT, problems are : Problem set: 2 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 67 out of 616 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 616/616 places, 556/556 transitions.
Graph (complete) has 1260 edges and 616 vertex of which 610 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.6 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 71 transitions
Trivial Post-agglo rules discarded 71 transitions
Performed 71 trivial Post agglomeration. Transition count delta: 71
Iterating post reduction 0 with 71 rules applied. Total rules applied 72 place count 610 transition count 484
Reduce places removed 71 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 77 rules applied. Total rules applied 149 place count 539 transition count 478
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 155 place count 533 transition count 478
Performed 115 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 115 Pre rules applied. Total rules applied 155 place count 533 transition count 363
Deduced a syphon composed of 115 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 241 rules applied. Total rules applied 396 place count 407 transition count 363
Discarding 66 places :
Symmetric choice reduction at 3 with 66 rule applications. Total rules 462 place count 341 transition count 297
Iterating global reduction 3 with 66 rules applied. Total rules applied 528 place count 341 transition count 297
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 528 place count 341 transition count 295
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 5 rules applied. Total rules applied 533 place count 338 transition count 295
Performed 84 Post agglomeration using F-continuation condition.Transition count delta: 84
Deduced a syphon composed of 84 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 170 rules applied. Total rules applied 703 place count 252 transition count 211
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 704 place count 252 transition count 210
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 705 place count 251 transition count 210
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 709 place count 251 transition count 210
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 710 place count 250 transition count 209
Applied a total of 710 rules in 249 ms. Remains 250 /616 variables (removed 366) and now considering 209/556 (removed 347) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 263 ms. Remains : 250/616 places, 209/556 transitions.
RANDOM walk for 40000 steps (1075 resets) in 723 ms. (55 steps per ms) remains 4/7 properties
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2025-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (167 resets) in 427 ms. (93 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (181 resets) in 94 ms. (421 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (192 resets) in 160 ms. (248 steps per ms) remains 3/4 properties
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2025-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 209 rows 250 cols
[2025-05-30 07:58:15] [INFO ] Computed 80 invariants in 7 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 134/172 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 28/200 variables, 16/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/200 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 37/237 variables, 24/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 209/446 variables, 237/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/446 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 13/459 variables, 13/325 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/459 variables, 5/330 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/459 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/459 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 459/459 variables, and 330 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1656 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 134/172 variables, 35/35 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:17] [INFO ] Deduced a trap composed of 51 places in 125 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:17] [INFO ] Deduced a trap composed of 52 places in 106 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:17] [INFO ] Deduced a trap composed of 51 places in 102 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:17] [INFO ] Deduced a trap composed of 51 places in 109 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:17] [INFO ] Deduced a trap composed of 51 places in 108 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:17] [INFO ] Deduced a trap composed of 53 places in 121 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:18] [INFO ] Deduced a trap composed of 52 places in 130 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:18] [INFO ] Deduced a trap composed of 53 places in 116 ms of which 12 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 8/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 28/200 variables, 16/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 37/237 variables, 24/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:18] [INFO ] Deduced a trap composed of 51 places in 222 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:18] [INFO ] Deduced a trap composed of 50 places in 225 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:18] [INFO ] Deduced a trap composed of 50 places in 176 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:19] [INFO ] Deduced a trap composed of 49 places in 203 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:19] [INFO ] Deduced a trap composed of 50 places in 211 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:19] [INFO ] Deduced a trap composed of 49 places in 192 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:19] [INFO ] Deduced a trap composed of 50 places in 189 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:20] [INFO ] Deduced a trap composed of 51 places in 179 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:20] [INFO ] Deduced a trap composed of 51 places in 161 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:20] [INFO ] Deduced a trap composed of 50 places in 164 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:20] [INFO ] Deduced a trap composed of 51 places in 156 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:20] [INFO ] Deduced a trap composed of 50 places in 232 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:21] [INFO ] Deduced a trap composed of 50 places in 186 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:21] [INFO ] Deduced a trap composed of 51 places in 202 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:21] [INFO ] Deduced a trap composed of 49 places in 238 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:21] [INFO ] Deduced a trap composed of 50 places in 220 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:21] [INFO ] Deduced a trap composed of 50 places in 214 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:22] [INFO ] Deduced a trap composed of 52 places in 237 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:22] [INFO ] Deduced a trap composed of 51 places in 226 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:22] [INFO ] Deduced a trap composed of 51 places in 219 ms of which 27 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 20/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:22] [INFO ] Deduced a trap composed of 48 places in 189 ms of which 21 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/237 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/237 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 209/446 variables, 237/341 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/446 variables, 2/343 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/446 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem BusinessProcesses-PT-14-ReachabilityFireability-2025-14 is UNSAT
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2025-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 13 (OVERLAPS) 13/459 variables, 13/356 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/459 variables, 5/361 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/459 variables, 1/362 constraints. Problems are: Problem set: 1 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 07:58:24] [INFO ] Deduced a trap along path composed of 2 places in 35 ms of which 4 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/459 variables, 1/363 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/459 variables, 0/363 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/459 variables, 0/363 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 459/459 variables, and 363 constraints, problems are : Problem set: 1 solved, 2 unsolved in 7782 ms.
Refiners :[Positive P Invariants (semi-flows): 56/56 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 250/250 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 9469ms problems are : Problem set: 1 solved, 2 unsolved
Finished Parikh walk after 95 steps, including 1 resets, run visited all 2 properties in 4 ms. (steps per millisecond=23 )
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2025-10 FALSE TECHNIQUES PARIKH_WALK
FORMULA BusinessProcesses-PT-14-ReachabilityFireability-2025-00 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 18 ms.
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 23352 ms.

BK_STOP 1748591904939

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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
++ 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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -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-14"
export BK_EXAMINATION="ReachabilityFireability"
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-5832"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-14, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r030-smll-174853813300111"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-14.tgz
mv BusinessProcesses-PT-14 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "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 [ "ReachabilityFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityFireability" != "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 "ReachabilityFireability.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 '' ReachabilityFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityFireability"
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 ;