Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 684K
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K 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 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 195K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 30K 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 192K 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-20-ReachabilityCardinality-2025-00
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2025-01
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2025-02
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2025-03
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2025-04
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2025-05
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2025-06
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2025-07
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2025-08
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2025-09
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2025-10
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2025-11
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2025-12
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2025-13
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2025-14
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748624958912

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-05-30 17:09:21] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 17:09:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 17:09:22] [INFO ] Load time of PNML (sax parser for PT used): 277 ms
[2025-05-30 17:09:22] [INFO ] Transformed 782 places.
[2025-05-30 17:09:22] [INFO ] Transformed 697 transitions.
[2025-05-30 17:09:22] [INFO ] Found NUPN structural information;
[2025-05-30 17:09:22] [INFO ] Parsed PT model containing 782 places and 697 transitions and 2011 arcs in 536 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 55 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 63 places in 35 ms
Reduce places removed 63 places and 59 transitions.
[2025-05-30 17:09:23] [INFO ] Flatten gal took : 289 ms
[2025-05-30 17:09:23] [INFO ] Flatten gal took : 140 ms
RANDOM walk for 40000 steps (196 resets) in 3115 ms. (12 steps per ms) remains 8/16 properties
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2025-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2025-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2025-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2025-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-05-30 17:09:23] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14124546335232804199.gal : 94 ms
BEST_FIRST walk for 40004 steps (35 resets) in 396 ms. (100 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (36 resets) in 269 ms. (148 steps per ms) remains 8/8 properties
[2025-05-30 17:09:23] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality7541801066888273789.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/ReachabilityCardinality14124546335232804199.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality7541801066888273789.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
Loading property file /tmp/ReachabilityCardinality7541801066888273789.prop.
BEST_FIRST walk for 40004 steps (33 resets) in 620 ms. (64 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (42 resets) in 367 ms. (108 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (39 resets) in 589 ms. (67 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (44 resets) in 230 ms. (173 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (33 resets) in 208 ms. (191 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (38 resets) in 307 ms. (129 steps per ms) remains 8/8 properties
// Phase 1: matrix 638 rows 719 cols
[2025-05-30 17:09:24] [INFO ] Computed 121 invariants in 54 ms
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :6 after 7
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :8 after 11
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :11 after 41
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :41 after 81
Excessive predecessor constraint size, skipping predecessor.
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :81 after 248
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :248 after 456
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :456 after 604
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, 0/165 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem BusinessProcesses-PT-20-ReachabilityCardinality-2025-10 is UNSAT
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2025-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem BusinessProcesses-PT-20-ReachabilityCardinality-2025-14 is UNSAT
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2025-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 441/606 variables, 78/243 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/606 variables, 441/684 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/606 variables, 0/684 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 113/719 variables, 43/727 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/719 variables, 113/840 constraints. Problems are: Problem set: 2 solved, 6 unsolved
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :604 after 382835
At refinement iteration 7 (INCLUDED_ONLY) 0/719 variables, 0/840 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 638/1357 variables, 719/1559 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1357 variables, 0/1559 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1357/1357 variables, and 1559 constraints, problems are : Problem set: 2 solved, 6 unsolved in 5047 ms.
Refiners :[Domain max(s): 719/719 constraints, Positive P Invariants (semi-flows): 78/78 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 719/719 constraints, PredecessorRefiner: 8/5 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/116 variables, 116/116 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/116 variables, 0/116 constraints. Problems are: Problem set: 2 solved, 6 unsolved
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :3.61047e+06 after 4.87704e+06
Problem BusinessProcesses-PT-20-ReachabilityCardinality-2025-13 is UNSAT
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2025-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 485/601 variables, 78/194 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/601 variables, 485/679 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 17:09:30] [INFO ] Deduced a trap composed of 15 places in 427 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:31] [INFO ] Deduced a trap composed of 17 places in 413 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,8 properties remain. new max is 8192
SDD size :1.17848e+08 after 1.84874e+08
[2025-05-30 17:09:31] [INFO ] Deduced a trap composed of 18 places in 523 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:32] [INFO ] Deduced a trap composed of 18 places in 405 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:32] [INFO ] Deduced a trap composed of 19 places in 390 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:33] [INFO ] Deduced a trap composed of 19 places in 353 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,8 properties remain. new max is 16384
SDD size :1.84874e+08 after 7.89485e+08
[2025-05-30 17:09:33] [INFO ] Deduced a trap composed of 21 places in 336 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:33] [INFO ] Deduced a trap composed of 23 places in 434 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:34] [INFO ] Deduced a trap composed of 20 places in 320 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:34] [INFO ] Deduced a trap composed of 26 places in 396 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:34] [INFO ] Deduced a trap composed of 27 places in 292 ms of which 42 ms to minimize.
SMT process timed out in 10544ms, After SMT, problems are : Problem set: 3 solved, 5 unsolved
Fused 5 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 103 out of 719 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 719/719 places, 638/638 transitions.
Graph (complete) has 1418 edges and 719 vertex of which 700 are kept as prefixes of interest. Removing 19 places using SCC suffix rule.8 ms
Discarding 19 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 82 transitions
Trivial Post-agglo rules discarded 82 transitions
Performed 82 trivial Post agglomeration. Transition count delta: 82
Iterating post reduction 0 with 82 rules applied. Total rules applied 83 place count 700 transition count 550
Reduce places removed 82 places and 0 transitions.
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Iterating post reduction 1 with 95 rules applied. Total rules applied 178 place count 618 transition count 537
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 191 place count 605 transition count 537
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 110 Pre rules applied. Total rules applied 191 place count 605 transition count 427
Deduced a syphon composed of 110 places in 3 ms
Ensure Unique test removed 13 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 3 with 233 rules applied. Total rules applied 424 place count 482 transition count 427
Discarding 71 places :
Symmetric choice reduction at 3 with 71 rule applications. Total rules 495 place count 411 transition count 356
Iterating global reduction 3 with 71 rules applied. Total rules applied 566 place count 411 transition count 356
Performed 97 Post agglomeration using F-continuation condition.Transition count delta: 97
Deduced a syphon composed of 97 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 196 rules applied. Total rules applied 762 place count 312 transition count 259
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 764 place count 311 transition count 262
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 769 place count 311 transition count 262
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 770 place count 310 transition count 261
Applied a total of 770 rules in 375 ms. Remains 310 /719 variables (removed 409) and now considering 261/638 (removed 377) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 390 ms. Remains : 310/719 places, 261/638 transitions.
RANDOM walk for 40000 steps (586 resets) in 1210 ms. (33 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (96 resets) in 138 ms. (287 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (98 resets) in 172 ms. (231 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (90 resets) in 479 ms. (83 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (113 resets) in 345 ms. (115 steps per ms) remains 3/5 properties
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2025-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (109 resets) in 273 ms. (145 steps per ms) remains 3/3 properties
// Phase 1: matrix 261 rows 310 cols
[2025-05-30 17:09:36] [INFO ] Computed 93 invariants in 13 ms
[2025-05-30 17:09:36] [INFO ] State equation strengthened by 2 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/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 166/265 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1/266 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/266 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 37/303 variables, 27/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/303 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 261/564 variables, 303/394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/564 variables, 2/396 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/564 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 7/571 variables, 7/403 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/571 variables, 2/405 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/571 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/571 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 571/571 variables, and 405 constraints, problems are : Problem set: 0 solved, 3 unsolved in 725 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 310/310 constraints, ReadFeed: 2/2 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/99 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 166/265 variables, 63/63 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 17:09:37] [INFO ] Deduced a trap composed of 5 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:37] [INFO ] Deduced a trap composed of 7 places in 56 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:37] [INFO ] Deduced a trap composed of 7 places in 70 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:37] [INFO ] Deduced a trap composed of 8 places in 66 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:37] [INFO ] Deduced a trap composed of 11 places in 53 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:37] [INFO ] Deduced a trap composed of 10 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 17:09:37] [INFO ] Deduced a trap composed of 12 places in 61 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:37] [INFO ] Deduced a trap composed of 24 places in 128 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:37] [INFO ] Deduced a trap composed of 27 places in 199 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:38] [INFO ] Deduced a trap composed of 13 places in 180 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:38] [INFO ] Deduced a trap composed of 59 places in 148 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:38] [INFO ] Deduced a trap composed of 59 places in 145 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:38] [INFO ] Deduced a trap composed of 17 places in 190 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:38] [INFO ] Deduced a trap composed of 64 places in 154 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:39] [INFO ] Deduced a trap composed of 60 places in 186 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:39] [INFO ] Deduced a trap composed of 60 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 17:09:39] [INFO ] Deduced a trap composed of 63 places in 146 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:39] [INFO ] Deduced a trap composed of 60 places in 147 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:39] [INFO ] Deduced a trap composed of 60 places in 158 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:39] [INFO ] Deduced a trap composed of 26 places in 159 ms of which 27 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/265 variables, 20/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:40] [INFO ] Deduced a trap composed of 62 places in 181 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:40] [INFO ] Deduced a trap composed of 60 places in 145 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:40] [INFO ] Deduced a trap composed of 60 places in 182 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:40] [INFO ] Deduced a trap composed of 61 places in 158 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:40] [INFO ] Deduced a trap composed of 60 places in 146 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:40] [INFO ] Deduced a trap composed of 61 places in 181 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:41] [INFO ] Deduced a trap composed of 62 places in 193 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:41] [INFO ] Deduced a trap composed of 62 places in 152 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:41] [INFO ] Deduced a trap composed of 61 places in 141 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:41] [INFO ] Deduced a trap composed of 63 places in 141 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:41] [INFO ] Deduced a trap composed of 63 places in 183 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:41] [INFO ] Deduced a trap composed of 65 places in 146 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:42] [INFO ] Deduced a trap composed of 68 places in 158 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:42] [INFO ] Deduced a trap composed of 66 places in 144 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:42] [INFO ] Deduced a trap composed of 64 places in 142 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:42] [INFO ] Deduced a trap composed of 60 places in 191 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:42] [INFO ] Deduced a trap composed of 65 places in 148 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:43] [INFO ] Deduced a trap composed of 61 places in 158 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:43] [INFO ] Deduced a trap composed of 62 places in 185 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:43] [INFO ] Deduced a trap composed of 69 places in 149 ms of which 17 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/265 variables, 20/103 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:43] [INFO ] Deduced a trap composed of 62 places in 166 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:43] [INFO ] Deduced a trap composed of 63 places in 117 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:43] [INFO ] Deduced a trap composed of 62 places in 115 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:43] [INFO ] Deduced a trap composed of 61 places in 125 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:44] [INFO ] Deduced a trap composed of 66 places in 115 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:44] [INFO ] Deduced a trap composed of 61 places in 120 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:44] [INFO ] Deduced a trap composed of 62 places in 110 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:44] [INFO ] Deduced a trap composed of 61 places in 129 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:44] [INFO ] Deduced a trap composed of 60 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 17:09:44] [INFO ] Deduced a trap composed of 62 places in 165 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:45] [INFO ] Deduced a trap composed of 63 places in 167 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:45] [INFO ] Deduced a trap composed of 64 places in 118 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:45] [INFO ] Deduced a trap composed of 63 places in 134 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:45] [INFO ] Deduced a trap composed of 61 places in 119 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:45] [INFO ] Deduced a trap composed of 63 places in 130 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:45] [INFO ] Deduced a trap composed of 61 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 17:09:45] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:46] [INFO ] Deduced a trap composed of 67 places in 127 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:46] [INFO ] Deduced a trap composed of 62 places in 122 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:46] [INFO ] Deduced a trap composed of 64 places in 129 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 20/123 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 17:09:46] [INFO ] Deduced a trap composed of 65 places in 139 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:46] [INFO ] Deduced a trap composed of 66 places in 119 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:46] [INFO ] Deduced a trap composed of 65 places in 130 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:46] [INFO ] Deduced a trap composed of 66 places in 120 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:47] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:47] [INFO ] Deduced a trap composed of 66 places in 116 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:47] [INFO ] Deduced a trap composed of 67 places in 125 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:47] [INFO ] Deduced a trap composed of 62 places in 120 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:47] [INFO ] Deduced a trap composed of 65 places in 119 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:47] [INFO ] Deduced a trap composed of 62 places in 124 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:48] [INFO ] Deduced a trap composed of 62 places in 139 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:48] [INFO ] Deduced a trap composed of 65 places in 118 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:48] [INFO ] Deduced a trap composed of 62 places in 114 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:48] [INFO ] Deduced a trap composed of 60 places in 119 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:48] [INFO ] Deduced a trap composed of 63 places in 116 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:48] [INFO ] Deduced a trap composed of 67 places in 117 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:48] [INFO ] Deduced a trap composed of 67 places in 120 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:49] [INFO ] Deduced a trap composed of 65 places in 121 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:49] [INFO ] Deduced a trap composed of 64 places in 119 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:49] [INFO ] Deduced a trap composed of 64 places in 111 ms of which 11 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/265 variables, 20/143 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 17:09:49] [INFO ] Deduced a trap composed of 66 places in 122 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:49] [INFO ] Deduced a trap composed of 66 places in 140 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:49] [INFO ] Deduced a trap composed of 65 places in 129 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:50] [INFO ] Deduced a trap composed of 68 places in 143 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:50] [INFO ] Deduced a trap composed of 64 places in 137 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:50] [INFO ] Deduced a trap composed of 65 places in 138 ms of which 17 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/265 variables, 6/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/265 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 1/266 variables, 1/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/266 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 37/303 variables, 27/177 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 17:09:50] [INFO ] Deduced a trap composed of 21 places in 175 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:51] [INFO ] Deduced a trap composed of 24 places in 163 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:51] [INFO ] Deduced a trap composed of 53 places in 152 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:51] [INFO ] Deduced a trap composed of 53 places in 183 ms of which 25 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 32768
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:51] [INFO ] Deduced a trap composed of 55 places in 183 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD size :7.89485e+08 after 1.1715e+10
[2025-05-30 17:09:51] [INFO ] Deduced a trap composed of 55 places in 187 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:52] [INFO ] Deduced a trap composed of 56 places in 162 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:52] [INFO ] Deduced a trap composed of 56 places in 148 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:52] [INFO ] Deduced a trap composed of 54 places in 140 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:52] [INFO ] Deduced a trap composed of 54 places in 136 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:52] [INFO ] Deduced a trap composed of 54 places in 143 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:52] [INFO ] Deduced a trap composed of 55 places in 146 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:53] [INFO ] Deduced a trap composed of 56 places in 155 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:53] [INFO ] Deduced a trap composed of 57 places in 147 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:53] [INFO ] Deduced a trap composed of 56 places in 149 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:53] [INFO ] Deduced a trap composed of 57 places in 134 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:53] [INFO ] Deduced a trap composed of 57 places in 186 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:54] [INFO ] Deduced a trap composed of 56 places in 134 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:54] [INFO ] Deduced a trap composed of 57 places in 135 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:54] [INFO ] Deduced a trap composed of 56 places in 164 ms of which 22 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/303 variables, 20/197 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 17:09:54] [INFO ] Deduced a trap composed of 17 places in 138 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:54] [INFO ] Deduced a trap composed of 25 places in 152 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:55] [INFO ] Deduced a trap composed of 28 places in 158 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 17:09:55] [INFO ] Deduced a trap composed of 19 places in 32 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/303 variables, 4/201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/303 variables, 0/201 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 261/564 variables, 303/504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/564 variables, 2/506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/564 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 7/571 variables, 7/513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/571 variables, 2/515 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/571 variables, 1/516 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 17:09:56] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 6 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/571 variables, 1/517 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 17:09:56] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 4 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/571 variables, 1/518 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/571 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 0/571 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 571/571 variables, and 518 constraints, problems are : Problem set: 0 solved, 3 unsolved in 20331 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 310/310 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 111/111 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 21109ms problems are : Problem set: 0 solved, 3 unsolved
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2025-15 TRUE TECHNIQUES PARIKH_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2025-12 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 280 ms.
Support contains 38 out of 310 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 310/310 places, 261/261 transitions.
Graph (complete) has 935 edges and 310 vertex of which 307 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 307 transition count 250
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 299 transition count 249
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 19 place count 298 transition count 249
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 24 Pre rules applied. Total rules applied 19 place count 298 transition count 225
Deduced a syphon composed of 24 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 55 rules applied. Total rules applied 74 place count 267 transition count 225
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 81 place count 260 transition count 217
Iterating global reduction 3 with 7 rules applied. Total rules applied 88 place count 260 transition count 217
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 57 rules applied. Total rules applied 145 place count 231 transition count 189
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 149 place count 229 transition count 193
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 150 place count 228 transition count 192
Applied a total of 150 rules in 73 ms. Remains 228 /310 variables (removed 82) and now considering 192/261 (removed 69) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 228/310 places, 192/261 transitions.
RANDOM walk for 40000 steps (1211 resets) in 204 ms. (195 steps per ms) remains 1/1 properties
BEST_FIRST walk for 22077 steps (129 resets) in 121 ms. (180 steps per ms) remains 0/1 properties
FORMULA BusinessProcesses-PT-20-ReachabilityCardinality-2025-08 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 36266 ms.

BK_STOP 1748624997896

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ 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 ReachabilityCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-20"
export BK_EXAMINATION="ReachabilityCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-20, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r030-smll-174853813400158"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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