Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K 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.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K 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 110K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K 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 146K 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-12-ReachabilityFireability-2025-00
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2025-01
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2025-02
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2025-03
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2025-04
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2025-05
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2025-06
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2025-07
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2025-08
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2025-09
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2025-10
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2025-11
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2025-12
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2025-13
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2025-14
FORMULA_NAME BusinessProcesses-PT-12-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1748583037136

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-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-05-30 05:30:39] [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 05:30:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 05:30:39] [INFO ] Load time of PNML (sax parser for PT used): 216 ms
[2025-05-30 05:30:39] [INFO ] Transformed 586 places.
[2025-05-30 05:30:39] [INFO ] Transformed 525 transitions.
[2025-05-30 05:30:39] [INFO ] Found NUPN structural information;
[2025-05-30 05:30:39] [INFO ] Parsed PT model containing 586 places and 525 transitions and 1560 arcs in 385 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 22 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 4 places in 14 ms
Reduce places removed 4 places and 4 transitions.
RANDOM walk for 40000 steps (291 resets) in 2400 ms. (16 steps per ms) remains 11/16 properties
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2025-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2025-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2025-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (50 resets) in 847 ms. (47 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (50 resets) in 351 ms. (113 steps per ms) remains 11/11 properties
[2025-05-30 05:30:40] [INFO ] Flatten gal took : 295 ms
[2025-05-30 05:30:40] [INFO ] Flatten gal took : 122 ms
BEST_FIRST walk for 40002 steps (59 resets) in 667 ms. (59 steps per ms) remains 11/11 properties
[2025-05-30 05:30:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2620879625906651050.gal : 56 ms
BEST_FIRST walk for 40002 steps (51 resets) in 180 ms. (221 steps per ms) remains 11/11 properties
[2025-05-30 05:30:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3664408061468139094.prop : 11 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/ReachabilityCardinality2620879625906651050.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3664408061468139094.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (51 resets) in 153 ms. (259 steps per ms) remains 10/11 properties
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2025-04 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK

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 ...328
Loading property file /tmp/ReachabilityCardinality3664408061468139094.prop.
BEST_FIRST walk for 40004 steps (36 resets) in 674 ms. (59 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (50 resets) in 155 ms. (256 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (53 resets) in 135 ms. (294 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (38 resets) in 300 ms. (132 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (51 resets) in 109 ms. (363 steps per ms) remains 10/10 properties
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :6 after 7
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :8 after 11
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :11 after 61
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :61 after 201
BEST_FIRST walk for 40004 steps (52 resets) in 246 ms. (161 steps per ms) remains 10/10 properties
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :201 after 336
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :336 after 381
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :381 after 3788
// Phase 1: matrix 521 rows 582 cols
[2025-05-30 05:30:41] [INFO ] Computed 98 invariants in 49 ms
SDD proceeding with computation,11 properties remain. new max is 2048
SDD size :3788 after 39961
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/152 variables, 152/152 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/152 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem BusinessProcesses-PT-12-ReachabilityFireability-2025-03 is UNSAT
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2025-03 FALSE TECHNIQUES SMT_REFINEMENT
Problem BusinessProcesses-PT-12-ReachabilityFireability-2025-06 is UNSAT
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2025-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 326/478 variables, 53/205 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 326/531 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/478 variables, 0/531 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 5/483 variables, 2/533 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 5/538 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/483 variables, 0/538 constraints. Problems are: Problem set: 2 solved, 8 unsolved
Problem BusinessProcesses-PT-12-ReachabilityFireability-2025-01 is UNSAT
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2025-01 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 99/582 variables, 43/581 constraints. Problems are: Problem set: 3 solved, 7 unsolved
SDD proceeding with computation,11 properties remain. new max is 4096
SDD size :2.8345e+06 after 4.54137e+06
At refinement iteration 9 (INCLUDED_ONLY) 0/582 variables, 99/680 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/582 variables, 0/680 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 521/1103 variables, 582/1262 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1103 variables, 0/1262 constraints. Problems are: Problem set: 3 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1103/1103 variables, and 1262 constraints, problems are : Problem set: 3 solved, 7 unsolved in 5043 ms.
Refiners :[Domain max(s): 582/582 constraints, Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 582/582 constraints, PredecessorRefiner: 10/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 7 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/104 variables, 104/104 constraints. Problems are: Problem set: 3 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/104 variables, 0/104 constraints. Problems are: Problem set: 3 solved, 7 unsolved
Problem BusinessProcesses-PT-12-ReachabilityFireability-2025-12 is UNSAT
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2025-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 326/430 variables, 46/150 constraints. Problems are: Problem set: 4 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/430 variables, 326/476 constraints. Problems are: Problem set: 4 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:47] [INFO ] Deduced a trap composed of 14 places in 222 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:47] [INFO ] Deduced a trap composed of 12 places in 191 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:48] [INFO ] Deduced a trap composed of 15 places in 231 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:48] [INFO ] Deduced a trap composed of 16 places in 358 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:48] [INFO ] Deduced a trap composed of 17 places in 377 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:49] [INFO ] Deduced a trap composed of 18 places in 285 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:49] [INFO ] Deduced a trap composed of 30 places in 272 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:49] [INFO ] Deduced a trap composed of 112 places in 260 ms of which 44 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:50] [INFO ] Deduced a trap composed of 113 places in 318 ms of which 54 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:50] [INFO ] Deduced a trap composed of 114 places in 370 ms of which 63 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:50] [INFO ] Deduced a trap composed of 112 places in 283 ms of which 50 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:51] [INFO ] Deduced a trap composed of 115 places in 366 ms of which 69 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:51] [INFO ] Deduced a trap composed of 115 places in 294 ms of which 74 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:51] [INFO ] Deduced a trap composed of 115 places in 297 ms of which 75 ms to minimize.
SMT process timed out in 10316ms, After SMT, problems are : Problem set: 4 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 81 out of 582 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 582/582 places, 521/521 transitions.
Graph (complete) has 1186 edges and 582 vertex of which 578 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.7 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 578 transition count 462
Reduce places removed 58 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 1 with 63 rules applied. Total rules applied 122 place count 520 transition count 457
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 127 place count 515 transition count 457
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 108 Pre rules applied. Total rules applied 127 place count 515 transition count 349
Deduced a syphon composed of 108 places in 4 ms
Ensure Unique test removed 10 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 3 with 226 rules applied. Total rules applied 353 place count 397 transition count 349
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 413 place count 337 transition count 289
Iterating global reduction 3 with 60 rules applied. Total rules applied 473 place count 337 transition count 289
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 473 place count 337 transition count 288
Deduced a syphon composed of 1 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 476 place count 335 transition count 288
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 2 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 3 with 148 rules applied. Total rules applied 624 place count 261 transition count 214
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 3 with 4 rules applied. Total rules applied 628 place count 261 transition count 214
Applied a total of 628 rules in 303 ms. Remains 261 /582 variables (removed 321) and now considering 214/521 (removed 307) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 327 ms. Remains : 261/582 places, 214/521 transitions.
RANDOM walk for 40000 steps (964 resets) in 835 ms. (47 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (170 resets) in 281 ms. (141 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (174 resets) in 125 ms. (317 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (176 resets) in 134 ms. (296 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (176 resets) in 175 ms. (227 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (172 resets) in 150 ms. (264 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (175 resets) in 233 ms. (170 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 615878 steps, run timeout after 3001 ms. (steps per millisecond=205 ) properties seen :3 out of 6
Probabilistic random walk after 615878 steps, saw 97940 distinct states, run finished after 3008 ms. (steps per millisecond=204 ) properties seen :3
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2025-09 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2025-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2025-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 214 rows 261 cols
[2025-05-30 05:30:55] [INFO ] Computed 84 invariants in 8 ms
[2025-05-30 05:30:55] [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/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 110/185 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 22/207 variables, 12/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 51/258 variables, 31/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/258 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/259 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 214/473 variables, 259/343 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/473 variables, 1/344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/473 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 2/475 variables, 2/346 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/475 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/475 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 475/475 variables, and 346 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2151 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 261/261 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/1 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/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 110/185 variables, 40/40 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 05:30:58] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:58] [INFO ] Deduced a trap composed of 5 places in 83 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:58] [INFO ] Deduced a trap composed of 59 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:58] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:58] [INFO ] Deduced a trap composed of 10 places in 82 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:58] [INFO ] Deduced a trap composed of 61 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:58] [INFO ] Deduced a trap composed of 61 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:58] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:59] [INFO ] Deduced a trap composed of 61 places in 75 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:59] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:59] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:59] [INFO ] Deduced a trap composed of 59 places in 90 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:59] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:59] [INFO ] Deduced a trap composed of 59 places in 91 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:59] [INFO ] Deduced a trap composed of 61 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:59] [INFO ] Deduced a trap composed of 60 places in 85 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:59] [INFO ] Deduced a trap composed of 11 places in 119 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:30:59] [INFO ] Deduced a trap composed of 62 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 05:31:00] [INFO ] Deduced a trap composed of 62 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:00] [INFO ] Deduced a trap composed of 62 places in 84 ms of which 8 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/185 variables, 20/60 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 05:31:00] [INFO ] Deduced a trap composed of 60 places in 103 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:00] [INFO ] Deduced a trap composed of 60 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:00] [INFO ] Deduced a trap composed of 60 places in 91 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:00] [INFO ] Deduced a trap composed of 60 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:00] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:00] [INFO ] Deduced a trap composed of 62 places in 123 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:00] [INFO ] Deduced a trap composed of 62 places in 88 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:00] [INFO ] Deduced a trap composed of 61 places in 114 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:01] [INFO ] Deduced a trap composed of 61 places in 90 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:01] [INFO ] Deduced a trap composed of 61 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:01] [INFO ] Deduced a trap composed of 61 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:01] [INFO ] Deduced a trap composed of 60 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:01] [INFO ] Deduced a trap composed of 62 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:01] [INFO ] Deduced a trap composed of 62 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:01] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:01] [INFO ] Deduced a trap composed of 62 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:01] [INFO ] Deduced a trap composed of 61 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:01] [INFO ] Deduced a trap composed of 63 places in 84 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:02] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:02] [INFO ] Deduced a trap composed of 64 places in 98 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/185 variables, 20/80 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 05:31:02] [INFO ] Deduced a trap composed of 58 places in 115 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:02] [INFO ] Deduced a trap composed of 59 places in 91 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:02] [INFO ] Deduced a trap composed of 60 places in 94 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:02] [INFO ] Deduced a trap composed of 61 places in 119 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:02] [INFO ] Deduced a trap composed of 61 places in 89 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:02] [INFO ] Deduced a trap composed of 62 places in 80 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:02] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:03] [INFO ] Deduced a trap composed of 61 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:03] [INFO ] Deduced a trap composed of 61 places in 80 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:03] [INFO ] Deduced a trap composed of 62 places in 81 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:03] [INFO ] Deduced a trap composed of 61 places in 83 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:03] [INFO ] Deduced a trap composed of 61 places in 83 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:03] [INFO ] Deduced a trap composed of 61 places in 78 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:03] [INFO ] Deduced a trap composed of 63 places in 90 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:03] [INFO ] Deduced a trap composed of 65 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:03] [INFO ] Deduced a trap composed of 63 places in 86 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:03] [INFO ] Deduced a trap composed of 63 places in 89 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:03] [INFO ] Deduced a trap composed of 64 places in 82 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:04] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:04] [INFO ] Deduced a trap composed of 64 places in 87 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/185 variables, 20/100 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 05:31:04] [INFO ] Deduced a trap composed of 64 places in 70 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:04] [INFO ] Deduced a trap composed of 64 places in 85 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:04] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:04] [INFO ] Deduced a trap composed of 61 places in 77 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:04] [INFO ] Deduced a trap composed of 61 places in 79 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:04] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:04] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:04] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:05] [INFO ] Deduced a trap composed of 62 places in 88 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:05] [INFO ] Deduced a trap composed of 62 places in 86 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:05] [INFO ] Deduced a trap composed of 62 places in 83 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:05] [INFO ] Deduced a trap composed of 62 places in 84 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:05] [INFO ] Deduced a trap composed of 63 places in 81 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:05] [INFO ] Deduced a trap composed of 63 places in 82 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:05] [INFO ] Deduced a trap composed of 62 places in 87 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:05] [INFO ] Deduced a trap composed of 65 places in 99 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:05] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:05] [INFO ] Deduced a trap composed of 66 places in 84 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:06] [INFO ] Deduced a trap composed of 66 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 05:31:06] [INFO ] Deduced a trap composed of 66 places in 95 ms of which 15 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/185 variables, 20/120 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 05:31:06] [INFO ] Deduced a trap composed of 66 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 05:31:06] [INFO ] Deduced a trap composed of 62 places in 82 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:06] [INFO ] Deduced a trap composed of 62 places in 80 ms of which 9 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/185 variables, 3/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 22/207 variables, 12/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/207 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 51/258 variables, 31/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/258 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1/259 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/259 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 214/473 variables, 259/426 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/473 variables, 1/427 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/473 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/473 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem BusinessProcesses-PT-12-ReachabilityFireability-2025-00 is UNSAT
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2025-00 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 18 (OVERLAPS) 2/475 variables, 2/430 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 05:31:07] [INFO ] Deduced a trap composed of 60 places in 180 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:07] [INFO ] Deduced a trap composed of 59 places in 144 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:07] [INFO ] Deduced a trap composed of 60 places in 135 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,11 properties remain. new max is 8192
SDD size :4.54137e+06 after 6.26726e+07
[2025-05-30 05:31:08] [INFO ] Deduced a trap composed of 60 places in 178 ms of which 33 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:08] [INFO ] Deduced a trap composed of 61 places in 149 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:08] [INFO ] Deduced a trap composed of 61 places in 218 ms of which 53 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:08] [INFO ] Deduced a trap composed of 61 places in 222 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:09] [INFO ] Deduced a trap composed of 60 places in 227 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 05:31:09] [INFO ] Deduced a trap composed of 62 places in 230 ms of which 47 ms to minimize.
Problem BusinessProcesses-PT-12-ReachabilityFireability-2025-15 is UNSAT
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2025-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 19 (INCLUDED_ONLY) 0/475 variables, 9/439 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/475 variables, 0/439 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/475 variables, 0/439 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 475/475 variables, and 439 constraints, problems are : Problem set: 2 solved, 1 unsolved in 12107 ms.
Refiners :[Positive P Invariants (semi-flows): 52/52 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 261/261 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 92/92 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14301ms problems are : Problem set: 2 solved, 1 unsolved
Parikh walk visited 0 properties in 56 ms.
Support contains 1 out of 261 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 261/261 places, 214/214 transitions.
Graph (trivial) has 74 edges and 261 vertex of which 6 / 261 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 256 transition count 192
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 241 transition count 192
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 31 place count 241 transition count 167
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 89 place count 208 transition count 167
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 100 place count 197 transition count 156
Iterating global reduction 2 with 11 rules applied. Total rules applied 111 place count 197 transition count 156
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 2 with 63 rules applied. Total rules applied 174 place count 164 transition count 126
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 178 place count 162 transition count 147
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 180 place count 162 transition count 145
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 182 place count 160 transition count 145
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 183 place count 160 transition count 145
Applied a total of 183 rules in 82 ms. Remains 160 /261 variables (removed 101) and now considering 145/214 (removed 69) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 160/261 places, 145/214 transitions.
RANDOM walk for 40000 steps (1415 resets) in 922 ms. (43 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (759 resets) in 334 ms. (119 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 249 steps, run visited all 1 properties in 7 ms. (steps per millisecond=35 )
Probabilistic random walk after 249 steps, saw 145 distinct states, run finished after 14 ms. (steps per millisecond=17 ) properties seen :1
FORMULA BusinessProcesses-PT-12-ReachabilityFireability-2025-13 TRUE 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 31705 ms.

BK_STOP 1748583070868

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.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-12"
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-12, 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-174853813300095"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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