Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K 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.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K 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 159K 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-16-ReachabilityFireability-2025-00
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-2025-01
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-2025-02
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-2025-03
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-2025-04
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-2025-05
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-2025-06
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-2025-07
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-2025-08
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-2025-09
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-2025-10
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-2025-11
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-2025-12
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-2025-13
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-2025-14
FORMULA_NAME BusinessProcesses-PT-16-ReachabilityFireability-2025-15

=== Now, execution of the tool begins

BK_START 1748601282082

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-16
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202505121319
[2025-05-30 10:34:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-05-30 10:34:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-30 10:34:45] [INFO ] Load time of PNML (sax parser for PT used): 252 ms
[2025-05-30 10:34:45] [INFO ] Transformed 638 places.
[2025-05-30 10:34:45] [INFO ] Transformed 578 transitions.
[2025-05-30 10:34:45] [INFO ] Found NUPN structural information;
[2025-05-30 10:34:45] [INFO ] Parsed PT model containing 638 places and 578 transitions and 1694 arcs in 521 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 31 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 8 places in 25 ms
Reduce places removed 8 places and 8 transitions.
[2025-05-30 10:34:46] [INFO ] Flatten gal took : 287 ms
RANDOM walk for 40000 steps (269 resets) in 3399 ms. (11 steps per ms) remains 13/16 properties
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-2025-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-2025-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-2025-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-05-30 10:34:46] [INFO ] Flatten gal took : 117 ms
BEST_FIRST walk for 40002 steps (46 resets) in 471 ms. (84 steps per ms) remains 13/13 properties
[2025-05-30 10:34:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality498569761838827924.gal : 94 ms
BEST_FIRST walk for 40004 steps (45 resets) in 241 ms. (165 steps per ms) remains 13/13 properties
[2025-05-30 10:34:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality3022612839367128430.prop : 19 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/ReachabilityCardinality498569761838827924.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality3022612839367128430.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 ...327
BEST_FIRST walk for 40003 steps (50 resets) in 870 ms. (45 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (47 resets) in 196 ms. (203 steps per ms) remains 13/13 properties
Loading property file /tmp/ReachabilityCardinality3022612839367128430.prop.
BEST_FIRST walk for 40004 steps (46 resets) in 1021 ms. (39 steps per ms) remains 13/13 properties
SDD proceeding with computation,13 properties remain. new max is 4
SDD size :1 after 5
BEST_FIRST walk for 40003 steps (47 resets) in 289 ms. (137 steps per ms) remains 13/13 properties
SDD proceeding with computation,13 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,13 properties remain. new max is 16
SDD size :10 after 19
SDD proceeding with computation,13 properties remain. new max is 32
SDD size :19 after 29
BEST_FIRST walk for 40004 steps (46 resets) in 235 ms. (169 steps per ms) remains 13/13 properties
SDD proceeding with computation,13 properties remain. new max is 64
SDD size :29 after 141
SDD proceeding with computation,13 properties remain. new max is 128
SDD size :141 after 279
BEST_FIRST walk for 40004 steps (48 resets) in 334 ms. (119 steps per ms) remains 13/13 properties
SDD proceeding with computation,13 properties remain. new max is 256
SDD size :279 after 2.73815e+14
BEST_FIRST walk for 40003 steps (52 resets) in 419 ms. (95 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (48 resets) in 184 ms. (216 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40004 steps (44 resets) in 722 ms. (55 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (46 resets) in 108 ms. (367 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40003 steps (49 resets) in 116 ms. (341 steps per ms) remains 13/13 properties
// Phase 1: matrix 570 rows 630 cols
[2025-05-30 10:34:48] [INFO ] Computed 100 invariants in 57 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/194 variables, 194/194 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/194 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 343/537 variables, 59/253 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/537 variables, 343/596 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/537 variables, 1/597 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/537 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 6 (OVERLAPS) 6/543 variables, 3/600 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/543 variables, 6/606 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/543 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem BusinessProcesses-PT-16-ReachabilityFireability-2025-01 is UNSAT
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-2025-01 FALSE TECHNIQUES SMT_REFINEMENT
Problem BusinessProcesses-PT-16-ReachabilityFireability-2025-06 is UNSAT
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-2025-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 87/630 variables, 37/643 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/630 variables, 87/730 constraints. Problems are: Problem set: 2 solved, 11 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 630/1200 variables, and 730 constraints, problems are : Problem set: 2 solved, 11 unsolved in 5071 ms.
Refiners :[Domain max(s): 630/630 constraints, Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 38/38 constraints, State Equation: 0/630 constraints, PredecessorRefiner: 13/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 11 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/166 variables, 166/166 constraints. Problems are: Problem set: 2 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/166 variables, 0/166 constraints. Problems are: Problem set: 2 solved, 11 unsolved
Problem BusinessProcesses-PT-16-ReachabilityFireability-2025-11 is UNSAT
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-2025-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 363/529 variables, 59/225 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/529 variables, 363/588 constraints. Problems are: Problem set: 3 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/529 variables, 1/589 constraints. Problems are: Problem set: 3 solved, 10 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:34:55] [INFO ] Deduced a trap composed of 13 places in 346 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:34:55] [INFO ] Deduced a trap composed of 14 places in 291 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:34:55] [INFO ] Deduced a trap composed of 17 places in 319 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:34:56] [INFO ] Deduced a trap composed of 19 places in 320 ms of which 36 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:34:56] [INFO ] Deduced a trap composed of 19 places in 297 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:34:56] [INFO ] Deduced a trap composed of 25 places in 295 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:34:57] [INFO ] Deduced a trap composed of 21 places in 359 ms of which 35 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:34:57] [INFO ] Deduced a trap composed of 27 places in 290 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:34:57] [INFO ] Deduced a trap composed of 28 places in 295 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:34:58] [INFO ] Deduced a trap composed of 38 places in 279 ms of which 51 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:34:58] [INFO ] Deduced a trap composed of 39 places in 329 ms of which 42 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:34:58] [INFO ] Deduced a trap composed of 111 places in 395 ms of which 70 ms to minimize.
SMT process timed out in 10716ms, After SMT, problems are : Problem set: 3 solved, 10 unsolved
Fused 10 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 119 out of 630 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 630/630 places, 570/570 transitions.
Graph (complete) has 1291 edges and 630 vertex of which 624 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.9 ms
Discarding 6 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 624 transition count 511
Reduce places removed 58 places and 0 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Iterating post reduction 1 with 69 rules applied. Total rules applied 128 place count 566 transition count 500
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 139 place count 555 transition count 500
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 114 Pre rules applied. Total rules applied 139 place count 555 transition count 386
Deduced a syphon composed of 114 places in 4 ms
Ensure Unique test removed 11 places
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 3 with 239 rules applied. Total rules applied 378 place count 430 transition count 386
Discarding 70 places :
Symmetric choice reduction at 3 with 70 rule applications. Total rules 448 place count 360 transition count 316
Iterating global reduction 3 with 70 rules applied. Total rules applied 518 place count 360 transition count 316
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 518 place count 360 transition count 312
Deduced a syphon composed of 4 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 528 place count 354 transition count 312
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: 49
Deduced a syphon composed of 49 places in 1 ms
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 3 with 98 rules applied. Total rules applied 626 place count 305 transition count 263
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 627 place count 305 transition count 262
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 629 place count 305 transition count 262
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 630 place count 304 transition count 261
Applied a total of 630 rules in 354 ms. Remains 304 /630 variables (removed 326) and now considering 261/570 (removed 309) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 367 ms. Remains : 304/630 places, 261/570 transitions.
RANDOM walk for 40000 steps (708 resets) in 847 ms. (47 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (151 resets) in 137 ms. (289 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (169 resets) in 300 ms. (132 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (154 resets) in 100 ms. (396 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (152 resets) in 167 ms. (238 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (150 resets) in 155 ms. (256 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (161 resets) in 232 ms. (171 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (151 resets) in 95 ms. (416 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (150 resets) in 302 ms. (132 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (154 resets) in 98 ms. (404 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (161 resets) in 139 ms. (285 steps per ms) remains 10/10 properties
Interrupted probabilistic random walk after 497249 steps, run timeout after 3001 ms. (steps per millisecond=165 ) properties seen :3 out of 10
Probabilistic random walk after 497249 steps, saw 75667 distinct states, run finished after 3008 ms. (steps per millisecond=165 ) properties seen :3
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-2025-07 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-2025-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-2025-00 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 261 rows 304 cols
[2025-05-30 10:35:03] [INFO ] Computed 82 invariants in 21 ms
[2025-05-30 10:35:03] [INFO ] State equation strengthened by 1 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 157/271 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 1/272 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 29/301 variables, 22/82 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/301 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 261/562 variables, 301/383 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/562 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/562 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 3/565 variables, 3/387 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/565 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/565 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 565/565 variables, and 387 constraints, problems are : Problem set: 0 solved, 7 unsolved in 4442 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 304/304 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/114 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 157/271 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/271 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:08] [INFO ] Deduced a trap composed of 14 places in 146 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:08] [INFO ] Deduced a trap composed of 14 places in 163 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:08] [INFO ] Deduced a trap composed of 15 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:08] [INFO ] Deduced a trap composed of 16 places in 140 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:08] [INFO ] Deduced a trap composed of 16 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 10:35:08] [INFO ] Deduced a trap composed of 12 places in 67 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:08] [INFO ] Deduced a trap composed of 16 places in 66 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:08] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:09] [INFO ] Deduced a trap composed of 18 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 10:35:09] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:09] [INFO ] Deduced a trap composed of 19 places in 129 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:09] [INFO ] Deduced a trap composed of 43 places in 135 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:09] [INFO ] Deduced a trap composed of 43 places in 122 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:09] [INFO ] Deduced a trap composed of 21 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:09] [INFO ] Deduced a trap composed of 46 places in 142 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:10] [INFO ] Deduced a trap composed of 15 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 10:35:10] [INFO ] Deduced a trap composed of 17 places in 40 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:10] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:10] [INFO ] Deduced a trap composed of 10 places in 144 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:10] [INFO ] Deduced a trap composed of 39 places in 151 ms of which 10 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/271 variables, 20/79 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:10] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:10] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:10] [INFO ] Deduced a trap composed of 10 places in 133 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:11] [INFO ] Deduced a trap composed of 11 places in 141 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:11] [INFO ] Deduced a trap composed of 11 places in 146 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:11] [INFO ] Deduced a trap composed of 12 places in 148 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:11] [INFO ] Deduced a trap composed of 12 places in 146 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:11] [INFO ] Deduced a trap composed of 47 places in 154 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:11] [INFO ] Deduced a trap composed of 47 places in 150 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:11] [INFO ] Deduced a trap composed of 11 places in 145 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:12] [INFO ] Deduced a trap composed of 48 places in 142 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:12] [INFO ] Deduced a trap composed of 48 places in 146 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:12] [INFO ] Deduced a trap composed of 11 places in 136 ms of which 10 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 13/92 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:12] [INFO ] Deduced a trap composed of 19 places in 179 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:12] [INFO ] Deduced a trap composed of 28 places in 149 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:12] [INFO ] Deduced a trap composed of 45 places in 146 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:13] [INFO ] Deduced a trap composed of 29 places in 156 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:13] [INFO ] Deduced a trap composed of 42 places in 156 ms of which 21 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 5/97 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:13] [INFO ] Deduced a trap composed of 41 places in 146 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:13] [INFO ] Deduced a trap composed of 40 places in 165 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:13] [INFO ] Deduced a trap composed of 42 places in 161 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:14] [INFO ] Deduced a trap composed of 42 places in 160 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:14] [INFO ] Deduced a trap composed of 51 places in 160 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:14] [INFO ] Deduced a trap composed of 51 places in 167 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:14] [INFO ] Deduced a trap composed of 55 places in 143 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:14] [INFO ] Deduced a trap composed of 54 places in 153 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:15] [INFO ] Deduced a trap composed of 59 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 10:35:15] [INFO ] Deduced a trap composed of 57 places in 143 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:15] [INFO ] Deduced a trap composed of 56 places in 150 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:15] [INFO ] Deduced a trap composed of 58 places in 143 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:15] [INFO ] Deduced a trap composed of 57 places in 161 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:15] [INFO ] Deduced a trap composed of 59 places in 158 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:16] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:16] [INFO ] Deduced a trap composed of 41 places in 166 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:16] [INFO ] Deduced a trap composed of 45 places in 136 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:16] [INFO ] Deduced a trap composed of 45 places in 110 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:16] [INFO ] Deduced a trap composed of 42 places in 161 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:16] [INFO ] Deduced a trap composed of 46 places in 189 ms of which 29 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:17] [INFO ] Deduced a trap composed of 57 places in 159 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:17] [INFO ] Deduced a trap composed of 44 places in 112 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:17] [INFO ] Deduced a trap composed of 47 places in 109 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:17] [INFO ] Deduced a trap composed of 43 places in 147 ms of which 22 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:17] [INFO ] Deduced a trap composed of 44 places in 117 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:17] [INFO ] Deduced a trap composed of 42 places in 155 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:17] [INFO ] Deduced a trap composed of 42 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 10:35:18] [INFO ] Deduced a trap composed of 55 places in 143 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:18] [INFO ] Deduced a trap composed of 44 places in 156 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:18] [INFO ] Deduced a trap composed of 43 places in 146 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:18] [INFO ] Deduced a trap composed of 43 places in 149 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:18] [INFO ] Deduced a trap composed of 44 places in 148 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:18] [INFO ] Deduced a trap composed of 45 places in 180 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:19] [INFO ] Deduced a trap composed of 49 places in 144 ms of which 23 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:19] [INFO ] Deduced a trap composed of 46 places in 161 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:19] [INFO ] Deduced a trap composed of 47 places in 159 ms of which 31 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:19] [INFO ] Deduced a trap composed of 51 places in 142 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:19] [INFO ] Deduced a trap composed of 47 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 10:35:19] [INFO ] Deduced a trap composed of 59 places in 154 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:20] [INFO ] Deduced a trap composed of 59 places in 155 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:20] [INFO ] Deduced a trap composed of 59 places in 148 ms of which 27 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:20] [INFO ] Deduced a trap composed of 60 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 10:35:20] [INFO ] Deduced a trap composed of 62 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 10:35:20] [INFO ] Deduced a trap composed of 49 places in 160 ms of which 14 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 20/141 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:21] [INFO ] Deduced a trap composed of 44 places in 136 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:21] [INFO ] Deduced a trap composed of 45 places in 147 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:21] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 29 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:21] [INFO ] Deduced a trap composed of 45 places in 145 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:21] [INFO ] Deduced a trap composed of 46 places in 153 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:21] [INFO ] Deduced a trap composed of 47 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 10:35:22] [INFO ] Deduced a trap composed of 47 places in 197 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:22] [INFO ] Deduced a trap composed of 46 places in 161 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:22] [INFO ] Deduced a trap composed of 51 places in 178 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:22] [INFO ] Deduced a trap composed of 48 places in 192 ms of which 24 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:22] [INFO ] Deduced a trap composed of 48 places in 198 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:23] [INFO ] Deduced a trap composed of 49 places in 152 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:23] [INFO ] Deduced a trap composed of 47 places in 199 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:23] [INFO ] Deduced a trap composed of 49 places in 198 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:23] [INFO ] Deduced a trap composed of 48 places in 203 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:23] [INFO ] Deduced a trap composed of 61 places in 192 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:24] [INFO ] Deduced a trap composed of 62 places in 153 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:24] [INFO ] Deduced a trap composed of 60 places in 156 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:24] [INFO ] Deduced a trap composed of 60 places in 115 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:24] [INFO ] Deduced a trap composed of 60 places in 111 ms of which 16 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 20/161 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 1/272 variables, 1/162 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:25] [INFO ] Deduced a trap composed of 61 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 10:35:25] [INFO ] Deduced a trap composed of 27 places in 68 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:25] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 7 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/272 variables, 3/165 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:25] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 6 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/272 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/272 variables, 0/166 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 29/301 variables, 22/188 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:25] [INFO ] Deduced a trap composed of 26 places in 197 ms of which 34 ms to minimize.
Problem BusinessProcesses-PT-16-ReachabilityFireability-2025-03 is UNSAT
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-2025-03 TRUE TECHNIQUES SMT_REFINEMENT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:26] [INFO ] Deduced a trap composed of 25 places in 89 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:26] [INFO ] Deduced a trap composed of 14 places in 80 ms of which 11 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/301 variables, 3/191 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/301 variables, 0/191 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 261/562 variables, 301/492 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/562 variables, 1/493 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/562 variables, 4/497 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:27] [INFO ] Deduced a trap composed of 26 places in 76 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:27] [INFO ] Deduced a trap composed of 54 places in 266 ms of which 41 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:27] [INFO ] Deduced a trap composed of 53 places in 146 ms of which 28 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:27] [INFO ] Deduced a trap composed of 54 places in 152 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:27] [INFO ] Deduced a trap composed of 55 places in 157 ms of which 25 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:28] [INFO ] Deduced a trap composed of 55 places in 236 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:28] [INFO ] Deduced a trap composed of 56 places in 236 ms of which 37 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:28] [INFO ] Deduced a trap composed of 56 places in 243 ms of which 45 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:29] [INFO ] Deduced a trap composed of 55 places in 245 ms of which 47 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:29] [INFO ] Deduced a trap composed of 56 places in 243 ms of which 43 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:29] [INFO ] Deduced a trap composed of 55 places in 243 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:29] [INFO ] Deduced a trap composed of 42 places in 183 ms of which 30 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:30] [INFO ] Deduced a trap composed of 42 places in 212 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:30] [INFO ] Deduced a trap composed of 43 places in 229 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:30] [INFO ] Deduced a trap composed of 42 places in 217 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:31] [INFO ] Deduced a trap composed of 43 places in 229 ms of which 32 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:31] [INFO ] Deduced a trap composed of 52 places in 245 ms of which 46 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:31] [INFO ] Deduced a trap composed of 51 places in 239 ms of which 40 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:31] [INFO ] Deduced a trap composed of 52 places in 234 ms of which 34 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:32] [INFO ] Deduced a trap composed of 53 places in 149 ms of which 25 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/562 variables, 20/517 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:33] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:33] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:33] [INFO ] Deduced a trap composed of 25 places in 83 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:33] [INFO ] Deduced a trap composed of 9 places in 157 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:33] [INFO ] Deduced a trap composed of 10 places in 163 ms of which 15 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:33] [INFO ] Deduced a trap composed of 13 places in 96 ms of which 6 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/562 variables, 6/523 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:34] [INFO ] Deduced a trap along path composed of 4 places in 52 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:34] [INFO ] Deduced a trap along path composed of 3 places in 53 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:34] [INFO ] Deduced a trap along path composed of 4 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:34] [INFO ] Deduced a trap along path composed of 2 places in 33 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:34] [INFO ] Deduced a trap along path composed of 3 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-30 10:35:34] [INFO ] Deduced a trap along path composed of 5 places in 26 ms of which 1 ms to minimize.
Problem BusinessProcesses-PT-16-ReachabilityFireability-2025-09 is UNSAT
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-2025-09 FALSE TECHNIQUES SMT_REFINEMENT
Problem BusinessProcesses-PT-16-ReachabilityFireability-2025-15 is UNSAT
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-2025-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 23 (INCLUDED_ONLY) 0/562 variables, 6/529 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/562 variables, 0/529 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 25 (OVERLAPS) 3/565 variables, 3/532 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/565 variables, 0/532 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 27 (OVERLAPS) 0/565 variables, 0/532 constraints. Problems are: Problem set: 3 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 565/565 variables, and 532 constraints, problems are : Problem set: 3 solved, 4 unsolved in 28541 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 304/304 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 7/4 constraints, Known Traps: 135/135 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 33046ms problems are : Problem set: 3 solved, 4 unsolved
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-2025-13 FALSE TECHNIQUES PARIKH_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-2025-12 FALSE TECHNIQUES PARIKH_WALK
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-2025-08 TRUE TECHNIQUES PARIKH_WALK
Finished Parikh walk after 145 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=72 )
FORMULA BusinessProcesses-PT-16-ReachabilityFireability-2025-14 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 4 properties in 203 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 51765 ms.

BK_STOP 1748601336543

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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