fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r508-tall-171654352100666
Last Updated
July 7, 2024

About the Execution of LTSMin+red for NoC3x3-PT-8A

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
536.380 59769.00 83514.00 243.00 [undef] Cannot compute

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.r508-tall-171654352100666.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 ltsminxred
Input is NoC3x3-PT-8A, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r508-tall-171654352100666
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 66K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K Apr 23 07:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 23 07:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.7K Apr 12 07:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 12 07:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.5K Apr 12 07:45 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Apr 12 07:45 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 23 07:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 23 07:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 745K May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717244319259

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-8A
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 12:18:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 12:18:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 12:18:40] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2024-06-01 12:18:40] [INFO ] Transformed 317 places.
[2024-06-01 12:18:40] [INFO ] Transformed 4293 transitions.
[2024-06-01 12:18:40] [INFO ] Found NUPN structural information;
[2024-06-01 12:18:40] [INFO ] Parsed PT model containing 317 places and 4293 transitions and 9691 arcs in 258 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 13 ms.
Ensure Unique test removed 3607 transitions
Reduce redundant transitions removed 3607 transitions.
Support contains 70 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 686/686 transitions.
Discarding 45 places :
Symmetric choice reduction at 0 with 45 rule applications. Total rules 45 place count 272 transition count 601
Iterating global reduction 0 with 45 rules applied. Total rules applied 90 place count 272 transition count 601
Drop transitions (Redundant composition of simpler transitions.) removed 80 transitions
Redundant transition composition rules discarded 80 transitions
Iterating global reduction 0 with 80 rules applied. Total rules applied 170 place count 272 transition count 521
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 177 place count 265 transition count 521
Applied a total of 177 rules in 53 ms. Remains 265 /317 variables (removed 52) and now considering 521/686 (removed 165) transitions.
// Phase 1: matrix 521 rows 265 cols
[2024-06-01 12:18:40] [INFO ] Computed 59 invariants in 23 ms
[2024-06-01 12:18:41] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-06-01 12:18:41] [INFO ] Invariant cache hit.
[2024-06-01 12:18:41] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 565 ms to find 0 implicit places.
Running 520 sub problems to find dead transitions.
[2024-06-01 12:18:41] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 3 (OVERLAPS) 2/265 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 5 (OVERLAPS) 521/786 variables, 265/324 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/786 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 7 (OVERLAPS) 0/786 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 520 unsolved
No progress, stopping.
After SMT solving in domain Real declared 786/786 variables, and 324 constraints, problems are : Problem set: 0 solved, 520 unsolved in 24064 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, State Equation: 265/265 constraints, PredecessorRefiner: 520/520 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 520 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/262 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 1 (OVERLAPS) 1/263 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 3 (OVERLAPS) 2/265 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 5 (OVERLAPS) 521/786 variables, 265/324 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/786 variables, 520/844 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/786 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 520 unsolved
At refinement iteration 8 (OVERLAPS) 0/786 variables, 0/844 constraints. Problems are: Problem set: 0 solved, 520 unsolved
No progress, stopping.
After SMT solving in domain Int declared 786/786 variables, and 844 constraints, problems are : Problem set: 0 solved, 520 unsolved in 29738 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, State Equation: 265/265 constraints, PredecessorRefiner: 520/520 constraints, Known Traps: 0/0 constraints]
After SMT, in 54028ms problems are : Problem set: 0 solved, 520 unsolved
Search for dead transitions found 0 dead transitions in 54056ms
Starting structural reductions in LTL mode, iteration 1 : 265/317 places, 521/686 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 54694 ms. Remains : 265/317 places, 521/686 transitions.
Support contains 70 out of 265 places after structural reductions.
[2024-06-01 12:19:35] [INFO ] Flatten gal took : 71 ms
[2024-06-01 12:19:35] [INFO ] Flatten gal took : 36 ms
[2024-06-01 12:19:35] [INFO ] Input system was already deterministic with 521 transitions.
RANDOM walk for 40000 steps (8 resets) in 1919 ms. (20 steps per ms) remains 1/74 properties
BEST_FIRST walk for 40004 steps (8 resets) in 140 ms. (283 steps per ms) remains 1/1 properties
[2024-06-01 12:19:36] [INFO ] Invariant cache hit.
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) 11/14 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 251/265 variables, 56/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 521/786 variables, 265/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/786 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/786 variables, 0/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 786/786 variables, and 324 constraints, problems are : Problem set: 0 solved, 1 unsolved in 191 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, State Equation: 265/265 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) 11/14 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/14 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 251/265 variables, 56/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/265 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 521/786 variables, 265/324 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/786 variables, 1/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/786 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/786 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 786/786 variables, and 325 constraints, problems are : Problem set: 0 solved, 1 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 59/59 constraints, State Equation: 265/265 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 367ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 17 ms.
Support contains 3 out of 265 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 265/265 places, 521/521 transitions.
Graph (trivial) has 160 edges and 265 vertex of which 73 / 265 are part of one of the 32 SCC in 3 ms
Free SCC test removed 41 places
Drop transitions (Empty/Sink Transition effects.) removed 91 transitions
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 162 transitions.
Graph (complete) has 668 edges and 224 vertex of which 222 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Discarding 2 places :
Also discarding 0 output transitions
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 12 place count 212 transition count 349
Iterating global reduction 0 with 10 rules applied. Total rules applied 22 place count 212 transition count 349
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 44 rules applied. Total rules applied 66 place count 190 transition count 327
Drop transitions (Redundant composition of simpler transitions.) removed 109 transitions
Redundant transition composition rules discarded 109 transitions
Iterating global reduction 0 with 109 rules applied. Total rules applied 175 place count 190 transition count 218
Partial Free-agglomeration rule applied 23 times.
Drop transitions (Partial Free agglomeration) removed 23 transitions
Iterating global reduction 0 with 23 rules applied. Total rules applied 198 place count 190 transition count 218
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 199 place count 189 transition count 217
Reduce places removed 9 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 33 rules applied. Total rules applied 232 place count 180 transition count 193
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 256 place count 156 transition count 193
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 257 place count 156 transition count 192
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 258 place count 155 transition count 192
Applied a total of 258 rules in 97 ms. Remains 155 /265 variables (removed 110) and now considering 192/521 (removed 329) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 155/265 places, 192/521 transitions.
RANDOM walk for 20396 steps (4 resets) in 232 ms. (87 steps per ms) remains 0/1 properties
[2024-06-01 12:19:37] [INFO ] Flatten gal took : 28 ms
[2024-06-01 12:19:37] [INFO ] Flatten gal took : 30 ms
[2024-06-01 12:19:37] [INFO ] Input system was already deterministic with 521 transitions.
Computed a total of 3 stabilizing places and 1 stable transitions
Graph (complete) has 1142 edges and 265 vertex of which 263 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 521/521 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 263 transition count 521
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 13 place count 252 transition count 510
Iterating global reduction 1 with 11 rules applied. Total rules applied 24 place count 252 transition count 510
Applied a total of 24 rules in 18 ms. Remains 252 /265 variables (removed 13) and now considering 510/521 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18 ms. Remains : 252/265 places, 510/521 transitions.
[2024-06-01 12:19:37] [INFO ] Flatten gal took : 25 ms
[2024-06-01 12:19:37] [INFO ] Flatten gal took : 26 ms
[2024-06-01 12:19:37] [INFO ] Input system was already deterministic with 510 transitions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 521/521 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 263 transition count 521
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 253 transition count 511
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 253 transition count 511
Applied a total of 22 rules in 8 ms. Remains 253 /265 variables (removed 12) and now considering 511/521 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 253/265 places, 511/521 transitions.
[2024-06-01 12:19:37] [INFO ] Flatten gal took : 20 ms
[2024-06-01 12:19:37] [INFO ] Flatten gal took : 22 ms
[2024-06-01 12:19:37] [INFO ] Input system was already deterministic with 511 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 265/265 places, 521/521 transitions.
Graph (trivial) has 156 edges and 265 vertex of which 73 / 265 are part of one of the 32 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 130 transitions
Reduce isomorphic transitions removed 130 transitions.
Graph (complete) has 856 edges and 224 vertex of which 222 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 212 transition count 358
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 67 place count 188 transition count 358
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 77 place count 178 transition count 348
Iterating global reduction 2 with 10 rules applied. Total rules applied 87 place count 178 transition count 348
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 123 place count 160 transition count 330
Drop transitions (Redundant composition of simpler transitions.) removed 132 transitions
Redundant transition composition rules discarded 132 transitions
Iterating global reduction 2 with 132 rules applied. Total rules applied 255 place count 160 transition count 198
Applied a total of 255 rules in 32 ms. Remains 160 /265 variables (removed 105) and now considering 198/521 (removed 323) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 32 ms. Remains : 160/265 places, 198/521 transitions.
[2024-06-01 12:19:37] [INFO ] Flatten gal took : 7 ms
[2024-06-01 12:19:37] [INFO ] Flatten gal took : 7 ms
[2024-06-01 12:19:37] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 521/521 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 263 transition count 521
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 13 place count 252 transition count 510
Iterating global reduction 1 with 11 rules applied. Total rules applied 24 place count 252 transition count 510
Applied a total of 24 rules in 7 ms. Remains 252 /265 variables (removed 13) and now considering 510/521 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 252/265 places, 510/521 transitions.
[2024-06-01 12:19:37] [INFO ] Flatten gal took : 17 ms
[2024-06-01 12:19:37] [INFO ] Flatten gal took : 18 ms
[2024-06-01 12:19:37] [INFO ] Input system was already deterministic with 510 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 265/265 places, 521/521 transitions.
Graph (trivial) has 163 edges and 265 vertex of which 75 / 265 are part of one of the 33 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 132 transitions
Reduce isomorphic transitions removed 132 transitions.
Graph (complete) has 850 edges and 223 vertex of which 221 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 211 transition count 356
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 67 place count 187 transition count 356
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 78 place count 176 transition count 345
Iterating global reduction 2 with 11 rules applied. Total rules applied 89 place count 176 transition count 345
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 133 place count 154 transition count 323
Drop transitions (Redundant composition of simpler transitions.) removed 136 transitions
Redundant transition composition rules discarded 136 transitions
Iterating global reduction 2 with 136 rules applied. Total rules applied 269 place count 154 transition count 187
Applied a total of 269 rules in 25 ms. Remains 154 /265 variables (removed 111) and now considering 187/521 (removed 334) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 25 ms. Remains : 154/265 places, 187/521 transitions.
[2024-06-01 12:19:37] [INFO ] Flatten gal took : 6 ms
[2024-06-01 12:19:37] [INFO ] Flatten gal took : 5 ms
[2024-06-01 12:19:37] [INFO ] Input system was already deterministic with 187 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 265/265 places, 521/521 transitions.
Graph (trivial) has 159 edges and 265 vertex of which 73 / 265 are part of one of the 32 SCC in 0 ms
Free SCC test removed 41 places
Ensure Unique test removed 130 transitions
Reduce isomorphic transitions removed 130 transitions.
Graph (complete) has 858 edges and 224 vertex of which 222 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 40 rules applied. Total rules applied 42 place count 212 transition count 359
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 65 place count 189 transition count 359
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 75 place count 179 transition count 349
Iterating global reduction 2 with 10 rules applied. Total rules applied 85 place count 179 transition count 349
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 127 place count 158 transition count 328
Drop transitions (Redundant composition of simpler transitions.) removed 130 transitions
Redundant transition composition rules discarded 130 transitions
Iterating global reduction 2 with 130 rules applied. Total rules applied 257 place count 158 transition count 198
Applied a total of 257 rules in 23 ms. Remains 158 /265 variables (removed 107) and now considering 198/521 (removed 323) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 23 ms. Remains : 158/265 places, 198/521 transitions.
[2024-06-01 12:19:37] [INFO ] Flatten gal took : 6 ms
[2024-06-01 12:19:37] [INFO ] Flatten gal took : 5 ms
[2024-06-01 12:19:37] [INFO ] Input system was already deterministic with 198 transitions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 521/521 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 263 transition count 521
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 13 place count 252 transition count 510
Iterating global reduction 1 with 11 rules applied. Total rules applied 24 place count 252 transition count 510
Applied a total of 24 rules in 7 ms. Remains 252 /265 variables (removed 13) and now considering 510/521 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 252/265 places, 510/521 transitions.
[2024-06-01 12:19:37] [INFO ] Flatten gal took : 17 ms
[2024-06-01 12:19:37] [INFO ] Flatten gal took : 19 ms
[2024-06-01 12:19:37] [INFO ] Input system was already deterministic with 510 transitions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 521/521 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 263 transition count 521
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 13 place count 252 transition count 510
Iterating global reduction 1 with 11 rules applied. Total rules applied 24 place count 252 transition count 510
Applied a total of 24 rules in 8 ms. Remains 252 /265 variables (removed 13) and now considering 510/521 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 252/265 places, 510/521 transitions.
[2024-06-01 12:19:37] [INFO ] Flatten gal took : 19 ms
[2024-06-01 12:19:37] [INFO ] Flatten gal took : 19 ms
[2024-06-01 12:19:37] [INFO ] Input system was already deterministic with 510 transitions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 521/521 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 263 transition count 521
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 13 place count 252 transition count 510
Iterating global reduction 1 with 11 rules applied. Total rules applied 24 place count 252 transition count 510
Applied a total of 24 rules in 8 ms. Remains 252 /265 variables (removed 13) and now considering 510/521 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 252/265 places, 510/521 transitions.
[2024-06-01 12:19:37] [INFO ] Flatten gal took : 19 ms
[2024-06-01 12:19:37] [INFO ] Flatten gal took : 20 ms
[2024-06-01 12:19:37] [INFO ] Input system was already deterministic with 510 transitions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 521/521 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 263 transition count 521
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 10 place count 255 transition count 513
Iterating global reduction 1 with 8 rules applied. Total rules applied 18 place count 255 transition count 513
Applied a total of 18 rules in 6 ms. Remains 255 /265 variables (removed 10) and now considering 513/521 (removed 8) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 255/265 places, 513/521 transitions.
[2024-06-01 12:19:37] [INFO ] Flatten gal took : 16 ms
[2024-06-01 12:19:37] [INFO ] Flatten gal took : 17 ms
[2024-06-01 12:19:38] [INFO ] Input system was already deterministic with 513 transitions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 521/521 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 263 transition count 521
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 11 place count 254 transition count 512
Iterating global reduction 1 with 9 rules applied. Total rules applied 20 place count 254 transition count 512
Applied a total of 20 rules in 8 ms. Remains 254 /265 variables (removed 11) and now considering 512/521 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8 ms. Remains : 254/265 places, 512/521 transitions.
[2024-06-01 12:19:38] [INFO ] Flatten gal took : 16 ms
[2024-06-01 12:19:38] [INFO ] Flatten gal took : 17 ms
[2024-06-01 12:19:38] [INFO ] Input system was already deterministic with 512 transitions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 521/521 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 263 transition count 521
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 13 place count 252 transition count 510
Iterating global reduction 1 with 11 rules applied. Total rules applied 24 place count 252 transition count 510
Applied a total of 24 rules in 7 ms. Remains 252 /265 variables (removed 13) and now considering 510/521 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7 ms. Remains : 252/265 places, 510/521 transitions.
[2024-06-01 12:19:38] [INFO ] Flatten gal took : 17 ms
[2024-06-01 12:19:38] [INFO ] Flatten gal took : 17 ms
[2024-06-01 12:19:38] [INFO ] Input system was already deterministic with 510 transitions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 521/521 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 263 transition count 521
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 12 place count 253 transition count 511
Iterating global reduction 1 with 10 rules applied. Total rules applied 22 place count 253 transition count 511
Applied a total of 22 rules in 5 ms. Remains 253 /265 variables (removed 12) and now considering 511/521 (removed 10) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6 ms. Remains : 253/265 places, 511/521 transitions.
[2024-06-01 12:19:38] [INFO ] Flatten gal took : 15 ms
[2024-06-01 12:19:38] [INFO ] Flatten gal took : 17 ms
[2024-06-01 12:19:38] [INFO ] Input system was already deterministic with 511 transitions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 521/521 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 264 transition count 521
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 12 place count 253 transition count 510
Iterating global reduction 1 with 11 rules applied. Total rules applied 23 place count 253 transition count 510
Applied a total of 23 rules in 4 ms. Remains 253 /265 variables (removed 12) and now considering 510/521 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 253/265 places, 510/521 transitions.
[2024-06-01 12:19:38] [INFO ] Flatten gal took : 15 ms
[2024-06-01 12:19:38] [INFO ] Flatten gal took : 16 ms
[2024-06-01 12:19:38] [INFO ] Input system was already deterministic with 510 transitions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 521/521 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 263 transition count 521
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 13 place count 252 transition count 510
Iterating global reduction 1 with 11 rules applied. Total rules applied 24 place count 252 transition count 510
Applied a total of 24 rules in 4 ms. Remains 252 /265 variables (removed 13) and now considering 510/521 (removed 11) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4 ms. Remains : 252/265 places, 510/521 transitions.
[2024-06-01 12:19:38] [INFO ] Flatten gal took : 15 ms
[2024-06-01 12:19:38] [INFO ] Flatten gal took : 15 ms
[2024-06-01 12:19:38] [INFO ] Input system was already deterministic with 510 transitions.
Starting structural reductions in LTL mode, iteration 0 : 265/265 places, 521/521 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 264 transition count 521
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 10 place count 255 transition count 512
Iterating global reduction 1 with 9 rules applied. Total rules applied 19 place count 255 transition count 512
Applied a total of 19 rules in 5 ms. Remains 255 /265 variables (removed 10) and now considering 512/521 (removed 9) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5 ms. Remains : 255/265 places, 512/521 transitions.
[2024-06-01 12:19:38] [INFO ] Flatten gal took : 15 ms
[2024-06-01 12:19:38] [INFO ] Flatten gal took : 16 ms
[2024-06-01 12:19:38] [INFO ] Input system was already deterministic with 512 transitions.
[2024-06-01 12:19:38] [INFO ] Flatten gal took : 26 ms
[2024-06-01 12:19:38] [INFO ] Flatten gal took : 18 ms
[2024-06-01 12:19:38] [INFO ] Export to MCC of 16 properties in file /home/mcc/execution/CTLFireability.sr.xml took 4 ms.
[2024-06-01 12:19:38] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 265 places, 521 transitions and 1810 arcs took 5 ms.
Total runtime 58251 ms.
There are residual formulas that ITS could not solve within timeout
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : NoC3x3-PT-8A-CTLFireability-2024-00
Could not compute solution for formula : NoC3x3-PT-8A-CTLFireability-2024-01
Could not compute solution for formula : NoC3x3-PT-8A-CTLFireability-2024-02
Could not compute solution for formula : NoC3x3-PT-8A-CTLFireability-2024-03
Could not compute solution for formula : NoC3x3-PT-8A-CTLFireability-2024-04
Could not compute solution for formula : NoC3x3-PT-8A-CTLFireability-2024-05
Could not compute solution for formula : NoC3x3-PT-8A-CTLFireability-2024-06
Could not compute solution for formula : NoC3x3-PT-8A-CTLFireability-2024-07
Could not compute solution for formula : NoC3x3-PT-8A-CTLFireability-2024-08
Could not compute solution for formula : NoC3x3-PT-8A-CTLFireability-2024-09
Could not compute solution for formula : NoC3x3-PT-8A-CTLFireability-2024-10
Could not compute solution for formula : NoC3x3-PT-8A-CTLFireability-2024-11
Could not compute solution for formula : NoC3x3-PT-8A-CTLFireability-2023-12
Could not compute solution for formula : NoC3x3-PT-8A-CTLFireability-2023-13
Could not compute solution for formula : NoC3x3-PT-8A-CTLFireability-2023-14
Could not compute solution for formula : NoC3x3-PT-8A-CTLFireability-2023-15

