Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r472-tajo-171620399500442.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is BugTracking-PT-q8m256, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399500442
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.7K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 19 15:30 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 125K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 91K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M 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 BugTracking-PT-q8m256-CTLFireability-2024-00
FORMULA_NAME BugTracking-PT-q8m256-CTLFireability-2024-01
FORMULA_NAME BugTracking-PT-q8m256-CTLFireability-2024-02
FORMULA_NAME BugTracking-PT-q8m256-CTLFireability-2024-03
FORMULA_NAME BugTracking-PT-q8m256-CTLFireability-2024-04
FORMULA_NAME BugTracking-PT-q8m256-CTLFireability-2024-05
FORMULA_NAME BugTracking-PT-q8m256-CTLFireability-2024-06
FORMULA_NAME BugTracking-PT-q8m256-CTLFireability-2024-07
FORMULA_NAME BugTracking-PT-q8m256-CTLFireability-2024-08
FORMULA_NAME BugTracking-PT-q8m256-CTLFireability-2024-09
FORMULA_NAME BugTracking-PT-q8m256-CTLFireability-2024-10
FORMULA_NAME BugTracking-PT-q8m256-CTLFireability-2024-11
FORMULA_NAME BugTracking-PT-q8m256-CTLFireability-2023-12
FORMULA_NAME BugTracking-PT-q8m256-CTLFireability-2023-13
FORMULA_NAME BugTracking-PT-q8m256-CTLFireability-2023-14
FORMULA_NAME BugTracking-PT-q8m256-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1717224731696

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m256
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:52:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 06:52:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:52:14] [INFO ] Load time of PNML (sax parser for PT used): 1171 ms
[2024-06-01 06:52:14] [INFO ] Transformed 754 places.
[2024-06-01 06:52:14] [INFO ] Transformed 27370 transitions.
[2024-06-01 06:52:14] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1526 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 41 ms.
Deduced a syphon composed of 474 places in 143 ms
Reduce places removed 474 places and 23466 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BugTracking-PT-q8m256-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-CTLFireability-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 10 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 278 transition count 3904
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 277 transition count 3871
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 277 transition count 3871
Applied a total of 4 rules in 171 ms. Remains 277 /280 variables (removed 3) and now considering 3871/3904 (removed 33) transitions.
[2024-06-01 06:52:15] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2024-06-01 06:52:15] [INFO ] Computed 8 invariants in 43 ms
[2024-06-01 06:52:16] [INFO ] Implicit Places using invariants in 912 ms returned []
[2024-06-01 06:52:16] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-06-01 06:52:16] [INFO ] Invariant cache hit.
[2024-06-01 06:52:17] [INFO ] State equation strengthened by 282 read => feed constraints.
[2024-06-01 06:52:19] [INFO ] Implicit Places using invariants and state equation in 2380 ms returned []
Implicit Place search using SMT with State Equation took 3367 ms to find 0 implicit places.
Running 3869 sub problems to find dead transitions.
[2024-06-01 06:52:19] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-06-01 06:52:19] [INFO ] Invariant cache hit.
[2024-06-01 06:52:19] [INFO ] State equation strengthened by 282 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3869 unsolved
[2024-06-01 06:53:21] [INFO ] Deduced a trap composed of 10 places in 213 ms of which 19 ms to minimize.
[2024-06-01 06:53:21] [INFO ] Deduced a trap composed of 7 places in 217 ms of which 2 ms to minimize.
[2024-06-01 06:53:21] [INFO ] Deduced a trap composed of 23 places in 172 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s1 1.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 1.0)
(s12 1.0)
(s13 1.0)
(s14 1.0)
(s15 1.0)
(s16 1.0)
(s17 1.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 1.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 1.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 1.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 276/3984 variables, and 11 constraints, problems are : Problem set: 0 solved, 3869 unsolved in 30075 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/277 constraints, ReadFeed: 0/282 constraints, PredecessorRefiner: 3869/2672 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3869 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3869 unsolved
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD2706 is UNSAT
Problem TDEAD2715 is UNSAT
Problem TDEAD2727 is UNSAT
Problem TDEAD2731 is UNSAT
Problem TDEAD2740 is UNSAT
Problem TDEAD2752 is UNSAT
Problem TDEAD2756 is UNSAT
Problem TDEAD2765 is UNSAT
Problem TDEAD2777 is UNSAT
Problem TDEAD2781 is UNSAT
Problem TDEAD2782 is UNSAT
Problem TDEAD2783 is UNSAT
Problem TDEAD2784 is UNSAT
Problem TDEAD2785 is UNSAT
Problem TDEAD2786 is UNSAT
Problem TDEAD2787 is UNSAT
Problem TDEAD2788 is UNSAT
Problem TDEAD2789 is UNSAT
Problem TDEAD2790 is UNSAT
Problem TDEAD2794 is UNSAT
Problem TDEAD2795 is UNSAT
Problem TDEAD2796 is UNSAT
Problem TDEAD2797 is UNSAT
Problem TDEAD2798 is UNSAT
Problem TDEAD2799 is UNSAT
Problem TDEAD2800 is UNSAT
Problem TDEAD2801 is UNSAT
Problem TDEAD2802 is UNSAT
Problem TDEAD2803 is UNSAT
Problem TDEAD2804 is UNSAT
Problem TDEAD2805 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 3/11 constraints. Problems are: Problem set: 40 solved, 3829 unsolved
[2024-06-01 06:53:40] [INFO ] Deduced a trap composed of 11 places in 82 ms of which 1 ms to minimize.
Problem TDEAD784 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD814 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 276/3984 variables, and 12 constraints, problems are : Problem set: 45 solved, 3824 unsolved in 30078 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/277 constraints, ReadFeed: 0/282 constraints, PredecessorRefiner: 1197/2672 constraints, Known Traps: 4/4 constraints]
After SMT, in 100822ms problems are : Problem set: 45 solved, 3824 unsolved
Search for dead transitions found 45 dead transitions in 101044ms
Found 45 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 45 transitions
Dead transitions reduction (with SMT) removed 45 transitions
Starting structural reductions in LTL mode, iteration 1 : 277/280 places, 3826/3904 transitions.
Reduce places removed 11 places and 334 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 266 transition count 3492
Reduce places removed 5 places and 152 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 16 place count 261 transition count 3340
Reduce places removed 2 places and 56 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 18 place count 259 transition count 3284
Reduce places removed 1 places and 32 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 19 place count 258 transition count 3252
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 20 place count 257 transition count 3227
Iterating global reduction 4 with 1 rules applied. Total rules applied 21 place count 257 transition count 3227
Applied a total of 21 rules in 138 ms. Remains 257 /277 variables (removed 20) and now considering 3227/3826 (removed 599) transitions.
[2024-06-01 06:54:00] [INFO ] Flow matrix only has 3100 transitions (discarded 127 similar events)
// Phase 1: matrix 3100 rows 257 cols
[2024-06-01 06:54:00] [INFO ] Computed 8 invariants in 16 ms
[2024-06-01 06:54:01] [INFO ] Implicit Places using invariants in 895 ms returned []
[2024-06-01 06:54:01] [INFO ] Flow matrix only has 3100 transitions (discarded 127 similar events)
[2024-06-01 06:54:01] [INFO ] Invariant cache hit.
[2024-06-01 06:54:01] [INFO ] State equation strengthened by 251 read => feed constraints.
[2024-06-01 06:54:02] [INFO ] Implicit Places using invariants and state equation in 1688 ms returned []
Implicit Place search using SMT with State Equation took 2601 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 257/280 places, 3227/3904 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 107392 ms. Remains : 257/280 places, 3227/3904 transitions.
Support contains 10 out of 257 places after structural reductions.
[2024-06-01 06:54:03] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2024-06-01 06:54:03] [INFO ] Flatten gal took : 365 ms
[2024-06-01 06:54:03] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA BugTracking-PT-q8m256-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-CTLFireability-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-CTLFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m256-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:54:03] [INFO ] Flatten gal took : 231 ms
[2024-06-01 06:54:04] [INFO ] Input system was already deterministic with 3227 transitions.
Support contains 6 out of 257 places (down from 10) after GAL structural reductions.
FORMULA BugTracking-PT-q8m256-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40221 steps (14 resets) in 1456 ms. (27 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 174 ms. (228 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 149277 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 2
Probabilistic random walk after 149277 steps, saw 72165 distinct states, run finished after 3005 ms. (steps per millisecond=49 ) properties seen :0
[2024-06-01 06:54:08] [INFO ] Flow matrix only has 3100 transitions (discarded 127 similar events)
[2024-06-01 06:54:08] [INFO ] Invariant cache hit.
[2024-06-01 06:54:08] [INFO ] State equation strengthened by 251 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 68/74 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-01 06:54:08] [INFO ] Deduced a trap composed of 18 places in 134 ms of which 2 ms to minimize.
Problem AtomicPropp1 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1859/1933 variables, 74/78 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1933 variables, 134/212 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/1933 variables, 0/212 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1136/3069 variables, 98/310 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3069 variables, 72/382 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3069 variables, 0/382 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 4/3073 variables, 1/383 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3073 variables, 0/383 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 244/3317 variables, 58/441 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3317 variables, 2/443 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3317 variables, 36/479 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3317 variables, 0/479 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/3319 variables, 1/480 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3319 variables, 0/480 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 38/3357 variables, 27/507 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3357 variables, 1/508 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3357 variables, 9/517 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3357 variables, 0/517 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/3357 variables, 0/517 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3357/3357 variables, and 517 constraints, problems are : Problem set: 1 solved, 1 unsolved in 1611 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 257/257 constraints, ReadFeed: 251/251 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 31/34 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 891/925 variables, 34/35 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/925 variables, 61/96 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/925 variables, 0/96 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1486/2411 variables, 69/165 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2411 variables, 104/269 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2411 variables, 0/269 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 5/2416 variables, 1/270 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2416 variables, 0/270 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 816/3232 variables, 98/368 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3232 variables, 2/370 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3232 variables, 64/434 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3232 variables, 1/435 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3232 variables, 1/436 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 06:54:11] [INFO ] Deduced a trap composed of 17 places in 307 ms of which 2 ms to minimize.
[2024-06-01 06:54:11] [INFO ] Deduced a trap composed of 30 places in 230 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/3232 variables, 2/438 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3232 variables, 0/438 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 5/3237 variables, 2/440 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3237 variables, 2/442 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3237 variables, 0/442 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 115/3352 variables, 51/493 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3352 variables, 2/495 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3352 variables, 22/517 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-01 06:54:12] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 2 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/3352 variables, 1/518 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3352 variables, 0/518 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 5/3357 variables, 3/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/3357 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 28 (OVERLAPS) 0/3357 variables, 0/521 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3357/3357 variables, and 521 constraints, problems are : Problem set: 1 solved, 1 unsolved in 2922 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 257/257 constraints, ReadFeed: 251/251 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 4/4 constraints]
After SMT, in 4594ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 135 ms.
Support contains 3 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 3227/3227 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 255 transition count 3232
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 255 transition count 3226
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 249 transition count 3226
Applied a total of 16 rules in 263 ms. Remains 249 /257 variables (removed 8) and now considering 3226/3227 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 277 ms. Remains : 249/257 places, 3226/3227 transitions.
RANDOM walk for 40708 steps (8 resets) in 54 ms. (740 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 180 ms. (221 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 116644 steps, run timeout after 3001 ms. (steps per millisecond=38 ) properties seen :0 out of 1
Probabilistic random walk after 116644 steps, saw 50364 distinct states, run finished after 3001 ms. (steps per millisecond=38 ) properties seen :0
[2024-06-01 06:54:16] [INFO ] Flow matrix only has 3092 transitions (discarded 134 similar events)
// Phase 1: matrix 3092 rows 249 cols
[2024-06-01 06:54:16] [INFO ] Computed 8 invariants in 34 ms
[2024-06-01 06:54:16] [INFO ] State equation strengthened by 252 read => feed constraints.
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) 31/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 891/925 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/925 variables, 61/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/925 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1485/2410 variables, 69/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2410 variables, 104/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2410 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/2414 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2414 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 820/3234 variables, 96/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3234 variables, 3/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3234 variables, 72/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3234 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/3235 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3235 variables, 1/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3235 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 105/3340 variables, 48/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3340 variables, 2/493 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3340 variables, 15/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3340 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 1/3341 variables, 1/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3341 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/3341 variables, 0/509 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3341/3341 variables, and 509 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1141 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 249/249 constraints, ReadFeed: 252/252 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) 31/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 891/925 variables, 34/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/925 variables, 61/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/925 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1485/2410 variables, 69/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2410 variables, 104/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2410 variables, 0/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 4/2414 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2414 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 820/3234 variables, 96/366 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3234 variables, 3/369 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3234 variables, 72/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3234 variables, 1/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:54:18] [INFO ] Deduced a trap composed of 50 places in 383 ms of which 3 ms to minimize.
[2024-06-01 06:54:19] [INFO ] Deduced a trap composed of 71 places in 367 ms of which 2 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/3234 variables, 2/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3234 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 1/3235 variables, 1/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3235 variables, 1/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3235 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 105/3340 variables, 48/494 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3340 variables, 2/496 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3340 variables, 15/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3340 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 1/3341 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/3341 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/3341 variables, 0/512 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3341/3341 variables, and 512 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3028 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 249/249 constraints, ReadFeed: 252/252 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 4246ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 176 ms.
Support contains 3 out of 249 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 3226/3226 transitions.
Applied a total of 0 rules in 67 ms. Remains 249 /249 variables (removed 0) and now considering 3226/3226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 67 ms. Remains : 249/249 places, 3226/3226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 249/249 places, 3226/3226 transitions.
Applied a total of 0 rules in 64 ms. Remains 249 /249 variables (removed 0) and now considering 3226/3226 (removed 0) transitions.
[2024-06-01 06:54:20] [INFO ] Flow matrix only has 3092 transitions (discarded 134 similar events)
[2024-06-01 06:54:20] [INFO ] Invariant cache hit.
[2024-06-01 06:54:21] [INFO ] Implicit Places using invariants in 454 ms returned []
[2024-06-01 06:54:21] [INFO ] Flow matrix only has 3092 transitions (discarded 134 similar events)
[2024-06-01 06:54:21] [INFO ] Invariant cache hit.
[2024-06-01 06:54:21] [INFO ] State equation strengthened by 252 read => feed constraints.
[2024-06-01 06:54:23] [INFO ] Implicit Places using invariants and state equation in 2114 ms returned []
Implicit Place search using SMT with State Equation took 2571 ms to find 0 implicit places.
[2024-06-01 06:54:23] [INFO ] Redundant transitions in 229 ms returned []
Running 3225 sub problems to find dead transitions.
[2024-06-01 06:54:23] [INFO ] Flow matrix only has 3092 transitions (discarded 134 similar events)
[2024-06-01 06:54:23] [INFO ] Invariant cache hit.
[2024-06-01 06:54:23] [INFO ] State equation strengthened by 252 read => feed constraints.
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 : BugTracking-PT-q8m256-CTLFireability-2024-00
Could not compute solution for formula : BugTracking-PT-q8m256-CTLFireability-2024-01
Could not compute solution for formula : BugTracking-PT-q8m256-CTLFireability-2024-02
Could not compute solution for formula : BugTracking-PT-q8m256-CTLFireability-2024-03
Could not compute solution for formula : BugTracking-PT-q8m256-CTLFireability-2024-04
Could not compute solution for formula : BugTracking-PT-q8m256-CTLFireability-2024-05
Could not compute solution for formula : BugTracking-PT-q8m256-CTLFireability-2024-06
Could not compute solution for formula : BugTracking-PT-q8m256-CTLFireability-2024-07
Could not compute solution for formula : BugTracking-PT-q8m256-CTLFireability-2024-08
Could not compute solution for formula : BugTracking-PT-q8m256-CTLFireability-2024-09
Could not compute solution for formula : BugTracking-PT-q8m256-CTLFireability-2024-10
Could not compute solution for formula : BugTracking-PT-q8m256-CTLFireability-2024-11
Could not compute solution for formula : BugTracking-PT-q8m256-CTLFireability-2023-12
Could not compute solution for formula : BugTracking-PT-q8m256-CTLFireability-2023-13
Could not compute solution for formula : BugTracking-PT-q8m256-CTLFireability-2023-14
Could not compute solution for formula : BugTracking-PT-q8m256-CTLFireability-2023-15

