Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399500433.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-q8m128, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399500433
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K 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 50K 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.4K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 12 01:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 12 01:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K 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-q8m128-CTLCardinality-2024-00
FORMULA_NAME BugTracking-PT-q8m128-CTLCardinality-2024-01
FORMULA_NAME BugTracking-PT-q8m128-CTLCardinality-2024-02
FORMULA_NAME BugTracking-PT-q8m128-CTLCardinality-2024-03
FORMULA_NAME BugTracking-PT-q8m128-CTLCardinality-2024-04
FORMULA_NAME BugTracking-PT-q8m128-CTLCardinality-2024-05
FORMULA_NAME BugTracking-PT-q8m128-CTLCardinality-2024-06
FORMULA_NAME BugTracking-PT-q8m128-CTLCardinality-2024-07
FORMULA_NAME BugTracking-PT-q8m128-CTLCardinality-2024-08
FORMULA_NAME BugTracking-PT-q8m128-CTLCardinality-2024-09
FORMULA_NAME BugTracking-PT-q8m128-CTLCardinality-2024-10
FORMULA_NAME BugTracking-PT-q8m128-CTLCardinality-2024-11
FORMULA_NAME BugTracking-PT-q8m128-CTLCardinality-2023-12
FORMULA_NAME BugTracking-PT-q8m128-CTLCardinality-2023-13
FORMULA_NAME BugTracking-PT-q8m128-CTLCardinality-2023-14
FORMULA_NAME BugTracking-PT-q8m128-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1716333303414

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m128
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLCardinality PT
Running Version 202405141337
[2024-05-21 23:15:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 23:15:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:15:05] [INFO ] Load time of PNML (sax parser for PT used): 1071 ms
[2024-05-21 23:15:05] [INFO ] Transformed 754 places.
[2024-05-21 23:15:06] [INFO ] Transformed 27370 transitions.
[2024-05-21 23:15:06] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1286 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 17 ms.
Deduced a syphon composed of 474 places in 177 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m128-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 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
Applied a total of 2 rules in 80 ms. Remains 278 /280 variables (removed 2) and now considering 3904/3904 (removed 0) transitions.
[2024-05-21 23:15:06] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 278 cols
[2024-05-21 23:15:06] [INFO ] Computed 8 invariants in 34 ms
[2024-05-21 23:15:07] [INFO ] Implicit Places using invariants in 899 ms returned []
[2024-05-21 23:15:07] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
[2024-05-21 23:15:07] [INFO ] Invariant cache hit.
[2024-05-21 23:15:08] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-21 23:15:10] [INFO ] Implicit Places using invariants and state equation in 3242 ms returned []
Implicit Place search using SMT with State Equation took 4225 ms to find 0 implicit places.
Running 3902 sub problems to find dead transitions.
[2024-05-21 23:15:10] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
[2024-05-21 23:15:10] [INFO ] Invariant cache hit.
[2024-05-21 23:15:10] [INFO ] State equation strengthened by 303 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3902 unsolved
[2024-05-21 23:16:20] [INFO ] Deduced a trap composed of 10 places in 254 ms of which 14 ms to minimize.
[2024-05-21 23:16:20] [INFO ] Deduced a trap composed of 18 places in 264 ms of which 2 ms to minimize.
[2024-05-21 23:16:20] [INFO ] Deduced a trap composed of 14 places in 179 ms of which 2 ms to minimize.
[2024-05-21 23:16:20] [INFO ] Deduced a trap composed of 7 places in 71 ms of which 1 ms to minimize.
[2024-05-21 23:16:28] [INFO ] Deduced a trap composed of 11 places in 51 ms of which 1 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 277/4007 variables, and 13 constraints, problems are : Problem set: 14 solved, 3888 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/278 constraints, ReadFeed: 0/303 constraints, PredecessorRefiner: 3902/2705 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 14 solved, 3888 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 8/8 constraints. Problems are: Problem set: 14 solved, 3888 unsolved
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 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
Problem TDEAD3740 is UNSAT
Problem TDEAD3741 is UNSAT
Problem TDEAD3742 is UNSAT
Problem TDEAD3743 is UNSAT
Problem TDEAD3749 is UNSAT
Problem TDEAD3750 is UNSAT
Problem TDEAD3751 is UNSAT
Problem TDEAD3752 is UNSAT
Problem TDEAD3753 is UNSAT
Problem TDEAD3754 is UNSAT
Problem TDEAD3755 is UNSAT
Problem TDEAD3756 is UNSAT
Problem TDEAD3757 is UNSAT
Problem TDEAD3758 is UNSAT
Problem TDEAD3759 is UNSAT
Problem TDEAD3764 is UNSAT
Problem TDEAD3769 is UNSAT
Problem TDEAD3770 is UNSAT
Problem TDEAD3771 is UNSAT
Problem TDEAD3806 is UNSAT
Problem TDEAD3807 is UNSAT
Problem TDEAD3808 is UNSAT
Problem TDEAD3809 is UNSAT
Problem TDEAD3815 is UNSAT
Problem TDEAD3816 is UNSAT
Problem TDEAD3817 is UNSAT
Problem TDEAD3818 is UNSAT
Problem TDEAD3819 is UNSAT
Problem TDEAD3820 is UNSAT
Problem TDEAD3821 is UNSAT
Problem TDEAD3822 is UNSAT
Problem TDEAD3823 is UNSAT
Problem TDEAD3824 is UNSAT
Problem TDEAD3825 is UNSAT
Problem TDEAD3830 is UNSAT
Problem TDEAD3835 is UNSAT
Problem TDEAD3836 is UNSAT
Problem TDEAD3837 is UNSAT
Problem TDEAD3839 is UNSAT
Problem TDEAD3840 is UNSAT
Problem TDEAD3841 is UNSAT
Problem TDEAD3842 is UNSAT
Problem TDEAD3844 is UNSAT
Problem TDEAD3848 is UNSAT
Problem TDEAD3849 is UNSAT
Problem TDEAD3850 is UNSAT
Problem TDEAD3851 is UNSAT
Problem TDEAD3852 is UNSAT
Problem TDEAD3853 is UNSAT
Problem TDEAD3854 is UNSAT
Problem TDEAD3855 is UNSAT
Problem TDEAD3856 is UNSAT
Problem TDEAD3857 is UNSAT
Problem TDEAD3858 is UNSAT
Problem TDEAD3859 is UNSAT
Problem TDEAD3860 is UNSAT
Problem TDEAD3861 is UNSAT
Problem TDEAD3862 is UNSAT
Problem TDEAD3863 is UNSAT
Problem TDEAD3864 is UNSAT
Problem TDEAD3865 is UNSAT
Problem TDEAD3866 is UNSAT
Problem TDEAD3867 is UNSAT
Problem TDEAD3872 is UNSAT
Problem TDEAD3873 is UNSAT
Problem TDEAD3874 is UNSAT
Problem TDEAD3875 is UNSAT
Problem TDEAD3877 is UNSAT
Problem TDEAD3881 is UNSAT
Problem TDEAD3882 is UNSAT
Problem TDEAD3883 is UNSAT
Problem TDEAD3884 is UNSAT
Problem TDEAD3885 is UNSAT
Problem TDEAD3886 is UNSAT
Problem TDEAD3887 is UNSAT
Problem TDEAD3888 is UNSAT
Problem TDEAD3889 is UNSAT
Problem TDEAD3890 is UNSAT
Problem TDEAD3891 is UNSAT
Problem TDEAD3892 is UNSAT
Problem TDEAD3893 is UNSAT
Problem TDEAD3894 is UNSAT
Problem TDEAD3895 is UNSAT
Problem TDEAD3896 is UNSAT
Problem TDEAD3897 is UNSAT
Problem TDEAD3898 is UNSAT
Problem TDEAD3899 is UNSAT
Problem TDEAD3900 is UNSAT
Problem TDEAD3901 is UNSAT
Problem TDEAD3902 is UNSAT
Problem TDEAD3903 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 5/13 constraints. Problems are: Problem set: 125 solved, 3777 unsolved
[2024-05-21 23:17:01] [INFO ] Deduced a trap composed of 23 places in 83 ms of which 0 ms to minimize.
Problem TDEAD2706 is UNSAT
Problem TDEAD2715 is UNSAT
Problem TDEAD2716 is UNSAT
Problem TDEAD2727 is UNSAT
Problem TDEAD2728 is UNSAT
[2024-05-21 23:17:02] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 3 ms to minimize.
Problem TDEAD2731 is UNSAT
Problem TDEAD2732 is UNSAT
Problem TDEAD2733 is UNSAT
Problem TDEAD2734 is UNSAT
Problem TDEAD2735 is UNSAT
Problem TDEAD2736 is UNSAT
Problem TDEAD2737 is UNSAT
Problem TDEAD2738 is UNSAT
Problem TDEAD2739 is UNSAT
Problem TDEAD2740 is UNSAT
Problem TDEAD2741 is UNSAT
Problem TDEAD2742 is UNSAT
Problem TDEAD2743 is UNSAT
Problem TDEAD2744 is UNSAT
Problem TDEAD2745 is UNSAT
Problem TDEAD2746 is UNSAT
Problem TDEAD2747 is UNSAT
Problem TDEAD2748 is UNSAT
Problem TDEAD2749 is UNSAT
Problem TDEAD2750 is UNSAT
Problem TDEAD2751 is UNSAT
[2024-05-21 23:17:02] [INFO ] Deduced a trap composed of 23 places in 72 ms of which 2 ms to minimize.
Problem TDEAD2752 is UNSAT
Problem TDEAD2756 is UNSAT
Problem TDEAD2765 is UNSAT
Problem TDEAD2766 is UNSAT
Problem TDEAD2777 is UNSAT
Problem TDEAD2778 is UNSAT
Problem TDEAD2781 is UNSAT
Problem TDEAD2790 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 277/4007 variables, and 16 constraints, problems are : Problem set: 159 solved, 3743 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/278 constraints, ReadFeed: 0/303 constraints, PredecessorRefiner: 1197/2705 constraints, Known Traps: 8/8 constraints]
After SMT, in 111965ms problems are : Problem set: 159 solved, 3743 unsolved
Search for dead transitions found 159 dead transitions in 112079ms
Found 159 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 159 transitions
Dead transitions reduction (with SMT) removed 159 transitions
Starting structural reductions in LTL mode, iteration 1 : 278/280 places, 3745/3904 transitions.
Reduce places removed 28 places and 864 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 250 transition count 2881
Reduce places removed 20 places and 441 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 48 place count 230 transition count 2440
Reduce places removed 11 places and 296 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 59 place count 219 transition count 2144
Reduce places removed 9 places and 186 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 68 place count 210 transition count 1958
Reduce places removed 2 places and 44 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 70 place count 208 transition count 1914
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 72 place count 206 transition count 1890
Deduced a syphon composed of 6 places in 3 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 74 place count 206 transition count 1890
Deduced a syphon composed of 6 places in 15 ms
Applied a total of 74 rules in 61 ms. Remains 206 /278 variables (removed 72) and now considering 1890/3745 (removed 1855) transitions.
[2024-05-21 23:17:02] [INFO ] Flow matrix only has 1806 transitions (discarded 84 similar events)
// Phase 1: matrix 1806 rows 206 cols
[2024-05-21 23:17:02] [INFO ] Computed 14 invariants in 9 ms
[2024-05-21 23:17:03] [INFO ] Implicit Places using invariants in 648 ms returned []
[2024-05-21 23:17:03] [INFO ] Flow matrix only has 1806 transitions (discarded 84 similar events)
[2024-05-21 23:17:03] [INFO ] Invariant cache hit.
[2024-05-21 23:17:03] [INFO ] State equation strengthened by 179 read => feed constraints.
[2024-05-21 23:17:04] [INFO ] Implicit Places using invariants and state equation in 1238 ms returned []
Implicit Place search using SMT with State Equation took 1909 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 206/280 places, 1890/3904 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 118430 ms. Remains : 206/280 places, 1890/3904 transitions.
Deduced a syphon composed of 6 places in 3 ms
Reduce places removed 6 places and 0 transitions.
Support contains 13 out of 200 places after structural reductions.
[2024-05-21 23:17:05] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-05-21 23:17:05] [INFO ] Flatten gal took : 284 ms
[2024-05-21 23:17:05] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
FORMULA BugTracking-PT-q8m128-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 23:17:05] [INFO ] Flatten gal took : 231 ms
[2024-05-21 23:17:06] [INFO ] Input system was already deterministic with 1890 transitions.
Support contains 10 out of 200 places (down from 13) after GAL structural reductions.
RANDOM walk for 40001 steps (24 resets) in 1900 ms. (21 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 288 ms. (138 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 99 ms. (400 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 83 ms. (476 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 103 ms. (384 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 123 ms. (322 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (8 resets) in 76 ms. (519 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (8 resets) in 39 ms. (1000 steps per ms) remains 7/7 properties
[2024-05-21 23:17:07] [INFO ] Flow matrix only has 1806 transitions (discarded 84 similar events)
// Phase 1: matrix 1806 rows 200 cols
[2024-05-21 23:17:07] [INFO ] Computed 8 invariants in 6 ms
[2024-05-21 23:17:07] [INFO ] State equation strengthened by 179 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp5 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
At refinement iteration 1 (OVERLAPS) 50/58 variables, 4/4 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 1250/1308 variables, 58/62 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1308 variables, 48/110 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1308 variables, 0/110 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 196/1504 variables, 92/202 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1504 variables, 1/203 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1504 variables, 90/293 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1504 variables, 0/293 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1/1505 variables, 1/294 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1505 variables, 1/295 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1505 variables, 0/295 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 474/1979 variables, 24/319 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1979 variables, 41/360 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1979 variables, 0/360 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 3/1982 variables, 1/361 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1982 variables, 0/361 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 24/2006 variables, 25/386 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2006 variables, 1/387 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2006 variables, 0/387 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/2006 variables, 0/387 constraints. Problems are: Problem set: 4 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2006/2006 variables, and 387 constraints, problems are : Problem set: 4 solved, 3 unsolved in 922 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 200/200 constraints, ReadFeed: 179/179 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 26/30 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 585/615 variables, 30/31 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/615 variables, 2/33 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/615 variables, 0/33 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 609/1224 variables, 52/85 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1224 variables, 1/86 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1224 variables, 100/186 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1224 variables, 3/189 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1224 variables, 0/189 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 5/1229 variables, 1/190 constraints. Problems are: Problem set: 4 solved, 3 unsolved
[2024-05-21 23:17:08] [INFO ] Deduced a trap composed of 22 places in 92 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/1229 variables, 1/191 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1229 variables, 0/191 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 642/1871 variables, 55/246 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1871 variables, 55/301 constraints. Problems are: Problem set: 4 solved, 3 unsolved
[2024-05-21 23:17:09] [INFO ] Deduced a trap composed of 22 places in 91 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/1871 variables, 1/302 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1871 variables, 0/302 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 7/1878 variables, 2/304 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1878 variables, 0/304 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 123/2001 variables, 60/364 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2001 variables, 3/367 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2001 variables, 22/389 constraints. Problems are: Problem set: 4 solved, 3 unsolved
[2024-05-21 23:17:09] [INFO ] Deduced a trap composed of 8 places in 253 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/2001 variables, 1/390 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2001 variables, 0/390 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 5/2006 variables, 3/393 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2006 variables, 0/393 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 0/2006 variables, 0/393 constraints. Problems are: Problem set: 4 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2006/2006 variables, and 393 constraints, problems are : Problem set: 4 solved, 3 unsolved in 2555 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 200/200 constraints, ReadFeed: 179/179 constraints, PredecessorRefiner: 3/7 constraints, Known Traps: 3/3 constraints]
After SMT, in 3512ms problems are : Problem set: 4 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 6974 ms.
Support contains 4 out of 200 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 200/200 places, 1890/1890 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 198 transition count 1893
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 198 transition count 1887
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 192 transition count 1887
Applied a total of 16 rules in 203 ms. Remains 192 /200 variables (removed 8) and now considering 1887/1890 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 204 ms. Remains : 192/200 places, 1887/1890 transitions.
RANDOM walk for 40281 steps (8 resets) in 150 ms. (266 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 242 ms. (164 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 460 ms. (86 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 177 ms. (224 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 168328 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 3
Probabilistic random walk after 168328 steps, saw 79165 distinct states, run finished after 3017 ms. (steps per millisecond=55 ) properties seen :0
[2024-05-21 23:17:21] [INFO ] Flow matrix only has 1798 transitions (discarded 89 similar events)
// Phase 1: matrix 1798 rows 192 cols
[2024-05-21 23:17:21] [INFO ] Computed 8 invariants in 16 ms
[2024-05-21 23:17:21] [INFO ] State equation strengthened by 180 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 26/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 585/615 variables, 30/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/615 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/615 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 609/1224 variables, 52/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1224 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1224 variables, 101/187 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1224 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 4/1228 variables, 1/188 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1228 variables, 2/190 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1228 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 644/1872 variables, 51/241 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1872 variables, 62/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1872 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 3/1875 variables, 2/305 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1875 variables, 1/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1875 variables, 0/306 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 114/1989 variables, 55/361 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1989 variables, 3/364 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1989 variables, 15/379 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1989 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (OVERLAPS) 1/1990 variables, 1/380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1990 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (OVERLAPS) 0/1990 variables, 0/380 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1990/1990 variables, and 380 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1334 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 192/192 constraints, ReadFeed: 180/180 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 26/30 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/30 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 585/615 variables, 30/31 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/615 variables, 2/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/615 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 609/1224 variables, 52/85 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1224 variables, 1/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1224 variables, 101/187 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1224 variables, 3/190 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 23:17:23] [INFO ] Deduced a trap composed of 23 places in 116 ms of which 1 ms to minimize.
[2024-05-21 23:17:23] [INFO ] Deduced a trap composed of 16 places in 121 ms of which 1 ms to minimize.
[2024-05-21 23:17:23] [INFO ] Deduced a trap composed of 24 places in 111 ms of which 0 ms to minimize.
[2024-05-21 23:17:23] [INFO ] Deduced a trap composed of 21 places in 98 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/1224 variables, 4/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1224 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 4/1228 variables, 1/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1228 variables, 2/197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1228 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 644/1872 variables, 51/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1872 variables, 62/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1872 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 3/1875 variables, 2/312 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1875 variables, 1/313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1875 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 114/1989 variables, 55/368 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1989 variables, 3/371 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1989 variables, 15/386 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-05-21 23:17:25] [INFO ] Deduced a trap composed of 8 places in 157 ms of which 7 ms to minimize.
[2024-05-21 23:17:25] [INFO ] Deduced a trap composed of 6 places in 159 ms of which 10 ms to minimize.
[2024-05-21 23:17:25] [INFO ] Deduced a trap composed of 8 places in 154 ms of which 7 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1989 variables, 3/389 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1989 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 1/1990 variables, 1/390 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1990 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (OVERLAPS) 0/1990 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1990/1990 variables, and 390 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3284 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 192/192 constraints, ReadFeed: 180/180 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 7/7 constraints]
After SMT, in 4668ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 994 ms.
Support contains 4 out of 192 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 1887/1887 transitions.
Applied a total of 0 rules in 29 ms. Remains 192 /192 variables (removed 0) and now considering 1887/1887 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 192/192 places, 1887/1887 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 192/192 places, 1887/1887 transitions.
Applied a total of 0 rules in 30 ms. Remains 192 /192 variables (removed 0) and now considering 1887/1887 (removed 0) transitions.
[2024-05-21 23:17:26] [INFO ] Flow matrix only has 1798 transitions (discarded 89 similar events)
[2024-05-21 23:17:26] [INFO ] Invariant cache hit.
[2024-05-21 23:17:27] [INFO ] Implicit Places using invariants in 835 ms returned []
[2024-05-21 23:17:27] [INFO ] Flow matrix only has 1798 transitions (discarded 89 similar events)
[2024-05-21 23:17:27] [INFO ] Invariant cache hit.
[2024-05-21 23:17:28] [INFO ] State equation strengthened by 180 read => feed constraints.
[2024-05-21 23:17:28] [INFO ] Implicit Places using invariants and state equation in 894 ms returned []
Implicit Place search using SMT with State Equation took 1731 ms to find 0 implicit places.
[2024-05-21 23:17:28] [INFO ] Redundant transitions in 82 ms returned []
Running 1886 sub problems to find dead transitions.
[2024-05-21 23:17:28] [INFO ] Flow matrix only has 1798 transitions (discarded 89 similar events)
[2024-05-21 23:17:28] [INFO ] Invariant cache hit.
[2024-05-21 23:17:28] [INFO ] State equation strengthened by 180 read => feed constraints.

BK_STOP 1716333464347

--------------------
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
+ [[ CTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLCardinality -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 CTLCardinality -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-q8m128"
export BK_EXAMINATION="CTLCardinality"
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-q8m128, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r048-tajo-171620399500433"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q8m128.tgz
mv BugTracking-PT-q8m128 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;