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-171734919600086.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-11, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r575-smll-171734919600086
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 612K
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K 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 17K 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.1K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K 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 160K 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-11-ReachabilityCardinality-2024-00
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2024-01
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2024-02
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2024-03
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2024-04
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2024-05
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2024-06
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2024-07
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2024-08
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2024-09
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2024-10
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2024-11
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2024-12
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2024-13
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2024-14
FORMULA_NAME MedleyA-PT-11-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717362659191

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-11
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 21:11:01] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 21:11:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:11:02] [INFO ] Load time of PNML (sax parser for PT used): 329 ms
[2024-06-02 21:11:02] [INFO ] Transformed 150 places.
[2024-06-02 21:11:02] [INFO ] Transformed 478 transitions.
[2024-06-02 21:11:02] [INFO ] Found NUPN structural information;
[2024-06-02 21:11:02] [INFO ] Parsed PT model containing 150 places and 478 transitions and 2705 arcs in 579 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 40 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 9 transitions
Reduce redundant transitions removed 9 transitions.
FORMULA MedleyA-PT-11-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-ReachabilityCardinality-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-11-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (3126 resets) in 3375 ms. (11 steps per ms) remains 7/10 properties
FORMULA MedleyA-PT-11-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-11-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-11-ReachabilityCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (541 resets) in 450 ms. (88 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (613 resets) in 636 ms. (62 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (625 resets) in 362 ms. (110 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (548 resets) in 539 ms. (74 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (549 resets) in 747 ms. (53 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (546 resets) in 129 ms. (307 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (535 resets) in 126 ms. (314 steps per ms) remains 7/7 properties
[2024-06-02 21:11:04] [INFO ] Flow matrix only has 397 transitions (discarded 72 similar events)
// Phase 1: matrix 397 rows 150 cols
[2024-06-02 21:11:04] [INFO ] Computed 23 invariants in 15 ms
[2024-06-02 21:11:04] [INFO ] State equation strengthened by 171 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/70 variables, 70/70 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/70 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem MedleyA-PT-11-ReachabilityCardinality-2024-02 is UNSAT
FORMULA MedleyA-PT-11-ReachabilityCardinality-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 39/109 variables, 9/79 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 39/118 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/109 variables, 0/118 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Problem MedleyA-PT-11-ReachabilityCardinality-2024-09 is UNSAT
FORMULA MedleyA-PT-11-ReachabilityCardinality-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 37/146 variables, 14/132 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/146 variables, 37/169 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/169 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 394/540 variables, 146/315 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/540 variables, 171/486 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/540 variables, 0/486 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 7/547 variables, 4/490 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/547 variables, 4/494 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/547 variables, 0/494 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/547 variables, 0/494 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 547/547 variables, and 494 constraints, problems are : Problem set: 2 solved, 5 unsolved in 1472 ms.
Refiners :[Domain max(s): 150/150 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 150/150 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 19/19 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/19 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Problem MedleyA-PT-11-ReachabilityCardinality-2024-15 is UNSAT
FORMULA MedleyA-PT-11-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 53/72 variables, 6/25 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/72 variables, 53/78 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/72 variables, 0/78 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 9/81 variables, 3/81 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 9/90 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/90 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 65/146 variables, 14/104 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/146 variables, 65/169 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-06-02 21:11:06] [INFO ] Deduced a trap composed of 15 places in 253 ms of which 38 ms to minimize.
[2024-06-02 21:11:06] [INFO ] Deduced a trap composed of 19 places in 244 ms of which 3 ms to minimize.
[2024-06-02 21:11:07] [INFO ] Deduced a trap composed of 13 places in 240 ms of which 4 ms to minimize.
[2024-06-02 21:11:07] [INFO ] Deduced a trap composed of 26 places in 212 ms of which 3 ms to minimize.
[2024-06-02 21:11:07] [INFO ] Deduced a trap composed of 16 places in 277 ms of which 3 ms to minimize.
[2024-06-02 21:11:07] [INFO ] Deduced a trap composed of 29 places in 174 ms of which 2 ms to minimize.
[2024-06-02 21:11:08] [INFO ] Deduced a trap composed of 19 places in 157 ms of which 2 ms to minimize.
[2024-06-02 21:11:08] [INFO ] Deduced a trap composed of 17 places in 94 ms of which 3 ms to minimize.
[2024-06-02 21:11:08] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 4 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/146 variables, 9/178 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-06-02 21:11:08] [INFO ] Deduced a trap composed of 21 places in 179 ms of which 3 ms to minimize.
[2024-06-02 21:11:08] [INFO ] Deduced a trap composed of 39 places in 187 ms of which 3 ms to minimize.
[2024-06-02 21:11:08] [INFO ] Deduced a trap composed of 44 places in 142 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/146 variables, 3/181 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/146 variables, 0/181 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 394/540 variables, 146/327 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/540 variables, 171/498 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/540 variables, 3/501 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-06-02 21:11:09] [INFO ] Deduced a trap composed of 19 places in 141 ms of which 2 ms to minimize.
[2024-06-02 21:11:10] [INFO ] Deduced a trap composed of 15 places in 91 ms of which 3 ms to minimize.
[2024-06-02 21:11:10] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2024-06-02 21:11:10] [INFO ] Deduced a trap composed of 33 places in 119 ms of which 2 ms to minimize.
[2024-06-02 21:11:10] [INFO ] Deduced a trap composed of 29 places in 124 ms of which 2 ms to minimize.
[2024-06-02 21:11:10] [INFO ] Deduced a trap composed of 28 places in 98 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/540 variables, 6/507 constraints. Problems are: Problem set: 3 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 540/547 variables, and 507 constraints, problems are : Problem set: 3 solved, 4 unsolved in 5011 ms.
Refiners :[Domain max(s): 146/150 constraints, Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 146/150 constraints, ReadFeed: 171/171 constraints, PredecessorRefiner: 3/7 constraints, Known Traps: 18/18 constraints]
After SMT, in 6690ms problems are : Problem set: 3 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 17 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 469/469 transitions.
Graph (complete) has 749 edges and 150 vertex of which 147 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.5 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 33 place count 115 transition count 418
Iterating global reduction 0 with 32 rules applied. Total rules applied 65 place count 115 transition count 418
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 72 place count 108 transition count 379
Iterating global reduction 0 with 7 rules applied. Total rules applied 79 place count 108 transition count 379
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 82 place count 105 transition count 367
Iterating global reduction 0 with 3 rules applied. Total rules applied 85 place count 105 transition count 367
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 91 place count 102 transition count 386
Drop transitions (Redundant composition of simpler transitions.) removed 17 transitions
Redundant transition composition rules discarded 17 transitions
Iterating global reduction 0 with 17 rules applied. Total rules applied 108 place count 102 transition count 369
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 110 place count 101 transition count 368
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 112 place count 100 transition count 380
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 0 with 10 rules applied. Total rules applied 122 place count 100 transition count 439
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 0 with 23 rules applied. Total rules applied 145 place count 90 transition count 426
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 147 place count 90 transition count 426
Applied a total of 147 rules in 248 ms. Remains 90 /150 variables (removed 60) and now considering 426/469 (removed 43) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 267 ms. Remains : 90/150 places, 426/469 transitions.
RANDOM walk for 40000 steps (4807 resets) in 601 ms. (66 steps per ms) remains 2/4 properties
FORMULA MedleyA-PT-11-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA MedleyA-PT-11-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (1080 resets) in 127 ms. (312 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (1230 resets) in 176 ms. (226 steps per ms) remains 2/2 properties
[2024-06-02 21:11:11] [INFO ] Flow matrix only has 354 transitions (discarded 72 similar events)
// Phase 1: matrix 354 rows 90 cols
[2024-06-02 21:11:11] [INFO ] Computed 23 invariants in 6 ms
[2024-06-02 21:11:11] [INFO ] State equation strengthened by 189 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 20/30 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 19/49 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 40/89 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 354/443 variables, 89/112 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/443 variables, 189/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1/444 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/444 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/444 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 444/444 variables, and 302 constraints, problems are : Problem set: 0 solved, 2 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 90/90 constraints, ReadFeed: 189/189 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/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 20/30 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 19/49 variables, 5/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 40/89 variables, 14/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 21:11:12] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 2 ms to minimize.
[2024-06-02 21:11:12] [INFO ] Deduced a trap composed of 28 places in 114 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/89 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/89 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 354/443 variables, 89/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/443 variables, 189/303 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/443 variables, 1/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/443 variables, 0/304 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/444 variables, 1/305 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/444 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/444 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 21:11:13] [INFO ] Deduced a trap composed of 18 places in 94 ms of which 2 ms to minimize.
At refinement iteration 15 (OVERLAPS) 0/444 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/444 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/444 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 444/444 variables, and 307 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1908 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 90/90 constraints, ReadFeed: 189/189 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 3/3 constraints]
After SMT, in 2242ms problems are : Problem set: 0 solved, 2 unsolved
FORMULA MedleyA-PT-11-ReachabilityCardinality-2024-01 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 120 ms.
Support contains 5 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 426/426 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 86 transition count 410
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 86 transition count 410
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 85 transition count 405
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 85 transition count 405
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 84 transition count 401
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 84 transition count 401
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -12
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 83 transition count 413
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 82 transition count 384
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 82 transition count 384
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 81 transition count 380
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 81 transition count 380
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 19 place count 81 transition count 379
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 20 place count 80 transition count 379
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 1 with 5 rules applied. Total rules applied 25 place count 80 transition count 565
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 30 place count 75 transition count 565
Applied a total of 30 rules in 138 ms. Remains 75 /90 variables (removed 15) and now considering 565/426 (removed -139) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 75/90 places, 565/426 transitions.
RANDOM walk for 40000 steps (5744 resets) in 658 ms. (60 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (1910 resets) in 335 ms. (119 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 168146 steps, run visited all 1 properties in 1019 ms. (steps per millisecond=165 )
Probabilistic random walk after 168146 steps, saw 37948 distinct states, run finished after 1025 ms. (steps per millisecond=164 ) properties seen :1
FORMULA MedleyA-PT-11-ReachabilityCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 13961 ms.
ITS solved all properties within timeout

BK_STOP 1717362675549

--------------------
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-11"
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-11, 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-171734919600086"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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