BK_STOP 1717224895486

--------------------
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 CTLFireability -timeout 360 -rebuildPNML
mcc2024
ctl formula name BugTracking-PT-q8m256-CTLFireability-2024-00
ctl formula formula --ctl=/tmp/604/ctl_0_
ctl formula name BugTracking-PT-q8m256-CTLFireability-2024-01
ctl formula formula --ctl=/tmp/604/ctl_1_
ctl formula name BugTracking-PT-q8m256-CTLFireability-2024-02
ctl formula formula --ctl=/tmp/604/ctl_2_
ctl formula name BugTracking-PT-q8m256-CTLFireability-2024-03
ctl formula formula --ctl=/tmp/604/ctl_3_
ctl formula name BugTracking-PT-q8m256-CTLFireability-2024-04
ctl formula formula --ctl=/tmp/604/ctl_4_
ctl formula name BugTracking-PT-q8m256-CTLFireability-2024-05
ctl formula formula --ctl=/tmp/604/ctl_5_
ctl formula name BugTracking-PT-q8m256-CTLFireability-2024-06
ctl formula formula --ctl=/tmp/604/ctl_6_
ctl formula name BugTracking-PT-q8m256-CTLFireability-2024-07
ctl formula formula --ctl=/tmp/604/ctl_7_
ctl formula name BugTracking-PT-q8m256-CTLFireability-2024-08
ctl formula formula --ctl=/tmp/604/ctl_8_
ctl formula name BugTracking-PT-q8m256-CTLFireability-2024-09
ctl formula formula --ctl=/tmp/604/ctl_9_
ctl formula name BugTracking-PT-q8m256-CTLFireability-2024-10
ctl formula formula --ctl=/tmp/604/ctl_10_
ctl formula name BugTracking-PT-q8m256-CTLFireability-2024-11
ctl formula formula --ctl=/tmp/604/ctl_11_
ctl formula name BugTracking-PT-q8m256-CTLFireability-2023-12
ctl formula formula --ctl=/tmp/604/ctl_12_
ctl formula name BugTracking-PT-q8m256-CTLFireability-2023-13
ctl formula formula --ctl=/tmp/604/ctl_13_
ctl formula name BugTracking-PT-q8m256-CTLFireability-2023-14
ctl formula formula --ctl=/tmp/604/ctl_14_
ctl formula name BugTracking-PT-q8m256-CTLFireability-2023-15
ctl formula formula --ctl=/tmp/604/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="BugTracking-PT-q8m256"
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 BugTracking-PT-q8m256, 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 r472-tajo-171620399500442"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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