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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 7.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 14K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 162K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K 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 184K 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-19-ReachabilityFireability-2024-00
FORMULA_NAME MedleyA-PT-19-ReachabilityFireability-2024-01
FORMULA_NAME MedleyA-PT-19-ReachabilityFireability-2024-02
FORMULA_NAME MedleyA-PT-19-ReachabilityFireability-2024-03
FORMULA_NAME MedleyA-PT-19-ReachabilityFireability-2024-04
FORMULA_NAME MedleyA-PT-19-ReachabilityFireability-2024-05
FORMULA_NAME MedleyA-PT-19-ReachabilityFireability-2024-06
FORMULA_NAME MedleyA-PT-19-ReachabilityFireability-2024-07
FORMULA_NAME MedleyA-PT-19-ReachabilityFireability-2024-08
FORMULA_NAME MedleyA-PT-19-ReachabilityFireability-2024-09
FORMULA_NAME MedleyA-PT-19-ReachabilityFireability-2024-10
FORMULA_NAME MedleyA-PT-19-ReachabilityFireability-2024-11
FORMULA_NAME MedleyA-PT-19-ReachabilityFireability-2024-12
FORMULA_NAME MedleyA-PT-19-ReachabilityFireability-2024-13
FORMULA_NAME MedleyA-PT-19-ReachabilityFireability-2024-14
FORMULA_NAME MedleyA-PT-19-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1717375127622

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-19
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-03 00:38:50] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-03 00:38:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-03 00:38:50] [INFO ] Load time of PNML (sax parser for PT used): 244 ms
[2024-06-03 00:38:50] [INFO ] Transformed 272 places.
[2024-06-03 00:38:50] [INFO ] Transformed 586 transitions.
[2024-06-03 00:38:50] [INFO ] Found NUPN structural information;
[2024-06-03 00:38:50] [INFO ] Parsed PT model containing 272 places and 586 transitions and 2889 arcs in 507 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 33 ms.
Working with output stream class java.io.PrintStream
Deduced a syphon composed of 3 places in 13 ms
Reduce places removed 3 places and 3 transitions.
RANDOM walk for 40000 steps (14 resets) in 3226 ms. (12 steps per ms) remains 15/16 properties
FORMULA MedleyA-PT-19-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 4004 steps (10 resets) in 133 ms. (29 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (10 resets) in 117 ms. (33 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (10 resets) in 80 ms. (49 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (11 resets) in 100 ms. (39 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (11 resets) in 126 ms. (31 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (10 resets) in 112 ms. (35 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (9 resets) in 107 ms. (37 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (10 resets) in 45 ms. (87 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (12 resets) in 187 ms. (21 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (13 resets) in 132 ms. (30 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (14 resets) in 20 ms. (190 steps per ms) remains 14/15 properties
FORMULA MedleyA-PT-19-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 4003 steps (12 resets) in 26 ms. (148 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4004 steps (12 resets) in 28 ms. (138 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (14 resets) in 18 ms. (210 steps per ms) remains 14/14 properties
BEST_FIRST walk for 4003 steps (12 resets) in 50 ms. (78 steps per ms) remains 14/14 properties
// Phase 1: matrix 583 rows 269 cols
[2024-06-03 00:38:52] [INFO ] Computed 24 invariants in 36 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 106/106 constraints. Problems are: Problem set: 0 solved, 14 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 14 unsolved
Problem MedleyA-PT-19-ReachabilityFireability-2024-00 is UNSAT
FORMULA MedleyA-PT-19-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem MedleyA-PT-19-ReachabilityFireability-2024-07 is UNSAT
FORMULA MedleyA-PT-19-ReachabilityFireability-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem MedleyA-PT-19-ReachabilityFireability-2024-12 is UNSAT
FORMULA MedleyA-PT-19-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
Problem MedleyA-PT-19-ReachabilityFireability-2024-13 is UNSAT
FORMULA MedleyA-PT-19-ReachabilityFireability-2024-13 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 83/189 variables, 10/116 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/189 variables, 83/199 constraints. Problems are: Problem set: 4 solved, 10 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/189 variables, 0/199 constraints. Problems are: Problem set: 4 solved, 10 unsolved
Problem MedleyA-PT-19-ReachabilityFireability-2024-08 is UNSAT
FORMULA MedleyA-PT-19-ReachabilityFireability-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem MedleyA-PT-19-ReachabilityFireability-2024-15 is UNSAT
FORMULA MedleyA-PT-19-ReachabilityFireability-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 80/269 variables, 14/213 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/269 variables, 80/293 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/269 variables, 0/293 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 583/852 variables, 269/562 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/852 variables, 0/562 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 0/852 variables, 0/562 constraints. Problems are: Problem set: 6 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 852/852 variables, and 562 constraints, problems are : Problem set: 6 solved, 8 unsolved in 2071 ms.
Refiners :[Domain max(s): 269/269 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 14/14 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 61/61 constraints. Problems are: Problem set: 6 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/61 variables, 0/61 constraints. Problems are: Problem set: 6 solved, 8 unsolved
Problem MedleyA-PT-19-ReachabilityFireability-2024-06 is UNSAT
FORMULA MedleyA-PT-19-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 104/165 variables, 10/71 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/165 variables, 104/175 constraints. Problems are: Problem set: 7 solved, 7 unsolved
[2024-06-03 00:38:55] [INFO ] Deduced a trap composed of 32 places in 161 ms of which 37 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/165 variables, 1/176 constraints. Problems are: Problem set: 7 solved, 7 unsolved
[2024-06-03 00:38:56] [INFO ] Deduced a trap composed of 46 places in 162 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/165 variables, 1/177 constraints. Problems are: Problem set: 7 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/165 variables, 0/177 constraints. Problems are: Problem set: 7 solved, 7 unsolved
Problem MedleyA-PT-19-ReachabilityFireability-2024-10 is UNSAT
FORMULA MedleyA-PT-19-ReachabilityFireability-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (OVERLAPS) 104/269 variables, 14/191 constraints. Problems are: Problem set: 8 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/269 variables, 104/295 constraints. Problems are: Problem set: 8 solved, 6 unsolved
[2024-06-03 00:38:56] [INFO ] Deduced a trap composed of 32 places in 356 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/269 variables, 1/296 constraints. Problems are: Problem set: 8 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/269 variables, 0/296 constraints. Problems are: Problem set: 8 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 583/852 variables, 269/565 constraints. Problems are: Problem set: 8 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/852 variables, 6/571 constraints. Problems are: Problem set: 8 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/852 variables, 0/571 constraints. Problems are: Problem set: 8 solved, 6 unsolved
[2024-06-03 00:38:58] [INFO ] Deduced a trap composed of 33 places in 251 ms of which 4 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/852 variables, 1/572 constraints. Problems are: Problem set: 8 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/852 variables, 0/572 constraints. Problems are: Problem set: 8 solved, 6 unsolved
At refinement iteration 16 (OVERLAPS) 0/852 variables, 0/572 constraints. Problems are: Problem set: 8 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 852/852 variables, and 572 constraints, problems are : Problem set: 8 solved, 6 unsolved in 5013 ms.
Refiners :[Domain max(s): 269/269 constraints, Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 6/14 constraints, Known Traps: 4/4 constraints]
After SMT, in 7709ms problems are : Problem set: 8 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 42 out of 269 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 269/269 places, 583/583 transitions.
Graph (complete) has 909 edges and 269 vertex of which 264 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.7 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 264 transition count 564
Reduce places removed 16 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 21 rules applied. Total rules applied 38 place count 248 transition count 559
Reduce places removed 4 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 43 place count 244 transition count 558
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 43 place count 244 transition count 543
Deduced a syphon composed of 15 places in 3 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 73 place count 229 transition count 543
Discarding 69 places :
Symmetric choice reduction at 3 with 69 rule applications. Total rules 142 place count 160 transition count 463
Iterating global reduction 3 with 69 rules applied. Total rules applied 211 place count 160 transition count 463
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 214 place count 157 transition count 457
Iterating global reduction 3 with 3 rules applied. Total rules applied 217 place count 157 transition count 457
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 239 place count 146 transition count 446
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 251 place count 140 transition count 466
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 3 with 11 rules applied. Total rules applied 262 place count 140 transition count 455
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 3 with 1 rules applied. Total rules applied 263 place count 140 transition count 454
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 264 place count 139 transition count 454
Free-agglomeration rule applied 5 times.
Iterating global reduction 5 with 5 rules applied. Total rules applied 269 place count 139 transition count 449
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 5 with 5 rules applied. Total rules applied 274 place count 134 transition count 449
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 6 with 9 rules applied. Total rules applied 283 place count 134 transition count 440
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 6 with 9 rules applied. Total rules applied 292 place count 125 transition count 440
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 7 with 9 rules applied. Total rules applied 301 place count 125 transition count 440
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 302 place count 124 transition count 439
Applied a total of 302 rules in 376 ms. Remains 124 /269 variables (removed 145) and now considering 439/583 (removed 144) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 398 ms. Remains : 124/269 places, 439/583 transitions.
RANDOM walk for 40000 steps (15 resets) in 511 ms. (78 steps per ms) remains 5/6 properties
FORMULA MedleyA-PT-19-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40001 steps (17 resets) in 373 ms. (106 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (11 resets) in 152 ms. (261 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (20 resets) in 247 ms. (161 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (21 resets) in 349 ms. (114 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (16 resets) in 163 ms. (243 steps per ms) remains 5/5 properties
// Phase 1: matrix 439 rows 124 cols
[2024-06-03 00:39:01] [INFO ] Computed 22 invariants in 3 ms
[2024-06-03 00:39:01] [INFO ] State equation strengthened by 39 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 30/65 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 46/111 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 2/113 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 436/549 variables, 113/133 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/549 variables, 39/172 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/549 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 13/562 variables, 10/182 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/562 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 1/563 variables, 2/184 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/563 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/563 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/563 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 563/563 variables, and 185 constraints, problems are : Problem set: 0 solved, 5 unsolved in 707 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 124/124 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 30/65 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/65 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 46/111 variables, 13/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 2/113 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/113 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 436/549 variables, 113/133 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/549 variables, 39/172 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/549 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/549 variables, 0/173 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 13/562 variables, 10/183 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/562 variables, 4/187 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-03 00:39:03] [INFO ] Deduced a trap composed of 22 places in 149 ms of which 2 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/562 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/562 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 1/563 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/563 variables, 1/191 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/563 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-03 00:39:04] [INFO ] Deduced a trap composed of 10 places in 110 ms of which 2 ms to minimize.
At refinement iteration 18 (OVERLAPS) 0/563 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/563 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (OVERLAPS) 0/563 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 563/563 variables, and 192 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2367 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 124/124 constraints, ReadFeed: 39/39 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 2/2 constraints]
After SMT, in 3165ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
FORMULA MedleyA-PT-19-ReachabilityFireability-2024-14 FALSE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-19-ReachabilityFireability-2024-11 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-19-ReachabilityFireability-2024-02 TRUE TECHNIQUES PARIKH_WALK
FORMULA MedleyA-PT-19-ReachabilityFireability-2024-01 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 4 properties in 384 ms.
Support contains 1 out of 124 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 124/124 places, 439/439 transitions.
Graph (complete) has 605 edges and 124 vertex of which 123 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 123 transition count 435
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 120 transition count 435
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 7 place count 120 transition count 432
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 13 place count 117 transition count 432
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 14 place count 117 transition count 431
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 18 place count 113 transition count 427
Iterating global reduction 3 with 4 rules applied. Total rules applied 22 place count 113 transition count 427
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 22 place count 113 transition count 426
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 24 place count 112 transition count 426
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 1 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 70 place count 89 transition count 403
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 73 place count 89 transition count 400
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 74 place count 88 transition count 397
Iterating global reduction 4 with 1 rules applied. Total rules applied 75 place count 88 transition count 397
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 77 place count 87 transition count 399
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 4 with 16 rules applied. Total rules applied 93 place count 87 transition count 383
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 98 place count 87 transition count 378
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 103 place count 82 transition count 378
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 5 with 10 rules applied. Total rules applied 113 place count 82 transition count 620
Reduce places removed 10 places and 0 transitions.
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 5 with 70 rules applied. Total rules applied 183 place count 72 transition count 560
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 184 place count 71 transition count 559
Applied a total of 184 rules in 156 ms. Remains 71 /124 variables (removed 53) and now considering 559/439 (removed -120) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 156 ms. Remains : 71/124 places, 559/439 transitions.
RANDOM walk for 22648 steps (2736 resets) in 553 ms. (40 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-19-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
All properties solved without resorting to model-checking.
Total runtime 15123 ms.
ITS solved all properties within timeout

BK_STOP 1717375145396

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-19"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is MedleyA-PT-19, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r575-smll-171734919700151"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-19.tgz
mv MedleyA-PT-19 execution
cd execution
if [ "ReachabilityFireability" = "ReachabilityDeadlock" ] || [ "ReachabilityFireability" = "UpperBounds" ] || [ "ReachabilityFireability" = "QuasiLiveness" ] || [ "ReachabilityFireability" = "StableMarking" ] || [ "ReachabilityFireability" = "Liveness" ] || [ "ReachabilityFireability" = "OneSafe" ] || [ "ReachabilityFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

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