fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r472-tajo-171620399700535
Last Updated
July 7, 2024

About the Execution of LTSMin+red for BusinessProcesses-PT-11

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
458.443 32948.00 56902.00 59.60 TFTTTFTFTFFTTTTT normal

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.r472-tajo-171620399700535.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 ltsminxred
Input is BusinessProcesses-PT-11, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399700535
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K 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 Apr 22 14:31 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:31 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 16:36 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 109K Apr 11 16:36 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Apr 11 16:36 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 11 16:36 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 141K 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-11-ReachabilityFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-2024-12
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-2024-13
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-2024-14
FORMULA_NAME BusinessProcesses-PT-11-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717225664388

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 07:07:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 07:07:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 07:07:46] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2024-06-01 07:07:46] [INFO ] Transformed 567 places.
[2024-06-01 07:07:46] [INFO ] Transformed 508 transitions.
[2024-06-01 07:07:46] [INFO ] Found NUPN structural information;
[2024-06-01 07:07:46] [INFO ] Parsed PT model containing 567 places and 508 transitions and 1512 arcs in 267 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 32 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 7 places in 15 ms
Reduce places removed 7 places and 7 transitions.
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (300 resets) in 1909 ms. (20 steps per ms) remains 7/15 properties
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (59 resets) in 222 ms. (179 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (51 resets) in 450 ms. (88 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (59 resets) in 199 ms. (200 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (56 resets) in 148 ms. (268 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (54 resets) in 817 ms. (48 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (58 resets) in 179 ms. (222 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (56 resets) in 98 ms. (404 steps per ms) remains 7/7 properties
// Phase 1: matrix 501 rows 560 cols
[2024-06-01 07:07:47] [INFO ] Computed 95 invariants in 22 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 84/84 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 360/444 variables, 53/137 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/444 variables, 360/497 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/444 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 116/560 variables, 42/539 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/560 variables, 116/655 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/560 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem BusinessProcesses-PT-11-ReachabilityFireability-2024-05 is UNSAT
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-2024-05 FALSE TECHNIQUES SMT_REFINEMENT
Problem BusinessProcesses-PT-11-ReachabilityFireability-2024-09 is UNSAT
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 501/1061 variables, 560/1215 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1061 variables, 0/1215 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/1061 variables, 0/1215 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1061/1061 variables, and 1215 constraints, problems are : Problem set: 2 solved, 5 unsolved in 1223 ms.
Refiners :[Domain max(s): 560/560 constraints, Positive P Invariants (semi-flows): 53/53 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 560/560 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 75/75 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/75 variables, 0/75 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 324/399 variables, 42/117 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/399 variables, 324/441 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-06-01 07:07:49] [INFO ] Deduced a trap composed of 20 places in 176 ms of which 30 ms to minimize.
[2024-06-01 07:07:49] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 3 ms to minimize.
[2024-06-01 07:07:49] [INFO ] Deduced a trap composed of 127 places in 123 ms of which 3 ms to minimize.
[2024-06-01 07:07:49] [INFO ] Deduced a trap composed of 22 places in 120 ms of which 3 ms to minimize.
[2024-06-01 07:07:49] [INFO ] Deduced a trap composed of 127 places in 119 ms of which 3 ms to minimize.
[2024-06-01 07:07:50] [INFO ] Deduced a trap composed of 18 places in 113 ms of which 3 ms to minimize.
[2024-06-01 07:07:50] [INFO ] Deduced a trap composed of 24 places in 155 ms of which 3 ms to minimize.
[2024-06-01 07:07:50] [INFO ] Deduced a trap composed of 109 places in 129 ms of which 3 ms to minimize.
[2024-06-01 07:07:50] [INFO ] Deduced a trap composed of 106 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:07:50] [INFO ] Deduced a trap composed of 22 places in 109 ms of which 2 ms to minimize.
[2024-06-01 07:07:50] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 2 ms to minimize.
[2024-06-01 07:07:50] [INFO ] Deduced a trap composed of 34 places in 105 ms of which 2 ms to minimize.
[2024-06-01 07:07:51] [INFO ] Deduced a trap composed of 27 places in 122 ms of which 2 ms to minimize.
[2024-06-01 07:07:51] [INFO ] Deduced a trap composed of 25 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:07:51] [INFO ] Deduced a trap composed of 93 places in 106 ms of which 3 ms to minimize.
[2024-06-01 07:07:51] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 4 ms to minimize.
[2024-06-01 07:07:51] [INFO ] Deduced a trap composed of 28 places in 111 ms of which 2 ms to minimize.
[2024-06-01 07:07:51] [INFO ] Deduced a trap composed of 101 places in 118 ms of which 2 ms to minimize.
[2024-06-01 07:07:51] [INFO ] Deduced a trap composed of 97 places in 98 ms of which 2 ms to minimize.
[2024-06-01 07:07:51] [INFO ] Deduced a trap composed of 93 places in 97 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/399 variables, 20/461 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-06-01 07:07:51] [INFO ] Deduced a trap composed of 19 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:07:52] [INFO ] Deduced a trap composed of 113 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:07:52] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:07:52] [INFO ] Deduced a trap composed of 44 places in 90 ms of which 2 ms to minimize.
[2024-06-01 07:07:52] [INFO ] Deduced a trap composed of 45 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:07:52] [INFO ] Deduced a trap composed of 95 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:07:52] [INFO ] Deduced a trap composed of 135 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:07:52] [INFO ] Deduced a trap composed of 127 places in 101 ms of which 3 ms to minimize.
[2024-06-01 07:07:52] [INFO ] Deduced a trap composed of 138 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:07:52] [INFO ] Deduced a trap composed of 113 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:07:52] [INFO ] Deduced a trap composed of 46 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:07:53] [INFO ] Deduced a trap composed of 29 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:07:53] [INFO ] Deduced a trap composed of 116 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:07:53] [INFO ] Deduced a trap composed of 113 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:07:53] [INFO ] Deduced a trap composed of 99 places in 95 ms of which 5 ms to minimize.
[2024-06-01 07:07:53] [INFO ] Deduced a trap composed of 96 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:07:53] [INFO ] Deduced a trap composed of 107 places in 94 ms of which 2 ms to minimize.
[2024-06-01 07:07:53] [INFO ] Deduced a trap composed of 114 places in 115 ms of which 2 ms to minimize.
[2024-06-01 07:07:53] [INFO ] Deduced a trap composed of 102 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:07:53] [INFO ] Deduced a trap composed of 101 places in 95 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/399 variables, 20/481 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-06-01 07:07:54] [INFO ] Deduced a trap composed of 100 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:07:54] [INFO ] Deduced a trap composed of 107 places in 90 ms of which 2 ms to minimize.
SMT process timed out in 6380ms, After SMT, problems are : Problem set: 2 solved, 5 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 75 out of 560 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 560/560 places, 501/501 transitions.
Graph (complete) has 1140 edges and 560 vertex of which 555 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 60 place count 555 transition count 441
Reduce places removed 59 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 65 rules applied. Total rules applied 125 place count 496 transition count 435
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 131 place count 490 transition count 435
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 98 Pre rules applied. Total rules applied 131 place count 490 transition count 337
Deduced a syphon composed of 98 places in 3 ms
Ensure Unique test removed 11 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 207 rules applied. Total rules applied 338 place count 381 transition count 337
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 398 place count 321 transition count 277
Iterating global reduction 3 with 60 rules applied. Total rules applied 458 place count 321 transition count 277
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 458 place count 321 transition count 276
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 460 place count 320 transition count 276
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: 67
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 594 place count 253 transition count 209
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 596 place count 252 transition count 213
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 601 place count 252 transition count 213
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 602 place count 251 transition count 212
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 603 place count 250 transition count 212
Applied a total of 603 rules in 145 ms. Remains 250 /560 variables (removed 310) and now considering 212/501 (removed 289) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 153 ms. Remains : 250/560 places, 212/501 transitions.
RANDOM walk for 40000 steps (937 resets) in 283 ms. (140 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (193 resets) in 140 ms. (283 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (168 resets) in 132 ms. (300 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (193 resets) in 161 ms. (246 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (197 resets) in 158 ms. (251 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (182 resets) in 97 ms. (408 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 590607 steps, run timeout after 3001 ms. (steps per millisecond=196 ) properties seen :1 out of 5
Probabilistic random walk after 590607 steps, saw 97479 distinct states, run finished after 3018 ms. (steps per millisecond=195 ) properties seen :1
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-2024-12 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
// Phase 1: matrix 212 rows 250 cols
[2024-06-01 07:07:57] [INFO ] Computed 79 invariants in 4 ms
[2024-06-01 07:07:57] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 112/187 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 11/198 variables, 7/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/198 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 47/245 variables, 29/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/245 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 2/247 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 212/459 variables, 247/326 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/459 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/459 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 3/462 variables, 3/331 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/462 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 0/462 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 462/462 variables, and 331 constraints, problems are : Problem set: 0 solved, 4 unsolved in 400 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 250/250 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/75 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 112/187 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:07:58] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:07:58] [INFO ] Deduced a trap composed of 4 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:07:58] [INFO ] Deduced a trap composed of 7 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:07:58] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
[2024-06-01 07:07:58] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:07:58] [INFO ] Deduced a trap composed of 61 places in 58 ms of which 2 ms to minimize.
[2024-06-01 07:07:58] [INFO ] Deduced a trap composed of 57 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:07:58] [INFO ] Deduced a trap composed of 60 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:07:58] [INFO ] Deduced a trap composed of 60 places in 54 ms of which 2 ms to minimize.
[2024-06-01 07:07:58] [INFO ] Deduced a trap composed of 56 places in 74 ms of which 3 ms to minimize.
[2024-06-01 07:07:58] [INFO ] Deduced a trap composed of 57 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:07:58] [INFO ] Deduced a trap composed of 60 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:07:58] [INFO ] Deduced a trap composed of 53 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:07:59] [INFO ] Deduced a trap composed of 54 places in 55 ms of which 2 ms to minimize.
[2024-06-01 07:07:59] [INFO ] Deduced a trap composed of 54 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:07:59] [INFO ] Deduced a trap composed of 55 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:07:59] [INFO ] Deduced a trap composed of 56 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:07:59] [INFO ] Deduced a trap composed of 66 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:07:59] [INFO ] Deduced a trap composed of 57 places in 55 ms of which 2 ms to minimize.
[2024-06-01 07:07:59] [INFO ] Deduced a trap composed of 57 places in 59 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/187 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:07:59] [INFO ] Deduced a trap composed of 48 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:07:59] [INFO ] Deduced a trap composed of 9 places in 64 ms of which 2 ms to minimize.
[2024-06-01 07:07:59] [INFO ] Deduced a trap composed of 45 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:07:59] [INFO ] Deduced a trap composed of 50 places in 62 ms of which 2 ms to minimize.
[2024-06-01 07:07:59] [INFO ] Deduced a trap composed of 50 places in 59 ms of which 1 ms to minimize.
[2024-06-01 07:07:59] [INFO ] Deduced a trap composed of 49 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:07:59] [INFO ] Deduced a trap composed of 47 places in 62 ms of which 1 ms to minimize.
[2024-06-01 07:07:59] [INFO ] Deduced a trap composed of 48 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:08:00] [INFO ] Deduced a trap composed of 54 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:08:00] [INFO ] Deduced a trap composed of 56 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:08:00] [INFO ] Deduced a trap composed of 57 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:08:00] [INFO ] Deduced a trap composed of 57 places in 50 ms of which 1 ms to minimize.
[2024-06-01 07:08:00] [INFO ] Deduced a trap composed of 63 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:08:00] [INFO ] Deduced a trap composed of 62 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:08:00] [INFO ] Deduced a trap composed of 61 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:08:00] [INFO ] Deduced a trap composed of 66 places in 47 ms of which 1 ms to minimize.
[2024-06-01 07:08:00] [INFO ] Deduced a trap composed of 61 places in 47 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/187 variables, 17/78 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 07:08:00] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 2 ms to minimize.
[2024-06-01 07:08:00] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:08:00] [INFO ] Deduced a trap composed of 9 places in 51 ms of which 1 ms to minimize.
[2024-06-01 07:08:00] [INFO ] Deduced a trap composed of 59 places in 57 ms of which 1 ms to minimize.
[2024-06-01 07:08:00] [INFO ] Deduced a trap composed of 49 places in 58 ms of which 1 ms to minimize.
[2024-06-01 07:08:00] [INFO ] Deduced a trap composed of 45 places in 52 ms of which 1 ms to minimize.
[2024-06-01 07:08:00] [INFO ] Deduced a trap composed of 44 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:08:00] [INFO ] Deduced a trap composed of 44 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:08:01] [INFO ] Deduced a trap composed of 45 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:08:01] [INFO ] Deduced a trap composed of 46 places in 49 ms of which 1 ms to minimize.
[2024-06-01 07:08:01] [INFO ] Deduced a trap composed of 47 places in 69 ms of which 1 ms to minimize.
Problem BusinessProcesses-PT-11-ReachabilityFireability-2024-01 is UNSAT
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-2024-01 FALSE TECHNIQUES SMT_REFINEMENT
[2024-06-01 07:08:01] [INFO ] Deduced a trap composed of 62 places in 48 ms of which 1 ms to minimize.
[2024-06-01 07:08:01] [INFO ] Deduced a trap composed of 58 places in 46 ms of which 1 ms to minimize.
[2024-06-01 07:08:01] [INFO ] Deduced a trap composed of 63 places in 55 ms of which 1 ms to minimize.
[2024-06-01 07:08:01] [INFO ] Deduced a trap composed of 59 places in 42 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/187 variables, 15/93 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 07:08:01] [INFO ] Deduced a trap composed of 60 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/187 variables, 1/94 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/94 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 11/198 variables, 7/101 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/101 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 47/245 variables, 29/130 constraints. Problems are: Problem set: 1 solved, 3 unsolved
[2024-06-01 07:08:01] [INFO ] Deduced a trap composed of 10 places in 35 ms of which 1 ms to minimize.
[2024-06-01 07:08:01] [INFO ] Deduced a trap composed of 56 places in 83 ms of which 2 ms to minimize.
[2024-06-01 07:08:01] [INFO ] Deduced a trap composed of 53 places in 69 ms of which 2 ms to minimize.
[2024-06-01 07:08:01] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:08:01] [INFO ] Deduced a trap composed of 27 places in 61 ms of which 1 ms to minimize.
[2024-06-01 07:08:02] [INFO ] Deduced a trap composed of 40 places in 60 ms of which 1 ms to minimize.
[2024-06-01 07:08:02] [INFO ] Deduced a trap composed of 55 places in 65 ms of which 1 ms to minimize.
[2024-06-01 07:08:02] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
Problem BusinessProcesses-PT-11-ReachabilityFireability-2024-04 is UNSAT
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
[2024-06-01 07:08:02] [INFO ] Deduced a trap composed of 53 places in 67 ms of which 1 ms to minimize.
[2024-06-01 07:08:02] [INFO ] Deduced a trap composed of 39 places in 69 ms of which 1 ms to minimize.
[2024-06-01 07:08:02] [INFO ] Deduced a trap composed of 42 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:08:02] [INFO ] Deduced a trap composed of 45 places in 65 ms of which 2 ms to minimize.
[2024-06-01 07:08:02] [INFO ] Deduced a trap composed of 41 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:08:02] [INFO ] Deduced a trap composed of 59 places in 81 ms of which 1 ms to minimize.
[2024-06-01 07:08:02] [INFO ] Deduced a trap composed of 57 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:08:02] [INFO ] Deduced a trap composed of 42 places in 71 ms of which 2 ms to minimize.
[2024-06-01 07:08:02] [INFO ] Deduced a trap composed of 57 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:08:03] [INFO ] Deduced a trap composed of 39 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:08:03] [INFO ] Deduced a trap composed of 42 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:08:03] [INFO ] Deduced a trap composed of 45 places in 73 ms of which 1 ms to minimize.
Problem BusinessProcesses-PT-11-ReachabilityFireability-2024-04 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/245 variables, 20/150 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 07:08:03] [INFO ] Deduced a trap composed of 45 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:08:03] [INFO ] Deduced a trap composed of 58 places in 73 ms of which 1 ms to minimize.
[2024-06-01 07:08:03] [INFO ] Deduced a trap composed of 59 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:08:03] [INFO ] Deduced a trap composed of 55 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:08:03] [INFO ] Deduced a trap composed of 56 places in 68 ms of which 1 ms to minimize.
[2024-06-01 07:08:03] [INFO ] Deduced a trap composed of 66 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:08:03] [INFO ] Deduced a trap composed of 61 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:08:04] [INFO ] Deduced a trap composed of 43 places in 91 ms of which 2 ms to minimize.
[2024-06-01 07:08:04] [INFO ] Deduced a trap composed of 69 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:08:04] [INFO ] Deduced a trap composed of 62 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:08:04] [INFO ] Deduced a trap composed of 68 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:08:04] [INFO ] Deduced a trap composed of 50 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:08:04] [INFO ] Deduced a trap composed of 69 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:08:04] [INFO ] Deduced a trap composed of 68 places in 81 ms of which 2 ms to minimize.
[2024-06-01 07:08:04] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:08:04] [INFO ] Deduced a trap composed of 52 places in 101 ms of which 1 ms to minimize.
[2024-06-01 07:08:04] [INFO ] Deduced a trap composed of 55 places in 141 ms of which 5 ms to minimize.
[2024-06-01 07:08:05] [INFO ] Deduced a trap composed of 59 places in 103 ms of which 2 ms to minimize.
[2024-06-01 07:08:05] [INFO ] Deduced a trap composed of 53 places in 124 ms of which 3 ms to minimize.
[2024-06-01 07:08:05] [INFO ] Deduced a trap composed of 54 places in 105 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/245 variables, 20/170 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 07:08:05] [INFO ] Deduced a trap composed of 49 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:08:05] [INFO ] Deduced a trap composed of 63 places in 77 ms of which 1 ms to minimize.
[2024-06-01 07:08:05] [INFO ] Deduced a trap composed of 59 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:08:05] [INFO ] Deduced a trap composed of 55 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:08:05] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 2 ms to minimize.
[2024-06-01 07:08:05] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 1 ms to minimize.
[2024-06-01 07:08:06] [INFO ] Deduced a trap composed of 55 places in 92 ms of which 1 ms to minimize.
[2024-06-01 07:08:06] [INFO ] Deduced a trap composed of 54 places in 100 ms of which 4 ms to minimize.
[2024-06-01 07:08:06] [INFO ] Deduced a trap composed of 62 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:08:06] [INFO ] Deduced a trap composed of 62 places in 68 ms of which 2 ms to minimize.
[2024-06-01 07:08:06] [INFO ] Deduced a trap composed of 62 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:08:06] [INFO ] Deduced a trap composed of 63 places in 73 ms of which 2 ms to minimize.
[2024-06-01 07:08:06] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:08:06] [INFO ] Deduced a trap composed of 59 places in 74 ms of which 2 ms to minimize.
[2024-06-01 07:08:06] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:08:06] [INFO ] Deduced a trap composed of 54 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:08:06] [INFO ] Deduced a trap composed of 62 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:08:07] [INFO ] Deduced a trap composed of 55 places in 66 ms of which 2 ms to minimize.
[2024-06-01 07:08:07] [INFO ] Deduced a trap composed of 68 places in 99 ms of which 2 ms to minimize.
[2024-06-01 07:08:07] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/245 variables, 20/190 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 07:08:07] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 1 ms to minimize.
[2024-06-01 07:08:07] [INFO ] Deduced a trap composed of 61 places in 97 ms of which 2 ms to minimize.
[2024-06-01 07:08:07] [INFO ] Deduced a trap composed of 64 places in 76 ms of which 2 ms to minimize.
[2024-06-01 07:08:07] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:08:08] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 1 ms to minimize.
[2024-06-01 07:08:08] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:08:08] [INFO ] Deduced a trap composed of 71 places in 102 ms of which 2 ms to minimize.
[2024-06-01 07:08:08] [INFO ] Deduced a trap composed of 66 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:08:08] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:08:08] [INFO ] Deduced a trap composed of 65 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:08:09] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 2 ms to minimize.
[2024-06-01 07:08:09] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 2 ms to minimize.
[2024-06-01 07:08:09] [INFO ] Deduced a trap composed of 66 places in 87 ms of which 2 ms to minimize.
[2024-06-01 07:08:09] [INFO ] Deduced a trap composed of 64 places in 90 ms of which 1 ms to minimize.
[2024-06-01 07:08:10] [INFO ] Deduced a trap composed of 58 places in 85 ms of which 2 ms to minimize.
[2024-06-01 07:08:10] [INFO ] Deduced a trap composed of 27 places in 64 ms of which 1 ms to minimize.
[2024-06-01 07:08:10] [INFO ] Deduced a trap composed of 31 places in 59 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/245 variables, 17/207 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 07:08:10] [INFO ] Deduced a trap composed of 49 places in 99 ms of which 1 ms to minimize.
[2024-06-01 07:08:11] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 2 ms to minimize.
[2024-06-01 07:08:11] [INFO ] Deduced a trap composed of 61 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:08:11] [INFO ] Deduced a trap composed of 60 places in 96 ms of which 2 ms to minimize.
[2024-06-01 07:08:11] [INFO ] Deduced a trap composed of 59 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:08:11] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 1 ms to minimize.
[2024-06-01 07:08:11] [INFO ] Deduced a trap composed of 63 places in 95 ms of which 2 ms to minimize.
[2024-06-01 07:08:11] [INFO ] Deduced a trap composed of 62 places in 82 ms of which 1 ms to minimize.
[2024-06-01 07:08:11] [INFO ] Deduced a trap composed of 61 places in 86 ms of which 2 ms to minimize.
[2024-06-01 07:08:11] [INFO ] Deduced a trap composed of 59 places in 89 ms of which 2 ms to minimize.
[2024-06-01 07:08:12] [INFO ] Deduced a trap composed of 62 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:08:12] [INFO ] Deduced a trap composed of 60 places in 73 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/245 variables, 12/219 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 07:08:12] [INFO ] Deduced a trap composed of 54 places in 92 ms of which 2 ms to minimize.
[2024-06-01 07:08:12] [INFO ] Deduced a trap composed of 63 places in 80 ms of which 2 ms to minimize.
[2024-06-01 07:08:12] [INFO ] Deduced a trap composed of 63 places in 66 ms of which 1 ms to minimize.
[2024-06-01 07:08:12] [INFO ] Deduced a trap composed of 62 places in 88 ms of which 2 ms to minimize.
[2024-06-01 07:08:12] [INFO ] Deduced a trap composed of 65 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:08:12] [INFO ] Deduced a trap composed of 66 places in 77 ms of which 2 ms to minimize.
[2024-06-01 07:08:13] [INFO ] Deduced a trap composed of 55 places in 70 ms of which 2 ms to minimize.
[2024-06-01 07:08:13] [INFO ] Deduced a trap composed of 55 places in 88 ms of which 1 ms to minimize.
[2024-06-01 07:08:13] [INFO ] Deduced a trap composed of 55 places in 93 ms of which 2 ms to minimize.
[2024-06-01 07:08:13] [INFO ] Deduced a trap composed of 66 places in 87 ms of which 1 ms to minimize.
[2024-06-01 07:08:13] [INFO ] Deduced a trap composed of 57 places in 84 ms of which 2 ms to minimize.
[2024-06-01 07:08:13] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 1 ms to minimize.
[2024-06-01 07:08:13] [INFO ] Deduced a trap composed of 61 places in 72 ms of which 2 ms to minimize.
[2024-06-01 07:08:13] [INFO ] Deduced a trap composed of 58 places in 78 ms of which 2 ms to minimize.
[2024-06-01 07:08:13] [INFO ] Deduced a trap composed of 65 places in 91 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/245 variables, 15/234 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/245 variables, 0/234 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 2/247 variables, 2/236 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/247 variables, 0/236 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 212/459 variables, 247/483 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/459 variables, 2/485 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/459 variables, 1/486 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/459 variables, 0/486 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 3/462 variables, 3/489 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/462 variables, 1/490 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 07:08:14] [INFO ] Deduced a trap composed of 3 places in 80 ms of which 1 ms to minimize.
[2024-06-01 07:08:14] [INFO ] Deduced a trap composed of 13 places in 68 ms of which 2 ms to minimize.
Problem BusinessProcesses-PT-11-ReachabilityFireability-2024-07 is UNSAT
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 25 (INCLUDED_ONLY) 0/462 variables, 2/492 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/462 variables, 0/492 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/462 variables, 0/492 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 462/462 variables, and 492 constraints, problems are : Problem set: 3 solved, 1 unsolved in 16803 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, Generalized P Invariants (flows): 31/31 constraints, State Equation: 250/250 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 159/159 constraints]
After SMT, in 17235ms problems are : Problem set: 3 solved, 1 unsolved
Parikh walk visited 0 properties in 35 ms.
Support contains 21 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 212/212 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 250 transition count 207
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 7 rules applied. Total rules applied 12 place count 245 transition count 205
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 243 transition count 205
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 14 place count 243 transition count 185
Deduced a syphon composed of 20 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 3 with 44 rules applied. Total rules applied 58 place count 219 transition count 185
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 62 place count 215 transition count 180
Iterating global reduction 3 with 4 rules applied. Total rules applied 66 place count 215 transition count 180
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 1 ms
Ensure Unique test removed 3 places
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 57 rules applied. Total rules applied 123 place count 185 transition count 153
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 124 place count 185 transition count 152
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 126 place count 184 transition count 152
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 127 place count 183 transition count 151
Applied a total of 127 rules in 51 ms. Remains 183 /250 variables (removed 67) and now considering 151/212 (removed 61) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 183/250 places, 151/212 transitions.
RANDOM walk for 40000 steps (2807 resets) in 959 ms. (41 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (631 resets) in 121 ms. (327 steps per ms) remains 1/1 properties
Probably explored full state space saw : 95741 states, properties seen :0
Probabilistic random walk after 436316 steps, saw 95741 distinct states, run finished after 1079 ms. (steps per millisecond=404 ) properties seen :0
Explored full state space saw : 95742 states, properties seen :0
Exhaustive walk after 436321 steps, saw 95742 distinct states, run finished after 932 ms. (steps per millisecond=468 ) properties seen :0
FORMULA BusinessProcesses-PT-11-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL EXHAUSTIVE_WALK
All properties solved without resorting to model-checking.
Total runtime 31362 ms.
ITS solved all properties within timeout

BK_STOP 1717225697336

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-11"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is BusinessProcesses-PT-11, 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 r472-tajo-171620399700535"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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