Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399900607.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.........................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is BusinessProcesses-PT-20, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399900607
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 628K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 36K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Apr 11 16:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 99K Apr 11 16:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 16:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K Apr 11 16:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:31 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:31 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 192K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2024-12
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2024-13
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2024-14
FORMULA_NAME BusinessProcesses-PT-20-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716338279167

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-20
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202405141337
[2024-05-22 00:38:00] [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]
[2024-05-22 00:38:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 00:38:00] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2024-05-22 00:38:00] [INFO ] Transformed 782 places.
[2024-05-22 00:38:00] [INFO ] Transformed 697 transitions.
[2024-05-22 00:38:00] [INFO ] Found NUPN structural information;
[2024-05-22 00:38:00] [INFO ] Parsed PT model containing 782 places and 697 transitions and 2011 arcs in 235 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 15 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 63 places in 12 ms
Reduce places removed 63 places and 59 transitions.
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 00:38:01] [INFO ] Flatten gal took : 142 ms
[2024-05-22 00:38:01] [INFO ] Flatten gal took : 59 ms
RANDOM walk for 40000 steps (204 resets) in 1780 ms. (22 steps per ms) remains 8/15 properties
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2024-05-22 00:38:01] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6286101679160973505.gal : 42 ms
[2024-05-22 00:38:01] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14159521668157318867.prop : 2 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.202405141337/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6286101679160973505.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14159521668157318867.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.202405141337/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality14159521668157318867.prop.
BEST_FIRST walk for 40004 steps (37 resets) in 515 ms. (77 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (36 resets) in 359 ms. (111 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (34 resets) in 217 ms. (183 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 4
SDD size :1 after 6
SDD proceeding with computation,8 properties remain. new max is 8
SDD size :6 after 7
SDD proceeding with computation,8 properties remain. new max is 16
SDD size :7 after 8
SDD proceeding with computation,8 properties remain. new max is 32
SDD size :8 after 11
SDD proceeding with computation,8 properties remain. new max is 64
SDD size :11 after 41
SDD proceeding with computation,8 properties remain. new max is 128
SDD size :41 after 81
SDD proceeding with computation,8 properties remain. new max is 256
SDD size :81 after 248
SDD proceeding with computation,8 properties remain. new max is 512
SDD size :248 after 456
BEST_FIRST walk for 40004 steps (30 resets) in 464 ms. (86 steps per ms) remains 8/8 properties
SDD proceeding with computation,8 properties remain. new max is 1024
SDD size :456 after 604
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :604 after 382835
BEST_FIRST walk for 40004 steps (31 resets) in 739 ms. (54 steps per ms) remains 7/8 properties
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (35 resets) in 188 ms. (211 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (34 resets) in 202 ms. (197 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (36 resets) in 197 ms. (202 steps per ms) remains 7/7 properties
// Phase 1: matrix 638 rows 719 cols
[2024-05-22 00:38:02] [INFO ] Computed 121 invariants in 31 ms
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, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 450/581 variables, 73/204 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/581 variables, 450/654 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/581 variables, 0/654 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 25/606 variables, 5/659 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/606 variables, 25/684 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/606 variables, 0/684 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 113/719 variables, 43/727 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/719 variables, 113/840 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/719 variables, 0/840 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 638/1357 variables, 719/1559 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1357 variables, 0/1559 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 0/1357 variables, 0/1559 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1357/1357 variables, and 1559 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1803 ms.
Refiners :[Domain max(s): 719/719 constraints, Positive P Invariants (semi-flows): 78/78 constraints, Generalized P Invariants (flows): 43/43 constraints, State Equation: 719/719 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/131 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/131 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 450/581 variables, 73/204 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/581 variables, 450/654 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 00:38:04] [INFO ] Deduced a trap composed of 11 places in 182 ms of which 29 ms to minimize.
[2024-05-22 00:38:05] [INFO ] Deduced a trap composed of 22 places in 307 ms of which 4 ms to minimize.
[2024-05-22 00:38:05] [INFO ] Deduced a trap composed of 32 places in 156 ms of which 3 ms to minimize.
[2024-05-22 00:38:05] [INFO ] Deduced a trap composed of 123 places in 145 ms of which 3 ms to minimize.
[2024-05-22 00:38:05] [INFO ] Deduced a trap composed of 54 places in 159 ms of which 3 ms to minimize.
[2024-05-22 00:38:05] [INFO ] Deduced a trap composed of 122 places in 144 ms of which 13 ms to minimize.
[2024-05-22 00:38:05] [INFO ] Deduced a trap composed of 29 places in 139 ms of which 3 ms to minimize.
[2024-05-22 00:38:06] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 3 ms to minimize.
[2024-05-22 00:38:06] [INFO ] Deduced a trap composed of 38 places in 130 ms of which 3 ms to minimize.
[2024-05-22 00:38:06] [INFO ] Deduced a trap composed of 54 places in 216 ms of which 2 ms to minimize.
[2024-05-22 00:38:06] [INFO ] Deduced a trap composed of 129 places in 125 ms of which 3 ms to minimize.
[2024-05-22 00:38:06] [INFO ] Deduced a trap composed of 149 places in 131 ms of which 3 ms to minimize.
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :3.61047e+06 after 4.87704e+06
[2024-05-22 00:38:06] [INFO ] Deduced a trap composed of 130 places in 196 ms of which 3 ms to minimize.
[2024-05-22 00:38:07] [INFO ] Deduced a trap composed of 126 places in 206 ms of which 3 ms to minimize.
[2024-05-22 00:38:07] [INFO ] Deduced a trap composed of 30 places in 143 ms of which 6 ms to minimize.
[2024-05-22 00:38:07] [INFO ] Deduced a trap composed of 128 places in 225 ms of which 2 ms to minimize.
[2024-05-22 00:38:07] [INFO ] Deduced a trap composed of 123 places in 186 ms of which 2 ms to minimize.
[2024-05-22 00:38:08] [INFO ] Deduced a trap composed of 136 places in 261 ms of which 2 ms to minimize.
[2024-05-22 00:38:08] [INFO ] Deduced a trap composed of 126 places in 213 ms of which 3 ms to minimize.
[2024-05-22 00:38:08] [INFO ] Deduced a trap composed of 55 places in 226 ms of which 15 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/581 variables, 20/674 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-05-22 00:38:08] [INFO ] Deduced a trap composed of 123 places in 217 ms of which 12 ms to minimize.
[2024-05-22 00:38:09] [INFO ] Deduced a trap composed of 127 places in 115 ms of which 3 ms to minimize.
[2024-05-22 00:38:09] [INFO ] Deduced a trap composed of 27 places in 169 ms of which 3 ms to minimize.
[2024-05-22 00:38:09] [INFO ] Deduced a trap composed of 133 places in 137 ms of which 3 ms to minimize.
[2024-05-22 00:38:09] [INFO ] Deduced a trap composed of 137 places in 137 ms of which 3 ms to minimize.
SMT process timed out in 7075ms, After SMT, problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 131 out of 719 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 719/719 places, 638/638 transitions.
Graph (complete) has 1418 edges and 719 vertex of which 698 are kept as prefixes of interest. Removing 21 places using SCC suffix rule.3 ms
Discarding 21 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 72 transitions
Trivial Post-agglo rules discarded 72 transitions
Performed 72 trivial Post agglomeration. Transition count delta: 72
Iterating post reduction 0 with 72 rules applied. Total rules applied 73 place count 698 transition count 559
Reduce places removed 72 places and 0 transitions.
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: 17
Iterating post reduction 1 with 89 rules applied. Total rules applied 162 place count 626 transition count 542
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 2 with 17 rules applied. Total rules applied 179 place count 609 transition count 542
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 103 Pre rules applied. Total rules applied 179 place count 609 transition count 439
Deduced a syphon composed of 103 places in 0 ms
Ensure Unique test removed 10 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 3 with 216 rules applied. Total rules applied 395 place count 496 transition count 439
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 456 place count 435 transition count 378
Iterating global reduction 3 with 61 rules applied. Total rules applied 517 place count 435 transition count 378
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 517 place count 435 transition count 377
Deduced a syphon composed of 1 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 3 rules applied. Total rules applied 520 place count 433 transition count 377
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 150 rules applied. Total rules applied 670 place count 357 transition count 303
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 674 place count 355 transition count 308
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 676 place count 355 transition count 308
Applied a total of 676 rules in 196 ms. Remains 355 /719 variables (removed 364) and now considering 308/638 (removed 330) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 218 ms. Remains : 355/719 places, 308/638 transitions.
RANDOM walk for 40000 steps (532 resets) in 1218 ms. (32 steps per ms) remains 6/7 properties
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (96 resets) in 135 ms. (294 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (101 resets) in 146 ms. (272 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (97 resets) in 77 ms. (512 steps per ms) remains 5/6 properties
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (94 resets) in 256 ms. (155 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (100 resets) in 113 ms. (350 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (102 resets) in 126 ms. (314 steps per ms) remains 5/5 properties
[2024-05-22 00:38:10] [INFO ] Flow matrix only has 307 transitions (discarded 1 similar events)
// Phase 1: matrix 307 rows 355 cols
[2024-05-22 00:38:10] [INFO ] Computed 94 invariants in 7 ms
[2024-05-22 00:38:10] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 191/281 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 19/300 variables, 8/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/300 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 50/350 variables, 28/94 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/350 variables, 0/94 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 305/655 variables, 350/444 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/655 variables, 1/445 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/655 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 5/660 variables, 4/449 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/660 variables, 0/449 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 2/662 variables, 1/450 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/662 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/662 variables, 0/450 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 662/662 variables, and 450 constraints, problems are : Problem set: 0 solved, 5 unsolved in 604 ms.
Refiners :[Positive P Invariants (semi-flows): 66/66 constraints, Generalized P Invariants (flows): 28/28 constraints, State Equation: 355/355 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/90 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 191/281 variables, 58/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 00:38:11] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 2 ms to minimize.
[2024-05-22 00:38:11] [INFO ] Deduced a trap composed of 13 places in 61 ms of which 2 ms to minimize.
[2024-05-22 00:38:11] [INFO ] Deduced a trap composed of 15 places in 61 ms of which 2 ms to minimize.
[2024-05-22 00:38:11] [INFO ] Deduced a trap composed of 71 places in 58 ms of which 2 ms to minimize.
[2024-05-22 00:38:11] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:38:11] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 2 ms to minimize.
[2024-05-22 00:38:11] [INFO ] Deduced a trap composed of 62 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:38:11] [INFO ] Deduced a trap composed of 73 places in 58 ms of which 2 ms to minimize.
[2024-05-22 00:38:11] [INFO ] Deduced a trap composed of 74 places in 62 ms of which 5 ms to minimize.
[2024-05-22 00:38:11] [INFO ] Deduced a trap composed of 74 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:38:11] [INFO ] Deduced a trap composed of 70 places in 53 ms of which 1 ms to minimize.
[2024-05-22 00:38:11] [INFO ] Deduced a trap composed of 76 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:38:11] [INFO ] Deduced a trap composed of 75 places in 54 ms of which 2 ms to minimize.
[2024-05-22 00:38:12] [INFO ] Deduced a trap composed of 74 places in 79 ms of which 1 ms to minimize.
[2024-05-22 00:38:12] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 2 ms to minimize.
[2024-05-22 00:38:12] [INFO ] Deduced a trap composed of 73 places in 58 ms of which 1 ms to minimize.
[2024-05-22 00:38:12] [INFO ] Deduced a trap composed of 73 places in 79 ms of which 1 ms to minimize.
[2024-05-22 00:38:12] [INFO ] Deduced a trap composed of 76 places in 54 ms of which 1 ms to minimize.
[2024-05-22 00:38:12] [INFO ] Deduced a trap composed of 77 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:38:12] [INFO ] Deduced a trap composed of 79 places in 57 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 20/78 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 00:38:12] [INFO ] Deduced a trap composed of 8 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:38:12] [INFO ] Deduced a trap composed of 75 places in 61 ms of which 2 ms to minimize.
[2024-05-22 00:38:12] [INFO ] Deduced a trap composed of 77 places in 57 ms of which 2 ms to minimize.
[2024-05-22 00:38:12] [INFO ] Deduced a trap composed of 75 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:38:12] [INFO ] Deduced a trap composed of 81 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:38:12] [INFO ] Deduced a trap composed of 77 places in 55 ms of which 2 ms to minimize.
[2024-05-22 00:38:12] [INFO ] Deduced a trap composed of 72 places in 52 ms of which 2 ms to minimize.
[2024-05-22 00:38:12] [INFO ] Deduced a trap composed of 76 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:38:13] [INFO ] Deduced a trap composed of 76 places in 53 ms of which 2 ms to minimize.
[2024-05-22 00:38:13] [INFO ] Deduced a trap composed of 75 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:38:13] [INFO ] Deduced a trap composed of 78 places in 65 ms of which 9 ms to minimize.
[2024-05-22 00:38:13] [INFO ] Deduced a trap composed of 77 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:38:13] [INFO ] Deduced a trap composed of 75 places in 57 ms of which 2 ms to minimize.
[2024-05-22 00:38:13] [INFO ] Deduced a trap composed of 90 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:38:13] [INFO ] Deduced a trap composed of 75 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:38:13] [INFO ] Deduced a trap composed of 77 places in 68 ms of which 3 ms to minimize.
[2024-05-22 00:38:13] [INFO ] Deduced a trap composed of 77 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:38:13] [INFO ] Deduced a trap composed of 8 places in 30 ms of which 1 ms to minimize.
[2024-05-22 00:38:13] [INFO ] Deduced a trap composed of 8 places in 27 ms of which 1 ms to minimize.
[2024-05-22 00:38:13] [INFO ] Deduced a trap composed of 10 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 20/98 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 00:38:13] [INFO ] Deduced a trap composed of 25 places in 40 ms of which 1 ms to minimize.
[2024-05-22 00:38:13] [INFO ] Deduced a trap composed of 10 places in 65 ms of which 2 ms to minimize.
[2024-05-22 00:38:13] [INFO ] Deduced a trap composed of 19 places in 69 ms of which 2 ms to minimize.
[2024-05-22 00:38:14] [INFO ] Deduced a trap composed of 71 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:38:14] [INFO ] Deduced a trap composed of 73 places in 63 ms of which 1 ms to minimize.
[2024-05-22 00:38:14] [INFO ] Deduced a trap composed of 74 places in 58 ms of which 2 ms to minimize.
[2024-05-22 00:38:14] [INFO ] Deduced a trap composed of 74 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:38:14] [INFO ] Deduced a trap composed of 72 places in 61 ms of which 1 ms to minimize.
[2024-05-22 00:38:14] [INFO ] Deduced a trap composed of 74 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:38:14] [INFO ] Deduced a trap composed of 79 places in 138 ms of which 1 ms to minimize.
[2024-05-22 00:38:14] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 7 ms to minimize.
[2024-05-22 00:38:14] [INFO ] Deduced a trap composed of 77 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:38:14] [INFO ] Deduced a trap composed of 78 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:38:14] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:38:15] [INFO ] Deduced a trap composed of 74 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:38:15] [INFO ] Deduced a trap composed of 74 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:38:15] [INFO ] Deduced a trap composed of 74 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:38:15] [INFO ] Deduced a trap composed of 73 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:38:15] [INFO ] Deduced a trap composed of 75 places in 83 ms of which 1 ms to minimize.
[2024-05-22 00:38:15] [INFO ] Deduced a trap composed of 75 places in 86 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 20/118 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 00:38:15] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:38:15] [INFO ] Deduced a trap composed of 77 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:38:15] [INFO ] Deduced a trap composed of 76 places in 82 ms of which 1 ms to minimize.
[2024-05-22 00:38:16] [INFO ] Deduced a trap composed of 77 places in 98 ms of which 1 ms to minimize.
[2024-05-22 00:38:16] [INFO ] Deduced a trap composed of 72 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:38:16] [INFO ] Deduced a trap composed of 74 places in 88 ms of which 1 ms to minimize.
[2024-05-22 00:38:16] [INFO ] Deduced a trap composed of 73 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:38:16] [INFO ] Deduced a trap composed of 74 places in 66 ms of which 2 ms to minimize.
[2024-05-22 00:38:16] [INFO ] Deduced a trap composed of 77 places in 68 ms of which 1 ms to minimize.
[2024-05-22 00:38:16] [INFO ] Deduced a trap composed of 75 places in 107 ms of which 1 ms to minimize.
[2024-05-22 00:38:16] [INFO ] Deduced a trap composed of 75 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:38:16] [INFO ] Deduced a trap composed of 75 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:38:16] [INFO ] Deduced a trap composed of 77 places in 58 ms of which 2 ms to minimize.
[2024-05-22 00:38:16] [INFO ] Deduced a trap composed of 20 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:38:17] [INFO ] Deduced a trap composed of 78 places in 56 ms of which 1 ms to minimize.
[2024-05-22 00:38:17] [INFO ] Deduced a trap composed of 78 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:38:17] [INFO ] Deduced a trap composed of 76 places in 68 ms of which 2 ms to minimize.
[2024-05-22 00:38:17] [INFO ] Deduced a trap composed of 73 places in 55 ms of which 1 ms to minimize.
[2024-05-22 00:38:17] [INFO ] Deduced a trap composed of 76 places in 71 ms of which 2 ms to minimize.
[2024-05-22 00:38:17] [INFO ] Deduced a trap composed of 73 places in 67 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 20/138 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/281 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 19/300 variables, 8/146 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 00:38:17] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/300 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/300 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 50/350 variables, 28/175 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 00:38:17] [INFO ] Deduced a trap composed of 72 places in 80 ms of which 1 ms to minimize.
[2024-05-22 00:38:17] [INFO ] Deduced a trap composed of 72 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:38:17] [INFO ] Deduced a trap composed of 25 places in 77 ms of which 2 ms to minimize.
[2024-05-22 00:38:17] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:38:17] [INFO ] Deduced a trap composed of 40 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:38:18] [INFO ] Deduced a trap composed of 77 places in 81 ms of which 1 ms to minimize.
[2024-05-22 00:38:18] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:38:18] [INFO ] Deduced a trap composed of 78 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:38:18] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:38:18] [INFO ] Deduced a trap composed of 78 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:38:18] [INFO ] Deduced a trap composed of 75 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:38:18] [INFO ] Deduced a trap composed of 61 places in 90 ms of which 1 ms to minimize.
[2024-05-22 00:38:18] [INFO ] Deduced a trap composed of 65 places in 114 ms of which 2 ms to minimize.
[2024-05-22 00:38:18] [INFO ] Deduced a trap composed of 75 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:38:19] [INFO ] Deduced a trap composed of 67 places in 128 ms of which 3 ms to minimize.
[2024-05-22 00:38:19] [INFO ] Deduced a trap composed of 76 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:38:19] [INFO ] Deduced a trap composed of 75 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:38:19] [INFO ] Deduced a trap composed of 62 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:38:19] [INFO ] Deduced a trap composed of 23 places in 91 ms of which 1 ms to minimize.
[2024-05-22 00:38:19] [INFO ] Deduced a trap composed of 81 places in 92 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/350 variables, 20/195 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 00:38:19] [INFO ] Deduced a trap composed of 65 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:38:19] [INFO ] Deduced a trap composed of 72 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:38:19] [INFO ] Deduced a trap composed of 66 places in 87 ms of which 1 ms to minimize.
[2024-05-22 00:38:20] [INFO ] Deduced a trap composed of 77 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:38:20] [INFO ] Deduced a trap composed of 74 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:38:20] [INFO ] Deduced a trap composed of 69 places in 88 ms of which 2 ms to minimize.
[2024-05-22 00:38:20] [INFO ] Deduced a trap composed of 80 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:38:20] [INFO ] Deduced a trap composed of 87 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:38:20] [INFO ] Deduced a trap composed of 79 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:38:20] [INFO ] Deduced a trap composed of 78 places in 84 ms of which 2 ms to minimize.
[2024-05-22 00:38:20] [INFO ] Deduced a trap composed of 67 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:38:20] [INFO ] Deduced a trap composed of 77 places in 80 ms of which 1 ms to minimize.
[2024-05-22 00:38:20] [INFO ] Deduced a trap composed of 76 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:38:20] [INFO ] Deduced a trap composed of 67 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:38:21] [INFO ] Deduced a trap composed of 60 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:38:21] [INFO ] Deduced a trap composed of 61 places in 83 ms of which 1 ms to minimize.
[2024-05-22 00:38:21] [INFO ] Deduced a trap composed of 80 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:38:21] [INFO ] Deduced a trap composed of 74 places in 78 ms of which 2 ms to minimize.
[2024-05-22 00:38:21] [INFO ] Deduced a trap composed of 76 places in 76 ms of which 2 ms to minimize.
[2024-05-22 00:38:21] [INFO ] Deduced a trap composed of 66 places in 91 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/350 variables, 20/215 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 00:38:21] [INFO ] Deduced a trap composed of 79 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:38:21] [INFO ] Deduced a trap composed of 84 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:38:21] [INFO ] Deduced a trap composed of 78 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:38:21] [INFO ] Deduced a trap composed of 81 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:38:21] [INFO ] Deduced a trap composed of 57 places in 80 ms of which 2 ms to minimize.
[2024-05-22 00:38:22] [INFO ] Deduced a trap composed of 78 places in 75 ms of which 2 ms to minimize.
[2024-05-22 00:38:22] [INFO ] Deduced a trap composed of 77 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:38:22] [INFO ] Deduced a trap composed of 77 places in 143 ms of which 5 ms to minimize.
[2024-05-22 00:38:22] [INFO ] Deduced a trap composed of 61 places in 111 ms of which 1 ms to minimize.
[2024-05-22 00:38:22] [INFO ] Deduced a trap composed of 85 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:38:22] [INFO ] Deduced a trap composed of 76 places in 85 ms of which 1 ms to minimize.
[2024-05-22 00:38:22] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:38:22] [INFO ] Deduced a trap composed of 64 places in 79 ms of which 1 ms to minimize.
[2024-05-22 00:38:22] [INFO ] Deduced a trap composed of 77 places in 135 ms of which 4 ms to minimize.
[2024-05-22 00:38:23] [INFO ] Deduced a trap composed of 79 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:38:23] [INFO ] Deduced a trap composed of 33 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:38:23] [INFO ] Deduced a trap composed of 84 places in 169 ms of which 2 ms to minimize.
[2024-05-22 00:38:23] [INFO ] Deduced a trap composed of 76 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:38:23] [INFO ] Deduced a trap composed of 83 places in 108 ms of which 1 ms to minimize.
[2024-05-22 00:38:23] [INFO ] Deduced a trap composed of 82 places in 217 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/350 variables, 20/235 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 00:38:24] [INFO ] Deduced a trap composed of 77 places in 116 ms of which 4 ms to minimize.
[2024-05-22 00:38:24] [INFO ] Deduced a trap composed of 71 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:38:24] [INFO ] Deduced a trap composed of 77 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:38:24] [INFO ] Deduced a trap composed of 74 places in 101 ms of which 2 ms to minimize.
[2024-05-22 00:38:24] [INFO ] Deduced a trap composed of 73 places in 94 ms of which 1 ms to minimize.
[2024-05-22 00:38:24] [INFO ] Deduced a trap composed of 80 places in 82 ms of which 2 ms to minimize.
[2024-05-22 00:38:24] [INFO ] Deduced a trap composed of 74 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:38:25] [INFO ] Deduced a trap composed of 77 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:38:25] [INFO ] Deduced a trap composed of 78 places in 132 ms of which 4 ms to minimize.
[2024-05-22 00:38:25] [INFO ] Deduced a trap composed of 78 places in 125 ms of which 1 ms to minimize.
[2024-05-22 00:38:25] [INFO ] Deduced a trap composed of 77 places in 108 ms of which 1 ms to minimize.
[2024-05-22 00:38:25] [INFO ] Deduced a trap composed of 70 places in 112 ms of which 2 ms to minimize.
[2024-05-22 00:38:26] [INFO ] Deduced a trap composed of 77 places in 89 ms of which 1 ms to minimize.
[2024-05-22 00:38:26] [INFO ] Deduced a trap composed of 81 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:38:26] [INFO ] Deduced a trap composed of 80 places in 320 ms of which 2 ms to minimize.
[2024-05-22 00:38:26] [INFO ] Deduced a trap composed of 78 places in 129 ms of which 4 ms to minimize.
[2024-05-22 00:38:26] [INFO ] Deduced a trap composed of 83 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:38:27] [INFO ] Deduced a trap composed of 80 places in 129 ms of which 3 ms to minimize.
[2024-05-22 00:38:27] [INFO ] Deduced a trap composed of 81 places in 134 ms of which 3 ms to minimize.
[2024-05-22 00:38:27] [INFO ] Deduced a trap composed of 82 places in 143 ms of which 3 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/350 variables, 20/255 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 00:38:27] [INFO ] Deduced a trap composed of 78 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:38:27] [INFO ] Deduced a trap composed of 66 places in 104 ms of which 1 ms to minimize.
[2024-05-22 00:38:27] [INFO ] Deduced a trap composed of 76 places in 90 ms of which 2 ms to minimize.
[2024-05-22 00:38:27] [INFO ] Deduced a trap composed of 64 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:38:28] [INFO ] Deduced a trap composed of 81 places in 162 ms of which 21 ms to minimize.
[2024-05-22 00:38:28] [INFO ] Deduced a trap composed of 74 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:38:28] [INFO ] Deduced a trap composed of 65 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:38:28] [INFO ] Deduced a trap composed of 67 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:38:28] [INFO ] Deduced a trap composed of 67 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:38:28] [INFO ] Deduced a trap composed of 63 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:38:28] [INFO ] Deduced a trap composed of 62 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:38:28] [INFO ] Deduced a trap composed of 91 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:38:29] [INFO ] Deduced a trap composed of 77 places in 106 ms of which 2 ms to minimize.
[2024-05-22 00:38:29] [INFO ] Deduced a trap composed of 81 places in 155 ms of which 5 ms to minimize.
[2024-05-22 00:38:29] [INFO ] Deduced a trap composed of 84 places in 674 ms of which 3 ms to minimize.
[2024-05-22 00:38:30] [INFO ] Deduced a trap composed of 79 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:38:30] [INFO ] Deduced a trap composed of 78 places in 135 ms of which 3 ms to minimize.
[2024-05-22 00:38:30] [INFO ] Deduced a trap composed of 75 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:38:30] [INFO ] Deduced a trap composed of 81 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:38:30] [INFO ] Deduced a trap composed of 80 places in 106 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/350 variables, 20/275 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 00:38:30] [INFO ] Deduced a trap composed of 87 places in 154 ms of which 5 ms to minimize.
[2024-05-22 00:38:30] [INFO ] Deduced a trap composed of 88 places in 118 ms of which 2 ms to minimize.
[2024-05-22 00:38:31] [INFO ] Deduced a trap composed of 85 places in 133 ms of which 2 ms to minimize.
[2024-05-22 00:38:31] [INFO ] Deduced a trap composed of 82 places in 112 ms of which 3 ms to minimize.
[2024-05-22 00:38:31] [INFO ] Deduced a trap composed of 78 places in 119 ms of which 2 ms to minimize.
[2024-05-22 00:38:31] [INFO ] Deduced a trap composed of 78 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:38:31] [INFO ] Deduced a trap composed of 77 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:38:31] [INFO ] Deduced a trap composed of 90 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:38:31] [INFO ] Deduced a trap composed of 81 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:38:32] [INFO ] Deduced a trap composed of 71 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:38:34] [INFO ] Deduced a trap composed of 75 places in 2097 ms of which 2 ms to minimize.
[2024-05-22 00:38:34] [INFO ] Deduced a trap composed of 82 places in 163 ms of which 2 ms to minimize.
[2024-05-22 00:38:34] [INFO ] Deduced a trap composed of 79 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:38:34] [INFO ] Deduced a trap composed of 82 places in 136 ms of which 2 ms to minimize.
[2024-05-22 00:38:34] [INFO ] Deduced a trap composed of 81 places in 108 ms of which 2 ms to minimize.
[2024-05-22 00:38:35] [INFO ] Deduced a trap composed of 75 places in 152 ms of which 2 ms to minimize.
[2024-05-22 00:38:35] [INFO ] Deduced a trap composed of 78 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:38:35] [INFO ] Deduced a trap composed of 70 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:38:35] [INFO ] Deduced a trap composed of 68 places in 174 ms of which 2 ms to minimize.
[2024-05-22 00:38:36] [INFO ] Deduced a trap composed of 71 places in 174 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/350 variables, 20/295 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-22 00:38:37] [INFO ] Deduced a trap composed of 83 places in 170 ms of which 1 ms to minimize.
[2024-05-22 00:38:37] [INFO ] Deduced a trap composed of 85 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:38:37] [INFO ] Deduced a trap composed of 79 places in 92 ms of which 1 ms to minimize.
[2024-05-22 00:38:37] [INFO ] Deduced a trap composed of 82 places in 150 ms of which 2 ms to minimize.
Problem BusinessProcesses-PT-20-ReachabilityFireability-2024-01 is UNSAT
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
[2024-05-22 00:38:38] [INFO ] Deduced a trap composed of 73 places in 183 ms of which 2 ms to minimize.
[2024-05-22 00:38:38] [INFO ] Deduced a trap composed of 78 places in 146 ms of which 3 ms to minimize.
[2024-05-22 00:38:38] [INFO ] Deduced a trap composed of 78 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:38:38] [INFO ] Deduced a trap composed of 74 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:38:38] [INFO ] Deduced a trap composed of 74 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:38:39] [INFO ] Deduced a trap composed of 80 places in 145 ms of which 2 ms to minimize.
[2024-05-22 00:38:39] [INFO ] Deduced a trap composed of 74 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:38:39] [INFO ] Deduced a trap composed of 39 places in 128 ms of which 2 ms to minimize.
[2024-05-22 00:38:39] [INFO ] Deduced a trap composed of 90 places in 103 ms of which 2 ms to minimize.
[2024-05-22 00:38:39] [INFO ] Deduced a trap composed of 78 places in 149 ms of which 2 ms to minimize.
[2024-05-22 00:38:39] [INFO ] Deduced a trap composed of 73 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:38:39] [INFO ] Deduced a trap composed of 76 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:38:40] [INFO ] Deduced a trap composed of 72 places in 141 ms of which 4 ms to minimize.
[2024-05-22 00:38:40] [INFO ] Deduced a trap composed of 73 places in 146 ms of which 2 ms to minimize.
[2024-05-22 00:38:40] [INFO ] Deduced a trap composed of 83 places in 149 ms of which 2 ms to minimize.
[2024-05-22 00:38:40] [INFO ] Deduced a trap composed of 84 places in 170 ms of which 2 ms to minimize.
Problem BusinessProcesses-PT-20-ReachabilityFireability-2024-01 is UNSAT
At refinement iteration 17 (INCLUDED_ONLY) 0/350 variables, 20/315 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-22 00:38:41] [INFO ] Deduced a trap composed of 19 places in 153 ms of which 2 ms to minimize.
[2024-05-22 00:38:41] [INFO ] Deduced a trap composed of 75 places in 143 ms of which 2 ms to minimize.
[2024-05-22 00:38:41] [INFO ] Deduced a trap composed of 74 places in 195 ms of which 3 ms to minimize.
[2024-05-22 00:38:41] [INFO ] Deduced a trap composed of 79 places in 153 ms of which 2 ms to minimize.
[2024-05-22 00:38:41] [INFO ] Deduced a trap composed of 80 places in 140 ms of which 2 ms to minimize.
[2024-05-22 00:38:41] [INFO ] Deduced a trap composed of 83 places in 117 ms of which 1 ms to minimize.
[2024-05-22 00:38:42] [INFO ] Deduced a trap composed of 75 places in 141 ms of which 2 ms to minimize.
[2024-05-22 00:38:42] [INFO ] Deduced a trap composed of 76 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:38:42] [INFO ] Deduced a trap composed of 78 places in 144 ms of which 3 ms to minimize.
[2024-05-22 00:38:42] [INFO ] Deduced a trap composed of 77 places in 137 ms of which 5 ms to minimize.
[2024-05-22 00:38:42] [INFO ] Deduced a trap composed of 76 places in 148 ms of which 2 ms to minimize.
[2024-05-22 00:38:42] [INFO ] Deduced a trap composed of 81 places in 138 ms of which 4 ms to minimize.
[2024-05-22 00:38:43] [INFO ] Deduced a trap composed of 77 places in 123 ms of which 2 ms to minimize.
[2024-05-22 00:38:43] [INFO ] Deduced a trap composed of 73 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:38:43] [INFO ] Deduced a trap composed of 64 places in 174 ms of which 2 ms to minimize.
[2024-05-22 00:38:43] [INFO ] Deduced a trap composed of 77 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:38:43] [INFO ] Deduced a trap composed of 80 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:38:43] [INFO ] Deduced a trap composed of 80 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:38:43] [INFO ] Deduced a trap composed of 61 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:38:44] [INFO ] Deduced a trap composed of 56 places in 104 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/350 variables, 20/335 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-22 00:38:44] [INFO ] Deduced a trap composed of 76 places in 141 ms of which 1 ms to minimize.
[2024-05-22 00:38:44] [INFO ] Deduced a trap composed of 83 places in 149 ms of which 2 ms to minimize.
[2024-05-22 00:38:44] [INFO ] Deduced a trap composed of 82 places in 110 ms of which 2 ms to minimize.
[2024-05-22 00:38:44] [INFO ] Deduced a trap composed of 82 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:38:45] [INFO ] Deduced a trap composed of 82 places in 147 ms of which 2 ms to minimize.
[2024-05-22 00:38:47] [INFO ] Deduced a trap composed of 55 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:38:47] [INFO ] Deduced a trap composed of 21 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:38:48] [INFO ] Deduced a trap composed of 72 places in 87 ms of which 1 ms to minimize.
[2024-05-22 00:38:48] [INFO ] Deduced a trap composed of 96 places in 105 ms of which 1 ms to minimize.
[2024-05-22 00:38:48] [INFO ] Deduced a trap composed of 65 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:38:48] [INFO ] Deduced a trap composed of 77 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:38:48] [INFO ] Deduced a trap composed of 72 places in 86 ms of which 1 ms to minimize.
[2024-05-22 00:38:48] [INFO ] Deduced a trap composed of 94 places in 111 ms of which 2 ms to minimize.
[2024-05-22 00:38:49] [INFO ] Deduced a trap composed of 80 places in 103 ms of which 1 ms to minimize.
[2024-05-22 00:38:49] [INFO ] Deduced a trap composed of 69 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:38:49] [INFO ] Deduced a trap composed of 68 places in 83 ms of which 1 ms to minimize.
[2024-05-22 00:38:49] [INFO ] Deduced a trap composed of 71 places in 87 ms of which 2 ms to minimize.
[2024-05-22 00:38:49] [INFO ] Deduced a trap composed of 74 places in 100 ms of which 2 ms to minimize.
[2024-05-22 00:38:49] [INFO ] Deduced a trap composed of 75 places in 146 ms of which 4 ms to minimize.
[2024-05-22 00:38:49] [INFO ] Deduced a trap composed of 76 places in 88 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/350 variables, 20/355 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-22 00:38:50] [INFO ] Deduced a trap composed of 80 places in 140 ms of which 1 ms to minimize.
[2024-05-22 00:38:50] [INFO ] Deduced a trap composed of 75 places in 130 ms of which 2 ms to minimize.
[2024-05-22 00:38:50] [INFO ] Deduced a trap composed of 84 places in 170 ms of which 1 ms to minimize.
[2024-05-22 00:38:51] [INFO ] Deduced a trap composed of 75 places in 88 ms of which 1 ms to minimize.
[2024-05-22 00:38:51] [INFO ] Deduced a trap composed of 77 places in 124 ms of which 2 ms to minimize.
[2024-05-22 00:38:51] [INFO ] Deduced a trap composed of 78 places in 121 ms of which 2 ms to minimize.
[2024-05-22 00:38:51] [INFO ] Deduced a trap composed of 80 places in 129 ms of which 2 ms to minimize.
[2024-05-22 00:38:51] [INFO ] Deduced a trap composed of 81 places in 125 ms of which 2 ms to minimize.
[2024-05-22 00:38:51] [INFO ] Deduced a trap composed of 96 places in 126 ms of which 2 ms to minimize.
[2024-05-22 00:38:51] [INFO ] Deduced a trap composed of 86 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:38:52] [INFO ] Deduced a trap composed of 82 places in 91 ms of which 2 ms to minimize.
[2024-05-22 00:38:52] [INFO ] Deduced a trap composed of 78 places in 131 ms of which 1 ms to minimize.
[2024-05-22 00:38:52] [INFO ] Deduced a trap composed of 77 places in 79 ms of which 1 ms to minimize.
[2024-05-22 00:38:52] [INFO ] Deduced a trap composed of 96 places in 82 ms of which 1 ms to minimize.
[2024-05-22 00:38:52] [INFO ] Deduced a trap composed of 73 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:38:52] [INFO ] Deduced a trap composed of 75 places in 126 ms of which 1 ms to minimize.
[2024-05-22 00:38:53] [INFO ] Deduced a trap composed of 82 places in 134 ms of which 2 ms to minimize.
[2024-05-22 00:38:53] [INFO ] Deduced a trap composed of 101 places in 156 ms of which 2 ms to minimize.
[2024-05-22 00:38:53] [INFO ] Deduced a trap composed of 79 places in 83 ms of which 2 ms to minimize.
[2024-05-22 00:38:53] [INFO ] Deduced a trap composed of 83 places in 137 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/350 variables, 20/375 constraints. Problems are: Problem set: 1 solved, 4 unsolved
[2024-05-22 00:38:53] [INFO ] Deduced a trap composed of 96 places in 132 ms of which 2 ms to minimize.
[2024-05-22 00:38:53] [INFO ] Deduced a trap composed of 77 places in 135 ms of which 1 ms to minimize.
[2024-05-22 00:38:54] [INFO ] Deduced a trap composed of 73 places in 86 ms of which 2 ms to minimize.
[2024-05-22 00:38:54] [INFO ] Deduced a trap composed of 99 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:38:54] [INFO ] Deduced a trap composed of 82 places in 109 ms of which 2 ms to minimize.
[2024-05-22 00:38:54] [INFO ] Deduced a trap composed of 79 places in 138 ms of which 2 ms to minimize.
[2024-05-22 00:38:54] [INFO ] Deduced a trap composed of 82 places in 135 ms of which 1 ms to minimize.
[2024-05-22 00:38:54] [INFO ] Deduced a trap composed of 74 places in 135 ms of which 1 ms to minimize.
[2024-05-22 00:38:55] [INFO ] Deduced a trap composed of 69 places in 134 ms of which 1 ms to minimize.
[2024-05-22 00:38:55] [INFO ] Deduced a trap composed of 75 places in 85 ms of which 1 ms to minimize.
[2024-05-22 00:38:55] [INFO ] Deduced a trap composed of 78 places in 117 ms of which 2 ms to minimize.
[2024-05-22 00:38:55] [INFO ] Deduced a trap composed of 71 places in 79 ms of which 1 ms to minimize.
[2024-05-22 00:38:55] [INFO ] Deduced a trap composed of 80 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:38:56] [INFO ] Deduced a trap composed of 85 places in 97 ms of which 2 ms to minimize.
SMT process timed out in 45667ms, After SMT, problems are : Problem set: 1 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 81 out of 355 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 355/355 places, 308/308 transitions.
Graph (complete) has 993 edges and 355 vertex of which 351 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.12 ms
Discarding 4 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 351 transition count 296
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 343 transition count 296
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 17 place count 343 transition count 278
Deduced a syphon composed of 18 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 41 rules applied. Total rules applied 58 place count 320 transition count 278
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 66 place count 312 transition count 269
Iterating global reduction 2 with 8 rules applied. Total rules applied 74 place count 312 transition count 269
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 114 place count 292 transition count 249
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 116 place count 291 transition count 251
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 118 place count 291 transition count 251
Applied a total of 118 rules in 90 ms. Remains 291 /355 variables (removed 64) and now considering 251/308 (removed 57) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 91 ms. Remains : 291/355 places, 251/308 transitions.
RANDOM walk for 40000 steps (872 resets) in 432 ms. (92 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (176 resets) in 160 ms. (248 steps per ms) remains 3/4 properties
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-15 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (163 resets) in 304 ms. (131 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (172 resets) in 121 ms. (327 steps per ms) remains 3/3 properties
[2024-05-22 00:38:56] [INFO ] Flow matrix only has 250 transitions (discarded 1 similar events)
// Phase 1: matrix 250 rows 291 cols
[2024-05-22 00:38:56] [INFO ] Computed 89 invariants in 7 ms
[2024-05-22 00:38:56] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 161/225 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 15/240 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 46/286 variables, 24/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/286 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1/287 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 248/535 variables, 287/376 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/535 variables, 5/381 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/535 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 6/541 variables, 4/385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/541 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/541 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 541/541 variables, and 385 constraints, problems are : Problem set: 0 solved, 3 unsolved in 417 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 291/291 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 161/225 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:38:57] [INFO ] Deduced a trap composed of 12 places in 81 ms of which 1 ms to minimize.
[2024-05-22 00:38:57] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 1 ms to minimize.
[2024-05-22 00:38:57] [INFO ] Deduced a trap composed of 51 places in 101 ms of which 1 ms to minimize.
[2024-05-22 00:38:57] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 1 ms to minimize.
[2024-05-22 00:38:57] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 0 ms to minimize.
[2024-05-22 00:38:57] [INFO ] Deduced a trap composed of 65 places in 107 ms of which 1 ms to minimize.
[2024-05-22 00:38:57] [INFO ] Deduced a trap composed of 50 places in 94 ms of which 1 ms to minimize.
[2024-05-22 00:38:57] [INFO ] Deduced a trap composed of 50 places in 93 ms of which 1 ms to minimize.
[2024-05-22 00:38:57] [INFO ] Deduced a trap composed of 51 places in 105 ms of which 1 ms to minimize.
[2024-05-22 00:38:58] [INFO ] Deduced a trap composed of 53 places in 103 ms of which 1 ms to minimize.
[2024-05-22 00:38:58] [INFO ] Deduced a trap composed of 49 places in 99 ms of which 1 ms to minimize.
[2024-05-22 00:38:58] [INFO ] Deduced a trap composed of 50 places in 97 ms of which 1 ms to minimize.
[2024-05-22 00:38:58] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 13/69 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:38:58] [INFO ] Deduced a trap composed of 69 places in 69 ms of which 1 ms to minimize.
[2024-05-22 00:38:58] [INFO ] Deduced a trap composed of 54 places in 64 ms of which 2 ms to minimize.
[2024-05-22 00:38:58] [INFO ] Deduced a trap composed of 53 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:38:58] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:38:58] [INFO ] Deduced a trap composed of 52 places in 59 ms of which 1 ms to minimize.
[2024-05-22 00:38:58] [INFO ] Deduced a trap composed of 52 places in 62 ms of which 1 ms to minimize.
[2024-05-22 00:38:58] [INFO ] Deduced a trap composed of 58 places in 87 ms of which 1 ms to minimize.
[2024-05-22 00:38:59] [INFO ] Deduced a trap composed of 50 places in 119 ms of which 1 ms to minimize.
[2024-05-22 00:38:59] [INFO ] Deduced a trap composed of 49 places in 60 ms of which 1 ms to minimize.
[2024-05-22 00:38:59] [INFO ] Deduced a trap composed of 53 places in 62 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/225 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 15/240 variables, 8/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:38:59] [INFO ] Deduced a trap composed of 70 places in 123 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/240 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:38:59] [INFO ] Deduced a trap composed of 64 places in 126 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/240 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/240 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 46/286 variables, 24/113 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:38:59] [INFO ] Deduced a trap composed of 69 places in 103 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/286 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/286 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 1/287 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/287 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 248/535 variables, 287/402 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/535 variables, 5/407 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/535 variables, 2/409 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:39:00] [INFO ] Deduced a trap composed of 6 places in 133 ms of which 1 ms to minimize.
[2024-05-22 00:39:00] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:39:00] [INFO ] Deduced a trap composed of 66 places in 144 ms of which 2 ms to minimize.
[2024-05-22 00:39:00] [INFO ] Deduced a trap composed of 66 places in 135 ms of which 1 ms to minimize.
[2024-05-22 00:39:00] [INFO ] Deduced a trap composed of 80 places in 93 ms of which 2 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/535 variables, 5/414 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:39:00] [INFO ] Deduced a trap composed of 63 places in 84 ms of which 1 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/535 variables, 1/415 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/535 variables, 0/415 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 6/541 variables, 4/419 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/541 variables, 1/420 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:39:01] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 1 ms to minimize.
[2024-05-22 00:39:01] [INFO ] Deduced a trap composed of 65 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:39:01] [INFO ] Deduced a trap composed of 66 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:39:01] [INFO ] Deduced a trap composed of 66 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:39:01] [INFO ] Deduced a trap composed of 71 places in 76 ms of which 1 ms to minimize.
[2024-05-22 00:39:01] [INFO ] Deduced a trap composed of 65 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:39:01] [INFO ] Deduced a trap composed of 67 places in 190 ms of which 2 ms to minimize.
[2024-05-22 00:39:02] [INFO ] Deduced a trap composed of 68 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:39:02] [INFO ] Deduced a trap composed of 67 places in 69 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/541 variables, 9/429 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:39:02] [INFO ] Deduced a trap composed of 68 places in 82 ms of which 1 ms to minimize.
[2024-05-22 00:39:02] [INFO ] Deduced a trap composed of 67 places in 122 ms of which 1 ms to minimize.
[2024-05-22 00:39:02] [INFO ] Deduced a trap composed of 67 places in 91 ms of which 1 ms to minimize.
[2024-05-22 00:39:02] [INFO ] Deduced a trap composed of 68 places in 85 ms of which 2 ms to minimize.
[2024-05-22 00:39:02] [INFO ] Deduced a trap composed of 73 places in 105 ms of which 1 ms to minimize.
[2024-05-22 00:39:03] [INFO ] Deduced a trap composed of 69 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:39:03] [INFO ] Deduced a trap composed of 68 places in 87 ms of which 1 ms to minimize.
[2024-05-22 00:39:03] [INFO ] Deduced a trap composed of 66 places in 102 ms of which 3 ms to minimize.
[2024-05-22 00:39:03] [INFO ] Deduced a trap composed of 67 places in 74 ms of which 2 ms to minimize.
[2024-05-22 00:39:03] [INFO ] Deduced a trap composed of 78 places in 124 ms of which 3 ms to minimize.
[2024-05-22 00:39:03] [INFO ] Deduced a trap composed of 72 places in 106 ms of which 1 ms to minimize.
[2024-05-22 00:39:03] [INFO ] Deduced a trap composed of 70 places in 115 ms of which 1 ms to minimize.
[2024-05-22 00:39:03] [INFO ] Deduced a trap composed of 79 places in 107 ms of which 2 ms to minimize.
[2024-05-22 00:39:04] [INFO ] Deduced a trap composed of 75 places in 100 ms of which 3 ms to minimize.
[2024-05-22 00:39:04] [INFO ] Deduced a trap composed of 69 places in 79 ms of which 2 ms to minimize.
[2024-05-22 00:39:04] [INFO ] Deduced a trap composed of 66 places in 98 ms of which 2 ms to minimize.
[2024-05-22 00:39:04] [INFO ] Deduced a trap composed of 75 places in 102 ms of which 1 ms to minimize.
[2024-05-22 00:39:04] [INFO ] Deduced a trap composed of 73 places in 102 ms of which 1 ms to minimize.
[2024-05-22 00:39:04] [INFO ] Deduced a trap composed of 68 places in 70 ms of which 2 ms to minimize.
[2024-05-22 00:39:04] [INFO ] Deduced a trap composed of 72 places in 71 ms of which 2 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/541 variables, 20/449 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 00:39:04] [INFO ] Deduced a trap composed of 66 places in 71 ms of which 1 ms to minimize.
[2024-05-22 00:39:05] [INFO ] Deduced a trap composed of 70 places in 85 ms of which 1 ms to minimize.
[2024-05-22 00:39:05] [INFO ] Deduced a trap composed of 72 places in 89 ms of which 2 ms to minimize.
[2024-05-22 00:39:05] [INFO ] Deduced a trap composed of 71 places in 91 ms of which 1 ms to minimize.
[2024-05-22 00:39:05] [INFO ] Deduced a trap composed of 69 places in 104 ms of which 2 ms to minimize.
[2024-05-22 00:39:05] [INFO ] Deduced a trap composed of 68 places in 120 ms of which 2 ms to minimize.
[2024-05-22 00:39:05] [INFO ] Deduced a trap composed of 67 places in 122 ms of which 2 ms to minimize.
[2024-05-22 00:39:06] [INFO ] Deduced a trap composed of 69 places in 152 ms of which 1 ms to minimize.
[2024-05-22 00:39:06] [INFO ] Deduced a trap composed of 76 places in 81 ms of which 2 ms to minimize.
[2024-05-22 00:39:06] [INFO ] Deduced a trap composed of 75 places in 116 ms of which 2 ms to minimize.
[2024-05-22 00:39:06] [INFO ] Deduced a trap composed of 66 places in 383 ms of which 2 ms to minimize.
[2024-05-22 00:39:06] [INFO ] Deduced a trap composed of 69 places in 88 ms of which 1 ms to minimize.
[2024-05-22 00:39:07] [INFO ] Deduced a trap composed of 80 places in 138 ms of which 1 ms to minimize.
[2024-05-22 00:39:07] [INFO ] Deduced a trap composed of 71 places in 101 ms of which 1 ms to minimize.
[2024-05-22 00:39:07] [INFO ] Deduced a trap composed of 72 places in 94 ms of which 2 ms to minimize.
[2024-05-22 00:39:07] [INFO ] Deduced a trap composed of 73 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:39:07] [INFO ] Deduced a trap composed of 68 places in 99 ms of which 2 ms to minimize.
[2024-05-22 00:39:07] [INFO ] Deduced a trap composed of 73 places in 105 ms of which 2 ms to minimize.
[2024-05-22 00:39:07] [INFO ] Deduced a trap composed of 75 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:39:08] [INFO ] Deduced a trap composed of 9 places in 91 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/541 variables, 20/469 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/541 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 0/541 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 541/541 variables, and 469 constraints, problems are : Problem set: 0 solved, 3 unsolved in 11924 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 291/291 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 81/81 constraints]
After SMT, in 12382ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1541 ms.
Support contains 64 out of 291 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 291/291 places, 251/251 transitions.
Graph (complete) has 900 edges and 291 vertex of which 289 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 289 transition count 248
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 288 transition count 248
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 3 place count 288 transition count 241
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 17 place count 281 transition count 241
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 20 place count 278 transition count 238
Iterating global reduction 2 with 3 rules applied. Total rules applied 23 place count 278 transition count 238
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 39 place count 270 transition count 230
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 270 transition count 230
Applied a total of 40 rules in 86 ms. Remains 270 /291 variables (removed 21) and now considering 230/251 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 86 ms. Remains : 270/291 places, 230/251 transitions.
RANDOM walk for 40000 steps (1055 resets) in 309 ms. (129 steps per ms) remains 2/3 properties
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (212 resets) in 318 ms. (125 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (225 resets) in 156 ms. (254 steps per ms) remains 2/2 properties
[2024-05-22 00:39:10] [INFO ] Flow matrix only has 229 transitions (discarded 1 similar events)
// Phase 1: matrix 229 rows 270 cols
[2024-05-22 00:39:10] [INFO ] Computed 89 invariants in 3 ms
[2024-05-22 00:39:10] [INFO ] State equation strengthened by 5 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 146/209 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 15/224 variables, 8/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/224 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 43/267 variables, 24/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/267 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 1/268 variables, 1/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 229/497 variables, 268/357 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/497 variables, 5/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/497 variables, 0/362 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 2/499 variables, 2/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/499 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/499 variables, 0/364 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 499/499 variables, and 364 constraints, problems are : Problem set: 0 solved, 2 unsolved in 288 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 270/270 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 146/209 variables, 56/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:39:11] [INFO ] Deduced a trap composed of 58 places in 93 ms of which 1 ms to minimize.
[2024-05-22 00:39:11] [INFO ] Deduced a trap composed of 62 places in 48 ms of which 1 ms to minimize.
[2024-05-22 00:39:11] [INFO ] Deduced a trap composed of 57 places in 69 ms of which 1 ms to minimize.
[2024-05-22 00:39:11] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 1 ms to minimize.
[2024-05-22 00:39:11] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:39:11] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:39:11] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/209 variables, 7/63 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:39:12] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 1 ms to minimize.
[2024-05-22 00:39:12] [INFO ] Deduced a trap composed of 63 places in 57 ms of which 1 ms to minimize.
[2024-05-22 00:39:12] [INFO ] Deduced a trap composed of 61 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:39:12] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:39:12] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:39:12] [INFO ] Deduced a trap composed of 62 places in 75 ms of which 1 ms to minimize.
[2024-05-22 00:39:12] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 1 ms to minimize.
[2024-05-22 00:39:12] [INFO ] Deduced a trap composed of 62 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:39:12] [INFO ] Deduced a trap composed of 61 places in 76 ms of which 1 ms to minimize.
[2024-05-22 00:39:12] [INFO ] Deduced a trap composed of 60 places in 65 ms of which 1 ms to minimize.
[2024-05-22 00:39:12] [INFO ] Deduced a trap composed of 58 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:39:13] [INFO ] Deduced a trap composed of 63 places in 78 ms of which 1 ms to minimize.
[2024-05-22 00:39:13] [INFO ] Deduced a trap composed of 60 places in 77 ms of which 1 ms to minimize.
[2024-05-22 00:39:13] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/209 variables, 14/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/209 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 15/224 variables, 8/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/224 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 43/267 variables, 24/109 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-22 00:39:13] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 2 ms to minimize.
[2024-05-22 00:39:13] [INFO ] Deduced a trap composed of 61 places in 94 ms of which 1 ms to minimize.
[2024-05-22 00:39:13] [INFO ] Deduced a trap composed of 62 places in 95 ms of which 2 ms to minimize.
[2024-05-22 00:39:13] [INFO ] Deduced a trap composed of 59 places in 91 ms of which 1 ms to minimize.
[2024-05-22 00:39:13] [INFO ] Deduced a trap composed of 59 places in 93 ms of which 2 ms to minimize.
[2024-05-22 00:39:13] [INFO ] Deduced a trap composed of 57 places in 69 ms of which 2 ms to minimize.
[2024-05-22 00:39:13] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 1 ms to minimize.
[2024-05-22 00:39:14] [INFO ] Deduced a trap composed of 64 places in 93 ms of which 1 ms to minimize.
[2024-05-22 00:39:14] [INFO ] Deduced a trap composed of 60 places in 72 ms of which 2 ms to minimize.
[2024-05-22 00:39:14] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 1 ms to minimize.
[2024-05-22 00:39:14] [INFO ] Deduced a trap composed of 18 places in 89 ms of which 1 ms to minimize.
[2024-05-22 00:39:14] [INFO ] Deduced a trap composed of 62 places in 106 ms of which 1 ms to minimize.
[2024-05-22 00:39:14] [INFO ] Deduced a trap composed of 59 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:39:14] [INFO ] Deduced a trap composed of 65 places in 92 ms of which 1 ms to minimize.
[2024-05-22 00:39:14] [INFO ] Deduced a trap composed of 66 places in 94 ms of which 1 ms to minimize.
[2024-05-22 00:39:14] [INFO ] Deduced a trap composed of 64 places in 125 ms of which 1 ms to minimize.
[2024-05-22 00:39:15] [INFO ] Deduced a trap composed of 62 places in 119 ms of which 1 ms to minimize.
[2024-05-22 00:39:15] [INFO ] Deduced a trap composed of 63 places in 92 ms of which 2 ms to minimize.
[2024-05-22 00:39:15] [INFO ] Deduced a trap composed of 62 places in 96 ms of which 2 ms to minimize.
[2024-05-22 00:39:15] [INFO ] Deduced a trap composed of 68 places in 66 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/267 variables, 20/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/267 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/268 variables, 1/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/268 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 229/497 variables, 268/398 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/497 variables, 5/403 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/497 variables, 1/404 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/497 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/499 variables, 2/406 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/499 variables, 1/407 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/499 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/499 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 499/499 variables, and 407 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4601 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 270/270 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 41/41 constraints]
After SMT, in 4914ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 589 ms.
Support contains 63 out of 270 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 270/270 places, 230/230 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 270 transition count 229
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 269 transition count 229
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 268 transition count 228
Applied a total of 4 rules in 31 ms. Remains 268 /270 variables (removed 2) and now considering 228/230 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 268/270 places, 228/230 transitions.
RANDOM walk for 40000 steps (1075 resets) in 324 ms. (123 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (213 resets) in 297 ms. (134 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (221 resets) in 101 ms. (392 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 78182 steps, run visited all 2 properties in 257 ms. (steps per millisecond=304 )
Probabilistic random walk after 78182 steps, saw 15822 distinct states, run finished after 262 ms. (steps per millisecond=298 ) properties seen :2
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA BusinessProcesses-PT-20-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 76527 ms.

BK_STOP 1716338357238

--------------------
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
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ 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.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /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-20"
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-5568"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-20, 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 r048-tajo-171620399900607"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-20.tgz
mv BusinessProcesses-PT-20 execution
cd execution
if [ "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.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property ReachabilityFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -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 ;