Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r575-smll-171734919700142.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is MedleyA-PT-18, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r575-smll-171734919700142
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 9.7K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 158K Jun 2 16:33 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 MedleyA-PT-18-ReachabilityCardinality-2024-00
FORMULA_NAME MedleyA-PT-18-ReachabilityCardinality-2024-01
FORMULA_NAME MedleyA-PT-18-ReachabilityCardinality-2024-02
FORMULA_NAME MedleyA-PT-18-ReachabilityCardinality-2024-03
FORMULA_NAME MedleyA-PT-18-ReachabilityCardinality-2024-04
FORMULA_NAME MedleyA-PT-18-ReachabilityCardinality-2024-05
FORMULA_NAME MedleyA-PT-18-ReachabilityCardinality-2024-06
FORMULA_NAME MedleyA-PT-18-ReachabilityCardinality-2024-07
FORMULA_NAME MedleyA-PT-18-ReachabilityCardinality-2024-08
FORMULA_NAME MedleyA-PT-18-ReachabilityCardinality-2024-09
FORMULA_NAME MedleyA-PT-18-ReachabilityCardinality-2024-10
FORMULA_NAME MedleyA-PT-18-ReachabilityCardinality-2024-11
FORMULA_NAME MedleyA-PT-18-ReachabilityCardinality-2024-12
FORMULA_NAME MedleyA-PT-18-ReachabilityCardinality-2024-13
FORMULA_NAME MedleyA-PT-18-ReachabilityCardinality-2024-14
FORMULA_NAME MedleyA-PT-18-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717370730894

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 23:25:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 23:25:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:25:34] [INFO ] Load time of PNML (sax parser for PT used): 228 ms
[2024-06-02 23:25:34] [INFO ] Transformed 252 places.
[2024-06-02 23:25:34] [INFO ] Transformed 543 transitions.
[2024-06-02 23:25:34] [INFO ] Found NUPN structural information;
[2024-06-02 23:25:34] [INFO ] Parsed PT model containing 252 places and 543 transitions and 2436 arcs in 478 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 94 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 2 transitions
Reduce redundant transitions removed 2 transitions.
FORMULA MedleyA-PT-18-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-18-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (1532 resets) in 3877 ms. (10 steps per ms) remains 12/14 properties
FORMULA MedleyA-PT-18-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-18-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (353 resets) in 613 ms. (65 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (435 resets) in 889 ms. (44 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (354 resets) in 280 ms. (142 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (350 resets) in 1798 ms. (22 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (356 resets) in 128 ms. (310 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (352 resets) in 127 ms. (312 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (360 resets) in 121 ms. (327 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (344 resets) in 161 ms. (246 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (353 resets) in 87 ms. (454 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (364 resets) in 101 ms. (392 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (351 resets) in 128 ms. (310 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (366 resets) in 180 ms. (221 steps per ms) remains 11/12 properties
FORMULA MedleyA-PT-18-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
// Phase 1: matrix 541 rows 252 cols
[2024-06-02 23:25:37] [INFO ] Computed 7 invariants in 32 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/130 variables, 130/130 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/130 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem MedleyA-PT-18-ReachabilityCardinality-2024-03 is UNSAT
FORMULA MedleyA-PT-18-ReachabilityCardinality-2024-03 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 122/252 variables, 7/137 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 122/259 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/259 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 5 (OVERLAPS) 541/793 variables, 252/511 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/793 variables, 0/511 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 0/793 variables, 0/511 constraints. Problems are: Problem set: 1 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Real declared 793/793 variables, and 511 constraints, problems are : Problem set: 1 solved, 10 unsolved in 1797 ms.
Refiners :[Domain max(s): 252/252 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 98/98 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/98 variables, 0/98 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Problem MedleyA-PT-18-ReachabilityCardinality-2024-01 is UNSAT
FORMULA MedleyA-PT-18-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 154/252 variables, 7/105 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/252 variables, 154/259 constraints. Problems are: Problem set: 2 solved, 9 unsolved
[2024-06-02 23:25:39] [INFO ] Deduced a trap composed of 20 places in 447 ms of which 50 ms to minimize.
[2024-06-02 23:25:40] [INFO ] Deduced a trap composed of 28 places in 332 ms of which 5 ms to minimize.
[2024-06-02 23:25:40] [INFO ] Deduced a trap composed of 21 places in 331 ms of which 4 ms to minimize.
[2024-06-02 23:25:40] [INFO ] Deduced a trap composed of 28 places in 272 ms of which 3 ms to minimize.
[2024-06-02 23:25:41] [INFO ] Deduced a trap composed of 27 places in 272 ms of which 4 ms to minimize.
[2024-06-02 23:25:41] [INFO ] Deduced a trap composed of 37 places in 207 ms of which 4 ms to minimize.
[2024-06-02 23:25:41] [INFO ] Deduced a trap composed of 28 places in 333 ms of which 4 ms to minimize.
[2024-06-02 23:25:42] [INFO ] Deduced a trap composed of 29 places in 259 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 8/267 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/252 variables, 0/267 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 541/793 variables, 252/519 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/793 variables, 9/528 constraints. Problems are: Problem set: 2 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 793/793 variables, and 528 constraints, problems are : Problem set: 2 solved, 9 unsolved in 5013 ms.
Refiners :[Domain max(s): 252/252 constraints, Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 9/11 constraints, Known Traps: 8/8 constraints]
After SMT, in 7161ms problems are : Problem set: 2 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 45 out of 252 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 252/252 places, 541/541 transitions.
Graph (trivial) has 205 edges and 252 vertex of which 5 / 252 are part of one of the 1 SCC in 4 ms
Free SCC test removed 4 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 32 place count 248 transition count 505
Reduce places removed 31 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 41 rules applied. Total rules applied 73 place count 217 transition count 495
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 12 rules applied. Total rules applied 85 place count 207 transition count 493
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 86 place count 206 transition count 493
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 6 Pre rules applied. Total rules applied 86 place count 206 transition count 487
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 4 with 12 rules applied. Total rules applied 98 place count 200 transition count 487
Discarding 29 places :
Symmetric choice reduction at 4 with 29 rule applications. Total rules 127 place count 171 transition count 436
Iterating global reduction 4 with 29 rules applied. Total rules applied 156 place count 171 transition count 436
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 158 place count 171 transition count 434
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 159 place count 170 transition count 434
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 3 Pre rules applied. Total rules applied 159 place count 170 transition count 431
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 165 place count 167 transition count 431
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 167 place count 165 transition count 413
Iterating global reduction 6 with 2 rules applied. Total rules applied 169 place count 165 transition count 413
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 170 place count 164 transition count 411
Iterating global reduction 6 with 1 rules applied. Total rules applied 171 place count 164 transition count 411
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 6 with 30 rules applied. Total rules applied 201 place count 149 transition count 396
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 203 place count 149 transition count 394
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -59
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 7 with 32 rules applied. Total rules applied 235 place count 133 transition count 453
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 238 place count 133 transition count 450
Drop transitions (Redundant composition of simpler transitions.) removed 23 transitions
Redundant transition composition rules discarded 23 transitions
Iterating global reduction 8 with 23 rules applied. Total rules applied 261 place count 133 transition count 427
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 8 with 6 rules applied. Total rules applied 267 place count 130 transition count 424
Free-agglomeration rule applied 19 times.
Iterating global reduction 8 with 19 rules applied. Total rules applied 286 place count 130 transition count 405
Reduce places removed 19 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 21 rules applied. Total rules applied 307 place count 111 transition count 403
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 9 with 6 rules applied. Total rules applied 313 place count 111 transition count 397
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 314 place count 110 transition count 396
Applied a total of 314 rules in 345 ms. Remains 110 /252 variables (removed 142) and now considering 396/541 (removed 145) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 363 ms. Remains : 110/252 places, 396/541 transitions.
RANDOM walk for 40000 steps (3791 resets) in 1328 ms. (30 steps per ms) remains 4/9 properties
FORMULA MedleyA-PT-18-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-18-ReachabilityCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-18-ReachabilityCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-18-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-18-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (1226 resets) in 303 ms. (131 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (1250 resets) in 96 ms. (412 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (1177 resets) in 103 ms. (384 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (1295 resets) in 103 ms. (384 steps per ms) remains 1/4 properties
FORMULA MedleyA-PT-18-ReachabilityCardinality-2024-13 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-18-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA MedleyA-PT-18-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-06-02 23:25:45] [INFO ] Flow matrix only has 388 transitions (discarded 8 similar events)
// Phase 1: matrix 388 rows 110 cols
[2024-06-02 23:25:45] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:25:45] [INFO ] State equation strengthened by 151 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 62/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/108 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 23:25:45] [INFO ] Deduced a trap composed of 54 places in 125 ms of which 2 ms to minimize.
[2024-06-02 23:25:45] [INFO ] Deduced a trap composed of 52 places in 149 ms of which 2 ms to minimize.
[2024-06-02 23:25:45] [INFO ] Deduced a trap composed of 16 places in 232 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 388/496 variables, 108/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/496 variables, 151/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 2/498 variables, 2/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/498 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/498 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/498 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 271 constraints, problems are : Problem set: 0 solved, 1 unsolved in 931 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 110/110 constraints, ReadFeed: 151/151 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 62/65 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 43/108 variables, 4/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 23:25:46] [INFO ] Deduced a trap composed of 27 places in 137 ms of which 2 ms to minimize.
[2024-06-02 23:25:46] [INFO ] Deduced a trap composed of 15 places in 109 ms of which 1 ms to minimize.
[2024-06-02 23:25:46] [INFO ] Deduced a trap composed of 14 places in 110 ms of which 6 ms to minimize.
[2024-06-02 23:25:46] [INFO ] Deduced a trap composed of 14 places in 94 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 4/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/108 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 388/496 variables, 108/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/496 variables, 151/272 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 23:25:47] [INFO ] Deduced a trap composed of 13 places in 322 ms of which 3 ms to minimize.
[2024-06-02 23:25:47] [INFO ] Deduced a trap composed of 27 places in 359 ms of which 2 ms to minimize.
[2024-06-02 23:25:47] [INFO ] Deduced a trap composed of 13 places in 150 ms of which 2 ms to minimize.
[2024-06-02 23:25:48] [INFO ] Deduced a trap composed of 17 places in 109 ms of which 1 ms to minimize.
[2024-06-02 23:25:49] [INFO ] Deduced a trap composed of 72 places in 116 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/496 variables, 5/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/496 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/498 variables, 2/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/498 variables, 1/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/498 variables, 1/281 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 23:25:49] [INFO ] Deduced a trap composed of 8 places in 128 ms of which 2 ms to minimize.
[2024-06-02 23:25:49] [INFO ] Deduced a trap composed of 7 places in 96 ms of which 2 ms to minimize.
[2024-06-02 23:25:49] [INFO ] Deduced a trap composed of 10 places in 103 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/498 variables, 3/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/498 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/498 variables, 0/284 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 498/498 variables, and 284 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3368 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 110/110 constraints, ReadFeed: 151/151 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 15/15 constraints]
After SMT, in 4332ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 4592 steps, including 514 resets, run visited all 1 properties in 19 ms. (steps per millisecond=241 )
FORMULA MedleyA-PT-18-ReachabilityCardinality-2024-11 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 29 ms.
All properties solved without resorting to model-checking.
Total runtime 15961 ms.
ITS solved all properties within timeout

BK_STOP 1717370749691

--------------------
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="MedleyA-PT-18"
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 MedleyA-PT-18, 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 r575-smll-171734919700142"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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