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-171620399400385.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-q8m002, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399400385
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 11K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K 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 3.9K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 19 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 19 07:13 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 19 17:55 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.7K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 79K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K 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:23 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-q8m002-CTLCardinality-2024-00
FORMULA_NAME BugTracking-PT-q8m002-CTLCardinality-2024-01
FORMULA_NAME BugTracking-PT-q8m002-CTLCardinality-2024-02
FORMULA_NAME BugTracking-PT-q8m002-CTLCardinality-2024-03
FORMULA_NAME BugTracking-PT-q8m002-CTLCardinality-2024-04
FORMULA_NAME BugTracking-PT-q8m002-CTLCardinality-2024-05
FORMULA_NAME BugTracking-PT-q8m002-CTLCardinality-2024-06
FORMULA_NAME BugTracking-PT-q8m002-CTLCardinality-2024-07
FORMULA_NAME BugTracking-PT-q8m002-CTLCardinality-2024-08
FORMULA_NAME BugTracking-PT-q8m002-CTLCardinality-2024-09
FORMULA_NAME BugTracking-PT-q8m002-CTLCardinality-2024-10
FORMULA_NAME BugTracking-PT-q8m002-CTLCardinality-2024-11
FORMULA_NAME BugTracking-PT-q8m002-CTLCardinality-2023-12
FORMULA_NAME BugTracking-PT-q8m002-CTLCardinality-2023-13
FORMULA_NAME BugTracking-PT-q8m002-CTLCardinality-2023-14
FORMULA_NAME BugTracking-PT-q8m002-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717223852089

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m002
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:37:33] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 06:37:33] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:37:34] [INFO ] Load time of PNML (sax parser for PT used): 802 ms
[2024-06-01 06:37:34] [INFO ] Transformed 754 places.
[2024-06-01 06:37:34] [INFO ] Transformed 27370 transitions.
[2024-06-01 06:37:34] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1067 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 21 ms.
Deduced a syphon composed of 474 places in 131 ms
Reduce places removed 474 places and 23466 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BugTracking-PT-q8m002-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-CTLCardinality-2024-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 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 87 ms. Remains 277 /280 variables (removed 3) and now considering 3871/3904 (removed 33) transitions.
[2024-06-01 06:37:34] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2024-06-01 06:37:34] [INFO ] Computed 8 invariants in 57 ms
[2024-06-01 06:37:35] [INFO ] Implicit Places using invariants in 639 ms returned []
[2024-06-01 06:37:35] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-06-01 06:37:35] [INFO ] Invariant cache hit.
[2024-06-01 06:37:36] [INFO ] State equation strengthened by 282 read => feed constraints.
[2024-06-01 06:37:38] [INFO ] Implicit Places using invariants and state equation in 2643 ms returned []
Implicit Place search using SMT with State Equation took 3317 ms to find 0 implicit places.
Running 3869 sub problems to find dead transitions.
[2024-06-01 06:37:38] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-06-01 06:37:38] [INFO ] Invariant cache hit.
[2024-06-01 06:37:38] [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:38:41] [INFO ] Deduced a trap composed of 10 places in 224 ms of which 12 ms to minimize.
[2024-06-01 06:38:41] [INFO ] Deduced a trap composed of 7 places in 140 ms of which 2 ms to minimize.
[2024-06-01 06:38:41] [INFO ] Deduced a trap composed of 23 places in 208 ms of which 1 ms to minimize.
[2024-06-01 06:38:51] [INFO ] Deduced a trap composed of 11 places in 65 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 276/3984 variables, and 12 constraints, problems are : Problem set: 14 solved, 3855 unsolved in 30098 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-06-01 06:39:21] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
Problem TDEAD2716 is UNSAT
Problem TDEAD2728 is UNSAT
[2024-06-01 06:39:21] [INFO ] Deduced a trap composed of 12 places in 101 ms of which 0 ms to minimize.
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
[2024-06-01 06:39:21] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 1 ms to minimize.
Problem TDEAD2741 is UNSAT
[2024-06-01 06:39:21] [INFO ] Deduced a trap composed of 9 places in 71 ms of which 1 ms to minimize.
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
Problem TDEAD2766 is UNSAT
Problem TDEAD2778 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 276/3984 variables, and 16 constraints, problems are : Problem set: 68 solved, 3801 unsolved in 30065 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: 8/8 constraints]
After SMT, in 104530ms problems are : Problem set: 68 solved, 3801 unsolved
Search for dead transitions found 68 dead transitions in 104611ms
Found 68 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 68 transitions
Dead transitions reduction (with SMT) removed 68 transitions
Starting structural reductions in LTL mode, iteration 1 : 277/280 places, 3803/3904 transitions.
Reduce places removed 17 places and 565 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 260 transition count 3238
Reduce places removed 9 places and 278 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 26 place count 251 transition count 2960
Reduce places removed 11 places and 336 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 37 place count 240 transition count 2624
Reduce places removed 8 places and 184 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 45 place count 232 transition count 2440
Deduced a syphon composed of 3 places in 40 ms
Applied a total of 45 rules in 64 ms. Remains 232 /277 variables (removed 45) and now considering 2440/3803 (removed 1363) transitions.
[2024-06-01 06:39:22] [INFO ] Flow matrix only has 2336 transitions (discarded 104 similar events)
// Phase 1: matrix 2336 rows 232 cols
[2024-06-01 06:39:22] [INFO ] Computed 11 invariants in 9 ms
[2024-06-01 06:39:23] [INFO ] Implicit Places using invariants in 288 ms returned []
[2024-06-01 06:39:23] [INFO ] Flow matrix only has 2336 transitions (discarded 104 similar events)
[2024-06-01 06:39:23] [INFO ] Invariant cache hit.
[2024-06-01 06:39:23] [INFO ] State equation strengthened by 210 read => feed constraints.
[2024-06-01 06:39:24] [INFO ] Implicit Places using invariants and state equation in 1194 ms returned []
Implicit Place search using SMT with State Equation took 1495 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 232/280 places, 2440/3904 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 109657 ms. Remains : 232/280 places, 2440/3904 transitions.
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Support contains 26 out of 229 places after structural reductions.
[2024-06-01 06:39:24] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2024-06-01 06:39:24] [INFO ] Flatten gal took : 286 ms
[2024-06-01 06:39:24] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
FORMULA BugTracking-PT-q8m002-CTLCardinality-2023-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-CTLCardinality-2024-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-CTLCardinality-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-CTLCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-CTLCardinality-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m002-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:39:25] [INFO ] Flatten gal took : 165 ms
[2024-06-01 06:39:25] [INFO ] Input system was already deterministic with 2440 transitions.
Support contains 14 out of 229 places (down from 26) after GAL structural reductions.
RANDOM walk for 40000 steps (823 resets) in 2100 ms. (19 steps per ms) remains 7/11 properties
BEST_FIRST walk for 40002 steps (234 resets) in 144 ms. (275 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (220 resets) in 215 ms. (185 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (268 resets) in 148 ms. (268 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (223 resets) in 170 ms. (233 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (250 resets) in 120 ms. (330 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (254 resets) in 167 ms. (238 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (229 resets) in 159 ms. (250 steps per ms) remains 7/7 properties
[2024-06-01 06:39:26] [INFO ] Flow matrix only has 2336 transitions (discarded 104 similar events)
// Phase 1: matrix 2336 rows 229 cols
[2024-06-01 06:39:26] [INFO ] Computed 8 invariants in 9 ms
[2024-06-01 06:39:26] [INFO ] State equation strengthened by 210 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp8 is UNSAT
At refinement iteration 1 (OVERLAPS) 71/80 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1575/1655 variables, 80/83 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1655 variables, 7/90 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1655 variables, 0/90 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 736/2391 variables, 98/188 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2391 variables, 1/189 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2391 variables, 178/367 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2391 variables, 0/367 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 5/2396 variables, 2/369 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2396 variables, 1/370 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2396 variables, 0/370 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 155/2551 variables, 37/407 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2551 variables, 25/432 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2551 variables, 0/432 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 2/2553 variables, 1/433 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2553 variables, 0/433 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 12/2565 variables, 13/446 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2565 variables, 1/447 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2565 variables, 0/447 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 21 (OVERLAPS) 0/2565 variables, 0/447 constraints. Problems are: Problem set: 2 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2565/2565 variables, and 447 constraints, problems are : Problem set: 2 solved, 5 unsolved in 1446 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 229/229 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 73/80 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 1575/1655 variables, 80/83 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1655 variables, 7/90 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1655 variables, 0/90 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 736/2391 variables, 98/188 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2391 variables, 1/189 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2391 variables, 178/367 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2391 variables, 5/372 constraints. Problems are: Problem set: 2 solved, 5 unsolved
[2024-06-01 06:39:29] [INFO ] Deduced a trap composed of 22 places in 111 ms of which 1 ms to minimize.
[2024-06-01 06:39:29] [INFO ] Deduced a trap composed of 24 places in 139 ms of which 1 ms to minimize.
[2024-06-01 06:39:29] [INFO ] Deduced a trap composed of 17 places in 150 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2391 variables, 3/375 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2391 variables, 0/375 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 12 (OVERLAPS) 5/2396 variables, 2/377 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2396 variables, 1/378 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2396 variables, 0/378 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 155/2551 variables, 37/415 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2551 variables, 25/440 constraints. Problems are: Problem set: 3 solved, 4 unsolved
[2024-06-01 06:39:30] [INFO ] Deduced a trap composed of 16 places in 163 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/2551 variables, 1/441 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2551 variables, 0/441 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 2/2553 variables, 1/442 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2553 variables, 0/442 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 21 (OVERLAPS) 12/2565 variables, 13/455 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2565 variables, 1/456 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2565 variables, 0/456 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 24 (OVERLAPS) 0/2565 variables, 0/456 constraints. Problems are: Problem set: 3 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2565/2565 variables, and 456 constraints, problems are : Problem set: 3 solved, 4 unsolved in 3920 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 229/229 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 5/7 constraints, Known Traps: 4/4 constraints]
After SMT, in 5438ms problems are : Problem set: 3 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 5040 ms.
Support contains 6 out of 229 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 229/229 places, 2440/2440 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 228 transition count 2420
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 228 transition count 2420
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -3
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 6 place count 226 transition count 2423
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 226 transition count 2417
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 18 place count 220 transition count 2417
Applied a total of 18 rules in 160 ms. Remains 220 /229 variables (removed 9) and now considering 2417/2440 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 220/229 places, 2417/2440 transitions.
RANDOM walk for 40000 steps (16 resets) in 458 ms. (87 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (20 resets) in 220 ms. (181 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (11 resets) in 189 ms. (210 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (19 resets) in 173 ms. (229 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (14 resets) in 179 ms. (222 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 145753 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :0 out of 4
Probabilistic random walk after 145753 steps, saw 61471 distinct states, run finished after 3005 ms. (steps per millisecond=48 ) properties seen :0
[2024-06-01 06:39:40] [INFO ] Flow matrix only has 2310 transitions (discarded 107 similar events)
// Phase 1: matrix 2310 rows 220 cols
[2024-06-01 06:39:40] [INFO ] Computed 8 invariants in 12 ms
[2024-06-01 06:39:40] [INFO ] State equation strengthened by 211 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 72/78 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1555/1633 variables, 78/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1633 variables, 5/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1633 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 734/2367 variables, 98/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2367 variables, 2/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2367 variables, 183/369 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2367 variables, 0/369 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 2/2369 variables, 1/370 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2369 variables, 2/372 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2369 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 150/2519 variables, 31/403 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2519 variables, 1/404 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2519 variables, 23/427 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2519 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 11/2530 variables, 11/438 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2530 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2530 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/2530 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2530/2530 variables, and 439 constraints, problems are : Problem set: 0 solved, 4 unsolved in 963 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 220/220 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 72/78 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/78 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1555/1633 variables, 78/81 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1633 variables, 5/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1633 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 734/2367 variables, 98/184 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2367 variables, 2/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2367 variables, 183/369 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2367 variables, 4/373 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 06:39:42] [INFO ] Deduced a trap composed of 19 places in 191 ms of which 1 ms to minimize.
[2024-06-01 06:39:42] [INFO ] Deduced a trap composed of 21 places in 103 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2367 variables, 2/375 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2367 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 2/2369 variables, 1/376 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2369 variables, 2/378 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2369 variables, 0/378 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 150/2519 variables, 31/409 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2519 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2519 variables, 23/433 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2519 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 11/2530 variables, 11/444 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2530 variables, 1/445 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 06:39:44] [INFO ] Deduced a trap composed of 15 places in 190 ms of which 2 ms to minimize.
[2024-06-01 06:39:44] [INFO ] Deduced a trap composed of 23 places in 218 ms of which 2 ms to minimize.
[2024-06-01 06:39:44] [INFO ] Deduced a trap composed of 23 places in 180 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/2530 variables, 3/448 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2530 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 0/2530 variables, 0/448 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2530/2530 variables, and 448 constraints, problems are : Problem set: 0 solved, 4 unsolved in 3781 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 220/220 constraints, ReadFeed: 211/211 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 5/5 constraints]
After SMT, in 4778ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 9901 ms.
Support contains 6 out of 220 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 2417/2417 transitions.
Applied a total of 0 rules in 97 ms. Remains 220 /220 variables (removed 0) and now considering 2417/2417 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 97 ms. Remains : 220/220 places, 2417/2417 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 220/220 places, 2417/2417 transitions.
Applied a total of 0 rules in 60 ms. Remains 220 /220 variables (removed 0) and now considering 2417/2417 (removed 0) transitions.
[2024-06-01 06:39:55] [INFO ] Flow matrix only has 2310 transitions (discarded 107 similar events)
[2024-06-01 06:39:55] [INFO ] Invariant cache hit.
[2024-06-01 06:39:56] [INFO ] Implicit Places using invariants in 425 ms returned []
[2024-06-01 06:39:56] [INFO ] Flow matrix only has 2310 transitions (discarded 107 similar events)
[2024-06-01 06:39:56] [INFO ] Invariant cache hit.
[2024-06-01 06:39:56] [INFO ] State equation strengthened by 211 read => feed constraints.
[2024-06-01 06:39:57] [INFO ] Implicit Places using invariants and state equation in 1373 ms returned []
Implicit Place search using SMT with State Equation took 1804 ms to find 0 implicit places.
[2024-06-01 06:39:57] [INFO ] Redundant transitions in 194 ms returned []
Running 2416 sub problems to find dead transitions.
[2024-06-01 06:39:57] [INFO ] Flow matrix only has 2310 transitions (discarded 107 similar events)
[2024-06-01 06:39:57] [INFO ] Invariant cache hit.
[2024-06-01 06:39:57] [INFO ] State equation strengthened by 211 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-q8m002-CTLCardinality-2024-00
Could not compute solution for formula : BugTracking-PT-q8m002-CTLCardinality-2024-01
Could not compute solution for formula : BugTracking-PT-q8m002-CTLCardinality-2024-02
Could not compute solution for formula : BugTracking-PT-q8m002-CTLCardinality-2024-03
Could not compute solution for formula : BugTracking-PT-q8m002-CTLCardinality-2024-04
Could not compute solution for formula : BugTracking-PT-q8m002-CTLCardinality-2024-05
Could not compute solution for formula : BugTracking-PT-q8m002-CTLCardinality-2024-06
Could not compute solution for formula : BugTracking-PT-q8m002-CTLCardinality-2024-07
Could not compute solution for formula : BugTracking-PT-q8m002-CTLCardinality-2024-08
Could not compute solution for formula : BugTracking-PT-q8m002-CTLCardinality-2024-09
Could not compute solution for formula : BugTracking-PT-q8m002-CTLCardinality-2024-10
Could not compute solution for formula : BugTracking-PT-q8m002-CTLCardinality-2024-11
Could not compute solution for formula : BugTracking-PT-q8m002-CTLCardinality-2023-12
Could not compute solution for formula : BugTracking-PT-q8m002-CTLCardinality-2023-13
Could not compute solution for formula : BugTracking-PT-q8m002-CTLCardinality-2023-14
Could not compute solution for formula : BugTracking-PT-q8m002-CTLCardinality-2023-15

BK_STOP 1717224023467

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name BugTracking-PT-q8m002-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/625/ctl_0_
ctl formula name BugTracking-PT-q8m002-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/625/ctl_1_
ctl formula name BugTracking-PT-q8m002-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/625/ctl_2_
ctl formula name BugTracking-PT-q8m002-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/625/ctl_3_
ctl formula name BugTracking-PT-q8m002-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/625/ctl_4_
ctl formula name BugTracking-PT-q8m002-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/625/ctl_5_
ctl formula name BugTracking-PT-q8m002-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/625/ctl_6_
ctl formula name BugTracking-PT-q8m002-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/625/ctl_7_
ctl formula name BugTracking-PT-q8m002-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/625/ctl_8_
ctl formula name BugTracking-PT-q8m002-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/625/ctl_9_
ctl formula name BugTracking-PT-q8m002-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/625/ctl_10_
ctl formula name BugTracking-PT-q8m002-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/625/ctl_11_
ctl formula name BugTracking-PT-q8m002-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/625/ctl_12_
ctl formula name BugTracking-PT-q8m002-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/625/ctl_13_
ctl formula name BugTracking-PT-q8m002-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/625/ctl_14_
ctl formula name BugTracking-PT-q8m002-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/625/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-q8m002"
export BK_EXAMINATION="CTLCardinality"
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-q8m002, 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 r472-tajo-171620399400385"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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