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.r047-tajo-171620398400527.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 greatspnxred
Input is BusinessProcesses-PT-10, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398400527
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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.4K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:31 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:31 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.1K Apr 11 16:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 66K Apr 11 16:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K Apr 11 16:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 11 16:31 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 131K 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-10-ReachabilityFireability-2024-00
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-2024-01
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-2024-02
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-2024-03
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-2024-04
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-2024-05
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-2024-06
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-2024-07
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-2024-08
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-2024-09
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-2024-10
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-2024-11
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-2024-12
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-2024-13
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-2024-14
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716305203766

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-10
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-21 15:26:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-21 15:26:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:26:45] [INFO ] Load time of PNML (sax parser for PT used): 176 ms
[2024-05-21 15:26:46] [INFO ] Transformed 518 places.
[2024-05-21 15:26:46] [INFO ] Transformed 471 transitions.
[2024-05-21 15:26:46] [INFO ] Found NUPN structural information;
[2024-05-21 15:26:46] [INFO ] Parsed PT model containing 518 places and 471 transitions and 1415 arcs in 385 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 36 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (322 resets) in 2207 ms. (18 steps per ms) remains 6/16 properties
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (57 resets) in 330 ms. (120 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (43 resets) in 738 ms. (54 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (51 resets) in 426 ms. (93 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (56 resets) in 670 ms. (59 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (40 resets) in 140 ms. (283 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (56 resets) in 737 ms. (54 steps per ms) remains 6/6 properties
// Phase 1: matrix 471 rows 518 cols
[2024-05-21 15:26:47] [INFO ] Computed 85 invariants in 23 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/165 variables, 165/165 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/165 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 277/442 variables, 48/213 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/442 variables, 277/490 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/442 variables, 1/491 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/442 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem BusinessProcesses-PT-10-ReachabilityFireability-2024-02 is UNSAT
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem BusinessProcesses-PT-10-ReachabilityFireability-2024-12 is UNSAT
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 76/518 variables, 36/527 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/518 variables, 76/603 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/518 variables, 0/603 constraints. Problems are: Problem set: 2 solved, 4 unsolved
Problem BusinessProcesses-PT-10-ReachabilityFireability-2024-00 is UNSAT
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 9 (OVERLAPS) 471/989 variables, 518/1121 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/989 variables, 0/1121 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/989 variables, 0/1121 constraints. Problems are: Problem set: 3 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 989/989 variables, and 1121 constraints, problems are : Problem set: 3 solved, 3 unsolved in 1612 ms.
Refiners :[Domain max(s): 518/518 constraints, Positive P Invariants (semi-flows): 48/48 constraints, Generalized P Invariants (flows): 37/37 constraints, State Equation: 518/518 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/84 variables, 84/84 constraints. Problems are: Problem set: 3 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/84 variables, 0/84 constraints. Problems are: Problem set: 3 solved, 3 unsolved
Problem BusinessProcesses-PT-10-ReachabilityFireability-2024-09 is UNSAT
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 323/407 variables, 46/130 constraints. Problems are: Problem set: 4 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/407 variables, 323/453 constraints. Problems are: Problem set: 4 solved, 2 unsolved
[2024-05-21 15:26:50] [INFO ] Deduced a trap composed of 13 places in 331 ms of which 25 ms to minimize.
[2024-05-21 15:26:50] [INFO ] Deduced a trap composed of 14 places in 552 ms of which 5 ms to minimize.
[2024-05-21 15:26:51] [INFO ] Deduced a trap composed of 18 places in 156 ms of which 2 ms to minimize.
[2024-05-21 15:26:51] [INFO ] Deduced a trap composed of 14 places in 247 ms of which 4 ms to minimize.
[2024-05-21 15:26:51] [INFO ] Deduced a trap composed of 8 places in 59 ms of which 10 ms to minimize.
[2024-05-21 15:26:51] [INFO ] Deduced a trap composed of 9 places in 104 ms of which 33 ms to minimize.
Problem BusinessProcesses-PT-10-ReachabilityFireability-2024-06 is UNSAT
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
[2024-05-21 15:26:51] [INFO ] Deduced a trap composed of 13 places in 125 ms of which 9 ms to minimize.
[2024-05-21 15:26:51] [INFO ] Deduced a trap composed of 16 places in 85 ms of which 2 ms to minimize.
[2024-05-21 15:26:51] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 2 ms to minimize.
[2024-05-21 15:26:51] [INFO ] Deduced a trap composed of 23 places in 102 ms of which 1 ms to minimize.
[2024-05-21 15:26:52] [INFO ] Deduced a trap composed of 33 places in 84 ms of which 8 ms to minimize.
[2024-05-21 15:26:52] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:26:52] [INFO ] Deduced a trap composed of 38 places in 88 ms of which 2 ms to minimize.
[2024-05-21 15:26:52] [INFO ] Deduced a trap composed of 41 places in 120 ms of which 3 ms to minimize.
[2024-05-21 15:26:52] [INFO ] Deduced a trap composed of 27 places in 90 ms of which 2 ms to minimize.
[2024-05-21 15:26:52] [INFO ] Deduced a trap composed of 25 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:26:52] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:26:52] [INFO ] Deduced a trap composed of 24 places in 110 ms of which 2 ms to minimize.
[2024-05-21 15:26:53] [INFO ] Deduced a trap composed of 38 places in 158 ms of which 2 ms to minimize.
[2024-05-21 15:26:53] [INFO ] Deduced a trap composed of 36 places in 82 ms of which 4 ms to minimize.
Problem BusinessProcesses-PT-10-ReachabilityFireability-2024-06 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/407 variables, 20/473 constraints. Problems are: Problem set: 5 solved, 1 unsolved
[2024-05-21 15:26:53] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 2 ms to minimize.
[2024-05-21 15:26:53] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/407 variables, 2/475 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/407 variables, 0/475 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/416 variables, 2/477 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 9/486 constraints. Problems are: Problem set: 5 solved, 1 unsolved
[2024-05-21 15:26:53] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 1/487 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 0/487 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 101/517 variables, 36/523 constraints. Problems are: Problem set: 5 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/517 variables, 101/624 constraints. Problems are: Problem set: 5 solved, 1 unsolved
[2024-05-21 15:26:53] [INFO ] Deduced a trap composed of 45 places in 212 ms of which 3 ms to minimize.
[2024-05-21 15:26:53] [INFO ] Deduced a trap composed of 127 places in 247 ms of which 7 ms to minimize.
[2024-05-21 15:26:54] [INFO ] Deduced a trap composed of 37 places in 206 ms of which 4 ms to minimize.
[2024-05-21 15:26:54] [INFO ] Deduced a trap composed of 50 places in 201 ms of which 4 ms to minimize.
[2024-05-21 15:26:54] [INFO ] Deduced a trap composed of 59 places in 245 ms of which 3 ms to minimize.
[2024-05-21 15:26:54] [INFO ] Deduced a trap composed of 25 places in 238 ms of which 3 ms to minimize.
SMT process timed out in 7069ms, After SMT, problems are : Problem set: 5 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 39 out of 518 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 518/518 places, 471/471 transitions.
Graph (complete) has 1071 edges and 518 vertex of which 516 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.5 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 57 place count 516 transition count 414
Reduce places removed 56 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 64 rules applied. Total rules applied 121 place count 460 transition count 406
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 129 place count 452 transition count 406
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 103 Pre rules applied. Total rules applied 129 place count 452 transition count 303
Deduced a syphon composed of 103 places in 8 ms
Ensure Unique test removed 11 places
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 3 with 217 rules applied. Total rules applied 346 place count 338 transition count 303
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 407 place count 277 transition count 242
Iterating global reduction 3 with 61 rules applied. Total rules applied 468 place count 277 transition count 242
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 468 place count 277 transition count 236
Deduced a syphon composed of 6 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 482 place count 269 transition count 236
Performed 68 Post agglomeration using F-continuation condition.Transition count delta: 68
Deduced a syphon composed of 68 places in 1 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 618 place count 201 transition count 168
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 619 place count 201 transition count 167
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 622 place count 201 transition count 167
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 623 place count 200 transition count 166
Applied a total of 623 rules in 225 ms. Remains 200 /518 variables (removed 318) and now considering 166/471 (removed 305) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 242 ms. Remains : 200/518 places, 166/471 transitions.
RANDOM walk for 40000 steps (1231 resets) in 484 ms. (82 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (201 resets) in 248 ms. (160 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1248175 steps, run timeout after 3001 ms. (steps per millisecond=415 ) properties seen :0 out of 1
Probabilistic random walk after 1248175 steps, saw 181310 distinct states, run finished after 3005 ms. (steps per millisecond=415 ) properties seen :0
// Phase 1: matrix 166 rows 200 cols
[2024-05-21 15:26:58] [INFO ] Computed 71 invariants in 7 ms
[2024-05-21 15:26:58] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 87/126 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/135 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/135 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 45/180 variables, 24/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/180 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/181 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/181 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/183 variables, 2/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/183 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 166/349 variables, 183/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/349 variables, 1/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/349 variables, 0/247 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 17/366 variables, 17/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/366 variables, 8/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/366 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/366 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 366/366 variables, and 272 constraints, problems are : Problem set: 0 solved, 1 unsolved in 173 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 200/200 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 87/126 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 15:26:58] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/126 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 15:26:58] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 0 ms to minimize.
[2024-05-21 15:26:58] [INFO ] Deduced a trap composed of 4 places in 29 ms of which 1 ms to minimize.
[2024-05-21 15:26:58] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
[2024-05-21 15:26:58] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 4/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 9/135 variables, 5/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 45/180 variables, 24/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 15:26:59] [INFO ] Deduced a trap composed of 5 places in 59 ms of which 6 ms to minimize.
[2024-05-21 15:26:59] [INFO ] Deduced a trap composed of 6 places in 54 ms of which 2 ms to minimize.
[2024-05-21 15:26:59] [INFO ] Deduced a trap composed of 45 places in 51 ms of which 2 ms to minimize.
[2024-05-21 15:26:59] [INFO ] Deduced a trap composed of 41 places in 55 ms of which 1 ms to minimize.
[2024-05-21 15:26:59] [INFO ] Deduced a trap composed of 37 places in 57 ms of which 2 ms to minimize.
[2024-05-21 15:26:59] [INFO ] Deduced a trap composed of 42 places in 129 ms of which 2 ms to minimize.
[2024-05-21 15:26:59] [INFO ] Deduced a trap composed of 6 places in 103 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/180 variables, 7/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/180 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/181 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/181 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/183 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/183 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 166/349 variables, 183/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/349 variables, 1/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/349 variables, 0/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 17/366 variables, 17/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/366 variables, 8/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/366 variables, 1/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 15:26:59] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 26 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/366 variables, 1/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/366 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/366 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 366/366 variables, and 286 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1044 ms.
Refiners :[Positive P Invariants (semi-flows): 45/45 constraints, Generalized P Invariants (flows): 26/26 constraints, State Equation: 200/200 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 13/13 constraints]
After SMT, in 1255ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 113 ms.
Support contains 39 out of 200 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 166/166 transitions.
Applied a total of 0 rules in 24 ms. Remains 200 /200 variables (removed 0) and now considering 166/166 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 200/200 places, 166/166 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 166/166 transitions.
Applied a total of 0 rules in 16 ms. Remains 200 /200 variables (removed 0) and now considering 166/166 (removed 0) transitions.
[2024-05-21 15:26:59] [INFO ] Invariant cache hit.
[2024-05-21 15:27:00] [INFO ] Implicit Places using invariants in 130 ms returned [30, 32, 34, 64, 66]
[2024-05-21 15:27:00] [INFO ] Actually due to overlaps returned [30, 64]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 148 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 198/200 places, 166/166 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 197 transition count 165
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 197 transition count 165
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 196 transition count 161
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 196 transition count 161
Applied a total of 4 rules in 18 ms. Remains 196 /198 variables (removed 2) and now considering 161/166 (removed 5) transitions.
// Phase 1: matrix 161 rows 196 cols
[2024-05-21 15:27:00] [INFO ] Computed 69 invariants in 1 ms
[2024-05-21 15:27:00] [INFO ] Implicit Places using invariants in 100 ms returned [31, 33]
[2024-05-21 15:27:00] [INFO ] Actually due to overlaps returned [31]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 102 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 195/200 places, 161/166 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 194 transition count 160
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 194 transition count 160
Applied a total of 2 rules in 10 ms. Remains 194 /195 variables (removed 1) and now considering 160/161 (removed 1) transitions.
// Phase 1: matrix 160 rows 194 cols
[2024-05-21 15:27:00] [INFO ] Computed 68 invariants in 2 ms
[2024-05-21 15:27:00] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-05-21 15:27:00] [INFO ] Invariant cache hit.
[2024-05-21 15:27:00] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-21 15:27:00] [INFO ] Implicit Places using invariants and state equation in 153 ms returned [121, 127, 133]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 239 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 191/200 places, 160/166 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 189 transition count 158
Applied a total of 4 rules in 10 ms. Remains 189 /191 variables (removed 2) and now considering 158/160 (removed 2) transitions.
// Phase 1: matrix 158 rows 189 cols
[2024-05-21 15:27:00] [INFO ] Computed 65 invariants in 2 ms
[2024-05-21 15:27:00] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-05-21 15:27:00] [INFO ] Invariant cache hit.
[2024-05-21 15:27:00] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-21 15:27:00] [INFO ] Implicit Places using invariants and state equation in 153 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 189/200 places, 158/166 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 784 ms. Remains : 189/200 places, 158/166 transitions.
RANDOM walk for 40000 steps (1260 resets) in 107 ms. (370 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (201 resets) in 132 ms. (300 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1576393 steps, run timeout after 3001 ms. (steps per millisecond=525 ) properties seen :0 out of 1
Probabilistic random walk after 1576393 steps, saw 237881 distinct states, run finished after 3001 ms. (steps per millisecond=525 ) properties seen :0
[2024-05-21 15:27:03] [INFO ] Invariant cache hit.
[2024-05-21 15:27:03] [INFO ] State equation strengthened by 3 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 84/123 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/132 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 41/173 variables, 22/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/174 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/175 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/175 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 158/333 variables, 175/235 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/333 variables, 3/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/333 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 14/347 variables, 14/252 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/347 variables, 5/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/347 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/347 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 347/347 variables, and 257 constraints, problems are : Problem set: 0 solved, 1 unsolved in 215 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 189/189 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 84/123 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/132 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 15:27:04] [INFO ] Deduced a trap composed of 4 places in 50 ms of which 1 ms to minimize.
[2024-05-21 15:27:04] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 2 ms to minimize.
[2024-05-21 15:27:04] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 1 ms to minimize.
[2024-05-21 15:27:04] [INFO ] Deduced a trap composed of 5 places in 57 ms of which 1 ms to minimize.
[2024-05-21 15:27:04] [INFO ] Deduced a trap composed of 5 places in 55 ms of which 1 ms to minimize.
[2024-05-21 15:27:04] [INFO ] Deduced a trap composed of 6 places in 52 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/132 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/132 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 41/173 variables, 22/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 15:27:04] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/174 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/175 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/175 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 158/333 variables, 175/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/333 variables, 3/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/333 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 14/347 variables, 14/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/347 variables, 5/264 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/347 variables, 1/265 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 15:27:05] [INFO ] Deduced a trap composed of 34 places in 84 ms of which 1 ms to minimize.
[2024-05-21 15:27:05] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 2 ms to minimize.
Problem BusinessProcesses-PT-10-ReachabilityFireability-2024-08 is UNSAT
FORMULA BusinessProcesses-PT-10-ReachabilityFireability-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
After SMT solving in domain Int declared 347/347 variables, and 267 constraints, problems are : Problem set: 1 solved, 0 unsolved in 1345 ms.
Refiners :[Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 23/23 constraints, State Equation: 189/189 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 9/9 constraints]
After SMT, in 1589ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
All properties solved without resorting to model-checking.
Total runtime 19784 ms.
ITS solved all properties within timeout

BK_STOP 1716305225512

--------------------
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-10"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is BusinessProcesses-PT-10, 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 r047-tajo-171620398400527"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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