Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399400402.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 itstools
Input is BugTracking-PT-q8m008, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399400402
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 13K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 129K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 111K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 81K 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-q8m008-CTLFireability-2024-00
FORMULA_NAME BugTracking-PT-q8m008-CTLFireability-2024-01
FORMULA_NAME BugTracking-PT-q8m008-CTLFireability-2024-02
FORMULA_NAME BugTracking-PT-q8m008-CTLFireability-2024-03
FORMULA_NAME BugTracking-PT-q8m008-CTLFireability-2024-04
FORMULA_NAME BugTracking-PT-q8m008-CTLFireability-2024-05
FORMULA_NAME BugTracking-PT-q8m008-CTLFireability-2024-06
FORMULA_NAME BugTracking-PT-q8m008-CTLFireability-2024-07
FORMULA_NAME BugTracking-PT-q8m008-CTLFireability-2024-08
FORMULA_NAME BugTracking-PT-q8m008-CTLFireability-2024-09
FORMULA_NAME BugTracking-PT-q8m008-CTLFireability-2024-10
FORMULA_NAME BugTracking-PT-q8m008-CTLFireability-2024-11
FORMULA_NAME BugTracking-PT-q8m008-CTLFireability-2023-12
FORMULA_NAME BugTracking-PT-q8m008-CTLFireability-2023-13
FORMULA_NAME BugTracking-PT-q8m008-CTLFireability-2023-14
FORMULA_NAME BugTracking-PT-q8m008-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716332836826

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m008
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 23:07:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 23:07:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:07:19] [INFO ] Load time of PNML (sax parser for PT used): 1261 ms
[2024-05-21 23:07:19] [INFO ] Transformed 754 places.
[2024-05-21 23:07:19] [INFO ] Transformed 27370 transitions.
[2024-05-21 23:07:19] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1499 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 39 ms.
Deduced a syphon composed of 474 places in 180 ms
Reduce places removed 474 places and 23466 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA BugTracking-PT-q8m008-CTLFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 14 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 106 ms. Remains 277 /280 variables (removed 3) and now considering 3871/3904 (removed 33) transitions.
[2024-05-21 23:07:20] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2024-05-21 23:07:20] [INFO ] Computed 8 invariants in 68 ms
[2024-05-21 23:07:21] [INFO ] Implicit Places using invariants in 784 ms returned []
[2024-05-21 23:07:21] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-05-21 23:07:21] [INFO ] Invariant cache hit.
[2024-05-21 23:07:22] [INFO ] State equation strengthened by 282 read => feed constraints.
[2024-05-21 23:07:24] [INFO ] Implicit Places using invariants and state equation in 3262 ms returned []
Implicit Place search using SMT with State Equation took 4078 ms to find 0 implicit places.
Running 3869 sub problems to find dead transitions.
[2024-05-21 23:07:24] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-05-21 23:07:24] [INFO ] Invariant cache hit.
[2024-05-21 23:07:24] [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-05-21 23:08:26] [INFO ] Deduced a trap composed of 10 places in 362 ms of which 24 ms to minimize.
[2024-05-21 23:08:26] [INFO ] Deduced a trap composed of 7 places in 224 ms of which 14 ms to minimize.
[2024-05-21 23:08:26] [INFO ] Deduced a trap composed of 23 places in 150 ms of which 1 ms to minimize.
[2024-05-21 23:08:34] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
Problem TDEAD784 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD802 is UNSAT
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 TDEAD814 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 276/3984 variables, and 12 constraints, problems are : Problem set: 14 solved, 3855 unsolved in 30078 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: 4/4 constraints]
Escalating to Integer solving :Problem set: 14 solved, 3855 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 8/8 constraints. Problems are: Problem set: 14 solved, 3855 unsolved
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, 4/12 constraints. Problems are: Problem set: 45 solved, 3824 unsolved
[2024-05-21 23:09:07] [INFO ] Deduced a trap composed of 23 places in 112 ms of which 1 ms to minimize.
Problem TDEAD2716 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 276/3984 variables, and 13 constraints, problems are : Problem set: 46 solved, 3823 unsolved in 30066 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: 5/5 constraints]
After SMT, in 103004ms problems are : Problem set: 46 solved, 3823 unsolved
Search for dead transitions found 46 dead transitions in 103096ms
Found 46 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 46 transitions
Dead transitions reduction (with SMT) removed 46 transitions
Starting structural reductions in LTL mode, iteration 1 : 277/280 places, 3825/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 3491
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 3339
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 3283
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 3251
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 20 place count 257 transition count 3226
Iterating global reduction 4 with 1 rules applied. Total rules applied 21 place count 257 transition count 3226
Applied a total of 21 rules in 60 ms. Remains 257 /277 variables (removed 20) and now considering 3226/3825 (removed 599) transitions.
[2024-05-21 23:09:07] [INFO ] Flow matrix only has 3099 transitions (discarded 127 similar events)
// Phase 1: matrix 3099 rows 257 cols
[2024-05-21 23:09:07] [INFO ] Computed 8 invariants in 15 ms
[2024-05-21 23:09:08] [INFO ] Implicit Places using invariants in 1010 ms returned []
[2024-05-21 23:09:08] [INFO ] Flow matrix only has 3099 transitions (discarded 127 similar events)
[2024-05-21 23:09:08] [INFO ] Invariant cache hit.
[2024-05-21 23:09:09] [INFO ] State equation strengthened by 251 read => feed constraints.
[2024-05-21 23:09:10] [INFO ] Implicit Places using invariants and state equation in 1542 ms returned []
Implicit Place search using SMT with State Equation took 2556 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 257/280 places, 3226/3904 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 109950 ms. Remains : 257/280 places, 3226/3904 transitions.
Support contains 14 out of 257 places after structural reductions.
[2024-05-21 23:09:10] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2024-05-21 23:09:10] [INFO ] Flatten gal took : 296 ms
[2024-05-21 23:09:10] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
FORMULA BugTracking-PT-q8m008-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-CTLFireability-2023-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-CTLFireability-2024-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-CTLFireability-2024-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-CTLFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-CTLFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-CTLFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m008-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 23:09:11] [INFO ] Flatten gal took : 209 ms
[2024-05-21 23:09:11] [INFO ] Input system was already deterministic with 3226 transitions.
Support contains 6 out of 257 places (down from 14) after GAL structural reductions.
FORMULA BugTracking-PT-q8m008-CTLFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (239 resets) in 2144 ms. (18 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (45 resets) in 214 ms. (186 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (52 resets) in 218 ms. (182 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 150901 steps, run timeout after 3001 ms. (steps per millisecond=50 ) properties seen :0 out of 2
Probabilistic random walk after 150901 steps, saw 85763 distinct states, run finished after 3004 ms. (steps per millisecond=50 ) properties seen :0
[2024-05-21 23:09:15] [INFO ] Flow matrix only has 3099 transitions (discarded 127 similar events)
[2024-05-21 23:09:15] [INFO ] Invariant cache hit.
[2024-05-21 23:09:15] [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) 50/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1072/1128 variables, 56/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1128 variables, 62/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1128 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1903/3031 variables, 67/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3031 variables, 141/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3031 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/3036 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3036 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 303/3339 variables, 119/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3339 variables, 2/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3339 variables, 48/499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3339 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 2/3341 variables, 1/500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3341 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 15/3356 variables, 15/515 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3356 variables, 1/516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3356 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/3356 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3356/3356 variables, and 516 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1511 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: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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) 50/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1072/1128 variables, 56/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1128 variables, 62/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1128 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1903/3031 variables, 67/188 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3031 variables, 141/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3031 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 5/3036 variables, 1/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3036 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 303/3339 variables, 119/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3339 variables, 2/451 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3339 variables, 48/499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3339 variables, 2/501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3339 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 2/3341 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3341 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 15/3356 variables, 15/517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3356 variables, 1/518 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:09:19] [INFO ] Deduced a trap composed of 60 places in 373 ms of which 2 ms to minimize.
[2024-05-21 23:09:19] [INFO ] Deduced a trap composed of 39 places in 313 ms of which 3 ms to minimize.
[2024-05-21 23:09:19] [INFO ] Deduced a trap composed of 23 places in 244 ms of which 1 ms to minimize.
[2024-05-21 23:09:20] [INFO ] Deduced a trap composed of 30 places in 342 ms of which 2 ms to minimize.
[2024-05-21 23:09:20] [INFO ] Deduced a trap composed of 19 places in 586 ms of which 2 ms to minimize.
[2024-05-21 23:09:21] [INFO ] Deduced a trap composed of 15 places in 415 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/3356 variables, 6/524 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3356 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/3356 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3356/3356 variables, and 524 constraints, problems are : Problem set: 0 solved, 2 unsolved in 5014 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: 6/6 constraints]
After SMT, in 6592ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 257 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 257/257 places, 3226/3226 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 2 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 3231
Free-agglomeration rule applied 5 times.
Iterating global reduction 0 with 5 rules applied. Total rules applied 9 place count 255 transition count 3226
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 14 place count 250 transition count 3226
Applied a total of 14 rules in 366 ms. Remains 250 /257 variables (removed 7) and now considering 3226/3226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 366 ms. Remains : 250/257 places, 3226/3226 transitions.
RANDOM walk for 40012 steps (353 resets) in 723 ms. (55 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (68 resets) in 206 ms. (193 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (64 resets) in 267 ms. (149 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 105145 steps, run timeout after 3001 ms. (steps per millisecond=35 ) properties seen :0 out of 2
Probabilistic random walk after 105145 steps, saw 69140 distinct states, run finished after 3001 ms. (steps per millisecond=35 ) properties seen :0
[2024-05-21 23:09:25] [INFO ] Flow matrix only has 3092 transitions (discarded 134 similar events)
// Phase 1: matrix 3092 rows 250 cols
[2024-05-21 23:09:25] [INFO ] Computed 8 invariants in 19 ms
[2024-05-21 23:09:25] [INFO ] State equation strengthened by 252 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) 48/54 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1070/1124 variables, 54/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1124 variables, 62/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1124 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1901/3025 variables, 66/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3025 variables, 142/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3025 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 4/3029 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3029 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 301/3330 variables, 118/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3330 variables, 3/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3330 variables, 48/497 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3330 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/3342 variables, 12/509 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3342 variables, 1/510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3342 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/3342 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3342/3342 variables, and 510 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1658 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 250/250 constraints, ReadFeed: 252/252 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
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) 48/54 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 1070/1124 variables, 54/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1124 variables, 62/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1124 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 1901/3025 variables, 66/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3025 variables, 142/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3025 variables, 0/327 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 4/3029 variables, 1/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3029 variables, 0/328 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 301/3330 variables, 118/446 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3330 variables, 3/449 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3330 variables, 48/497 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3330 variables, 2/499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:09:29] [INFO ] Deduced a trap composed of 11 places in 394 ms of which 18 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/3330 variables, 1/500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3330 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 12/3342 variables, 12/512 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3342 variables, 1/513 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:09:30] [INFO ] Deduced a trap composed of 22 places in 676 ms of which 1 ms to minimize.
[2024-05-21 23:09:31] [INFO ] Deduced a trap composed of 33 places in 274 ms of which 1 ms to minimize.
[2024-05-21 23:09:32] [INFO ] Deduced a trap composed of 33 places in 289 ms of which 2 ms to minimize.
[2024-05-21 23:09:32] [INFO ] Deduced a trap composed of 10 places in 501 ms of which 2 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/3342 variables, 4/517 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:09:33] [INFO ] Deduced a trap composed of 62 places in 362 ms of which 1 ms to minimize.
[2024-05-21 23:09:34] [INFO ] Deduced a trap composed of 15 places in 574 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/3342 variables, 2/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3342 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/3342 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3342/3342 variables, and 519 constraints, problems are : Problem set: 0 solved, 2 unsolved in 7559 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 250/250 constraints, ReadFeed: 252/252 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 7/7 constraints]
After SMT, in 9321ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 640 ms.
Support contains 6 out of 250 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 3226/3226 transitions.
Applied a total of 0 rules in 54 ms. Remains 250 /250 variables (removed 0) and now considering 3226/3226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 250/250 places, 3226/3226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 250/250 places, 3226/3226 transitions.
Applied a total of 0 rules in 47 ms. Remains 250 /250 variables (removed 0) and now considering 3226/3226 (removed 0) transitions.
[2024-05-21 23:09:35] [INFO ] Flow matrix only has 3092 transitions (discarded 134 similar events)
[2024-05-21 23:09:35] [INFO ] Invariant cache hit.
[2024-05-21 23:09:36] [INFO ] Implicit Places using invariants in 508 ms returned []
[2024-05-21 23:09:36] [INFO ] Flow matrix only has 3092 transitions (discarded 134 similar events)
[2024-05-21 23:09:36] [INFO ] Invariant cache hit.
[2024-05-21 23:09:36] [INFO ] State equation strengthened by 252 read => feed constraints.
[2024-05-21 23:09:38] [INFO ] Implicit Places using invariants and state equation in 1940 ms returned []
Implicit Place search using SMT with State Equation took 2451 ms to find 0 implicit places.
[2024-05-21 23:09:38] [INFO ] Redundant transitions in 230 ms returned []
Running 3224 sub problems to find dead transitions.
[2024-05-21 23:09:38] [INFO ] Flow matrix only has 3092 transitions (discarded 134 similar events)
[2024-05-21 23:09:38] [INFO ] Invariant cache hit.
[2024-05-21 23:09:38] [INFO ] State equation strengthened by 252 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 250/3342 variables, and 8 constraints, problems are : Problem set: 0 solved, 3224 unsolved in 30088 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/250 constraints, ReadFeed: 0/252 constraints, PredecessorRefiner: 3224/3224 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/250 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3224 unsolved
[2024-05-21 23:11:12] [INFO ] Deduced a trap composed of 11 places in 216 ms of which 12 ms to minimize.
Problem TDEAD2994 is UNSAT
Problem TDEAD2995 is UNSAT
Problem TDEAD2996 is UNSAT
Problem TDEAD2997 is UNSAT
Problem TDEAD2998 is UNSAT
Problem TDEAD2999 is UNSAT
Problem TDEAD3000 is UNSAT
Problem TDEAD3001 is UNSAT
Problem TDEAD3002 is UNSAT
Problem TDEAD3003 is UNSAT
Problem TDEAD3004 is UNSAT
Problem TDEAD3005 is UNSAT
Problem TDEAD3006 is UNSAT
Problem TDEAD3007 is UNSAT
Problem TDEAD3008 is UNSAT
Problem TDEAD3009 is UNSAT
Problem TDEAD3010 is UNSAT
Problem TDEAD3011 is UNSAT
Problem TDEAD3012 is UNSAT
Problem TDEAD3013 is UNSAT
[2024-05-21 23:11:12] [INFO ] Deduced a trap composed of 10 places in 355 ms of which 25 ms to minimize.
Problem TDEAD3014 is UNSAT
Problem TDEAD3015 is UNSAT
Problem TDEAD3016 is UNSAT
Problem TDEAD3017 is UNSAT
Problem TDEAD3018 is UNSAT
Problem TDEAD3023 is UNSAT
Problem TDEAD3024 is UNSAT
[2024-05-21 23:11:13] [INFO ] Deduced a trap composed of 14 places in 378 ms of which 28 ms to minimize.
Problem TDEAD3026 is UNSAT
Problem TDEAD3027 is UNSAT
Problem TDEAD3028 is UNSAT
Problem TDEAD3029 is UNSAT
Problem TDEAD3030 is UNSAT
Problem TDEAD3031 is UNSAT
Problem TDEAD3032 is UNSAT
Problem TDEAD3033 is UNSAT
Problem TDEAD3034 is UNSAT
Problem TDEAD3035 is UNSAT
Problem TDEAD3036 is UNSAT
Problem TDEAD3037 is UNSAT
Problem TDEAD3038 is UNSAT
Problem TDEAD3039 is UNSAT
Problem TDEAD3040 is UNSAT
Problem TDEAD3041 is UNSAT
Problem TDEAD3042 is UNSAT
Problem TDEAD3043 is UNSAT
Problem TDEAD3044 is UNSAT
Problem TDEAD3045 is UNSAT
[2024-05-21 23:11:14] [INFO ] Deduced a trap composed of 11 places in 579 ms of which 15 ms to minimize.
Problem TDEAD3051 is UNSAT
Problem TDEAD3052 is UNSAT
Problem TDEAD3053 is UNSAT
Problem TDEAD3054 is UNSAT
Problem TDEAD3055 is UNSAT
Problem TDEAD3056 is UNSAT
[2024-05-21 23:11:14] [INFO ] Deduced a trap composed of 19 places in 485 ms of which 42 ms to minimize.
Problem TDEAD3058 is UNSAT
Problem TDEAD3059 is UNSAT
Problem TDEAD3060 is UNSAT
Problem TDEAD3061 is UNSAT
Problem TDEAD3067 is UNSAT
Problem TDEAD3068 is UNSAT
Problem TDEAD3069 is UNSAT
Problem TDEAD3070 is UNSAT
Problem TDEAD3071 is UNSAT
Problem TDEAD3072 is UNSAT
Problem TDEAD3073 is UNSAT
Problem TDEAD3074 is UNSAT
Problem TDEAD3075 is UNSAT
Problem TDEAD3076 is UNSAT
Problem TDEAD3077 is UNSAT
[2024-05-21 23:11:19] [INFO ] Deduced a trap composed of 15 places in 4113 ms of which 1289 ms to minimize.
Problem TDEAD3078 is UNSAT
Problem TDEAD3079 is UNSAT
Problem TDEAD3080 is UNSAT
Problem TDEAD3081 is UNSAT
Problem TDEAD3082 is UNSAT
[2024-05-21 23:11:20] [INFO ] Deduced a trap composed of 17 places in 1573 ms of which 6 ms to minimize.
SMT process timed out in 102246ms, After SMT, problems are : Problem set: 0 solved, 3224 unsolved
Search for dead transitions found 0 dead transitions in 102286ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 105034 ms. Remains : 250/250 places, 3226/3226 transitions.
[2024-05-21 23:11:20] [INFO ] Flatten gal took : 153 ms
[2024-05-21 23:11:21] [INFO ] Flatten gal took : 243 ms
[2024-05-21 23:11:21] [INFO ] Input system was already deterministic with 3226 transitions.
Computed a total of 4 stabilizing places and 85 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 257/257 places, 3226/3226 transitions.
Applied a total of 0 rules in 13 ms. Remains 257 /257 variables (removed 0) and now considering 3226/3226 (removed 0) transitions.
[2024-05-21 23:11:21] [INFO ] Flow matrix only has 3099 transitions (discarded 127 similar events)
// Phase 1: matrix 3099 rows 257 cols
[2024-05-21 23:11:21] [INFO ] Computed 8 invariants in 24 ms
[2024-05-21 23:11:22] [INFO ] Implicit Places using invariants in 874 ms returned []
[2024-05-21 23:11:22] [INFO ] Flow matrix only has 3099 transitions (discarded 127 similar events)
[2024-05-21 23:11:22] [INFO ] Invariant cache hit.
[2024-05-21 23:11:24] [INFO ] State equation strengthened by 251 read => feed constraints.
[2024-05-21 23:11:28] [INFO ] Implicit Places using invariants and state equation in 6338 ms returned []
Implicit Place search using SMT with State Equation took 7365 ms to find 0 implicit places.
Running 3224 sub problems to find dead transitions.
[2024-05-21 23:11:29] [INFO ] Flow matrix only has 3099 transitions (discarded 127 similar events)
[2024-05-21 23:11:29] [INFO ] Invariant cache hit.
[2024-05-21 23:11:29] [INFO ] State equation strengthened by 251 read => feed constraints.

BK_STOP 1716333096864

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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-q8m008"
export BK_EXAMINATION="CTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BugTracking-PT-q8m008, 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 r048-tajo-171620399400402"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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