BK_STOP 1717244379028

--------------------
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 CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name NoC3x3-PT-8A-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/523/ctl_0_
ctl formula name NoC3x3-PT-8A-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/523/ctl_1_
ctl formula name NoC3x3-PT-8A-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/523/ctl_2_
ctl formula name NoC3x3-PT-8A-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/523/ctl_3_
ctl formula name NoC3x3-PT-8A-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/523/ctl_4_
ctl formula name NoC3x3-PT-8A-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/523/ctl_5_
ctl formula name NoC3x3-PT-8A-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/523/ctl_6_
ctl formula name NoC3x3-PT-8A-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/523/ctl_7_
ctl formula name NoC3x3-PT-8A-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/523/ctl_8_
ctl formula name NoC3x3-PT-8A-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/523/ctl_9_
ctl formula name NoC3x3-PT-8A-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/523/ctl_10_
ctl formula name NoC3x3-PT-8A-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/523/ctl_11_
ctl formula name NoC3x3-PT-8A-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/523/ctl_12_
ctl formula name NoC3x3-PT-8A-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/523/ctl_13_
ctl formula name NoC3x3-PT-8A-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/523/ctl_14_
ctl formula name NoC3x3-PT-8A-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/523/ctl_15_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

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="NoC3x3-PT-8A"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is NoC3x3-PT-8A, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r508-tall-171654352100666"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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