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.r135-tall-171631131300537.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 DoubleExponent-PT-003, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631131300537
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 03:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 200K Apr 12 03:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Apr 12 03:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 50K 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 DoubleExponent-PT-003-CTLCardinality-2024-00
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-2024-01
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-2024-02
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-2024-03
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-2024-04
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-2024-05
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-2024-06
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-2024-07
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-2024-08
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-2024-09
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-2024-10
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-2024-11
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-2023-12
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-2023-13
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-2023-14
FORMULA_NAME DoubleExponent-PT-003-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716375612198

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-003
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 11:00:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 11:00:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 11:00:13] [INFO ] Load time of PNML (sax parser for PT used): 62 ms
[2024-05-22 11:00:13] [INFO ] Transformed 163 places.
[2024-05-22 11:00:13] [INFO ] Transformed 148 transitions.
[2024-05-22 11:00:13] [INFO ] Parsed PT model containing 163 places and 148 transitions and 417 arcs in 166 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Support contains 104 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 148/148 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 161 transition count 148
Applied a total of 2 rules in 21 ms. Remains 161 /163 variables (removed 2) and now considering 148/148 (removed 0) transitions.
// Phase 1: matrix 148 rows 161 cols
[2024-05-22 11:00:13] [INFO ] Computed 17 invariants in 35 ms
[2024-05-22 11:00:13] [INFO ] Implicit Places using invariants in 255 ms returned [28]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 283 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 160/163 places, 148/148 transitions.
Applied a total of 0 rules in 10 ms. Remains 160 /160 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 337 ms. Remains : 160/163 places, 148/148 transitions.
Support contains 104 out of 160 places after structural reductions.
[2024-05-22 11:00:14] [INFO ] Flatten gal took : 36 ms
[2024-05-22 11:00:14] [INFO ] Flatten gal took : 14 ms
[2024-05-22 11:00:14] [INFO ] Input system was already deterministic with 148 transitions.
RANDOM walk for 40000 steps (1288 resets) in 1923 ms. (20 steps per ms) remains 59/94 properties
BEST_FIRST walk for 4002 steps (113 resets) in 70 ms. (56 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4000 steps (105 resets) in 68 ms. (57 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4000 steps (110 resets) in 38 ms. (102 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (113 resets) in 25 ms. (153 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (110 resets) in 45 ms. (86 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4000 steps (114 resets) in 34 ms. (114 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4000 steps (116 resets) in 24 ms. (160 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4001 steps (106 resets) in 38 ms. (102 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4000 steps (111 resets) in 35 ms. (111 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4000 steps (113 resets) in 61 ms. (64 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4000 steps (113 resets) in 28 ms. (137 steps per ms) remains 59/59 properties
BEST_FIRST walk for 4000 steps (110 resets) in 27 ms. (142 steps per ms) remains 52/59 properties
BEST_FIRST walk for 4000 steps (112 resets) in 24 ms. (160 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (121 resets) in 24 ms. (160 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (107 resets) in 45 ms. (86 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (115 resets) in 39 ms. (100 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (112 resets) in 38 ms. (102 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (106 resets) in 33 ms. (117 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (114 resets) in 43 ms. (90 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (112 resets) in 48 ms. (81 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (108 resets) in 34 ms. (114 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (110 resets) in 30 ms. (129 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (108 resets) in 69 ms. (57 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (111 resets) in 31 ms. (125 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (115 resets) in 73 ms. (54 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (116 resets) in 38 ms. (102 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (114 resets) in 33 ms. (117 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (113 resets) in 29 ms. (133 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (119 resets) in 32 ms. (121 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (108 resets) in 24 ms. (160 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (111 resets) in 51 ms. (76 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (106 resets) in 35 ms. (111 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (110 resets) in 50 ms. (78 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (107 resets) in 55 ms. (71 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (108 resets) in 33 ms. (117 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4002 steps (115 resets) in 28 ms. (138 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (114 resets) in 22 ms. (173 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (113 resets) in 48 ms. (81 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (116 resets) in 31 ms. (125 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (115 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (109 resets) in 20 ms. (190 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (114 resets) in 22 ms. (173 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (112 resets) in 41 ms. (95 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (110 resets) in 50 ms. (78 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (117 resets) in 33 ms. (117 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (108 resets) in 20 ms. (190 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4003 steps (118 resets) in 19 ms. (200 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (111 resets) in 22 ms. (173 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (108 resets) in 23 ms. (166 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (110 resets) in 49 ms. (80 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4000 steps (141 resets) in 30 ms. (129 steps per ms) remains 52/52 properties
BEST_FIRST walk for 4001 steps (110 resets) in 20 ms. (190 steps per ms) remains 52/52 properties
// Phase 1: matrix 148 rows 160 cols
[2024-05-22 11:00:15] [INFO ] Computed 16 invariants in 13 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 52 unsolved
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp42 is UNSAT
Problem AtomicPropp56 is UNSAT
Problem AtomicPropp67 is UNSAT
Problem AtomicPropp72 is UNSAT
Problem AtomicPropp82 is UNSAT
Problem AtomicPropp87 is UNSAT
Problem AtomicPropp92 is UNSAT
Problem AtomicPropp93 is UNSAT
At refinement iteration 1 (OVERLAPS) 79/153 variables, 5/5 constraints. Problems are: Problem set: 12 solved, 40 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp69 is UNSAT
Problem AtomicPropp91 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/153 variables, 4/9 constraints. Problems are: Problem set: 16 solved, 36 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/9 constraints. Problems are: Problem set: 16 solved, 36 unsolved
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp86 is UNSAT
At refinement iteration 4 (OVERLAPS) 7/160 variables, 7/16 constraints. Problems are: Problem set: 18 solved, 34 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/16 constraints. Problems are: Problem set: 18 solved, 34 unsolved
At refinement iteration 6 (OVERLAPS) 148/308 variables, 160/176 constraints. Problems are: Problem set: 18 solved, 34 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/308 variables, 0/176 constraints. Problems are: Problem set: 18 solved, 34 unsolved
At refinement iteration 8 (OVERLAPS) 0/308 variables, 0/176 constraints. Problems are: Problem set: 18 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 308/308 variables, and 176 constraints, problems are : Problem set: 18 solved, 34 unsolved in 1543 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 18 solved, 34 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 0/0 constraints. Problems are: Problem set: 18 solved, 34 unsolved
Problem AtomicPropp5 is UNSAT
At refinement iteration 1 (OVERLAPS) 94/149 variables, 5/5 constraints. Problems are: Problem set: 19 solved, 33 unsolved
Problem AtomicPropp64 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/149 variables, 3/8 constraints. Problems are: Problem set: 20 solved, 32 unsolved
[2024-05-22 11:00:17] [INFO ] Deduced a trap composed of 26 places in 146 ms of which 50 ms to minimize.
[2024-05-22 11:00:17] [INFO ] Deduced a trap composed of 21 places in 59 ms of which 2 ms to minimize.
[2024-05-22 11:00:17] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
[2024-05-22 11:00:18] [INFO ] Deduced a trap composed of 92 places in 100 ms of which 14 ms to minimize.
[2024-05-22 11:00:18] [INFO ] Deduced a trap composed of 95 places in 117 ms of which 19 ms to minimize.
[2024-05-22 11:00:18] [INFO ] Deduced a trap composed of 104 places in 67 ms of which 2 ms to minimize.
[2024-05-22 11:00:18] [INFO ] Deduced a trap composed of 16 places in 355 ms of which 1 ms to minimize.
[2024-05-22 11:00:18] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
Problem AtomicPropp48 is UNSAT
[2024-05-22 11:00:18] [INFO ] Deduced a trap composed of 87 places in 94 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/149 variables, 9/17 constraints. Problems are: Problem set: 21 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/149 variables, 0/17 constraints. Problems are: Problem set: 21 solved, 31 unsolved
Problem AtomicPropp77 is UNSAT
At refinement iteration 5 (OVERLAPS) 11/160 variables, 8/25 constraints. Problems are: Problem set: 22 solved, 30 unsolved
[2024-05-22 11:00:19] [INFO ] Deduced a trap composed of 16 places in 86 ms of which 6 ms to minimize.
[2024-05-22 11:00:19] [INFO ] Deduced a trap composed of 18 places in 75 ms of which 2 ms to minimize.
[2024-05-22 11:00:19] [INFO ] Deduced a trap composed of 56 places in 73 ms of which 1 ms to minimize.
[2024-05-22 11:00:19] [INFO ] Deduced a trap composed of 72 places in 264 ms of which 1 ms to minimize.
[2024-05-22 11:00:19] [INFO ] Deduced a trap composed of 44 places in 230 ms of which 0 ms to minimize.
[2024-05-22 11:00:19] [INFO ] Deduced a trap composed of 36 places in 38 ms of which 1 ms to minimize.
[2024-05-22 11:00:19] [INFO ] Deduced a trap composed of 37 places in 39 ms of which 1 ms to minimize.
[2024-05-22 11:00:20] [INFO ] Deduced a trap composed of 40 places in 44 ms of which 0 ms to minimize.
[2024-05-22 11:00:20] [INFO ] Deduced a trap composed of 39 places in 48 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 9/34 constraints. Problems are: Problem set: 22 solved, 30 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/34 constraints. Problems are: Problem set: 22 solved, 30 unsolved
At refinement iteration 8 (OVERLAPS) 148/308 variables, 160/194 constraints. Problems are: Problem set: 22 solved, 30 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/308 variables, 30/224 constraints. Problems are: Problem set: 22 solved, 30 unsolved
[2024-05-22 11:00:20] [INFO ] Deduced a trap composed of 83 places in 68 ms of which 1 ms to minimize.
[2024-05-22 11:00:20] [INFO ] Deduced a trap composed of 80 places in 49 ms of which 5 ms to minimize.
[2024-05-22 11:00:21] [INFO ] Deduced a trap composed of 42 places in 59 ms of which 1 ms to minimize.
[2024-05-22 11:00:21] [INFO ] Deduced a trap composed of 74 places in 63 ms of which 2 ms to minimize.
[2024-05-22 11:00:21] [INFO ] Deduced a trap composed of 57 places in 62 ms of which 1 ms to minimize.
[2024-05-22 11:00:21] [INFO ] Deduced a trap composed of 73 places in 64 ms of which 2 ms to minimize.
[2024-05-22 11:00:21] [INFO ] Deduced a trap composed of 75 places in 56 ms of which 2 ms to minimize.
[2024-05-22 11:00:21] [INFO ] Deduced a trap composed of 56 places in 59 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/308 variables, 8/232 constraints. Problems are: Problem set: 22 solved, 30 unsolved
[2024-05-22 11:00:22] [INFO ] Deduced a trap composed of 57 places in 46 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 308/308 variables, and 233 constraints, problems are : Problem set: 22 solved, 30 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 30/52 constraints, Known Traps: 27/27 constraints]
After SMT, in 6617ms problems are : Problem set: 22 solved, 30 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 47 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 148/148 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 160 transition count 140
Reduce places removed 8 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 16 rules applied. Total rules applied 24 place count 152 transition count 132
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 32 place count 144 transition count 132
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 32 place count 144 transition count 126
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 44 place count 138 transition count 126
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 15
Deduced a syphon composed of 15 places in 1 ms
Reduce places removed 15 places and 0 transitions.
Iterating global reduction 3 with 30 rules applied. Total rules applied 74 place count 123 transition count 111
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 3 with 4 rules applied. Total rules applied 78 place count 121 transition count 111
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 3 with 6 rules applied. Total rules applied 84 place count 121 transition count 105
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 90 place count 115 transition count 105
Partial Free-agglomeration rule applied 9 times.
Drop transitions (Partial Free agglomeration) removed 9 transitions
Iterating global reduction 4 with 9 rules applied. Total rules applied 99 place count 115 transition count 105
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 100 place count 114 transition count 104
Applied a total of 100 rules in 40 ms. Remains 114 /160 variables (removed 46) and now considering 104/148 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 114/160 places, 104/148 transitions.
RANDOM walk for 40000 steps (3547 resets) in 728 ms. (54 steps per ms) remains 29/30 properties
BEST_FIRST walk for 4002 steps (261 resets) in 25 ms. (153 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (269 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (249 resets) in 31 ms. (125 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (251 resets) in 27 ms. (142 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (258 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (263 resets) in 29 ms. (133 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (217 resets) in 50 ms. (78 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (267 resets) in 42 ms. (93 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (256 resets) in 25 ms. (153 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (257 resets) in 27 ms. (142 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (267 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (263 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (273 resets) in 32 ms. (121 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (255 resets) in 36 ms. (108 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (260 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (294 resets) in 23 ms. (166 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (260 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (270 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (239 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (243 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (270 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (269 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (262 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (264 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (264 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (252 resets) in 34 ms. (114 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (268 resets) in 17 ms. (222 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4001 steps (296 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (259 resets) in 22 ms. (173 steps per ms) remains 29/29 properties
Probabilistic random walk after 1000000 steps, saw 500123 distinct states, run finished after 2711 ms. (steps per millisecond=368 ) properties seen :28
// Phase 1: matrix 104 rows 114 cols
[2024-05-22 11:00:25] [INFO ] Computed 16 invariants in 5 ms
[2024-05-22 11:00:25] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/62 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 50/112 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/113 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/113 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 104/217 variables, 113/129 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/217 variables, 2/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/217 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/218 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/218 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/218 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 218/218 variables, and 132 constraints, problems are : Problem set: 0 solved, 1 unsolved in 94 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 114/114 constraints, ReadFeed: 2/2 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 52/55 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 7/62 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 50/112 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:00:25] [INFO ] Deduced a trap composed of 7 places in 40 ms of which 1 ms to minimize.
[2024-05-22 11:00:25] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2024-05-22 11:00:26] [INFO ] Deduced a trap composed of 13 places in 37 ms of which 1 ms to minimize.
[2024-05-22 11:00:26] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-05-22 11:00:26] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
[2024-05-22 11:00:26] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 2 ms to minimize.
[2024-05-22 11:00:26] [INFO ] Deduced a trap composed of 44 places in 32 ms of which 1 ms to minimize.
[2024-05-22 11:00:26] [INFO ] Deduced a trap composed of 41 places in 34 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 8/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/113 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/113 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 104/217 variables, 113/137 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/217 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/217 variables, 1/140 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:00:26] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 1 ms to minimize.
[2024-05-22 11:00:26] [INFO ] Deduced a trap composed of 24 places in 37 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/217 variables, 2/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/217 variables, 0/142 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/218 variables, 1/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/218 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/218 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 218/218 variables, and 143 constraints, problems are : Problem set: 0 solved, 1 unsolved in 546 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 114/114 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 10/10 constraints]
After SMT, in 653ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 72 ms.
Support contains 3 out of 114 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 114/114 places, 104/104 transitions.
Graph (complete) has 249 edges and 114 vertex of which 110 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 110 transition count 94
Reduce places removed 8 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 102 transition count 93
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 20 place count 101 transition count 93
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 20 place count 101 transition count 91
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 24 place count 99 transition count 91
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 56 place count 83 transition count 75
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 58 place count 82 transition count 75
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 82 transition count 73
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 62 place count 80 transition count 73
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 4 with 12 rules applied. Total rules applied 74 place count 80 transition count 61
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 4 with 12 rules applied. Total rules applied 86 place count 68 transition count 61
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 91 place count 68 transition count 61
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 92 place count 67 transition count 60
Applied a total of 92 rules in 42 ms. Remains 67 /114 variables (removed 47) and now considering 60/104 (removed 44) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 67/114 places, 60/104 transitions.
RANDOM walk for 40000 steps (5179 resets) in 284 ms. (140 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3372 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1578786 steps, run timeout after 3001 ms. (steps per millisecond=526 ) properties seen :0 out of 1
Probabilistic random walk after 1578786 steps, saw 789468 distinct states, run finished after 3008 ms. (steps per millisecond=524 ) properties seen :0
// Phase 1: matrix 60 rows 67 cols
[2024-05-22 11:00:29] [INFO ] Computed 15 invariants in 2 ms
[2024-05-22 11:00:29] [INFO ] State equation strengthened by 11 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 35/38 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/62 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 1/63 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 60/123 variables, 63/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/123 variables, 11/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/127 variables, 4/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/127 variables, 2/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/127 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/127 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 93 constraints, problems are : Problem set: 0 solved, 1 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 67/67 constraints, ReadFeed: 11/11 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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 35/38 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 24/62 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:00:29] [INFO ] Deduced a trap composed of 9 places in 46 ms of which 1 ms to minimize.
[2024-05-22 11:00:29] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 1 ms to minimize.
[2024-05-22 11:00:29] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/62 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/63 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 60/123 variables, 63/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/123 variables, 11/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/123 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/123 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/127 variables, 4/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/127 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/127 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/127 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 97 constraints, problems are : Problem set: 0 solved, 1 unsolved in 235 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 67/67 constraints, ReadFeed: 11/11 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 310ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 32 ms.
Support contains 3 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 60/60 transitions.
Applied a total of 0 rules in 3 ms. Remains 67 /67 variables (removed 0) and now considering 60/60 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 67/67 places, 60/60 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 60/60 transitions.
Applied a total of 0 rules in 2 ms. Remains 67 /67 variables (removed 0) and now considering 60/60 (removed 0) transitions.
[2024-05-22 11:00:29] [INFO ] Invariant cache hit.
[2024-05-22 11:00:30] [INFO ] Implicit Places using invariants in 94 ms returned [14, 19, 34, 39, 58, 64]
[2024-05-22 11:00:30] [INFO ] Actually due to overlaps returned [39, 34]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 95 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 65/67 places, 60/60 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 65 transition count 59
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 59
Applied a total of 2 rules in 6 ms. Remains 64 /65 variables (removed 1) and now considering 59/60 (removed 1) transitions.
// Phase 1: matrix 59 rows 64 cols
[2024-05-22 11:00:30] [INFO ] Computed 13 invariants in 1 ms
[2024-05-22 11:00:30] [INFO ] Implicit Places using invariants in 64 ms returned [14, 19, 55, 61]
[2024-05-22 11:00:30] [INFO ] Actually due to overlaps returned [14, 55]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 65 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 62/67 places, 59/60 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 61 transition count 58
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 61 transition count 58
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 61 transition count 58
Applied a total of 3 rules in 7 ms. Remains 61 /62 variables (removed 1) and now considering 58/59 (removed 1) transitions.
// Phase 1: matrix 58 rows 61 cols
[2024-05-22 11:00:30] [INFO ] Computed 11 invariants in 1 ms
[2024-05-22 11:00:30] [INFO ] Implicit Places using invariants in 55 ms returned [58]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 60/67 places, 58/60 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 60 transition count 57
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 59 transition count 57
Applied a total of 2 rules in 4 ms. Remains 59 /60 variables (removed 1) and now considering 57/58 (removed 1) transitions.
// Phase 1: matrix 57 rows 59 cols
[2024-05-22 11:00:30] [INFO ] Computed 10 invariants in 1 ms
[2024-05-22 11:00:30] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-22 11:00:30] [INFO ] Invariant cache hit.
[2024-05-22 11:00:30] [INFO ] State equation strengthened by 10 read => feed constraints.
[2024-05-22 11:00:30] [INFO ] Implicit Places using invariants and state equation in 107 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 59/67 places, 57/60 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 398 ms. Remains : 59/67 places, 57/60 transitions.
RANDOM walk for 40000 steps (5831 resets) in 46 ms. (851 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3695 resets) in 70 ms. (563 steps per ms) remains 1/1 properties
Probably explored full state space saw : 726980 states, properties seen :0
Probabilistic random walk after 1453996 steps, saw 726980 distinct states, run finished after 2387 ms. (steps per millisecond=609 ) properties seen :0
Explored full state space saw : 734820 states, properties seen :0
Exhaustive walk after 1469639 steps, saw 734820 distinct states, run finished after 2488 ms. (steps per millisecond=590 ) properties seen :0
Successfully simplified 23 atomic propositions for a total of 16 simplifications.
FORMULA DoubleExponent-PT-003-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 11:00:35] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-22 11:00:35] [INFO ] Flatten gal took : 10 ms
FORMULA DoubleExponent-PT-003-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-22 11:00:35] [INFO ] Flatten gal took : 10 ms
[2024-05-22 11:00:35] [INFO ] Input system was already deterministic with 148 transitions.
Support contains 79 out of 160 places (down from 85) after GAL structural reductions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 264 edges and 160 vertex of which 156 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Starting structural reductions in SI_CTL mode, iteration 0 : 160/160 places, 148/148 transitions.
Graph (complete) has 264 edges and 160 vertex of which 157 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 156 transition count 111
Reduce places removed 35 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 37 rules applied. Total rules applied 73 place count 121 transition count 109
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 75 place count 119 transition count 109
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 75 place count 119 transition count 104
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 85 place count 114 transition count 104
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 131 place count 91 transition count 81
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 133 place count 91 transition count 81
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 134 place count 90 transition count 80
Applied a total of 134 rules in 47 ms. Remains 90 /160 variables (removed 70) and now considering 80/148 (removed 68) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 47 ms. Remains : 90/160 places, 80/148 transitions.
[2024-05-22 11:00:35] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:00:35] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:00:35] [INFO ] Input system was already deterministic with 80 transitions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 148/148 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 158 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 157 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 157 transition count 147
Applied a total of 4 rules in 5 ms. Remains 157 /160 variables (removed 3) and now considering 147/148 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 157/160 places, 147/148 transitions.
[2024-05-22 11:00:35] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:00:35] [INFO ] Flatten gal took : 11 ms
[2024-05-22 11:00:35] [INFO ] Input system was already deterministic with 147 transitions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 148/148 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 158 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 157 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 157 transition count 147
Applied a total of 4 rules in 5 ms. Remains 157 /160 variables (removed 3) and now considering 147/148 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 157/160 places, 147/148 transitions.
[2024-05-22 11:00:35] [INFO ] Flatten gal took : 8 ms
[2024-05-22 11:00:35] [INFO ] Flatten gal took : 9 ms
[2024-05-22 11:00:35] [INFO ] Input system was already deterministic with 147 transitions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 148/148 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 158 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 157 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 157 transition count 147
Applied a total of 4 rules in 5 ms. Remains 157 /160 variables (removed 3) and now considering 147/148 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 157/160 places, 147/148 transitions.
[2024-05-22 11:00:35] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:00:35] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:00:35] [INFO ] Input system was already deterministic with 147 transitions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 148/148 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 159 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 158 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 158 transition count 147
Applied a total of 3 rules in 5 ms. Remains 158 /160 variables (removed 2) and now considering 147/148 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 158/160 places, 147/148 transitions.
[2024-05-22 11:00:35] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:00:35] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:00:35] [INFO ] Input system was already deterministic with 147 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 160/160 places, 148/148 transitions.
Graph (complete) has 264 edges and 160 vertex of which 158 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 29 place count 158 transition count 119
Reduce places removed 28 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 31 rules applied. Total rules applied 60 place count 130 transition count 116
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 63 place count 127 transition count 116
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 63 place count 127 transition count 111
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 73 place count 122 transition count 111
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 105 place count 106 transition count 95
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 106 place count 106 transition count 95
Applied a total of 106 rules in 15 ms. Remains 106 /160 variables (removed 54) and now considering 95/148 (removed 53) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 15 ms. Remains : 106/160 places, 95/148 transitions.
[2024-05-22 11:00:35] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:00:35] [INFO ] Flatten gal took : 12 ms
[2024-05-22 11:00:35] [INFO ] Input system was already deterministic with 95 transitions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 148/148 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 158 transition count 148
Applied a total of 2 rules in 3 ms. Remains 158 /160 variables (removed 2) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3 ms. Remains : 158/160 places, 148/148 transitions.
[2024-05-22 11:00:35] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:00:35] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:00:35] [INFO ] Input system was already deterministic with 148 transitions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 148/148 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 158 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 157 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 157 transition count 147
Applied a total of 4 rules in 5 ms. Remains 157 /160 variables (removed 3) and now considering 147/148 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 157/160 places, 147/148 transitions.
[2024-05-22 11:00:35] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:00:35] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:00:35] [INFO ] Input system was already deterministic with 147 transitions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 148/148 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 158 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 157 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 157 transition count 147
Applied a total of 4 rules in 7 ms. Remains 157 /160 variables (removed 3) and now considering 147/148 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 157/160 places, 147/148 transitions.
[2024-05-22 11:00:35] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:00:35] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:00:35] [INFO ] Input system was already deterministic with 147 transitions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 148/148 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 158 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 157 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 157 transition count 147
Applied a total of 4 rules in 4 ms. Remains 157 /160 variables (removed 3) and now considering 147/148 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 157/160 places, 147/148 transitions.
[2024-05-22 11:00:35] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:00:35] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:00:35] [INFO ] Input system was already deterministic with 147 transitions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 148/148 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 158 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 157 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 157 transition count 147
Applied a total of 4 rules in 5 ms. Remains 157 /160 variables (removed 3) and now considering 147/148 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 157/160 places, 147/148 transitions.
[2024-05-22 11:00:35] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:00:35] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:00:35] [INFO ] Input system was already deterministic with 147 transitions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 148/148 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 158 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 157 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 157 transition count 147
Applied a total of 4 rules in 5 ms. Remains 157 /160 variables (removed 3) and now considering 147/148 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 157/160 places, 147/148 transitions.
[2024-05-22 11:00:35] [INFO ] Flatten gal took : 5 ms
[2024-05-22 11:00:35] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:00:35] [INFO ] Input system was already deterministic with 147 transitions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 148/148 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 158 transition count 148
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 157 transition count 147
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 157 transition count 147
Applied a total of 4 rules in 6 ms. Remains 157 /160 variables (removed 3) and now considering 147/148 (removed 1) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 157/160 places, 147/148 transitions.
[2024-05-22 11:00:35] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:00:35] [INFO ] Flatten gal took : 6 ms
[2024-05-22 11:00:35] [INFO ] Input system was already deterministic with 147 transitions.
[2024-05-22 11:00:35] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:00:35] [INFO ] Flatten gal took : 7 ms
[2024-05-22 11:00:35] [INFO ] Export to MCC of 13 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 10 ms.
[2024-05-22 11:00:35] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 160 places, 148 transitions and 412 arcs took 2 ms.
Total runtime 22477 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DoubleExponent-PT-003

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: 160
TRANSITIONS: 148
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.005s, Sys 0.000s]


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


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

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

Process ID: 698
MODEL NAME: /home/mcc/execution/411/model
160 places, 148 transitions.
Enabling coverability test.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Start RS construction.
Start RS construction.
Convergence in 55 steps.
Creating all event NSFs..
Convergence in 55 steps.
Creating all event NSFs..
Convergence in 55 steps.
Convergence in 55 steps.
Creating all event NSFs..
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Convergence in 130 steps.
Creating all event NSFs..
Convergence in 130 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 130 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 130 steps.
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Convergence in 246 steps.
Creating all event NSFs..
Convergence in 246 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Building monolithic NSF...
Start RS construction.
Convergence in 246 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 246 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 682 steps.
Creating all event NSFs..
Convergence in 682 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Building monolithic NSF...
Start RS construction.
Convergence in 682 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 682 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 1149 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 1149 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 1149 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 1149 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 2256 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 2256 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 2256 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 2256 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
CANNOT_COMPUTE
EXITCODE: 87
----------------------------------------------------------------------

BK_STOP 1716375815440

--------------------
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 CTLCardinality -timeout 360 -rebuildPNML
MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

MEDDLY ERROR: Insufficient memory

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="DoubleExponent-PT-003"
export BK_EXAMINATION="CTLCardinality"
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 DoubleExponent-PT-003, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r135-tall-171631131300537"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-003.tgz
mv DoubleExponent-PT-003 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "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 [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "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 "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.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 '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
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 ;