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.r179-tall-171640600600015.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 FlexibleBarrier-PT-04b, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640600600015
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 448K
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.5K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Apr 22 14:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.2K Apr 13 08:34 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 13 08:34 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Apr 13 08:33 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 13 08:33 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 69K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-2024-00
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-2024-01
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-2024-02
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-2024-03
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-2024-04
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-2024-05
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-2024-06
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-2024-07
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-2024-08
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-2024-09
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-2024-10
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-2024-11
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-2024-12
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-2024-13
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-2024-14
FORMULA_NAME FlexibleBarrier-PT-04b-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1716415990243

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FlexibleBarrier-PT-04b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 22:13:11] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-05-22 22:13:11] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 22:13:11] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2024-05-22 22:13:11] [INFO ] Transformed 268 places.
[2024-05-22 22:13:11] [INFO ] Transformed 305 transitions.
[2024-05-22 22:13:11] [INFO ] Found NUPN structural information;
[2024-05-22 22:13:11] [INFO ] Parsed PT model containing 268 places and 305 transitions and 743 arcs in 170 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (957 resets) in 1455 ms. (27 steps per ms) remains 6/16 properties
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (165 resets) in 239 ms. (166 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (169 resets) in 689 ms. (57 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (181 resets) in 242 ms. (164 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (97 resets) in 238 ms. (167 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (172 resets) in 294 ms. (135 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (174 resets) in 131 ms. (303 steps per ms) remains 6/6 properties
// Phase 1: matrix 305 rows 268 cols
[2024-05-22 22:13:12] [INFO ] Computed 6 invariants in 16 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/119 variables, 119/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/119 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem FlexibleBarrier-PT-04b-ReachabilityFireability-2024-09 is UNSAT
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-2024-09 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 149/268 variables, 6/125 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 149/274 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 0/274 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 305/573 variables, 268/542 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/573 variables, 0/542 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/573 variables, 0/542 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 573/573 variables, and 542 constraints, problems are : Problem set: 1 solved, 5 unsolved in 569 ms.
Refiners :[Domain max(s): 268/268 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 97/97 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/97 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 171/268 variables, 6/103 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 171/274 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-05-22 22:13:13] [INFO ] Deduced a trap composed of 86 places in 119 ms of which 23 ms to minimize.
[2024-05-22 22:13:13] [INFO ] Deduced a trap composed of 77 places in 105 ms of which 2 ms to minimize.
[2024-05-22 22:13:13] [INFO ] Deduced a trap composed of 83 places in 77 ms of which 1 ms to minimize.
[2024-05-22 22:13:13] [INFO ] Deduced a trap composed of 83 places in 79 ms of which 1 ms to minimize.
[2024-05-22 22:13:14] [INFO ] Deduced a trap composed of 82 places in 81 ms of which 2 ms to minimize.
[2024-05-22 22:13:14] [INFO ] Deduced a trap composed of 81 places in 76 ms of which 2 ms to minimize.
[2024-05-22 22:13:14] [INFO ] Deduced a trap composed of 104 places in 74 ms of which 2 ms to minimize.
[2024-05-22 22:13:14] [INFO ] Deduced a trap composed of 16 places in 80 ms of which 2 ms to minimize.
Problem FlexibleBarrier-PT-04b-ReachabilityFireability-2024-15 is UNSAT
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 8/282 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-22 22:13:14] [INFO ] Deduced a trap composed of 81 places in 59 ms of which 2 ms to minimize.
[2024-05-22 22:13:14] [INFO ] Deduced a trap composed of 75 places in 56 ms of which 1 ms to minimize.
[2024-05-22 22:13:14] [INFO ] Deduced a trap composed of 83 places in 58 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 3/285 constraints. Problems are: Problem set: 2 solved, 4 unsolved
[2024-05-22 22:13:14] [INFO ] Deduced a trap composed of 75 places in 71 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 1/286 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/286 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 305/573 variables, 268/554 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/573 variables, 4/558 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/573 variables, 0/558 constraints. Problems are: Problem set: 2 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/573 variables, 0/558 constraints. Problems are: Problem set: 2 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 573/573 variables, and 558 constraints, problems are : Problem set: 2 solved, 4 unsolved in 2017 ms.
Refiners :[Domain max(s): 268/268 constraints, Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 4/6 constraints, Known Traps: 12/12 constraints]
After SMT, in 2733ms problems are : Problem set: 2 solved, 4 unsolved
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-2024-01 FALSE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 980 ms.
Support contains 77 out of 268 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 268/268 places, 305/305 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 22 rules applied. Total rules applied 22 place count 268 transition count 283
Reduce places removed 22 places and 0 transitions.
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 1 with 37 rules applied. Total rules applied 59 place count 246 transition count 268
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 2 with 15 rules applied. Total rules applied 74 place count 231 transition count 268
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 74 place count 231 transition count 256
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 3 with 24 rules applied. Total rules applied 98 place count 219 transition count 256
Discarding 38 places :
Symmetric choice reduction at 3 with 38 rule applications. Total rules 136 place count 181 transition count 218
Iterating global reduction 3 with 38 rules applied. Total rules applied 174 place count 181 transition count 218
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 174 place count 181 transition count 216
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 178 place count 179 transition count 216
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 180 place count 177 transition count 214
Iterating global reduction 3 with 2 rules applied. Total rules applied 182 place count 177 transition count 214
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 183 place count 177 transition count 213
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 4 with 36 rules applied. Total rules applied 219 place count 159 transition count 195
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 221 place count 158 transition count 195
Free-agglomeration rule applied 4 times.
Iterating global reduction 4 with 4 rules applied. Total rules applied 225 place count 158 transition count 191
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 229 place count 154 transition count 191
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 230 place count 154 transition count 191
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 231 place count 153 transition count 190
Applied a total of 231 rules in 86 ms. Remains 153 /268 variables (removed 115) and now considering 190/305 (removed 115) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 153/268 places, 190/305 transitions.
RANDOM walk for 40000 steps (1185 resets) in 376 ms. (106 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (214 resets) in 99 ms. (400 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (122 resets) in 83 ms. (476 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (197 resets) in 128 ms. (310 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 927177 steps, run timeout after 3001 ms. (steps per millisecond=308 ) properties seen :0 out of 3
Probabilistic random walk after 927177 steps, saw 221961 distinct states, run finished after 3013 ms. (steps per millisecond=307 ) properties seen :0
[2024-05-22 22:13:19] [INFO ] Flow matrix only has 189 transitions (discarded 1 similar events)
// Phase 1: matrix 189 rows 153 cols
[2024-05-22 22:13:19] [INFO ] Computed 6 invariants in 3 ms
[2024-05-22 22:13:19] [INFO ] State equation strengthened by 1 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 76/153 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 189/342 variables, 153/159 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/342 variables, 1/160 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 22:13:20] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 2 ms to minimize.
[2024-05-22 22:13:20] [INFO ] Deduced a trap composed of 42 places in 63 ms of which 1 ms to minimize.
[2024-05-22 22:13:20] [INFO ] Deduced a trap composed of 62 places in 39 ms of which 1 ms to minimize.
[2024-05-22 22:13:20] [INFO ] Deduced a trap composed of 24 places in 60 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 4/164 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 22:13:20] [INFO ] Deduced a trap composed of 43 places in 50 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 22:13:20] [INFO ] Deduced a trap composed of 45 places in 42 ms of which 1 ms to minimize.
At refinement iteration 8 (OVERLAPS) 0/342 variables, 1/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-22 22:13:20] [INFO ] Deduced a trap composed of 47 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/342 variables, 0/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 342/342 variables, and 167 constraints, problems are : Problem set: 0 solved, 3 unsolved in 912 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 153/153 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/77 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 76/153 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 189/342 variables, 153/166 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/342 variables, 1/167 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 3/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/342 variables, 0/170 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 342/342 variables, and 170 constraints, problems are : Problem set: 0 solved, 3 unsolved in 401 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 153/153 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 7/7 constraints]
After SMT, in 1341ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 429 ms.
Support contains 77 out of 153 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 190/190 transitions.
Applied a total of 0 rules in 15 ms. Remains 153 /153 variables (removed 0) and now considering 190/190 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 153/153 places, 190/190 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 153/153 places, 190/190 transitions.
Applied a total of 0 rules in 5 ms. Remains 153 /153 variables (removed 0) and now considering 190/190 (removed 0) transitions.
[2024-05-22 22:13:21] [INFO ] Flow matrix only has 189 transitions (discarded 1 similar events)
[2024-05-22 22:13:21] [INFO ] Invariant cache hit.
[2024-05-22 22:13:21] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-22 22:13:21] [INFO ] Flow matrix only has 189 transitions (discarded 1 similar events)
[2024-05-22 22:13:21] [INFO ] Invariant cache hit.
[2024-05-22 22:13:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-22 22:13:21] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2024-05-22 22:13:21] [INFO ] Redundant transitions in 5 ms returned []
Running 186 sub problems to find dead transitions.
[2024-05-22 22:13:21] [INFO ] Flow matrix only has 189 transitions (discarded 1 similar events)
[2024-05-22 22:13:21] [INFO ] Invariant cache hit.
[2024-05-22 22:13:21] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 4/153 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 22:13:22] [INFO ] Deduced a trap composed of 24 places in 33 ms of which 1 ms to minimize.
[2024-05-22 22:13:22] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-22 22:13:23] [INFO ] Deduced a trap composed of 42 places in 38 ms of which 1 ms to minimize.
[2024-05-22 22:13:23] [INFO ] Deduced a trap composed of 23 places in 49 ms of which 1 ms to minimize.
[2024-05-22 22:13:23] [INFO ] Deduced a trap composed of 26 places in 44 ms of which 1 ms to minimize.
[2024-05-22 22:13:23] [INFO ] Deduced a trap composed of 42 places in 44 ms of which 1 ms to minimize.
[2024-05-22 22:13:23] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 1 ms to minimize.
[2024-05-22 22:13:23] [INFO ] Deduced a trap composed of 45 places in 45 ms of which 1 ms to minimize.
[2024-05-22 22:13:23] [INFO ] Deduced a trap composed of 48 places in 48 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 9/15 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 22:13:24] [INFO ] Deduced a trap composed of 45 places in 48 ms of which 1 ms to minimize.
[2024-05-22 22:13:24] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 0 ms to minimize.
[2024-05-22 22:13:24] [INFO ] Deduced a trap composed of 45 places in 36 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 189/342 variables, 153/171 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 1/172 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 8 (OVERLAPS) 0/342 variables, 0/172 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Real declared 342/342 variables, and 172 constraints, problems are : Problem set: 0 solved, 186 unsolved in 6406 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 153/153 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 186 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/149 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 1 (OVERLAPS) 4/153 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 12/18 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 22:13:29] [INFO ] Deduced a trap composed of 46 places in 41 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 5 (OVERLAPS) 189/342 variables, 153/172 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/342 variables, 1/173 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/342 variables, 186/359 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 22:13:30] [INFO ] Deduced a trap composed of 41 places in 46 ms of which 1 ms to minimize.
[2024-05-22 22:13:30] [INFO ] Deduced a trap composed of 54 places in 45 ms of which 0 ms to minimize.
[2024-05-22 22:13:31] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/342 variables, 3/362 constraints. Problems are: Problem set: 0 solved, 186 unsolved
[2024-05-22 22:13:33] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/342 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/342 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 186 unsolved
At refinement iteration 11 (OVERLAPS) 0/342 variables, 0/363 constraints. Problems are: Problem set: 0 solved, 186 unsolved
No progress, stopping.
After SMT solving in domain Int declared 342/342 variables, and 363 constraints, problems are : Problem set: 0 solved, 186 unsolved in 9851 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, State Equation: 153/153 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 186/186 constraints, Known Traps: 17/17 constraints]
After SMT, in 16301ms problems are : Problem set: 0 solved, 186 unsolved
Search for dead transitions found 0 dead transitions in 16306ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16538 ms. Remains : 153/153 places, 190/190 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 153 transition count 189
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 151 transition count 187
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 151 transition count 187
Applied a total of 5 rules in 12 ms. Remains 151 /153 variables (removed 2) and now considering 187/190 (removed 3) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 187 rows 151 cols
[2024-05-22 22:13:38] [INFO ] Computed 6 invariants in 2 ms
[2024-05-22 22:13:38] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-22 22:13:38] [INFO ] [Nat]Absence check using 6 positive place invariants in 1 ms returned sat
[2024-05-22 22:13:38] [INFO ] After 121ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2024-05-22 22:13:38] [INFO ] Deduced a trap composed of 42 places in 51 ms of which 1 ms to minimize.
[2024-05-22 22:13:38] [INFO ] Deduced a trap composed of 42 places in 42 ms of which 1 ms to minimize.
[2024-05-22 22:13:38] [INFO ] Deduced a trap composed of 22 places in 55 ms of which 1 ms to minimize.
[2024-05-22 22:13:38] [INFO ] Deduced a trap composed of 42 places in 54 ms of which 14 ms to minimize.
[2024-05-22 22:13:38] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 243 ms
[2024-05-22 22:13:38] [INFO ] Deduced a trap composed of 11 places in 46 ms of which 1 ms to minimize.
[2024-05-22 22:13:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
TRAPS : Iteration 1
[2024-05-22 22:13:38] [INFO ] After 636ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2024-05-22 22:13:38] [INFO ] After 799ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Over-approximation ignoring read arcs solved 0 properties in 882 ms.
[2024-05-22 22:13:38] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/ReachabilityFireability.sr.xml took 4 ms.
[2024-05-22 22:13:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 153 places, 190 transitions and 516 arcs took 3 ms.
[2024-05-22 22:13:39] [INFO ] Flatten gal took : 42 ms
Total runtime 27813 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FlexibleBarrier-PT-04b

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/407/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 153
TRANSITIONS: 190
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.003s, Sys 0.000s]


SAVING FILE /home/mcc/execution/407/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 689
MODEL NAME: /home/mcc/execution/407/model
153 places, 190 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-2024-11 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-2024-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA FlexibleBarrier-PT-04b-ReachabilityFireability-2024-13 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716416051148

--------------------
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="FlexibleBarrier-PT-04b"
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 FlexibleBarrier-PT-04b, 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 r179-tall-171640600600015"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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