Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r179-tall-171640601000185.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 FunctionPointer-PT-a016, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r179-tall-171640601000185
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 77K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:54 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 11 16:08 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 146K Apr 11 16:08 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Apr 11 16:07 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 11 16:07 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:11 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 34K 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 FunctionPointer-PT-a016-CTLCardinality-2024-00
FORMULA_NAME FunctionPointer-PT-a016-CTLCardinality-2024-01
FORMULA_NAME FunctionPointer-PT-a016-CTLCardinality-2024-02
FORMULA_NAME FunctionPointer-PT-a016-CTLCardinality-2024-03
FORMULA_NAME FunctionPointer-PT-a016-CTLCardinality-2024-04
FORMULA_NAME FunctionPointer-PT-a016-CTLCardinality-2024-05
FORMULA_NAME FunctionPointer-PT-a016-CTLCardinality-2024-06
FORMULA_NAME FunctionPointer-PT-a016-CTLCardinality-2024-07
FORMULA_NAME FunctionPointer-PT-a016-CTLCardinality-2024-08
FORMULA_NAME FunctionPointer-PT-a016-CTLCardinality-2024-09
FORMULA_NAME FunctionPointer-PT-a016-CTLCardinality-2024-10
FORMULA_NAME FunctionPointer-PT-a016-CTLCardinality-2024-11
FORMULA_NAME FunctionPointer-PT-a016-CTLCardinality-2023-12
FORMULA_NAME FunctionPointer-PT-a016-CTLCardinality-2023-13
FORMULA_NAME FunctionPointer-PT-a016-CTLCardinality-2023-14
FORMULA_NAME FunctionPointer-PT-a016-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716431051058

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-a016
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-23 02:24:12] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-23 02:24:12] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 02:24:12] [INFO ] Load time of PNML (sax parser for PT used): 52 ms
[2024-05-23 02:24:12] [INFO ] Transformed 40 places.
[2024-05-23 02:24:12] [INFO ] Transformed 70 transitions.
[2024-05-23 02:24:12] [INFO ] Parsed PT model containing 40 places and 70 transitions and 284 arcs in 146 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 15 ms.
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 4 transitions.
FORMULA FunctionPointer-PT-a016-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 34 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Applied a total of 0 rules in 14 ms. Remains 34 /34 variables (removed 0) and now considering 66/66 (removed 0) transitions.
[2024-05-23 02:24:12] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
// Phase 1: matrix 46 rows 34 cols
[2024-05-23 02:24:12] [INFO ] Computed 4 invariants in 6 ms
[2024-05-23 02:24:12] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-23 02:24:12] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2024-05-23 02:24:12] [INFO ] Invariant cache hit.
[2024-05-23 02:24:12] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 02:24:12] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 243 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2024-05-23 02:24:12] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2024-05-23 02:24:12] [INFO ] Invariant cache hit.
[2024-05-23 02:24:12] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/33 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 46/79 variables, 33/37 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 0/45 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 1/80 variables, 1/46 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/80 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (OVERLAPS) 0/80 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 80/80 variables, and 46 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1065 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/31 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/31 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 1/32 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/32 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/33 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 46/79 variables, 33/37 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 8/45 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 4/49 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (OVERLAPS) 1/80 variables, 1/50 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/80 variables, 60/110 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/80 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 13 (OVERLAPS) 0/80 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 80/80 variables, and 110 constraints, problems are : Problem set: 0 solved, 64 unsolved in 1192 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints]
After SMT, in 2335ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 2350ms
Finished structural reductions in LTL mode , in 1 iterations and 2627 ms. Remains : 34/34 places, 66/66 transitions.
Support contains 34 out of 34 places after structural reductions.
[2024-05-23 02:24:15] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-05-23 02:24:15] [INFO ] Flatten gal took : 24 ms
[2024-05-23 02:24:15] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA FunctionPointer-PT-a016-CTLCardinality-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a016-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 02:24:15] [INFO ] Flatten gal took : 9 ms
[2024-05-23 02:24:15] [INFO ] Input system was already deterministic with 66 transitions.
RANDOM walk for 40000 steps (132 resets) in 1487 ms. (26 steps per ms) remains 18/48 properties
BEST_FIRST walk for 4004 steps (13 resets) in 62 ms. (63 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (23 resets) in 68 ms. (58 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (12 resets) in 68 ms. (58 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (11 resets) in 59 ms. (66 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (8 resets) in 49 ms. (80 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (15 resets) in 18 ms. (210 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (9 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (14 resets) in 17 ms. (222 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (10 resets) in 20 ms. (190 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (9 resets) in 11 ms. (333 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (11 resets) in 16 ms. (235 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (20 resets) in 12 ms. (308 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4004 steps (23 resets) in 13 ms. (286 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (16 resets) in 28 ms. (138 steps per ms) remains 18/18 properties
BEST_FIRST walk for 4003 steps (9 resets) in 10 ms. (363 steps per ms) remains 17/18 properties
BEST_FIRST walk for 4003 steps (8 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (12 resets) in 8 ms. (444 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (10 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
[2024-05-23 02:24:15] [INFO ] Flow matrix only has 46 transitions (discarded 20 similar events)
[2024-05-23 02:24:15] [INFO ] Invariant cache hit.
[2024-05-23 02:24:15] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp31 is UNSAT
Problem AtomicPropp34 is UNSAT
Problem AtomicPropp35 is UNSAT
Problem AtomicPropp44 is UNSAT
At refinement iteration 2 (OVERLAPS) 7/24 variables, 3/4 constraints. Problems are: Problem set: 11 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 11 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 41/65 variables, 24/28 constraints. Problems are: Problem set: 11 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 7/35 constraints. Problems are: Problem set: 11 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/35 constraints. Problems are: Problem set: 11 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 15/80 variables, 10/45 constraints. Problems are: Problem set: 11 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 1/46 constraints. Problems are: Problem set: 11 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/80 variables, 0/46 constraints. Problems are: Problem set: 11 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 0/80 variables, 0/46 constraints. Problems are: Problem set: 11 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 80/80 variables, and 46 constraints, problems are : Problem set: 11 solved, 6 unsolved in 104 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 11 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 17/22 variables, 5/5 constraints. Problems are: Problem set: 11 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 11 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 35/57 variables, 14/19 constraints. Problems are: Problem set: 11 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 1/20 constraints. Problems are: Problem set: 11 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 5/25 constraints. Problems are: Problem set: 11 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/25 constraints. Problems are: Problem set: 11 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 4/61 variables, 2/27 constraints. Problems are: Problem set: 11 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/61 variables, 2/29 constraints. Problems are: Problem set: 11 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/61 variables, 0/29 constraints. Problems are: Problem set: 11 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1/62 variables, 1/30 constraints. Problems are: Problem set: 11 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/62 variables, 1/31 constraints. Problems are: Problem set: 11 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/62 variables, 0/31 constraints. Problems are: Problem set: 11 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 17/79 variables, 11/42 constraints. Problems are: Problem set: 11 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/79 variables, 1/43 constraints. Problems are: Problem set: 11 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/79 variables, 7/50 constraints. Problems are: Problem set: 11 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/79 variables, 1/51 constraints. Problems are: Problem set: 11 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/79 variables, 0/51 constraints. Problems are: Problem set: 11 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 1/80 variables, 1/52 constraints. Problems are: Problem set: 11 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/80 variables, 0/52 constraints. Problems are: Problem set: 11 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 0/80 variables, 0/52 constraints. Problems are: Problem set: 11 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 80/80 variables, and 52 constraints, problems are : Problem set: 11 solved, 6 unsolved in 252 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 34/34 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 6/17 constraints, Known Traps: 0/0 constraints]
After SMT, in 364ms problems are : Problem set: 11 solved, 6 unsolved
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 1 properties in 767 ms.
Support contains 4 out of 34 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 34/34 places, 66/66 transitions.
Graph (complete) has 118 edges and 34 vertex of which 28 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 28 transition count 60
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 28 transition count 58
Applied a total of 9 rules in 20 ms. Remains 28 /34 variables (removed 6) and now considering 58/66 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 28/34 places, 58/66 transitions.
RANDOM walk for 40002 steps (8 resets) in 195 ms. (204 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 58 ms. (678 steps per ms) remains 1/2 properties
BEST_FIRST walk for 33283 steps (6 resets) in 53 ms. (616 steps per ms) remains 0/1 properties
Successfully simplified 11 atomic propositions for a total of 12 simplifications.
[2024-05-23 02:24:17] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-23 02:24:17] [INFO ] Flatten gal took : 7 ms
[2024-05-23 02:24:17] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA FunctionPointer-PT-a016-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a016-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-a016-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-23 02:24:17] [INFO ] Flatten gal took : 4 ms
[2024-05-23 02:24:17] [INFO ] Input system was already deterministic with 66 transitions.
Support contains 23 out of 34 places (down from 26) after GAL structural reductions.
Computed a total of 3 stabilizing places and 8 stable transitions
Graph (complete) has 153 edges and 34 vertex of which 31 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 31 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 30 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 30 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 30 transition count 62
Applied a total of 7 rules in 6 ms. Remains 30 /34 variables (removed 4) and now considering 62/66 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 30/34 places, 62/66 transitions.
[2024-05-23 02:24:17] [INFO ] Flatten gal took : 3 ms
[2024-05-23 02:24:17] [INFO ] Flatten gal took : 4 ms
[2024-05-23 02:24:17] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 31 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 30 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 30 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 30 transition count 62
Applied a total of 7 rules in 2 ms. Remains 30 /34 variables (removed 4) and now considering 62/66 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 30/34 places, 62/66 transitions.
[2024-05-23 02:24:17] [INFO ] Flatten gal took : 4 ms
[2024-05-23 02:24:17] [INFO ] Flatten gal took : 4 ms
[2024-05-23 02:24:17] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 31 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 30 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 30 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 30 transition count 62
Applied a total of 7 rules in 2 ms. Remains 30 /34 variables (removed 4) and now considering 62/66 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 30/34 places, 62/66 transitions.
[2024-05-23 02:24:17] [INFO ] Flatten gal took : 4 ms
[2024-05-23 02:24:17] [INFO ] Flatten gal took : 4 ms
[2024-05-23 02:24:17] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Graph (complete) has 153 edges and 34 vertex of which 31 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 30 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 30 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 5 place count 30 transition count 62
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 30 transition count 60
Applied a total of 7 rules in 9 ms. Remains 30 /34 variables (removed 4) and now considering 60/66 (removed 6) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 9 ms. Remains : 30/34 places, 60/66 transitions.
[2024-05-23 02:24:17] [INFO ] Flatten gal took : 3 ms
[2024-05-23 02:24:17] [INFO ] Flatten gal took : 3 ms
[2024-05-23 02:24:17] [INFO ] Input system was already deterministic with 60 transitions.
RANDOM walk for 40008 steps (118 resets) in 114 ms. (347 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (55 resets) in 80 ms. (493 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2307237 steps, run timeout after 3001 ms. (steps per millisecond=768 ) properties seen :0 out of 1
Probabilistic random walk after 2307237 steps, saw 1546034 distinct states, run finished after 3009 ms. (steps per millisecond=766 ) properties seen :0
[2024-05-23 02:24:20] [INFO ] Flow matrix only has 43 transitions (discarded 17 similar events)
// Phase 1: matrix 43 rows 30 cols
[2024-05-23 02:24:20] [INFO ] Computed 2 invariants in 1 ms
[2024-05-23 02:24:20] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/33 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/70 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/70 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/70 variables, 8/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/70 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/73 variables, 3/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/73 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/73 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 40 constraints, problems are : Problem set: 0 solved, 1 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 28/33 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/33 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 37/70 variables, 22/28 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/70 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/70 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/70 variables, 8/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/70 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 3/73 variables, 3/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/73 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/73 variables, 0/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/73 variables, and 41 constraints, problems are : Problem set: 0 solved, 1 unsolved in 54 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 30/30 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 115ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 23 ms.
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 30/30 places, 60/60 transitions.
Graph (complete) has 106 edges and 30 vertex of which 27 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 27 transition count 54
Applied a total of 7 rules in 2 ms. Remains 27 /30 variables (removed 3) and now considering 54/60 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 27/30 places, 54/60 transitions.
RANDOM walk for 494568 steps (0 resets) in 1017 ms. (485 steps per ms) remains 0/1 properties
FORMULA FunctionPointer-PT-a016-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 31 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 30 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 30 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 30 transition count 62
Applied a total of 7 rules in 2 ms. Remains 30 /34 variables (removed 4) and now considering 62/66 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 30/34 places, 62/66 transitions.
[2024-05-23 02:24:20] [INFO ] Flatten gal took : 4 ms
[2024-05-23 02:24:20] [INFO ] Flatten gal took : 4 ms
[2024-05-23 02:24:20] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 31 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 30 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 30 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 30 transition count 62
Applied a total of 7 rules in 2 ms. Remains 30 /34 variables (removed 4) and now considering 62/66 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 30/34 places, 62/66 transitions.
[2024-05-23 02:24:20] [INFO ] Flatten gal took : 3 ms
[2024-05-23 02:24:20] [INFO ] Flatten gal took : 3 ms
[2024-05-23 02:24:20] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 31 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 30 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 30 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 30 transition count 62
Applied a total of 7 rules in 2 ms. Remains 30 /34 variables (removed 4) and now considering 62/66 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 30/34 places, 62/66 transitions.
[2024-05-23 02:24:20] [INFO ] Flatten gal took : 3 ms
[2024-05-23 02:24:20] [INFO ] Flatten gal took : 3 ms
[2024-05-23 02:24:20] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 31 transition count 66
Applied a total of 3 rules in 1 ms. Remains 31 /34 variables (removed 3) and now considering 66/66 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 31/34 places, 66/66 transitions.
[2024-05-23 02:24:20] [INFO ] Flatten gal took : 3 ms
[2024-05-23 02:24:20] [INFO ] Flatten gal took : 3 ms
[2024-05-23 02:24:21] [INFO ] Input system was already deterministic with 66 transitions.
Starting structural reductions in LTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 31 transition count 66
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 30 transition count 64
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 30 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 30 transition count 62
Applied a total of 7 rules in 2 ms. Remains 30 /34 variables (removed 4) and now considering 62/66 (removed 4) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2 ms. Remains : 30/34 places, 62/66 transitions.
[2024-05-23 02:24:21] [INFO ] Flatten gal took : 3 ms
[2024-05-23 02:24:21] [INFO ] Flatten gal took : 3 ms
[2024-05-23 02:24:21] [INFO ] Input system was already deterministic with 62 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 34/34 places, 66/66 transitions.
Graph (complete) has 153 edges and 34 vertex of which 31 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 30 transition count 64
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 30 transition count 64
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 5 place count 30 transition count 62
Applied a total of 5 rules in 4 ms. Remains 30 /34 variables (removed 4) and now considering 62/66 (removed 4) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 4 ms. Remains : 30/34 places, 62/66 transitions.
[2024-05-23 02:24:21] [INFO ] Flatten gal took : 3 ms
[2024-05-23 02:24:21] [INFO ] Flatten gal took : 3 ms
[2024-05-23 02:24:21] [INFO ] Input system was already deterministic with 62 transitions.
[2024-05-23 02:24:21] [INFO ] Flatten gal took : 4 ms
[2024-05-23 02:24:21] [INFO ] Flatten gal took : 3 ms
[2024-05-23 02:24:21] [INFO ] Export to MCC of 9 properties in file /home/mcc/execution/CTLCardinality.sr.xml took 1 ms.
[2024-05-23 02:24:21] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 34 places, 66 transitions and 268 arcs took 2 ms.
Total runtime 8867 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running FunctionPointer-PT-a016

IS_COLORED=
IS_NUPN=

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


SAVING FILE /home/mcc/execution/412/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: 553
MODEL NAME: /home/mcc/execution/412/model
34 places, 66 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...
Start RS construction.
Building monolithic NSF...
Start RS construction.
coverability test failed!!
Convergence in 9 steps.
The state space is infinite.
CANNOT_COMPUTE
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716431061699

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ 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

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="FunctionPointer-PT-a016"
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 FunctionPointer-PT-a016, 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 r179-tall-171640601000185"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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