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.r355-tall-171683760001006.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 ShieldRVt-PT-030B, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r355-tall-171683760001006
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 808K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:17 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 16:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:56 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:56 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 11 21:09 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Apr 11 21:09 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Apr 11 21:08 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 80K Apr 11 21:08 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 23 07:56 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 23 07:56 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 364K May 18 16:43 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 ShieldRVt-PT-030B-ReachabilityCardinality-2024-00
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-2024-01
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-2024-02
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-2024-03
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-2024-04
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-2024-05
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-2024-06
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-2024-07
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-2024-08
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-2024-09
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-2024-10
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-2024-11
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-2024-12
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-2024-13
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-2024-14
FORMULA_NAME ShieldRVt-PT-030B-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1717082558109

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-030B
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-30 15:22:39] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -timeout, 360, -rebuildPNML]
[2024-05-30 15:22:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-30 15:22:39] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2024-05-30 15:22:39] [INFO ] Transformed 1503 places.
[2024-05-30 15:22:39] [INFO ] Transformed 1503 transitions.
[2024-05-30 15:22:39] [INFO ] Found NUPN structural information;
[2024-05-30 15:22:39] [INFO ] Parsed PT model containing 1503 places and 1503 transitions and 3546 arcs in 264 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-2024-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 1945 ms. (20 steps per ms) remains 7/13 properties
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (8 resets) in 205 ms. (194 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 310 ms. (128 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 114 ms. (347 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 1155 ms. (34 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 102 ms. (388 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 125 ms. (317 steps per ms) remains 7/7 properties
// Phase 1: matrix 1503 rows 1503 cols
[2024-05-30 15:22:41] [INFO ] Computed 121 invariants in 38 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1402/1503 variables, 121/222 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1503 variables, 1402/1624 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1503 variables, 0/1624 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1503/3006 variables, 1503/3127 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/3006 variables, 0/3127 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/3006 variables, 0/3127 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3006/3006 variables, and 3127 constraints, problems are : Problem set: 0 solved, 7 unsolved in 2217 ms.
Refiners :[Domain max(s): 1503/1503 constraints, Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 1503/1503 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/101 variables, 101/101 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/101 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem ShieldRVt-PT-030B-ReachabilityCardinality-2024-05 is UNSAT
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 1402/1503 variables, 121/222 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1503 variables, 1402/1624 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-30 15:22:44] [INFO ] Deduced a trap composed of 45 places in 407 ms of which 63 ms to minimize.
[2024-05-30 15:22:44] [INFO ] Deduced a trap composed of 22 places in 325 ms of which 7 ms to minimize.
[2024-05-30 15:22:45] [INFO ] Deduced a trap composed of 42 places in 313 ms of which 6 ms to minimize.
[2024-05-30 15:22:45] [INFO ] Deduced a trap composed of 44 places in 306 ms of which 6 ms to minimize.
[2024-05-30 15:22:45] [INFO ] Deduced a trap composed of 28 places in 291 ms of which 6 ms to minimize.
[2024-05-30 15:22:46] [INFO ] Deduced a trap composed of 43 places in 281 ms of which 5 ms to minimize.
[2024-05-30 15:22:46] [INFO ] Deduced a trap composed of 47 places in 259 ms of which 5 ms to minimize.
[2024-05-30 15:22:46] [INFO ] Deduced a trap composed of 37 places in 265 ms of which 5 ms to minimize.
[2024-05-30 15:22:46] [INFO ] Deduced a trap composed of 57 places in 255 ms of which 5 ms to minimize.
[2024-05-30 15:22:47] [INFO ] Deduced a trap composed of 38 places in 242 ms of which 5 ms to minimize.
[2024-05-30 15:22:47] [INFO ] Deduced a trap composed of 37 places in 207 ms of which 4 ms to minimize.
[2024-05-30 15:22:47] [INFO ] Deduced a trap composed of 27 places in 205 ms of which 4 ms to minimize.
[2024-05-30 15:22:47] [INFO ] Deduced a trap composed of 35 places in 197 ms of which 4 ms to minimize.
[2024-05-30 15:22:48] [INFO ] Deduced a trap composed of 45 places in 191 ms of which 4 ms to minimize.
[2024-05-30 15:22:48] [INFO ] Deduced a trap composed of 47 places in 193 ms of which 4 ms to minimize.
[2024-05-30 15:22:48] [INFO ] Deduced a trap composed of 50 places in 191 ms of which 4 ms to minimize.
SMT process timed out in 7474ms, After SMT, problems are : Problem set: 1 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 94 out of 1503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1503/1503 places, 1503/1503 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 396 transitions
Trivial Post-agglo rules discarded 396 transitions
Performed 396 trivial Post agglomeration. Transition count delta: 396
Iterating post reduction 0 with 396 rules applied. Total rules applied 396 place count 1503 transition count 1107
Reduce places removed 396 places and 0 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Iterating post reduction 1 with 426 rules applied. Total rules applied 822 place count 1107 transition count 1077
Reduce places removed 30 places and 0 transitions.
Iterating post reduction 2 with 30 rules applied. Total rules applied 852 place count 1077 transition count 1077
Performed 117 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 117 Pre rules applied. Total rules applied 852 place count 1077 transition count 960
Deduced a syphon composed of 117 places in 2 ms
Reduce places removed 117 places and 0 transitions.
Iterating global reduction 3 with 234 rules applied. Total rules applied 1086 place count 960 transition count 960
Discarding 183 places :
Symmetric choice reduction at 3 with 183 rule applications. Total rules 1269 place count 777 transition count 777
Iterating global reduction 3 with 183 rules applied. Total rules applied 1452 place count 777 transition count 777
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 1452 place count 777 transition count 709
Deduced a syphon composed of 68 places in 3 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 3 with 136 rules applied. Total rules applied 1588 place count 709 transition count 709
Performed 249 Post agglomeration using F-continuation condition.Transition count delta: 249
Deduced a syphon composed of 249 places in 1 ms
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 3 with 498 rules applied. Total rules applied 2086 place count 460 transition count 460
Performed 67 Post agglomeration using F-continuation condition.Transition count delta: -44
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 2220 place count 393 transition count 504
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 2221 place count 393 transition count 503
Free-agglomeration rule applied 7 times.
Iterating global reduction 3 with 7 rules applied. Total rules applied 2228 place count 393 transition count 496
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 2235 place count 386 transition count 496
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 2238 place count 386 transition count 493
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 2241 place count 386 transition count 493
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 2242 place count 386 transition count 493
Applied a total of 2242 rules in 544 ms. Remains 386 /1503 variables (removed 1117) and now considering 493/1503 (removed 1010) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 557 ms. Remains : 386/1503 places, 493/1503 transitions.
RANDOM walk for 40000 steps (19 resets) in 694 ms. (57 steps per ms) remains 5/6 properties
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (9 resets) in 197 ms. (202 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (9 resets) in 226 ms. (176 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 231 ms. (172 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 182 ms. (218 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 177 ms. (224 steps per ms) remains 5/5 properties
// Phase 1: matrix 493 rows 386 cols
[2024-05-30 15:22:49] [INFO ] Computed 121 invariants in 2 ms
[2024-05-30 15:22:49] [INFO ] State equation strengthened by 180 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 337/386 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 493/879 variables, 386/507 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/879 variables, 180/687 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/879 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/879 variables, 0/687 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 879/879 variables, and 687 constraints, problems are : Problem set: 0 solved, 5 unsolved in 568 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 386/386 constraints, ReadFeed: 180/180 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/49 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 337/386 variables, 121/121 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 15:22:50] [INFO ] Deduced a trap composed of 9 places in 47 ms of which 1 ms to minimize.
[2024-05-30 15:22:50] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
[2024-05-30 15:22:50] [INFO ] Deduced a trap composed of 13 places in 50 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/386 variables, 3/124 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/386 variables, 0/124 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 493/879 variables, 386/510 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/879 variables, 180/690 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/879 variables, 5/695 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-30 15:22:51] [INFO ] Deduced a trap composed of 18 places in 47 ms of which 1 ms to minimize.
[2024-05-30 15:22:51] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/879 variables, 2/697 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/879 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/879 variables, 0/697 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 879/879 variables, and 697 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1642 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 386/386 constraints, ReadFeed: 180/180 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 5/5 constraints]
After SMT, in 2233ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-2024-09 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 2656 ms.
Support contains 24 out of 386 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 386/386 places, 493/493 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 386 transition count 471
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 45 place count 364 transition count 470
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 363 transition count 470
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 20 Pre rules applied. Total rules applied 46 place count 363 transition count 450
Deduced a syphon composed of 20 places in 1 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 86 place count 343 transition count 450
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 88 place count 341 transition count 448
Iterating global reduction 3 with 2 rules applied. Total rules applied 90 place count 341 transition count 448
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 90 place count 341 transition count 447
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 92 place count 340 transition count 447
Performed 41 Post agglomeration using F-continuation condition.Transition count delta: 41
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 174 place count 299 transition count 406
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: -24
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 212 place count 280 transition count 430
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 213 place count 280 transition count 429
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 215 place count 280 transition count 427
Free-agglomeration rule applied 3 times.
Iterating global reduction 4 with 3 rules applied. Total rules applied 218 place count 280 transition count 424
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 221 place count 277 transition count 424
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 222 place count 277 transition count 423
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 223 place count 276 transition count 422
Applied a total of 223 rules in 78 ms. Remains 276 /386 variables (removed 110) and now considering 422/493 (removed 71) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 276/386 places, 422/493 transitions.
RANDOM walk for 40000 steps (32 resets) in 331 ms. (120 steps per ms) remains 3/4 properties
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40002 steps (13 resets) in 176 ms. (226 steps per ms) remains 2/3 properties
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (9 resets) in 141 ms. (281 steps per ms) remains 1/2 properties
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-2024-03 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (10 resets) in 180 ms. (221 steps per ms) remains 1/1 properties
// Phase 1: matrix 422 rows 276 cols
[2024-05-30 15:22:54] [INFO ] Computed 121 invariants in 4 ms
[2024-05-30 15:22:54] [INFO ] State equation strengthened by 154 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/44 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 138/182 variables, 65/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 292/474 variables, 182/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 146/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 115/589 variables, 44/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/589 variables, 21/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/589 variables, 4/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/589 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/590 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/590 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/590 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 69/659 variables, 30/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/659 variables, 13/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/659 variables, 3/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/659 variables, 0/522 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 2/661 variables, 1/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/661 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 34/695 variables, 17/540 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/695 variables, 7/547 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/695 variables, 1/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/695 variables, 0/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 3/698 variables, 2/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/698 variables, 1/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/698 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/698 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 698/698 variables, and 551 constraints, problems are : Problem set: 0 solved, 1 unsolved in 255 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 276/276 constraints, ReadFeed: 154/154 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 34/44 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 138/182 variables, 65/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/182 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 292/474 variables, 182/259 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/474 variables, 146/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/474 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 115/589 variables, 44/449 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/589 variables, 21/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/589 variables, 4/474 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/589 variables, 1/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/589 variables, 0/475 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/590 variables, 1/476 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/590 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/590 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 69/659 variables, 30/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/659 variables, 13/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/659 variables, 3/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/659 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/661 variables, 1/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/661 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 34/695 variables, 17/541 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/695 variables, 7/548 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/695 variables, 1/549 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/695 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 3/698 variables, 2/551 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/698 variables, 1/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/698 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/698 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 698/698 variables, and 552 constraints, problems are : Problem set: 0 solved, 1 unsolved in 507 ms.
Refiners :[Positive P Invariants (semi-flows): 121/121 constraints, State Equation: 276/276 constraints, ReadFeed: 154/154 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 775ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 65 ms.
Support contains 10 out of 276 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 276/276 places, 422/422 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 276 transition count 416
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 270 transition count 416
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 12 place count 270 transition count 413
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 18 place count 267 transition count 413
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 17 rules applied. Total rules applied 35 place count 258 transition count 405
Renaming transitions due to excessive name length > 1024 char.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 39 place count 256 transition count 405
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 256 transition count 404
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 256 transition count 404
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 255 transition count 403
Applied a total of 42 rules in 55 ms. Remains 255 /276 variables (removed 21) and now considering 403/422 (removed 19) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 255/276 places, 403/422 transitions.
RANDOM walk for 40000 steps (17 resets) in 262 ms. (152 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (11 resets) in 154 ms. (258 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 639991 steps, run timeout after 3001 ms. (steps per millisecond=213 ) properties seen :0 out of 1
Probabilistic random walk after 639991 steps, saw 352838 distinct states, run finished after 3004 ms. (steps per millisecond=213 ) properties seen :0
// Phase 1: matrix 403 rows 255 cols
[2024-05-30 15:22:58] [INFO ] Computed 120 invariants in 2 ms
[2024-05-30 15:22:58] [INFO ] State equation strengthened by 154 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/39 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/169 variables, 65/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 279/448 variables, 169/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 150/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/448 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 111/559 variables, 42/438 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/559 variables, 21/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/559 variables, 4/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/559 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 65/624 variables, 28/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/624 variables, 14/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/624 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 31/655 variables, 14/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/655 variables, 7/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/655 variables, 0/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/658 variables, 2/528 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/658 variables, 1/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/658 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/658 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 658/658 variables, and 529 constraints, problems are : Problem set: 0 solved, 1 unsolved in 251 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 255/255 constraints, ReadFeed: 154/154 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 29/39 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 130/169 variables, 65/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/169 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 279/448 variables, 169/246 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/448 variables, 150/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/448 variables, 0/396 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 111/559 variables, 42/438 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/559 variables, 21/459 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/559 variables, 4/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/559 variables, 1/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/559 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 65/624 variables, 28/492 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/624 variables, 14/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/624 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 31/655 variables, 14/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/655 variables, 7/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/655 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 3/658 variables, 2/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/658 variables, 1/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/658 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/658 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 658/658 variables, and 530 constraints, problems are : Problem set: 0 solved, 1 unsolved in 485 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 255/255 constraints, ReadFeed: 154/154 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 747ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 106 ms.
Support contains 10 out of 255 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 403/403 transitions.
Applied a total of 0 rules in 7 ms. Remains 255 /255 variables (removed 0) and now considering 403/403 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 255/255 places, 403/403 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 255/255 places, 403/403 transitions.
Applied a total of 0 rules in 7 ms. Remains 255 /255 variables (removed 0) and now considering 403/403 (removed 0) transitions.
[2024-05-30 15:22:59] [INFO ] Invariant cache hit.
[2024-05-30 15:22:59] [INFO ] Implicit Places using invariants in 178 ms returned []
[2024-05-30 15:22:59] [INFO ] Invariant cache hit.
[2024-05-30 15:23:00] [INFO ] State equation strengthened by 154 read => feed constraints.
[2024-05-30 15:23:00] [INFO ] Implicit Places using invariants and state equation in 573 ms returned []
Implicit Place search using SMT with State Equation took 769 ms to find 0 implicit places.
[2024-05-30 15:23:00] [INFO ] Redundant transitions in 26 ms returned []
Running 397 sub problems to find dead transitions.
[2024-05-30 15:23:00] [INFO ] Invariant cache hit.
[2024-05-30 15:23:00] [INFO ] State equation strengthened by 154 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 2 (OVERLAPS) 3/255 variables, 75/120 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 4 (OVERLAPS) 403/658 variables, 255/375 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/658 variables, 154/529 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/658 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 7 (OVERLAPS) 0/658 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 397 unsolved
No progress, stopping.
After SMT solving in domain Real declared 658/658 variables, and 529 constraints, problems are : Problem set: 0 solved, 397 unsolved in 16778 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 255/255 constraints, ReadFeed: 154/154 constraints, PredecessorRefiner: 397/397 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 397 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 45/45 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 2 (OVERLAPS) 3/255 variables, 75/120 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/255 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 4 (OVERLAPS) 403/658 variables, 255/375 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/658 variables, 154/529 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/658 variables, 397/926 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/658 variables, 0/926 constraints. Problems are: Problem set: 0 solved, 397 unsolved
At refinement iteration 8 (OVERLAPS) 0/658 variables, 0/926 constraints. Problems are: Problem set: 0 solved, 397 unsolved
No progress, stopping.
After SMT solving in domain Int declared 658/658 variables, and 926 constraints, problems are : Problem set: 0 solved, 397 unsolved in 29909 ms.
Refiners :[Positive P Invariants (semi-flows): 120/120 constraints, State Equation: 255/255 constraints, ReadFeed: 154/154 constraints, PredecessorRefiner: 397/397 constraints, Known Traps: 0/0 constraints]
After SMT, in 46863ms problems are : Problem set: 0 solved, 397 unsolved
Search for dead transitions found 0 dead transitions in 46868ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 47683 ms. Remains : 255/255 places, 403/403 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 102 edges and 255 vertex of which 4 / 255 are part of one of the 2 SCC in 4 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 916 edges and 253 vertex of which 251 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 99 edges and 249 vertex of which 4 / 249 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 247 transition count 394
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 98 edges and 245 vertex of which 6 / 245 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 242 transition count 385
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 96 edges and 239 vertex of which 6 / 239 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 236 transition count 374
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 94 edges and 233 vertex of which 6 / 233 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 3 with 15 rules applied. Total rules applied 50 place count 230 transition count 363
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 91 edges and 227 vertex of which 6 / 227 are part of one of the 3 SCC in 2 ms
Free SCC test removed 3 places
Iterating post reduction 4 with 17 rules applied. Total rules applied 67 place count 224 transition count 350
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 89 edges and 221 vertex of which 6 / 221 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 5 with 15 rules applied. Total rules applied 82 place count 218 transition count 339
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 87 edges and 215 vertex of which 6 / 215 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 6 with 15 rules applied. Total rules applied 97 place count 212 transition count 328
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 83 edges and 209 vertex of which 4 / 209 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Iterating post reduction 7 with 15 rules applied. Total rules applied 112 place count 207 transition count 317
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 80 edges and 205 vertex of which 2 / 205 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 8 with 9 rules applied. Total rules applied 121 place count 204 transition count 311
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 5 rules applied. Total rules applied 126 place count 203 transition count 307
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 10 with 4 Pre rules applied. Total rules applied 126 place count 203 transition count 303
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 10 with 11 rules applied. Total rules applied 137 place count 196 transition count 303
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (trivial) has 75 edges and 196 vertex of which 2 / 196 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 10 with 4 rules applied. Total rules applied 141 place count 195 transition count 300
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 75 edges and 193 vertex of which 2 / 193 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 11 with 6 rules applied. Total rules applied 147 place count 192 transition count 297
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 76 edges and 191 vertex of which 6 / 191 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 12 with 5 rules applied. Total rules applied 152 place count 188 transition count 294
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 73 edges and 186 vertex of which 6 / 186 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 13 with 14 rules applied. Total rules applied 166 place count 183 transition count 283
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 71 edges and 180 vertex of which 6 / 180 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 14 with 15 rules applied. Total rules applied 181 place count 177 transition count 272
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (complete) has 623 edges and 174 vertex of which 172 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Graph (trivial) has 67 edges and 172 vertex of which 4 / 172 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 15 with 15 rules applied. Total rules applied 196 place count 170 transition count 260
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 63 edges and 169 vertex of which 2 / 169 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 16 with 8 rules applied. Total rules applied 204 place count 168 transition count 254
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 604 edges and 167 vertex of which 166 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 17 with 7 rules applied. Total rules applied 211 place count 166 transition count 249
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 18 with 1 Pre rules applied. Total rules applied 211 place count 166 transition count 248
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 3 rules applied. Total rules applied 214 place count 164 transition count 248
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 18 with 2 rules applied. Total rules applied 216 place count 163 transition count 247
Graph (trivial) has 60 edges and 163 vertex of which 2 / 163 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating global reduction 18 with 1 rules applied. Total rules applied 217 place count 162 transition count 247
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 18 with 2 rules applied. Total rules applied 219 place count 162 transition count 245
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 220 place count 162 transition count 244
Partial Free-agglomeration rule applied 14 times.
Drop transitions (Partial Free agglomeration) removed 14 transitions
Iterating global reduction 19 with 14 rules applied. Total rules applied 234 place count 162 transition count 244
Drop transitions (Redundant composition of simpler transitions.) removed 13 transitions
Redundant transition composition rules discarded 13 transitions
Iterating global reduction 19 with 13 rules applied. Total rules applied 247 place count 162 transition count 231
Applied a total of 247 rules in 74 ms. Remains 162 /255 variables (removed 93) and now considering 231/403 (removed 172) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 231 rows 162 cols
[2024-05-30 15:23:47] [INFO ] Computed 76 invariants in 1 ms
[2024-05-30 15:23:47] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-30 15:23:47] [INFO ] [Nat]Absence check using 76 positive place invariants in 14 ms returned sat
[2024-05-30 15:23:47] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-30 15:23:47] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-30 15:23:47] [INFO ] After 14ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-05-30 15:23:47] [INFO ] After 34ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-05-30 15:23:47] [INFO ] After 167ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 332 ms.
[2024-05-30 15:23:47] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/ReachabilityCardinality.sr.xml took 3 ms.
[2024-05-30 15:23:47] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 255 places, 403 transitions and 2262 arcs took 6 ms.
[2024-05-30 15:23:48] [INFO ] Flatten gal took : 78 ms
Total runtime 68757 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ShieldRVt-PT-030B

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/414/model (.net / .def) ...
EXPORT TIME: [User 0.001s, 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: 662
MODEL NAME: /home/mcc/execution/414/model
255 places, 403 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA ShieldRVt-PT-030B-ReachabilityCardinality-2024-14 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717082628890

--------------------
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="ShieldRVt-PT-030B"
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 ShieldRVt-PT-030B, 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 r355-tall-171683760001006"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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