Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 7.6K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K 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 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K 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 141K 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-11-ReachabilityCardinality-2025-00
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2025-01
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2025-02
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2025-03
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2025-04
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2025-05
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2025-06
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2025-07
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2025-08
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2025-09
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2025-10
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2025-11
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2025-12
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2025-13
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2025-14
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityCardinality-2025-15

=== Now, execution of the tool begins

BK_START 1748578163885

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-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-05-30 04:09:26] [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 04:09:26] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 04:09:27] [INFO ] Load time of PNML (sax parser for PT used): 247 ms
[2025-05-30 04:09:27] [INFO ] Transformed 567 places.
[2025-05-30 04:09:27] [INFO ] Transformed 508 transitions.
[2025-05-30 04:09:27] [INFO ] Found NUPN structural information;
[2025-05-30 04:09:27] [INFO ] Parsed PT model containing 567 places and 508 transitions and 1512 arcs in 507 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 51 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 7 places in 17 ms
Reduce places removed 7 places and 7 transitions.
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2025-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (301 resets) in 2801 ms. (14 steps per ms) remains 10/14 properties
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2025-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2025-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2025-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2025-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-05-30 04:09:28] [INFO ] Flatten gal took : 243 ms
BEST_FIRST walk for 40003 steps (67 resets) in 977 ms. (40 steps per ms) remains 10/10 properties
[2025-05-30 04:09:28] [INFO ] Flatten gal took : 187 ms
BEST_FIRST walk for 40004 steps (54 resets) in 466 ms. (85 steps per ms) remains 10/10 properties
[2025-05-30 04:09:28] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2012994802113417810.gal : 90 ms
BEST_FIRST walk for 40002 steps (58 resets) in 578 ms. (69 steps per ms) remains 10/10 properties
[2025-05-30 04:09:28] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality88157586451991155.prop : 4 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/ReachabilityCardinality2012994802113417810.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality88157586451991155.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40004 steps (45 resets) in 209 ms. (190 steps per ms) remains 8/10 properties
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2025-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40001 steps (60 resets) in 179 ms. (222 steps per ms) remains 8/8 properties

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...326
Loading property file /tmp/ReachabilityCardinality88157586451991155.prop.
BEST_FIRST walk for 40004 steps (54 resets) in 388 ms. (102 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (52 resets) in 169 ms. (235 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (64 resets) in 394 ms. (101 steps per ms) remains 8/8 properties
SDD proceeding with computation,10 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,10 properties remain. new max is 8
SDD size :5 after 6
BEST_FIRST walk for 40003 steps (58 resets) in 296 ms. (134 steps per ms) remains 8/8 properties
SDD proceeding with computation,10 properties remain. new max is 16
SDD size :6 after 7
SDD proceeding with computation,10 properties remain. new max is 32
SDD size :7 after 11
SDD proceeding with computation,10 properties remain. new max is 64
SDD size :11 after 61
SDD proceeding with computation,10 properties remain. new max is 128
SDD size :61 after 101
SDD proceeding with computation,10 properties remain. new max is 256
SDD size :101 after 353
SDD proceeding with computation,10 properties remain. new max is 512
SDD size :353 after 609
// Phase 1: matrix 501 rows 560 cols
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :609 after 1997
[2025-05-30 04:09:29] [INFO ] Computed 95 invariants in 64 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,10 properties remain. new max is 2048
SDD size :1997 after 41565
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (OVERLAPS) 318/449 variables, 53/184 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/449 variables, 318/502 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/449 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 111/560 variables, 42/544 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/560 variables, 111/655 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/560 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem BusinessProcesses-PT-11-ReachabilityCardinality-2025-08 is UNSAT
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2025-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem BusinessProcesses-PT-11-ReachabilityCardinality-2025-14 is UNSAT
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2025-14 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 501/1061 variables, 560/1215 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1061/1061 variables, and 1215 constraints, problems are : Problem set: 2 solved, 6 unsolved in 5057 ms.
Refiners :[Domain max(s): 560/560 constraints, Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 560/560 constraints, PredecessorRefiner: 8/6 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/109 variables, 109/109 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 0/109 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 326/435 variables, 51/160 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/435 variables, 326/486 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:35] [INFO ] Deduced a trap composed of 10 places in 374 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:36] [INFO ] Deduced a trap composed of 12 places in 364 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:36] [INFO ] Deduced a trap composed of 8 places in 359 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:36] [INFO ] Deduced a trap composed of 13 places in 370 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:37] [INFO ] Deduced a trap composed of 13 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 04:09:37] [INFO ] Deduced a trap composed of 15 places in 286 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:37] [INFO ] Deduced a trap composed of 21 places in 283 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:38] [INFO ] Deduced a trap composed of 22 places in 303 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:38] [INFO ] Deduced a trap composed of 22 places in 371 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:38] [INFO ] Deduced a trap composed of 23 places in 276 ms of which 38 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:39] [INFO ] Deduced a trap composed of 26 places in 404 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:39] [INFO ] Deduced a trap composed of 30 places in 293 ms of which 50 ms to minimize.
SMT process timed out in 10364ms, After SMT, problems are : Problem set: 2 solved, 6 unsolved
Fused 6 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 109 out of 560 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 560/560 places, 501/501 transitions.
Graph (complete) has 1140 edges and 560 vertex of which 557 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.8 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 557 transition count 451
Reduce places removed 49 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 56 rules applied. Total rules applied 106 place count 508 transition count 444
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 113 place count 501 transition count 444
Performed 87 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 87 Pre rules applied. Total rules applied 113 place count 501 transition count 357
Deduced a syphon composed of 87 places in 4 ms
Ensure Unique test removed 7 places
Reduce places removed 94 places and 0 transitions.
Iterating global reduction 3 with 181 rules applied. Total rules applied 294 place count 407 transition count 357
Discarding 49 places :
Symmetric choice reduction at 3 with 49 rule applications. Total rules 343 place count 358 transition count 308
Iterating global reduction 3 with 49 rules applied. Total rules applied 392 place count 358 transition count 308
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 392 place count 358 transition count 306
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 396 place count 356 transition count 306
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 127 rules applied. Total rules applied 523 place count 291 transition count 244
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 524 place count 291 transition count 243
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 525 place count 290 transition count 243
Partial Post-agglomeration rule applied 4 times.
Drop transitions (Partial Post agglomeration) removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 529 place count 290 transition count 243
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 530 place count 289 transition count 242
Applied a total of 530 rules in 357 ms. Remains 289 /560 variables (removed 271) and now considering 242/501 (removed 259) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 373 ms. Remains : 289/560 places, 242/501 transitions.
RANDOM walk for 40000 steps (671 resets) in 1089 ms. (36 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (169 resets) in 405 ms. (98 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (135 resets) in 132 ms. (300 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (159 resets) in 351 ms. (113 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (138 resets) in 277 ms. (143 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (146 resets) in 132 ms. (300 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (173 resets) in 416 ms. (95 steps per ms) remains 6/6 properties
Interrupted probabilistic random walk after 542972 steps, run timeout after 3001 ms. (steps per millisecond=180 ) properties seen :4 out of 6
Probabilistic random walk after 542972 steps, saw 94192 distinct states, run finished after 3009 ms. (steps per millisecond=180 ) properties seen :4
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2025-11 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2025-10 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2025-03 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2025-00 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 242 rows 289 cols
[2025-05-30 04:09:44] [INFO ] Computed 83 invariants in 12 ms
[2025-05-30 04:09:44] [INFO ] State equation strengthened by 4 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/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 164/231 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 23/254 variables, 11/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/254 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 34/288 variables, 27/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/288 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 242/530 variables, 288/371 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 4/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/530 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/531 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/531 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/531 variables, 0/376 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 531/531 variables, and 376 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1521 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 289/289 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 164/231 variables, 44/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/231 variables, 1/45 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:45] [INFO ] Deduced a trap composed of 5 places in 78 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:45] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:45] [INFO ] Deduced a trap composed of 27 places in 52 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:46] [INFO ] Deduced a trap composed of 55 places in 151 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:46] [INFO ] Deduced a trap composed of 56 places in 123 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:46] [INFO ] Deduced a trap composed of 55 places in 131 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:46] [INFO ] Deduced a trap composed of 45 places in 121 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:46] [INFO ] Deduced a trap composed of 14 places in 117 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:46] [INFO ] Deduced a trap composed of 55 places in 118 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:46] [INFO ] Deduced a trap composed of 43 places in 123 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:47] [INFO ] Deduced a trap composed of 58 places in 123 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:47] [INFO ] Deduced a trap composed of 57 places in 123 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:47] [INFO ] Deduced a trap composed of 56 places in 125 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:47] [INFO ] Deduced a trap composed of 58 places in 123 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:47] [INFO ] Deduced a trap composed of 58 places in 132 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:47] [INFO ] Deduced a trap composed of 58 places in 120 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:47] [INFO ] Deduced a trap composed of 59 places in 117 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:48] [INFO ] Deduced a trap composed of 57 places in 124 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:48] [INFO ] Deduced a trap composed of 45 places in 113 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:48] [INFO ] Deduced a trap composed of 46 places in 117 ms of which 11 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/231 variables, 20/65 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:48] [INFO ] Deduced a trap composed of 59 places in 121 ms of which 23 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/231 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:48] [INFO ] Deduced a trap composed of 60 places in 121 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:48] [INFO ] Deduced a trap composed of 49 places in 114 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:48] [INFO ] Deduced a trap composed of 50 places in 121 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:49] [INFO ] Deduced a trap composed of 62 places in 127 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:49] [INFO ] Deduced a trap composed of 62 places in 127 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:49] [INFO ] Deduced a trap composed of 58 places in 191 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:49] [INFO ] Deduced a trap composed of 61 places in 129 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:49] [INFO ] Deduced a trap composed of 47 places in 192 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:49] [INFO ] Deduced a trap composed of 47 places in 114 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:50] [INFO ] Deduced a trap composed of 45 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 04:09:50] [INFO ] Deduced a trap composed of 46 places in 180 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:50] [INFO ] Deduced a trap composed of 48 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 04:09:50] [INFO ] Deduced a trap composed of 47 places in 179 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:50] [INFO ] Deduced a trap composed of 10 places in 136 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:50] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:51] [INFO ] Deduced a trap composed of 46 places in 135 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:51] [INFO ] Deduced a trap composed of 47 places in 122 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:51] [INFO ] Deduced a trap composed of 47 places in 122 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:51] [INFO ] Deduced a trap composed of 45 places in 185 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:51] [INFO ] Deduced a trap composed of 46 places in 186 ms of which 23 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/231 variables, 20/86 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:51] [INFO ] Deduced a trap composed of 48 places in 111 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:52] [INFO ] Deduced a trap composed of 49 places in 124 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:52] [INFO ] Deduced a trap composed of 46 places in 131 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:52] [INFO ] Deduced a trap composed of 48 places in 127 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:52] [INFO ] Deduced a trap composed of 49 places in 202 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:52] [INFO ] Deduced a trap composed of 45 places in 126 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:52] [INFO ] Deduced a trap composed of 28 places in 194 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:53] [INFO ] Deduced a trap composed of 46 places in 186 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:53] [INFO ] Deduced a trap composed of 48 places in 187 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:53] [INFO ] Deduced a trap composed of 49 places in 200 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:53] [INFO ] Deduced a trap composed of 46 places in 129 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:53] [INFO ] Deduced a trap composed of 47 places in 196 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:53] [INFO ] Deduced a trap composed of 49 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 04:09:54] [INFO ] Deduced a trap composed of 50 places in 115 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:54] [INFO ] Deduced a trap composed of 47 places in 112 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:54] [INFO ] Deduced a trap composed of 50 places in 115 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:54] [INFO ] Deduced a trap composed of 53 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 04:09:54] [INFO ] Deduced a trap composed of 56 places in 119 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:54] [INFO ] Deduced a trap composed of 58 places in 120 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:54] [INFO ] Deduced a trap composed of 56 places in 124 ms of which 20 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/231 variables, 20/106 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:55] [INFO ] Deduced a trap composed of 53 places in 140 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:55] [INFO ] Deduced a trap composed of 54 places in 115 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:55] [INFO ] Deduced a trap composed of 57 places in 107 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:55] [INFO ] Deduced a trap composed of 58 places in 126 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:55] [INFO ] Deduced a trap composed of 58 places in 173 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:55] [INFO ] Deduced a trap composed of 55 places in 103 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:55] [INFO ] Deduced a trap composed of 59 places in 114 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:55] [INFO ] Deduced a trap composed of 59 places in 107 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:56] [INFO ] Deduced a trap composed of 57 places in 180 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:56] [INFO ] Deduced a trap composed of 61 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 04:09:56] [INFO ] Deduced a trap composed of 61 places in 161 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:56] [INFO ] Deduced a trap composed of 58 places in 107 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:56] [INFO ] Deduced a trap composed of 62 places in 115 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:56] [INFO ] Deduced a trap composed of 62 places in 171 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:57] [INFO ] Deduced a trap composed of 55 places in 138 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:57] [INFO ] Deduced a trap composed of 55 places in 191 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:57] [INFO ] Deduced a trap composed of 59 places in 107 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:57] [INFO ] Deduced a trap composed of 59 places in 119 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:57] [INFO ] Deduced a trap composed of 56 places in 105 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:57] [INFO ] Deduced a trap composed of 60 places in 104 ms of which 11 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/231 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:57] [INFO ] Deduced a trap composed of 60 places in 119 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:58] [INFO ] Deduced a trap composed of 60 places in 103 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:58] [INFO ] Deduced a trap composed of 58 places in 111 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:58] [INFO ] Deduced a trap composed of 62 places in 109 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:58] [INFO ] Deduced a trap composed of 62 places in 114 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:58] [INFO ] Deduced a trap composed of 62 places in 112 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:58] [INFO ] Deduced a trap composed of 59 places in 109 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:58] [INFO ] Deduced a trap composed of 63 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 04:09:58] [INFO ] Deduced a trap composed of 63 places in 113 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:59] [INFO ] Deduced a trap composed of 60 places in 101 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:59] [INFO ] Deduced a trap composed of 58 places in 124 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:59] [INFO ] Deduced a trap composed of 61 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 04:09:59] [INFO ] Deduced a trap composed of 61 places in 132 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:09:59] [INFO ] Deduced a trap composed of 62 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 04:09:59] [INFO ] Deduced a trap composed of 61 places in 157 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:00] [INFO ] Deduced a trap composed of 61 places in 115 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:00] [INFO ] Deduced a trap composed of 61 places in 139 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:00] [INFO ] Deduced a trap composed of 62 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 04:10:00] [INFO ] Deduced a trap composed of 62 places in 133 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:00] [INFO ] Deduced a trap composed of 63 places in 140 ms of which 18 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/231 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:00] [INFO ] Deduced a trap composed of 8 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:00] [INFO ] Deduced a trap composed of 63 places in 128 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:01] [INFO ] Deduced a trap composed of 63 places in 133 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:01] [INFO ] Deduced a trap composed of 61 places in 138 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:01] [INFO ] Deduced a trap composed of 61 places in 136 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:01] [INFO ] Deduced a trap composed of 61 places in 131 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:01] [INFO ] Deduced a trap composed of 61 places in 137 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:01] [INFO ] Deduced a trap composed of 62 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 04:10:01] [INFO ] Deduced a trap composed of 62 places in 130 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:02] [INFO ] Deduced a trap composed of 62 places in 136 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:02] [INFO ] Deduced a trap composed of 57 places in 131 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:02] [INFO ] Deduced a trap composed of 58 places in 139 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:02] [INFO ] Deduced a trap composed of 61 places in 132 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:02] [INFO ] Deduced a trap composed of 61 places in 139 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:02] [INFO ] Deduced a trap composed of 60 places in 131 ms of which 12 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/231 variables, 15/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/231 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 23/254 variables, 11/172 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:03] [INFO ] Deduced a trap composed of 9 places in 131 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:03] [INFO ] Deduced a trap composed of 44 places in 121 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:03] [INFO ] Deduced a trap composed of 44 places in 124 ms of which 12 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/254 variables, 3/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/254 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem BusinessProcesses-PT-11-ReachabilityCardinality-2025-12 is UNSAT
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2025-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 14 (OVERLAPS) 34/288 variables, 27/202 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:03] [INFO ] Deduced a trap composed of 13 places in 97 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:03] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 5 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/288 variables, 2/204 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/288 variables, 0/204 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 242/530 variables, 288/492 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/530 variables, 4/496 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 04:10:04] [INFO ] Deduced a trap along path composed of 2 places in 40 ms of which 5 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/530 variables, 1/497 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/530 variables, 0/497 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem BusinessProcesses-PT-11-ReachabilityCardinality-2025-06 is UNSAT
FORMULA BusinessProcesses-PT-11-ReachabilityCardinality-2025-06 TRUE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 531/531 variables, and 498 constraints, problems are : Problem set: 2 solved, 0 unsolved in 18662 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 289/289 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 121/121 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 20218ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
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 37720 ms.

BK_STOP 1748578204322

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

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