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.r201-smll-171649586500078.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 HirschbergSinclair-PT-15, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r201-smll-171649586500078
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.4K May 19 07:10 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 19 15:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 22K Apr 13 03:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K Apr 13 03:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 13 03:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 13 03:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K Apr 22 14:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K Apr 22 14:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 173K 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 HirschbergSinclair-PT-15-ReachabilityCardinality-2024-00
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityCardinality-2024-01
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityCardinality-2024-02
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityCardinality-2024-03
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityCardinality-2024-04
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityCardinality-2024-05
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityCardinality-2024-06
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityCardinality-2024-07
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityCardinality-2024-08
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityCardinality-2024-09
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityCardinality-2024-10
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityCardinality-2024-11
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityCardinality-2024-12
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityCardinality-2024-13
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityCardinality-2024-14
FORMULA_NAME HirschbergSinclair-PT-15-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1716581980347

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-15
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-24 20:19:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-24 20:19:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 20:19:42] [INFO ] Load time of PNML (sax parser for PT used): 207 ms
[2024-05-24 20:19:42] [INFO ] Transformed 330 places.
[2024-05-24 20:19:42] [INFO ] Transformed 296 transitions.
[2024-05-24 20:19:42] [INFO ] Parsed PT model containing 330 places and 296 transitions and 906 arcs in 469 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 35 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (132 resets) in 2541 ms. (15 steps per ms) remains 10/16 properties
FORMULA HirschbergSinclair-PT-15-ReachabilityCardinality-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-15-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-15-ReachabilityCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-15-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-15-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA HirschbergSinclair-PT-15-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (20 resets) in 435 ms. (91 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (20 resets) in 205 ms. (194 steps per ms) remains 9/10 properties
FORMULA HirschbergSinclair-PT-15-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (18 resets) in 1279 ms. (31 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (20 resets) in 608 ms. (65 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (20 resets) in 206 ms. (193 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (20 resets) in 167 ms. (238 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (20 resets) in 200 ms. (199 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (20 resets) in 128 ms. (310 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (20 resets) in 62 ms. (634 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (20 resets) in 110 ms. (360 steps per ms) remains 9/9 properties
// Phase 1: matrix 296 rows 330 cols
[2024-05-24 20:19:44] [INFO ] Computed 34 invariants in 20 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/191 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/191 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem HirschbergSinclair-PT-15-ReachabilityCardinality-2024-04 is UNSAT
FORMULA HirschbergSinclair-PT-15-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem HirschbergSinclair-PT-15-ReachabilityCardinality-2024-08 is UNSAT
FORMULA HirschbergSinclair-PT-15-ReachabilityCardinality-2024-08 FALSE TECHNIQUES SMT_REFINEMENT
Problem HirschbergSinclair-PT-15-ReachabilityCardinality-2024-11 is UNSAT
FORMULA HirschbergSinclair-PT-15-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem HirschbergSinclair-PT-15-ReachabilityCardinality-2024-13 is UNSAT
FORMULA HirschbergSinclair-PT-15-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
Problem HirschbergSinclair-PT-15-ReachabilityCardinality-2024-15 is UNSAT
FORMULA HirschbergSinclair-PT-15-ReachabilityCardinality-2024-15 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 124/315 variables, 29/30 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/315 variables, 1/31 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/315 variables, 0/31 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 9/324 variables, 3/34 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/324 variables, 0/34 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 296/620 variables, 324/358 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/620 variables, 0/358 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 6/626 variables, 6/364 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/626 variables, 0/364 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/626 variables, 0/364 constraints. Problems are: Problem set: 5 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 626/626 variables, and 364 constraints, problems are : Problem set: 5 solved, 4 unsolved in 1661 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 330/330 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 0/0 constraints. Problems are: Problem set: 5 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 204/305 variables, 29/29 constraints. Problems are: Problem set: 5 solved, 4 unsolved
[2024-05-24 20:19:46] [INFO ] Deduced a trap composed of 27 places in 238 ms of which 35 ms to minimize.
[2024-05-24 20:19:47] [INFO ] Deduced a trap composed of 34 places in 170 ms of which 4 ms to minimize.
[2024-05-24 20:19:47] [INFO ] Deduced a trap composed of 19 places in 134 ms of which 3 ms to minimize.
[2024-05-24 20:19:47] [INFO ] Deduced a trap composed of 15 places in 125 ms of which 3 ms to minimize.
[2024-05-24 20:19:47] [INFO ] Deduced a trap composed of 27 places in 139 ms of which 3 ms to minimize.
[2024-05-24 20:19:47] [INFO ] Deduced a trap composed of 20 places in 132 ms of which 3 ms to minimize.
[2024-05-24 20:19:47] [INFO ] Deduced a trap composed of 65 places in 114 ms of which 3 ms to minimize.
[2024-05-24 20:19:48] [INFO ] Deduced a trap composed of 23 places in 113 ms of which 4 ms to minimize.
Problem HirschbergSinclair-PT-15-ReachabilityCardinality-2024-12 is UNSAT
FORMULA HirschbergSinclair-PT-15-ReachabilityCardinality-2024-12 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (INCLUDED_ONLY) 0/305 variables, 8/37 constraints. Problems are: Problem set: 6 solved, 3 unsolved
[2024-05-24 20:19:48] [INFO ] Deduced a trap composed of 34 places in 182 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/305 variables, 1/38 constraints. Problems are: Problem set: 6 solved, 3 unsolved
[2024-05-24 20:19:48] [INFO ] Deduced a trap composed of 60 places in 95 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/305 variables, 1/39 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/305 variables, 0/39 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 3/308 variables, 1/40 constraints. Problems are: Problem set: 6 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 0/40 constraints. Problems are: Problem set: 6 solved, 3 unsolved
Problem HirschbergSinclair-PT-15-ReachabilityCardinality-2024-06 is UNSAT
FORMULA HirschbergSinclair-PT-15-ReachabilityCardinality-2024-06 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 14/322 variables, 4/44 constraints. Problems are: Problem set: 7 solved, 2 unsolved
[2024-05-24 20:19:48] [INFO ] Deduced a trap composed of 21 places in 136 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/322 variables, 1/45 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/322 variables, 0/45 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 296/618 variables, 322/367 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/618 variables, 1/368 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/618 variables, 0/368 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 8/626 variables, 8/376 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/626 variables, 1/377 constraints. Problems are: Problem set: 7 solved, 2 unsolved
[2024-05-24 20:19:49] [INFO ] Deduced a trap composed of 11 places in 113 ms of which 3 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/626 variables, 1/378 constraints. Problems are: Problem set: 7 solved, 2 unsolved
[2024-05-24 20:19:49] [INFO ] Deduced a trap composed of 52 places in 130 ms of which 3 ms to minimize.
[2024-05-24 20:19:49] [INFO ] Deduced a trap composed of 31 places in 150 ms of which 3 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/626 variables, 2/380 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/626 variables, 0/380 constraints. Problems are: Problem set: 7 solved, 2 unsolved
[2024-05-24 20:19:50] [INFO ] Deduced a trap composed of 16 places in 133 ms of which 3 ms to minimize.
At refinement iteration 19 (OVERLAPS) 0/626 variables, 1/381 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/626 variables, 0/381 constraints. Problems are: Problem set: 7 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/626 variables, 0/381 constraints. Problems are: Problem set: 7 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 626/626 variables, and 381 constraints, problems are : Problem set: 7 solved, 2 unsolved in 4057 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 330/330 constraints, PredecessorRefiner: 2/9 constraints, Known Traps: 15/15 constraints]
After SMT, in 5910ms problems are : Problem set: 7 solved, 2 unsolved
Parikh walk visited 0 properties in 448 ms.
Support contains 58 out of 330 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 330/330 places, 296/296 transitions.
Graph (complete) has 628 edges and 330 vertex of which 312 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.5 ms
Discarding 18 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 63 transitions
Trivial Post-agglo rules discarded 63 transitions
Performed 63 trivial Post agglomeration. Transition count delta: 63
Iterating post reduction 0 with 68 rules applied. Total rules applied 69 place count 312 transition count 228
Reduce places removed 63 places and 0 transitions.
Graph (complete) has 439 edges and 249 vertex of which 234 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.1 ms
Discarding 15 places :
Also discarding 0 output transitions
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Iterating post reduction 1 with 79 rules applied. Total rules applied 148 place count 234 transition count 213
Reduce places removed 15 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 178 place count 219 transition count 198
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 181 place count 216 transition count 195
Iterating global reduction 3 with 3 rules applied. Total rules applied 184 place count 216 transition count 195
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 186 place count 214 transition count 193
Iterating global reduction 3 with 2 rules applied. Total rules applied 188 place count 214 transition count 193
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 208 place count 214 transition count 173
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 228 place count 194 transition count 173
Reduce places removed 8 places and 8 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 236 place count 186 transition count 165
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 237 place count 185 transition count 165
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 237 place count 185 transition count 161
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 245 place count 181 transition count 161
Applied a total of 245 rules in 154 ms. Remains 181 /330 variables (removed 149) and now considering 161/296 (removed 135) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 181/330 places, 161/296 transitions.
RANDOM walk for 40000 steps (240 resets) in 596 ms. (67 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (49 resets) in 161 ms. (246 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (44 resets) in 156 ms. (254 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 718953 steps, run timeout after 3001 ms. (steps per millisecond=239 ) properties seen :0 out of 2
Probabilistic random walk after 718953 steps, saw 145947 distinct states, run finished after 3016 ms. (steps per millisecond=238 ) properties seen :0
// Phase 1: matrix 161 rows 181 cols
[2024-05-24 20:19:54] [INFO ] Computed 20 invariants in 6 ms
[2024-05-24 20:19:54] [INFO ] State equation strengthened by 30 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/68 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 101/169 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 160/329 variables, 169/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 29/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 12/341 variables, 11/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 1/342 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/342 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/342 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 342/342 variables, and 231 constraints, problems are : Problem set: 0 solved, 2 unsolved in 404 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 181/181 constraints, ReadFeed: 30/30 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/58 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/68 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/68 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 101/169 variables, 14/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 160/329 variables, 169/189 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/329 variables, 29/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/329 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 12/341 variables, 11/229 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/341 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/341 variables, 2/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/341 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/342 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/342 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/342 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 342/342 variables, and 233 constraints, problems are : Problem set: 0 solved, 2 unsolved in 545 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 181/181 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 986ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 280 ms.
Support contains 58 out of 181 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 161/161 transitions.
Applied a total of 0 rules in 19 ms. Remains 181 /181 variables (removed 0) and now considering 161/161 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 181/181 places, 161/161 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 181/181 places, 161/161 transitions.
Applied a total of 0 rules in 9 ms. Remains 181 /181 variables (removed 0) and now considering 161/161 (removed 0) transitions.
[2024-05-24 20:19:55] [INFO ] Invariant cache hit.
[2024-05-24 20:19:55] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-24 20:19:55] [INFO ] Invariant cache hit.
[2024-05-24 20:19:56] [INFO ] State equation strengthened by 30 read => feed constraints.
[2024-05-24 20:19:56] [INFO ] Implicit Places using invariants and state equation in 386 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
[2024-05-24 20:19:56] [INFO ] Redundant transitions in 5 ms returned []
Running 149 sub problems to find dead transitions.
[2024-05-24 20:19:56] [INFO ] Invariant cache hit.
[2024-05-24 20:19:56] [INFO ] State equation strengthened by 30 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (OVERLAPS) 5/172 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (OVERLAPS) 6/178 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (OVERLAPS) 161/339 variables, 178/198 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 30/228 constraints. Problems are: Problem set: 0 solved, 149 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 10 (OVERLAPS) 3/342 variables, 3/231 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/342 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 12 (OVERLAPS) 0/342 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Real declared 342/342 variables, and 231 constraints, problems are : Problem set: 0 solved, 149 unsolved in 11171 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 181/181 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 149 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/167 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/167 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/167 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 3 (OVERLAPS) 5/172 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/172 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 5 (OVERLAPS) 6/178 variables, 11/20 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/178 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 7 (OVERLAPS) 161/339 variables, 178/198 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/339 variables, 30/228 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/339 variables, 149/377 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/339 variables, 0/377 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 11 (OVERLAPS) 3/342 variables, 3/380 constraints. Problems are: Problem set: 0 solved, 149 unsolved
[2024-05-24 20:20:17] [INFO ] Deduced a trap composed of 15 places in 62 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/342 variables, 1/381 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/342 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 149 unsolved
At refinement iteration 14 (OVERLAPS) 0/342 variables, 0/381 constraints. Problems are: Problem set: 0 solved, 149 unsolved
No progress, stopping.
After SMT solving in domain Int declared 342/342 variables, and 381 constraints, problems are : Problem set: 0 solved, 149 unsolved in 20892 ms.
Refiners :[Positive P Invariants (semi-flows): 6/6 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 181/181 constraints, ReadFeed: 30/30 constraints, PredecessorRefiner: 149/149 constraints, Known Traps: 1/1 constraints]
After SMT, in 32140ms problems are : Problem set: 0 solved, 149 unsolved
Search for dead transitions found 0 dead transitions in 32145ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32725 ms. Remains : 181/181 places, 161/161 transitions.
Attempting over-approximation, by ignoring read arcs.
Drop transitions (Trivial Post-Agglo cleanup.) removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 181 transition count 140
Reduce places removed 21 places and 0 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Iterating post reduction 1 with 28 rules applied. Total rules applied 49 place count 160 transition count 133
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 56 place count 153 transition count 133
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 15 Pre rules applied. Total rules applied 56 place count 153 transition count 118
Deduced a syphon composed of 15 places in 0 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 86 place count 138 transition count 118
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 88 place count 137 transition count 117
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 89 place count 136 transition count 117
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 89 place count 136 transition count 116
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 91 place count 135 transition count 116
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 5 with 2 rules applied. Total rules applied 93 place count 134 transition count 115
Applied a total of 93 rules in 30 ms. Remains 134 /181 variables (removed 47) and now considering 115/161 (removed 46) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 115 rows 134 cols
[2024-05-24 20:20:28] [INFO ] Computed 19 invariants in 4 ms
[2024-05-24 20:20:28] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 20:20:28] [INFO ] [Nat]Absence check using 6 positive place invariants in 2 ms returned sat
[2024-05-24 20:20:28] [INFO ] [Nat]Absence check using 6 positive and 13 generalized place invariants in 15 ms returned sat
[2024-05-24 20:20:28] [INFO ] After 118ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-05-24 20:20:28] [INFO ] Deduced a trap composed of 8 places in 28 ms of which 1 ms to minimize.
[2024-05-24 20:20:28] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 47 ms
TRAPS : Iteration 1
[2024-05-24 20:20:29] [INFO ] After 275ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-05-24 20:20:29] [INFO ] After 406ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 521 ms.
[2024-05-24 20:20:29] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 7 ms.
[2024-05-24 20:20:29] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 181 places, 161 transitions and 549 arcs took 8 ms.
[2024-05-24 20:20:29] [INFO ] Flatten gal took : 62 ms
Total runtime 47216 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running HirschbergSinclair-PT-15

IS_COLORED=
IS_NUPN=

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


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


----------------------------------------------------------------------
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: 625
MODEL NAME: /home/mcc/execution/411/model
181 places, 161 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 HirschbergSinclair-PT-15-ReachabilityCardinality-2024-00 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA HirschbergSinclair-PT-15-ReachabilityCardinality-2024-07 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716582269535

--------------------
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="HirschbergSinclair-PT-15"
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 HirschbergSinclair-PT-15, 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 r201-smll-171649586500078"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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