Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r030-smll-174853813300079.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-10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-smll-174853813300079
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 568K
-rw-r--r-- 1 mcc users 6.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 60K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K 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.7K 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 131K 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-10-ReachabilityFireability-2025-00
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-2025-01
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-2025-02
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-2025-03
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-2025-04
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-2025-05
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-2025-06
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-2025-07
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-2025-08
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-2025-09
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-2025-10
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-2025-11
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-2025-12
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-2025-13
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-2025-14
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1748570814829

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-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-05-30 02:06:57] [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 02:06:57] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 02:06:57] [INFO ] Load time of PNML (sax parser for PT used): 247 ms
[2025-05-30 02:06:57] [INFO ] Transformed 518 places.
[2025-05-30 02:06:57] [INFO ] Transformed 471 transitions.
[2025-05-30 02:06:57] [INFO ] Found NUPN structural information;
[2025-05-30 02:06:58] [INFO ] Parsed PT model containing 518 places and 471 transitions and 1415 arcs in 669 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 41 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (331 resets) in 3028 ms. (13 steps per ms) remains 8/16 properties
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-2025-15 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-2025-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-2025-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-2025-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-2025-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-2025-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-2025-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-05-30 02:06:59] [INFO ] Flatten gal took : 286 ms
BEST_FIRST walk for 40002 steps (60 resets) in 569 ms. (70 steps per ms) remains 8/8 properties
[2025-05-30 02:06:59] [INFO ] Flatten gal took : 203 ms
BEST_FIRST walk for 40002 steps (55 resets) in 749 ms. (53 steps per ms) remains 8/8 properties
[2025-05-30 02:06:59] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17324156335647181366.gal : 82 ms
[2025-05-30 02:06:59] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality1714488361867273716.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/ReachabilityCardinality17324156335647181366.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality1714488361867273716.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
BEST_FIRST walk for 40003 steps (53 resets) in 894 ms. (44 steps per ms) remains 8/8 properties
Loading property file /tmp/ReachabilityCardinality1714488361867273716.prop.
BEST_FIRST walk for 40003 steps (46 resets) in 297 ms. (134 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (58 resets) in 194 ms. (205 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (65 resets) in 190 ms. (209 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :19 after 22
BEST_FIRST walk for 40004 steps (77 resets) in 341 ms. (116 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :22 after 197
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :197 after 391
BEST_FIRST walk for 40003 steps (54 resets) in 223 ms. (178 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :391 after 3.84528e+14
// Phase 1: matrix 471 rows 518 cols
[2025-05-30 02:07:00] [INFO ] Computed 85 invariants in 40 ms
Excessive predecessor constraint size, skipping predecessor.
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/165 variables, 165/165 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/165 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem BusinessProcesses-PT-10-ReachabilityFireability-2025-10 is UNSAT
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-2025-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 272/437 variables, 48/214 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/437 variables, 272/486 constraints. Problems are: Problem set: 1 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 0/486 constraints. Problems are: Problem set: 1 solved, 7 unsolved
Problem BusinessProcesses-PT-10-ReachabilityFireability-2025-03 is UNSAT
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-2025-03 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 81/518 variables, 36/522 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/518 variables, 81/603 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/518 variables, 0/603 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 471/989 variables, 518/1121 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 989/989 variables, and 1121 constraints, problems are : Problem set: 2 solved, 6 unsolved in 5049 ms.
Refiners :[Domain max(s): 518/518 constraints, Positive P Invariants (semi-flows): 48/48 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 518/518 constraints, PredecessorRefiner: 8/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/139 variables, 139/139 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/139 variables, 1/140 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/139 variables, 0/140 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Problem BusinessProcesses-PT-10-ReachabilityFireability-2025-02 is UNSAT
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-2025-02 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 291/430 variables, 47/187 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/430 variables, 291/478 constraints. Problems are: Problem set: 3 solved, 5 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:06] [INFO ] Deduced a trap composed of 8 places in 293 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:06] [INFO ] Deduced a trap composed of 8 places in 225 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:06] [INFO ] Deduced a trap composed of 11 places in 246 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:07] [INFO ] Deduced a trap composed of 15 places in 208 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:07] [INFO ] Deduced a trap composed of 20 places in 185 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:07] [INFO ] Deduced a trap composed of 23 places in 202 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:07] [INFO ] Deduced a trap composed of 24 places in 187 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:07] [INFO ] Deduced a trap composed of 25 places in 229 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:08] [INFO ] Deduced a trap composed of 87 places in 311 ms of which 67 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:08] [INFO ] Deduced a trap composed of 86 places in 231 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:08] [INFO ] Deduced a trap composed of 87 places in 188 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:08] [INFO ] Deduced a trap composed of 87 places in 216 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:09] [INFO ] Deduced a trap composed of 98 places in 202 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:09] [INFO ] Deduced a trap composed of 102 places in 190 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:09] [INFO ] Deduced a trap composed of 85 places in 227 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:09] [INFO ] Deduced a trap composed of 101 places in 214 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:10] [INFO ] Deduced a trap composed of 11 places in 79 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:10] [INFO ] Deduced a trap composed of 19 places in 59 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:10] [INFO ] Deduced a trap composed of 86 places in 189 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:10] [INFO ] Deduced a trap composed of 27 places in 214 ms of which 26 ms to minimize.
SMT process timed out in 10386ms, After SMT, problems are : Problem set: 3 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 137 out of 518 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 518/518 places, 471/471 transitions.
Graph (complete) has 1071 edges and 518 vertex of which 516 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.6 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 516 transition count 439
Reduce places removed 31 places and 0 transitions.
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Iterating post reduction 1 with 40 rules applied. Total rules applied 72 place count 485 transition count 430
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 81 place count 476 transition count 430
Performed 79 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 79 Pre rules applied. Total rules applied 81 place count 476 transition count 351
Deduced a syphon composed of 79 places in 3 ms
Ensure Unique test removed 5 places
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 163 rules applied. Total rules applied 244 place count 392 transition count 351
Discarding 46 places :
Symmetric choice reduction at 3 with 46 rule applications. Total rules 290 place count 346 transition count 305
Iterating global reduction 3 with 46 rules applied. Total rules applied 336 place count 346 transition count 305
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 44
Deduced a syphon composed of 44 places in 1 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 424 place count 302 transition count 261
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 426 place count 301 transition count 263
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 429 place count 301 transition count 263
Applied a total of 429 rules in 244 ms. Remains 301 /518 variables (removed 217) and now considering 263/471 (removed 208) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 257 ms. Remains : 301/518 places, 263/471 transitions.
RANDOM walk for 40000 steps (595 resets) in 808 ms. (49 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (129 resets) in 344 ms. (115 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (135 resets) in 91 ms. (434 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (148 resets) in 218 ms. (182 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (168 resets) in 328 ms. (121 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (128 resets) in 190 ms. (209 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 658267 steps, run timeout after 3001 ms. (steps per millisecond=219 ) properties seen :3 out of 5
Probabilistic random walk after 658267 steps, saw 96891 distinct states, run finished after 3009 ms. (steps per millisecond=218 ) properties seen :3
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-2025-13 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-2025-12 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-2025-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 263 rows 301 cols
[2025-05-30 02:07:14] [INFO ] Computed 79 invariants in 13 ms
[2025-05-30 02:07:14] [INFO ] State equation strengthened by 1 read => feed constraints.
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/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 153/218 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 16/234 variables, 10/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 65/299 variables, 31/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/299 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 262/561 variables, 299/378 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/561 variables, 1/379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/561 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 3/564 variables, 2/381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/564 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/564 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 564/564 variables, and 381 constraints, problems are : Problem set: 0 solved, 2 unsolved in 677 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 301/301 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/65 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 153/218 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:15] [INFO ] Deduced a trap composed of 6 places in 111 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:15] [INFO ] Deduced a trap composed of 14 places in 96 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:15] [INFO ] Deduced a trap composed of 14 places in 105 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:15] [INFO ] Deduced a trap composed of 53 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:15] [INFO ] Deduced a trap composed of 54 places in 103 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:16] [INFO ] Deduced a trap composed of 53 places in 99 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:16] [INFO ] Deduced a trap composed of 54 places in 102 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:16] [INFO ] Deduced a trap composed of 53 places in 92 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:16] [INFO ] Deduced a trap composed of 53 places in 95 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:16] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:16] [INFO ] Deduced a trap composed of 54 places in 105 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:16] [INFO ] Deduced a trap composed of 54 places in 168 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:16] [INFO ] Deduced a trap composed of 53 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:17] [INFO ] Deduced a trap composed of 54 places in 96 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:17] [INFO ] Deduced a trap composed of 54 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:17] [INFO ] Deduced a trap composed of 58 places in 106 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:17] [INFO ] Deduced a trap composed of 56 places in 95 ms of which 9 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/218 variables, 17/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:17] [INFO ] Deduced a trap composed of 58 places in 99 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:17] [INFO ] Deduced a trap composed of 59 places in 97 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:17] [INFO ] Deduced a trap composed of 59 places in 91 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/218 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:17] [INFO ] Deduced a trap composed of 55 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:17] [INFO ] Deduced a trap composed of 56 places in 105 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:18] [INFO ] Deduced a trap composed of 53 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:18] [INFO ] Deduced a trap composed of 53 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:18] [INFO ] Deduced a trap composed of 56 places in 95 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/218 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:18] [INFO ] Deduced a trap composed of 53 places in 100 ms of which 18 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/218 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:18] [INFO ] Deduced a trap composed of 21 places in 105 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:18] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:18] [INFO ] Deduced a trap composed of 55 places in 95 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:18] [INFO ] Deduced a trap composed of 54 places in 97 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:18] [INFO ] Deduced a trap composed of 54 places in 99 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:19] [INFO ] Deduced a trap composed of 54 places in 93 ms of which 10 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/218 variables, 6/70 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:19] [INFO ] Deduced a trap composed of 58 places in 99 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:19] [INFO ] Deduced a trap composed of 56 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:19] [INFO ] Deduced a trap composed of 58 places in 97 ms of which 9 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/218 variables, 3/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:19] [INFO ] Deduced a trap composed of 54 places in 106 ms of which 19 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/218 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:19] [INFO ] Deduced a trap composed of 57 places in 95 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:19] [INFO ] Deduced a trap composed of 57 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:19] [INFO ] Deduced a trap composed of 58 places in 100 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:20] [INFO ] Deduced a trap composed of 59 places in 91 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:20] [INFO ] Deduced a trap composed of 54 places in 98 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:20] [INFO ] Deduced a trap composed of 54 places in 90 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:20] [INFO ] Deduced a trap composed of 54 places in 90 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:20] [INFO ] Deduced a trap composed of 54 places in 96 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:20] [INFO ] Deduced a trap composed of 56 places in 93 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:20] [INFO ] Deduced a trap composed of 56 places in 98 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:20] [INFO ] Deduced a trap composed of 54 places in 92 ms of which 9 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/218 variables, 11/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/218 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 16/234 variables, 10/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:20] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:20] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:21] [INFO ] Deduced a trap composed of 55 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:21] [INFO ] Deduced a trap composed of 54 places in 92 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:21] [INFO ] Deduced a trap composed of 55 places in 109 ms of which 18 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/234 variables, 5/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:21] [INFO ] Deduced a trap composed of 56 places in 103 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:21] [INFO ] Deduced a trap composed of 56 places in 108 ms of which 15 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/234 variables, 2/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/234 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem BusinessProcesses-PT-10-ReachabilityFireability-2025-04 is UNSAT
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-2025-04 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 15 (OVERLAPS) 65/299 variables, 31/133 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:21] [INFO ] Deduced a trap composed of 53 places in 143 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:21] [INFO ] Deduced a trap composed of 10 places in 139 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:22] [INFO ] Deduced a trap composed of 53 places in 147 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:22] [INFO ] Deduced a trap composed of 53 places in 151 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:22] [INFO ] Deduced a trap composed of 53 places in 150 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:22] [INFO ] Deduced a trap composed of 53 places in 159 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:22] [INFO ] Deduced a trap composed of 53 places in 169 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:22] [INFO ] Deduced a trap composed of 53 places in 143 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:23] [INFO ] Deduced a trap composed of 54 places in 148 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:23] [INFO ] Deduced a trap composed of 52 places in 148 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:23] [INFO ] Deduced a trap composed of 55 places in 153 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:23] [INFO ] Deduced a trap composed of 55 places in 154 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:23] [INFO ] Deduced a trap composed of 54 places in 153 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:24] [INFO ] Deduced a trap composed of 54 places in 154 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:24] [INFO ] Deduced a trap composed of 55 places in 153 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:24] [INFO ] Deduced a trap composed of 56 places in 185 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:24] [INFO ] Deduced a trap composed of 56 places in 165 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:24] [INFO ] Deduced a trap composed of 56 places in 166 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:24] [INFO ] Deduced a trap composed of 56 places in 159 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:25] [INFO ] Deduced a trap composed of 56 places in 178 ms of which 17 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/299 variables, 20/153 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:25] [INFO ] Deduced a trap composed of 60 places in 176 ms of which 34 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/299 variables, 1/154 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/299 variables, 0/154 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 262/561 variables, 299/453 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/561 variables, 1/454 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/561 variables, 1/455 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:25] [INFO ] Deduced a trap composed of 38 places in 161 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:26] [INFO ] Deduced a trap composed of 38 places in 241 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:26] [INFO ] Deduced a trap composed of 38 places in 174 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:26] [INFO ] Deduced a trap composed of 39 places in 143 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:26] [INFO ] Deduced a trap composed of 39 places in 132 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:26] [INFO ] Deduced a trap composed of 39 places in 146 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:27] [INFO ] Deduced a trap composed of 39 places in 138 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:27] [INFO ] Deduced a trap composed of 39 places in 156 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:27] [INFO ] Deduced a trap composed of 39 places in 153 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:27] [INFO ] Deduced a trap composed of 39 places in 144 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:27] [INFO ] Deduced a trap composed of 39 places in 151 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:28] [INFO ] Deduced a trap composed of 39 places in 150 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:28] [INFO ] Deduced a trap composed of 57 places in 148 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:28] [INFO ] Deduced a trap composed of 59 places in 152 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:28] [INFO ] Deduced a trap composed of 57 places in 135 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 02:07:28] [INFO ] Deduced a trap composed of 59 places in 153 ms of which 31 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/561 variables, 16/471 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/561 variables, 0/471 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 3/564 variables, 2/473 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/564 variables, 0/473 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/564 variables, 0/473 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 564/564 variables, and 473 constraints, problems are : Problem set: 1 solved, 1 unsolved in 13850 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 301/301 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 91/91 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14568ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 159 ms.
Support contains 20 out of 301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 263/263 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 301 transition count 247
Reduce places removed 16 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 18 rules applied. Total rules applied 34 place count 285 transition count 245
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 36 place count 283 transition count 245
Performed 36 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 36 Pre rules applied. Total rules applied 36 place count 283 transition count 209
Deduced a syphon composed of 36 places in 1 ms
Ensure Unique test removed 6 places
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 114 place count 241 transition count 209
Discarding 16 places :
Symmetric choice reduction at 3 with 16 rule applications. Total rules 130 place count 225 transition count 191
Ensure Unique test removed 1 places
Iterating global reduction 3 with 17 rules applied. Total rules applied 147 place count 224 transition count 191
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 147 place count 224 transition count 190
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 149 place count 223 transition count 190
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: 46
Deduced a syphon composed of 46 places in 1 ms
Ensure Unique test removed 4 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 96 rules applied. Total rules applied 245 place count 173 transition count 144
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 246 place count 173 transition count 143
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 250 place count 171 transition count 162
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 254 place count 171 transition count 162
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 255 place count 170 transition count 161
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 256 place count 169 transition count 161
Applied a total of 256 rules in 83 ms. Remains 169 /301 variables (removed 132) and now considering 161/263 (removed 102) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 84 ms. Remains : 169/301 places, 161/263 transitions.
RANDOM walk for 40000 steps (2714 resets) in 357 ms. (111 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (650 resets) in 203 ms. (196 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 92108 steps, run visited all 1 properties in 312 ms. (steps per millisecond=295 )
Probabilistic random walk after 92108 steps, saw 22160 distinct states, run finished after 317 ms. (steps per millisecond=290 ) properties seen :1
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-2025-14 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_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 32546 ms.

BK_STOP 1748570849971

--------------------
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-10"
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-10, 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-174853813300079"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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