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-171620398400526.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 ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r047-tajo-171620398400526
=====================================================================

--------------------
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-ReachabilityCardinality-2024-00
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-2024-01
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-2024-02
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-2024-03
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-2024-04
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-2024-05
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-2024-06
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-2024-07
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-2024-08
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-2024-09
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-2024-10
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-2024-11
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-2024-12
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-2024-13
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-2024-14
FORMULA_NAME BusinessProcesses-PT-10-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716305189264

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
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:31] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-21 15:26:31] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 15:26:31] [INFO ] Load time of PNML (sax parser for PT used): 166 ms
[2024-05-21 15:26:31] [INFO ] Transformed 518 places.
[2024-05-21 15:26:31] [INFO ] Transformed 471 transitions.
[2024-05-21 15:26:31] [INFO ] Found NUPN structural information;
[2024-05-21 15:26:31] [INFO ] Parsed PT model containing 518 places and 471 transitions and 1415 arcs in 354 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (327 resets) in 2019 ms. (19 steps per ms) remains 7/14 properties
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (54 resets) in 157 ms. (253 steps per ms) remains 6/7 properties
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (66 resets) in 654 ms. (61 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (53 resets) in 216 ms. (184 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (53 resets) in 338 ms. (118 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (58 resets) in 139 ms. (285 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (49 resets) in 362 ms. (110 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (55 resets) in 293 ms. (136 steps per ms) remains 6/6 properties
// Phase 1: matrix 471 rows 518 cols
[2024-05-21 15:26:33] [INFO ] Computed 85 invariants in 24 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/81 variables, 81/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/81 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem BusinessProcesses-PT-10-ReachabilityCardinality-2024-02 is UNSAT
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 326/407 variables, 47/128 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/407 variables, 326/454 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/407 variables, 0/454 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 4/411 variables, 1/455 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 4/459 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/411 variables, 0/459 constraints. Problems are: Problem set: 1 solved, 5 unsolved
Problem BusinessProcesses-PT-10-ReachabilityCardinality-2024-12 is UNSAT
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 104/515 variables, 34/493 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/515 variables, 104/597 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/515 variables, 0/597 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 3/518 variables, 3/600 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/518 variables, 3/603 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/518 variables, 0/603 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 471/989 variables, 518/1121 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/989 variables, 0/1121 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/989 variables, 0/1121 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 989/989 variables, and 1121 constraints, problems are : Problem set: 2 solved, 4 unsolved in 1388 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: 2 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 53/53 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 0/53 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 338/391 variables, 45/98 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/391 variables, 338/436 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-21 15:26:35] [INFO ] Deduced a trap composed of 11 places in 425 ms of which 34 ms to minimize.
[2024-05-21 15:26:35] [INFO ] Deduced a trap composed of 13 places in 202 ms of which 4 ms to minimize.
[2024-05-21 15:26:35] [INFO ] Deduced a trap composed of 25 places in 132 ms of which 14 ms to minimize.
[2024-05-21 15:26:35] [INFO ] Deduced a trap composed of 24 places in 124 ms of which 2 ms to minimize.
[2024-05-21 15:26:35] [INFO ] Deduced a trap composed of 19 places in 103 ms of which 2 ms to minimize.
[2024-05-21 15:26:35] [INFO ] Deduced a trap composed of 23 places in 95 ms of which 9 ms to minimize.
[2024-05-21 15:26:36] [INFO ] Deduced a trap composed of 25 places in 106 ms of which 3 ms to minimize.
[2024-05-21 15:26:36] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 1 ms to minimize.
[2024-05-21 15:26:36] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
[2024-05-21 15:26:36] [INFO ] Deduced a trap composed of 14 places in 66 ms of which 2 ms to minimize.
[2024-05-21 15:26:36] [INFO ] Deduced a trap composed of 16 places in 106 ms of which 2 ms to minimize.
[2024-05-21 15:26:36] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 1 ms to minimize.
[2024-05-21 15:26:36] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 2 ms to minimize.
[2024-05-21 15:26:36] [INFO ] Deduced a trap composed of 27 places in 74 ms of which 2 ms to minimize.
[2024-05-21 15:26:36] [INFO ] Deduced a trap composed of 22 places in 73 ms of which 1 ms to minimize.
[2024-05-21 15:26:36] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 1 ms to minimize.
[2024-05-21 15:26:37] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 1 ms to minimize.
[2024-05-21 15:26:37] [INFO ] Deduced a trap composed of 23 places in 54 ms of which 1 ms to minimize.
[2024-05-21 15:26:37] [INFO ] Deduced a trap composed of 39 places in 61 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 19/455 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-21 15:26:37] [INFO ] Deduced a trap composed of 25 places in 60 ms of which 1 ms to minimize.
[2024-05-21 15:26:37] [INFO ] Deduced a trap composed of 34 places in 69 ms of which 1 ms to minimize.
[2024-05-21 15:26:37] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 3/458 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-21 15:26:37] [INFO ] Deduced a trap composed of 31 places in 276 ms of which 1 ms to minimize.
[2024-05-21 15:26:37] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 1 ms to minimize.
[2024-05-21 15:26:37] [INFO ] Deduced a trap composed of 35 places in 69 ms of which 1 ms to minimize.
[2024-05-21 15:26:38] [INFO ] Deduced a trap composed of 33 places in 128 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/391 variables, 4/462 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-21 15:26:38] [INFO ] Deduced a trap composed of 104 places in 182 ms of which 3 ms to minimize.
[2024-05-21 15:26:38] [INFO ] Deduced a trap composed of 105 places in 142 ms of which 3 ms to minimize.
[2024-05-21 15:26:38] [INFO ] Deduced a trap composed of 105 places in 129 ms of which 2 ms to minimize.
[2024-05-21 15:26:38] [INFO ] Deduced a trap composed of 105 places in 215 ms of which 2 ms to minimize.
[2024-05-21 15:26:39] [INFO ] Deduced a trap composed of 27 places in 210 ms of which 2 ms to minimize.
[2024-05-21 15:26:39] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 2 ms to minimize.
[2024-05-21 15:26:39] [INFO ] Deduced a trap composed of 43 places in 139 ms of which 5 ms to minimize.
[2024-05-21 15:26:39] [INFO ] Deduced a trap composed of 101 places in 163 ms of which 16 ms to minimize.
[2024-05-21 15:26:39] [INFO ] Deduced a trap composed of 106 places in 135 ms of which 3 ms to minimize.
SMT process timed out in 6637ms, After SMT, problems are : Problem set: 2 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 53 out of 518 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 518/518 places, 471/471 transitions.
Graph (trivial) has 242 edges and 518 vertex of which 4 / 518 are part of one of the 1 SCC in 3 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Graph (complete) has 1067 edges and 515 vertex of which 514 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 88 transitions
Trivial Post-agglo rules discarded 88 transitions
Performed 88 trivial Post agglomeration. Transition count delta: 88
Iterating post reduction 0 with 88 rules applied. Total rules applied 90 place count 514 transition count 379
Reduce places removed 88 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 95 rules applied. Total rules applied 185 place count 426 transition count 372
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 192 place count 419 transition count 372
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 192 place count 419 transition count 304
Deduced a syphon composed of 68 places in 1 ms
Ensure Unique test removed 7 places
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 3 with 143 rules applied. Total rules applied 335 place count 344 transition count 304
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 388 place count 291 transition count 251
Iterating global reduction 3 with 53 rules applied. Total rules applied 441 place count 291 transition count 251
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 441 place count 291 transition count 247
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 449 place count 287 transition count 247
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 573 place count 225 transition count 185
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
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 575 place count 224 transition count 188
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 576 place count 224 transition count 187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 577 place count 223 transition count 187
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 582 place count 223 transition count 187
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 583 place count 223 transition count 187
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 584 place count 222 transition count 186
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 585 place count 221 transition count 186
Applied a total of 585 rules in 160 ms. Remains 221 /518 variables (removed 297) and now considering 186/471 (removed 285) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 221/518 places, 186/471 transitions.
RANDOM walk for 40000 steps (1055 resets) in 400 ms. (99 steps per ms) remains 2/4 properties
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (170 resets) in 222 ms. (179 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (181 resets) in 134 ms. (296 steps per ms) remains 2/2 properties
// Phase 1: matrix 186 rows 221 cols
[2024-05-21 15:26:40] [INFO ] Computed 76 invariants in 7 ms
[2024-05-21 15:26:40] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 112/156 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 6/162 variables, 3/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/162 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 55/217 variables, 29/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/217 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 3/220 variables, 3/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 186/406 variables, 220/296 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/406 variables, 4/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/406 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/407 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/407 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/407 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 407/407 variables, and 301 constraints, problems are : Problem set: 0 solved, 2 unsolved in 249 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 221/221 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/44 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 112/156 variables, 41/41 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:26:40] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 1 ms to minimize.
[2024-05-21 15:26:40] [INFO ] Deduced a trap composed of 6 places in 49 ms of which 1 ms to minimize.
[2024-05-21 15:26:40] [INFO ] Deduced a trap composed of 6 places in 44 ms of which 1 ms to minimize.
[2024-05-21 15:26:40] [INFO ] Deduced a trap composed of 8 places in 47 ms of which 1 ms to minimize.
[2024-05-21 15:26:40] [INFO ] Deduced a trap composed of 9 places in 76 ms of which 14 ms to minimize.
[2024-05-21 15:26:40] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 1 ms to minimize.
[2024-05-21 15:26:40] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 1 ms to minimize.
[2024-05-21 15:26:40] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
[2024-05-21 15:26:40] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
[2024-05-21 15:26:41] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 1 ms to minimize.
[2024-05-21 15:26:41] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 2 ms to minimize.
[2024-05-21 15:26:41] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 1 ms to minimize.
[2024-05-21 15:26:41] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 1 ms to minimize.
[2024-05-21 15:26:41] [INFO ] Deduced a trap composed of 11 places in 44 ms of which 1 ms to minimize.
[2024-05-21 15:26:41] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 1 ms to minimize.
[2024-05-21 15:26:41] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 2 ms to minimize.
[2024-05-21 15:26:41] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 1 ms to minimize.
[2024-05-21 15:26:41] [INFO ] Deduced a trap composed of 17 places in 43 ms of which 1 ms to minimize.
[2024-05-21 15:26:41] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-05-21 15:26:41] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/156 variables, 20/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/156 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 6/162 variables, 3/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 55/217 variables, 29/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:26:41] [INFO ] Deduced a trap composed of 49 places in 86 ms of which 8 ms to minimize.
[2024-05-21 15:26:41] [INFO ] Deduced a trap composed of 13 places in 52 ms of which 1 ms to minimize.
[2024-05-21 15:26:41] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 2 ms to minimize.
[2024-05-21 15:26:41] [INFO ] Deduced a trap composed of 14 places in 72 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/217 variables, 4/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/217 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 3/220 variables, 3/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/220 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 186/406 variables, 220/320 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/406 variables, 4/324 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/406 variables, 2/326 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:26:42] [INFO ] Deduced a trap composed of 7 places in 82 ms of which 1 ms to minimize.
[2024-05-21 15:26:42] [INFO ] Deduced a trap composed of 11 places in 70 ms of which 1 ms to minimize.
[2024-05-21 15:26:42] [INFO ] Deduced a trap composed of 45 places in 72 ms of which 2 ms to minimize.
[2024-05-21 15:26:42] [INFO ] Deduced a trap composed of 14 places in 114 ms of which 2 ms to minimize.
[2024-05-21 15:26:42] [INFO ] Deduced a trap composed of 9 places in 53 ms of which 2 ms to minimize.
[2024-05-21 15:26:42] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 1 ms to minimize.
[2024-05-21 15:26:42] [INFO ] Deduced a trap composed of 13 places in 101 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/406 variables, 7/333 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 15:26:42] [INFO ] Deduced a trap composed of 48 places in 69 ms of which 1 ms to minimize.
[2024-05-21 15:26:43] [INFO ] Deduced a trap composed of 51 places in 69 ms of which 2 ms to minimize.
[2024-05-21 15:26:43] [INFO ] Deduced a trap composed of 49 places in 68 ms of which 1 ms to minimize.
[2024-05-21 15:26:43] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 2 ms to minimize.
[2024-05-21 15:26:43] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 2 ms to minimize.
[2024-05-21 15:26:43] [INFO ] Deduced a trap composed of 44 places in 83 ms of which 1 ms to minimize.
[2024-05-21 15:26:43] [INFO ] Deduced a trap composed of 8 places in 24 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/406 variables, 7/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/406 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem BusinessProcesses-PT-10-ReachabilityCardinality-2024-01 is UNSAT
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 17 (OVERLAPS) 1/407 variables, 1/341 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/407 variables, 0/341 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/407 variables, 0/341 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 407/407 variables, and 341 constraints, problems are : Problem set: 1 solved, 1 unsolved in 3234 ms.
Refiners :[Positive P Invariants (semi-flows): 44/44 constraints, Generalized P Invariants (flows): 32/32 constraints, State Equation: 221/221 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 38/38 constraints]
After SMT, in 3510ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 5340 steps, including 133 resets, run visited all 1 properties in 27 ms. (steps per millisecond=197 )
FORMULA BusinessProcesses-PT-10-ReachabilityCardinality-2024-13 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 34 ms.
All properties solved without resorting to model-checking.
Total runtime 12623 ms.
ITS solved all properties within timeout

BK_STOP 1716305203780

--------------------
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 ReachabilityCardinality -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="ReachabilityCardinality"
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 ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r047-tajo-171620398400526"
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 [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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