About the Execution of LTSMin+red for BugTracking-PT-q8m032
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16202.644 | 296433.00 | 477218.00 | 337.80 | TT??TF??F???T??? | normal |
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-171620399500417.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-q8m032, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399500417
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K 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-q8m032-CTLCardinality-2024-00
FORMULA_NAME BugTracking-PT-q8m032-CTLCardinality-2024-01
FORMULA_NAME BugTracking-PT-q8m032-CTLCardinality-2024-02
FORMULA_NAME BugTracking-PT-q8m032-CTLCardinality-2024-03
FORMULA_NAME BugTracking-PT-q8m032-CTLCardinality-2024-04
FORMULA_NAME BugTracking-PT-q8m032-CTLCardinality-2024-05
FORMULA_NAME BugTracking-PT-q8m032-CTLCardinality-2024-06
FORMULA_NAME BugTracking-PT-q8m032-CTLCardinality-2024-07
FORMULA_NAME BugTracking-PT-q8m032-CTLCardinality-2024-08
FORMULA_NAME BugTracking-PT-q8m032-CTLCardinality-2024-09
FORMULA_NAME BugTracking-PT-q8m032-CTLCardinality-2024-10
FORMULA_NAME BugTracking-PT-q8m032-CTLCardinality-2024-11
FORMULA_NAME BugTracking-PT-q8m032-CTLCardinality-2023-12
FORMULA_NAME BugTracking-PT-q8m032-CTLCardinality-2023-13
FORMULA_NAME BugTracking-PT-q8m032-CTLCardinality-2023-14
FORMULA_NAME BugTracking-PT-q8m032-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1717224327723
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-q8m032
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:45:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 06:45:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:45:30] [INFO ] Load time of PNML (sax parser for PT used): 1127 ms
[2024-06-01 06:45:30] [INFO ] Transformed 754 places.
[2024-06-01 06:45:30] [INFO ] Transformed 27370 transitions.
[2024-06-01 06:45:30] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1430 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 58 ms.
Deduced a syphon composed of 474 places in 234 ms
Reduce places removed 474 places and 23466 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BugTracking-PT-q8m032-CTLCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-CTLCardinality-2023-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 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 101 ms. Remains 277 /280 variables (removed 3) and now considering 3871/3904 (removed 33) transitions.
[2024-06-01 06:45:31] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2024-06-01 06:45:31] [INFO ] Computed 8 invariants in 50 ms
[2024-06-01 06:45:32] [INFO ] Implicit Places using invariants in 1072 ms returned []
[2024-06-01 06:45:32] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-06-01 06:45:32] [INFO ] Invariant cache hit.
[2024-06-01 06:45:33] [INFO ] State equation strengthened by 282 read => feed constraints.
[2024-06-01 06:45:34] [INFO ] Implicit Places using invariants and state equation in 2123 ms returned []
Implicit Place search using SMT with State Equation took 3256 ms to find 0 implicit places.
Running 3869 sub problems to find dead transitions.
[2024-06-01 06:45:34] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-06-01 06:45:34] [INFO ] Invariant cache hit.
[2024-06-01 06:45:35] [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
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 276/3984 variables, and 8 constraints, problems are : Problem set: 0 solved, 3869 unsolved in 30149 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: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3869 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3869 unsolved
[2024-06-01 06:46:54] [INFO ] Deduced a trap composed of 10 places in 207 ms of which 10 ms to minimize.
[2024-06-01 06:46:54] [INFO ] Deduced a trap composed of 7 places in 116 ms of which 3 ms to minimize.
[2024-06-01 06:47:06] [INFO ] Deduced a trap composed of 11 places in 68 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 Int declared 276/3984 variables, and 11 constraints, problems are : Problem set: 14 solved, 3855 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: 3/3 constraints]
After SMT, in 106408ms problems are : Problem set: 14 solved, 3855 unsolved
Search for dead transitions found 14 dead transitions in 106489ms
Found 14 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 14 transitions
Dead transitions reduction (with SMT) removed 14 transitions
Starting structural reductions in LTL mode, iteration 1 : 277/280 places, 3857/3904 transitions.
Reduce places removed 2 places and 35 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 275 transition count 3822
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 3 place count 274 transition count 3797
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 274 transition count 3797
Applied a total of 4 rules in 42 ms. Remains 274 /277 variables (removed 3) and now considering 3797/3857 (removed 60) transitions.
[2024-06-01 06:47:21] [INFO ] Flow matrix only has 3640 transitions (discarded 157 similar events)
// Phase 1: matrix 3640 rows 274 cols
[2024-06-01 06:47:21] [INFO ] Computed 8 invariants in 24 ms
[2024-06-01 06:47:21] [INFO ] Implicit Places using invariants in 389 ms returned []
[2024-06-01 06:47:21] [INFO ] Flow matrix only has 3640 transitions (discarded 157 similar events)
[2024-06-01 06:47:21] [INFO ] Invariant cache hit.
[2024-06-01 06:47:22] [INFO ] State equation strengthened by 275 read => feed constraints.
[2024-06-01 06:47:23] [INFO ] Implicit Places using invariants and state equation in 2175 ms returned []
Implicit Place search using SMT with State Equation took 2568 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 274/280 places, 3797/3904 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 112510 ms. Remains : 274/280 places, 3797/3904 transitions.
Support contains 40 out of 274 places after structural reductions.
[2024-06-01 06:47:24] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 06:47:24] [INFO ] Flatten gal took : 326 ms
FORMULA BugTracking-PT-q8m032-CTLCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:47:24] [INFO ] Flatten gal took : 250 ms
[2024-06-01 06:47:25] [INFO ] Input system was already deterministic with 3797 transitions.
Support contains 30 out of 274 places (down from 40) after GAL structural reductions.
FORMULA BugTracking-PT-q8m032-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40016 steps (74 resets) in 2358 ms. (16 steps per ms) remains 23/25 properties
BEST_FIRST walk for 4003 steps (8 resets) in 46 ms. (85 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 52 ms. (75 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 49 ms. (80 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 37 ms. (105 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 29 ms. (133 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 20 ms. (190 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 33 ms. (117 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 32 ms. (121 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 19 ms. (200 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 23/23 properties
BEST_FIRST walk for 4004 steps (8 resets) in 24 ms. (160 steps per ms) remains 23/23 properties
Interrupted probabilistic random walk after 78582 steps, run timeout after 3001 ms. (steps per millisecond=26 ) properties seen :0 out of 23
Probabilistic random walk after 78582 steps, saw 40259 distinct states, run finished after 3005 ms. (steps per millisecond=26 ) properties seen :0
[2024-06-01 06:47:29] [INFO ] Flow matrix only has 3640 transitions (discarded 157 similar events)
[2024-06-01 06:47:29] [INFO ] Invariant cache hit.
[2024-06-01 06:47:29] [INFO ] State equation strengthened by 275 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp22 is UNSAT
At refinement iteration 1 (OVERLAPS) 113/140 variables, 5/5 constraints. Problems are: Problem set: 9 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/5 constraints. Problems are: Problem set: 9 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 3368/3508 variables, 140/145 constraints. Problems are: Problem set: 9 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3508 variables, 22/167 constraints. Problems are: Problem set: 9 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3508 variables, 0/167 constraints. Problems are: Problem set: 9 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 404/3912 variables, 132/299 constraints. Problems are: Problem set: 9 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3912 variables, 1/300 constraints. Problems are: Problem set: 9 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3912 variables, 253/553 constraints. Problems are: Problem set: 9 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3912 variables, 0/553 constraints. Problems are: Problem set: 9 solved, 14 unsolved
At refinement iteration 10 (OVERLAPS) 2/3914 variables, 2/555 constraints. Problems are: Problem set: 9 solved, 14 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3914 variables, 2/557 constraints. Problems are: Problem set: 9 solved, 14 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3914 variables, 0/557 constraints. Problems are: Problem set: 9 solved, 14 unsolved
At refinement iteration 13 (OVERLAPS) 0/3914 variables, 0/557 constraints. Problems are: Problem set: 9 solved, 14 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3914/3914 variables, and 557 constraints, problems are : Problem set: 9 solved, 14 unsolved in 3935 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 274/274 constraints, ReadFeed: 275/275 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 14 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 9 solved, 14 unsolved
At refinement iteration 1 (OVERLAPS) 110/129 variables, 4/4 constraints. Problems are: Problem set: 9 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/129 variables, 0/4 constraints. Problems are: Problem set: 9 solved, 14 unsolved
At refinement iteration 3 (OVERLAPS) 3270/3399 variables, 129/133 constraints. Problems are: Problem set: 9 solved, 14 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3399 variables, 21/154 constraints. Problems are: Problem set: 9 solved, 14 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3399 variables, 0/154 constraints. Problems are: Problem set: 9 solved, 14 unsolved
At refinement iteration 6 (OVERLAPS) 503/3902 variables, 133/287 constraints. Problems are: Problem set: 9 solved, 14 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3902 variables, 2/289 constraints. Problems are: Problem set: 9 solved, 14 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3902 variables, 254/543 constraints. Problems are: Problem set: 9 solved, 14 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3902 variables, 14/557 constraints. Problems are: Problem set: 9 solved, 14 unsolved
[2024-06-01 06:47:36] [INFO ] Deduced a trap composed of 12 places in 144 ms of which 2 ms to minimize.
[2024-06-01 06:47:36] [INFO ] Deduced a trap composed of 19 places in 190 ms of which 2 ms to minimize.
Problem AtomicPropp11 is UNSAT
[2024-06-01 06:47:37] [INFO ] Deduced a trap composed of 28 places in 243 ms of which 1 ms to minimize.
Problem AtomicPropp23 is UNSAT
[2024-06-01 06:47:38] [INFO ] Deduced a trap composed of 26 places in 297 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/3902 variables, 4/561 constraints. Problems are: Problem set: 11 solved, 12 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 3902/3914 variables, and 561 constraints, problems are : Problem set: 11 solved, 12 unsolved in 5016 ms.
Refiners :[Positive P Invariants (semi-flows): 6/8 constraints, State Equation: 262/274 constraints, ReadFeed: 275/275 constraints, PredecessorRefiner: 14/23 constraints, Known Traps: 4/4 constraints]
After SMT, in 9036ms problems are : Problem set: 11 solved, 12 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 17 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 3797/3797 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 273 transition count 3799
Free-agglomeration rule applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 9 place count 273 transition count 3792
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 16 place count 266 transition count 3792
Applied a total of 16 rules in 295 ms. Remains 266 /274 variables (removed 8) and now considering 3792/3797 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 298 ms. Remains : 266/274 places, 3792/3797 transitions.
RANDOM walk for 40079 steps (8 resets) in 183 ms. (217 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 239 ms. (166 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40003 steps (8 resets) in 213 ms. (186 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 198 ms. (201 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 196 ms. (203 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 241 ms. (165 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 234 ms. (170 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 231 ms. (172 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 187 ms. (212 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 217 ms. (183 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (8 resets) in 217 ms. (183 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40002 steps (8 resets) in 196 ms. (203 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (8 resets) in 183 ms. (217 steps per ms) remains 11/11 properties
Interrupted probabilistic random walk after 93183 steps, run timeout after 3001 ms. (steps per millisecond=31 ) properties seen :0 out of 11
Probabilistic random walk after 93183 steps, saw 31254 distinct states, run finished after 3001 ms. (steps per millisecond=31 ) properties seen :0
[2024-06-01 06:47:42] [INFO ] Flow matrix only has 3632 transitions (discarded 160 similar events)
// Phase 1: matrix 3632 rows 266 cols
[2024-06-01 06:47:42] [INFO ] Computed 8 invariants in 17 ms
[2024-06-01 06:47:42] [INFO ] State equation strengthened by 276 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 111/127 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 3265/3392 variables, 127/131 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3392 variables, 16/147 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3392 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 497/3889 variables, 130/277 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3889 variables, 4/281 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3889 variables, 260/541 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3889 variables, 0/541 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 10 (OVERLAPS) 9/3898 variables, 9/550 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3898 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 12 (OVERLAPS) 0/3898 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3898/3898 variables, and 550 constraints, problems are : Problem set: 0 solved, 11 unsolved in 3737 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 266/266 constraints, ReadFeed: 276/276 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (OVERLAPS) 111/127 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 3265/3392 variables, 127/131 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/3392 variables, 16/147 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/3392 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (OVERLAPS) 497/3889 variables, 130/277 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3889 variables, 4/281 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3889 variables, 260/541 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3889 variables, 11/552 constraints. Problems are: Problem set: 0 solved, 11 unsolved
[2024-06-01 06:47:49] [INFO ] Deduced a trap composed of 19 places in 478 ms of which 2 ms to minimize.
[2024-06-01 06:47:50] [INFO ] Deduced a trap composed of 19 places in 441 ms of which 1 ms to minimize.
[2024-06-01 06:47:50] [INFO ] Deduced a trap composed of 9 places in 372 ms of which 2 ms to minimize.
[2024-06-01 06:47:50] [INFO ] Deduced a trap composed of 10 places in 378 ms of which 1 ms to minimize.
[2024-06-01 06:47:51] [INFO ] Deduced a trap composed of 26 places in 218 ms of which 8 ms to minimize.
[2024-06-01 06:47:51] [INFO ] Deduced a trap composed of 23 places in 342 ms of which 1 ms to minimize.
[2024-06-01 06:47:52] [INFO ] Deduced a trap composed of 57 places in 346 ms of which 3 ms to minimize.
[2024-06-01 06:47:52] [INFO ] Deduced a trap composed of 60 places in 479 ms of which 1 ms to minimize.
[2024-06-01 06:47:52] [INFO ] Deduced a trap composed of 59 places in 282 ms of which 2 ms to minimize.
[2024-06-01 06:47:53] [INFO ] Deduced a trap composed of 26 places in 99 ms of which 1 ms to minimize.
[2024-06-01 06:47:53] [INFO ] Deduced a trap composed of 56 places in 372 ms of which 2 ms to minimize.
[2024-06-01 06:47:53] [INFO ] Deduced a trap composed of 26 places in 107 ms of which 1 ms to minimize.
[2024-06-01 06:47:54] [INFO ] Deduced a trap composed of 31 places in 172 ms of which 1 ms to minimize.
Problem AtomicPropp6 is UNSAT
[2024-06-01 06:47:54] [INFO ] Deduced a trap composed of 10 places in 187 ms of which 1 ms to minimize.
[2024-06-01 06:47:54] [INFO ] Deduced a trap composed of 9 places in 196 ms of which 2 ms to minimize.
Problem AtomicPropp21 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/3889 variables, 15/567 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3889 variables, 0/567 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 9/3898 variables, 9/576 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3898 variables, 0/576 constraints. Problems are: Problem set: 2 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 0/3898 variables, 0/576 constraints. Problems are: Problem set: 2 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3898/3898 variables, and 576 constraints, problems are : Problem set: 2 solved, 9 unsolved in 12935 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 266/266 constraints, ReadFeed: 276/276 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 15/15 constraints]
After SMT, in 16747ms problems are : Problem set: 2 solved, 9 unsolved
Fused 9 Parikh solutions to 8 different solutions.
Parikh walk visited 0 properties in 33901 ms.
Support contains 14 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 3792/3792 transitions.
Applied a total of 0 rules in 64 ms. Remains 266 /266 variables (removed 0) and now considering 3792/3792 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 65 ms. Remains : 266/266 places, 3792/3792 transitions.
RANDOM walk for 40052 steps (8 resets) in 154 ms. (258 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (8 resets) in 232 ms. (171 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (8 resets) in 230 ms. (173 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 159 ms. (250 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 136 ms. (291 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 146 ms. (272 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 145 ms. (274 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 141 ms. (281 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 113 ms. (350 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 115 ms. (344 steps per ms) remains 8/8 properties
[2024-06-01 06:48:34] [INFO ] Flow matrix only has 3632 transitions (discarded 160 similar events)
[2024-06-01 06:48:34] [INFO ] Invariant cache hit.
[2024-06-01 06:48:34] [INFO ] State equation strengthened by 276 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 79/92 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 2340/2432 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2432 variables, 10/105 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2432 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 1425/3857 variables, 134/239 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3857 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3857 variables, 265/507 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3857 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (OVERLAPS) 4/3861 variables, 2/509 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3861 variables, 2/511 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3861 variables, 0/511 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 37/3898 variables, 38/549 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3898 variables, 1/550 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3898 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 0/3898 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3898/3898 variables, and 550 constraints, problems are : Problem set: 0 solved, 8 unsolved in 2962 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 266/266 constraints, ReadFeed: 276/276 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 79/92 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/92 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 2340/2432 variables, 92/95 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2432 variables, 10/105 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2432 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 1425/3857 variables, 134/239 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/3857 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/3857 variables, 265/507 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3857 variables, 8/515 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3857 variables, 0/515 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 4/3861 variables, 2/517 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3861 variables, 2/519 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3861 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (OVERLAPS) 37/3898 variables, 38/557 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3898 variables, 1/558 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3898 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (OVERLAPS) 0/3898 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3898/3898 variables, and 558 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5116 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 266/266 constraints, ReadFeed: 276/276 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 8152ms problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 7 different solutions.
Parikh walk visited 0 properties in 25257 ms.
Support contains 13 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 3792/3792 transitions.
Applied a total of 0 rules in 73 ms. Remains 266 /266 variables (removed 0) and now considering 3792/3792 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 266/266 places, 3792/3792 transitions.
Successfully simplified 13 atomic propositions for a total of 12 simplifications.
FORMULA BugTracking-PT-q8m032-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:49:07] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
[2024-06-01 06:49:07] [INFO ] Flatten gal took : 185 ms
FORMULA BugTracking-PT-q8m032-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:49:07] [INFO ] Flatten gal took : 162 ms
[2024-06-01 06:49:08] [INFO ] Input system was already deterministic with 3797 transitions.
Computed a total of 4 stabilizing places and 96 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 3797/3797 transitions.
Applied a total of 0 rules in 11 ms. Remains 274 /274 variables (removed 0) and now considering 3797/3797 (removed 0) transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12 ms. Remains : 274/274 places, 3797/3797 transitions.
[2024-06-01 06:49:08] [INFO ] Flatten gal took : 134 ms
[2024-06-01 06:49:08] [INFO ] Flatten gal took : 153 ms
[2024-06-01 06:49:08] [INFO ] Input system was already deterministic with 3797 transitions.
Starting structural reductions in SI_CTL mode, iteration 0 : 274/274 places, 3797/3797 transitions.
Applied a total of 0 rules in 165 ms. Remains 274 /274 variables (removed 0) and now considering 3797/3797 (removed 0) transitions.
Finished structural reductions in SI_CTL mode , in 1 iterations and 166 ms. Remains : 274/274 places, 3797/3797 transitions.
[2024-06-01 06:49:09] [INFO ] Flatten gal took : 119 ms
[2024-06-01 06:49:09] [INFO ] Flatten gal took : 129 ms
[2024-06-01 06:49:09] [INFO ] Input system was already deterministic with 3797 transitions.
RANDOM walk for 40029 steps (76 resets) in 354 ms. (112 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (12 resets) in 249 ms. (160 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 163547 steps, run timeout after 3001 ms. (steps per millisecond=54 ) properties seen :0 out of 1
Probabilistic random walk after 163547 steps, saw 83633 distinct states, run finished after 3002 ms. (steps per millisecond=54 ) properties seen :0
[2024-06-01 06:49:12] [INFO ] Flow matrix only has 3640 transitions (discarded 157 similar events)
// Phase 1: matrix 3640 rows 274 cols
[2024-06-01 06:49:12] [INFO ] Computed 8 invariants in 36 ms
[2024-06-01 06:49:12] [INFO ] State equation strengthened by 275 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1071/1120 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1120 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 211/1331 variables, 53/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1331 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1331 variables, 86/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1331 variables, 0/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2392/3723 variables, 50/241 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3723 variables, 163/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3723 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 8/3731 variables, 2/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3731 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 180/3911 variables, 120/526 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3911 variables, 3/529 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3911 variables, 26/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3911 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 3/3914 variables, 2/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3914 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/3914 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3914/3914 variables, and 557 constraints, problems are : Problem set: 0 solved, 1 unsolved in 994 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 274/274 constraints, ReadFeed: 275/275 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1071/1120 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1120 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 211/1331 variables, 53/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1331 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1331 variables, 86/191 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1331 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1331 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2392/3723 variables, 50/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3723 variables, 163/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3723 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 8/3731 variables, 2/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3731 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 180/3911 variables, 120/527 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3911 variables, 3/530 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3911 variables, 26/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:49:15] [INFO ] Deduced a trap composed of 22 places in 374 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/3911 variables, 1/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3911 variables, 0/557 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 3/3914 variables, 2/559 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:49:15] [INFO ] Deduced a trap composed of 26 places in 307 ms of which 1 ms to minimize.
[2024-06-01 06:49:16] [INFO ] Deduced a trap composed of 37 places in 288 ms of which 2 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/3914 variables, 2/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3914 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/3914 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3914/3914 variables, and 561 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2714 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 274/274 constraints, ReadFeed: 275/275 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 3776ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 905 ms.
Support contains 3 out of 274 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 274/274 places, 3797/3797 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 272 transition count 3803
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 272 transition count 3797
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 266 transition count 3797
Applied a total of 16 rules in 214 ms. Remains 266 /274 variables (removed 8) and now considering 3797/3797 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 215 ms. Remains : 266/274 places, 3797/3797 transitions.
RANDOM walk for 4000021 steps (8 resets) in 8926 ms. (448 steps per ms) remains 1/1 properties
BEST_FIRST walk for 4000004 steps (8 resets) in 10315 ms. (387 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 702415 steps, run timeout after 15001 ms. (steps per millisecond=46 ) properties seen :0 out of 1
Probabilistic random walk after 702415 steps, saw 423073 distinct states, run finished after 15001 ms. (steps per millisecond=46 ) properties seen :0
[2024-06-01 06:49:38] [INFO ] Flow matrix only has 3632 transitions (discarded 165 similar events)
// Phase 1: matrix 3632 rows 266 cols
[2024-06-01 06:49:38] [INFO ] Computed 8 invariants in 18 ms
[2024-06-01 06:49:38] [INFO ] State equation strengthened by 276 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1071/1120 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1120 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 204/1324 variables, 50/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1324 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1324 variables, 86/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1324 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2391/3715 variables, 49/237 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/3715 variables, 164/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3715 variables, 0/401 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/3720 variables, 2/403 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3720 variables, 1/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3720 variables, 0/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 177/3897 variables, 116/520 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3897 variables, 3/523 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3897 variables, 26/549 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3897 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/3898 variables, 1/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3898 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/3898 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3898/3898 variables, and 550 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1284 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 266/266 constraints, ReadFeed: 276/276 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 46/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 1071/1120 variables, 49/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1120 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 204/1324 variables, 50/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1324 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1324 variables, 86/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1324 variables, 1/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1324 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 2391/3715 variables, 49/238 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/3715 variables, 164/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/3715 variables, 0/402 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/3720 variables, 2/404 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3720 variables, 1/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3720 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 177/3897 variables, 116/521 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3897 variables, 3/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3897 variables, 26/550 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:49:41] [INFO ] Deduced a trap composed of 17 places in 343 ms of which 3 ms to minimize.
[2024-06-01 06:49:41] [INFO ] Deduced a trap composed of 26 places in 206 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/3897 variables, 2/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3897 variables, 0/552 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/3898 variables, 1/553 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 06:49:42] [INFO ] Deduced a trap composed of 23 places in 317 ms of which 1 ms to minimize.
[2024-06-01 06:49:42] [INFO ] Deduced a trap composed of 21 places in 299 ms of which 1 ms to minimize.
[2024-06-01 06:49:42] [INFO ] Deduced a trap composed of 35 places in 264 ms of which 1 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/3898 variables, 3/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3898 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/3898 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3898/3898 variables, and 556 constraints, problems are : Problem set: 0 solved, 1 unsolved in 3556 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 266/266 constraints, ReadFeed: 276/276 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 5/5 constraints]
After SMT, in 4893ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 902 ms.
Support contains 3 out of 266 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 3797/3797 transitions.
Applied a total of 0 rules in 100 ms. Remains 266 /266 variables (removed 0) and now considering 3797/3797 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 266/266 places, 3797/3797 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 266/266 places, 3797/3797 transitions.
Applied a total of 0 rules in 66 ms. Remains 266 /266 variables (removed 0) and now considering 3797/3797 (removed 0) transitions.
[2024-06-01 06:49:44] [INFO ] Flow matrix only has 3632 transitions (discarded 165 similar events)
[2024-06-01 06:49:44] [INFO ] Invariant cache hit.
[2024-06-01 06:49:44] [INFO ] Implicit Places using invariants in 552 ms returned []
[2024-06-01 06:49:44] [INFO ] Flow matrix only has 3632 transitions (discarded 165 similar events)
[2024-06-01 06:49:44] [INFO ] Invariant cache hit.
[2024-06-01 06:49:45] [INFO ] State equation strengthened by 276 read => feed constraints.
[2024-06-01 06:49:47] [INFO ] Implicit Places using invariants and state equation in 2973 ms returned []
Implicit Place search using SMT with State Equation took 3535 ms to find 0 implicit places.
[2024-06-01 06:49:47] [INFO ] Redundant transitions in 243 ms returned []
Running 3796 sub problems to find dead transitions.
[2024-06-01 06:49:48] [INFO ] Flow matrix only has 3632 transitions (discarded 165 similar events)
[2024-06-01 06:49:48] [INFO ] Invariant cache hit.
[2024-06-01 06:49:48] [INFO ] State equation strengthened by 276 read => feed constraints.
Usage: pnml2lts-sym [-gvqh] [--order=
[--mu-opt] [--saturation=
[--sat-granularity=
[--guidance=
[--action=
[--trace=
[--mu=
[--ctl=
[--save-levels=STRING] [--pg-solve] [--attr=
[--saturating-attractor] [--write-strategy=
[--check-strategy] [--interactive-play] [--player]
[--pg-write=
[--edge-label=
[--mucalc=
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por=
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=
[--cw-max-cols=
[--mh-timeout=
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=
[--ldd32-cache=
[--cache-ratio=
[--min-free-nodes=
[--fdd-reorder=
[--vset-cache-diff=
[--next-union] [--peak-nodes] [--maxsum=
[--block-size=
[--debug=
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS]
Could not compute solution for formula : BugTracking-PT-q8m032-CTLCardinality-2024-00
Could not compute solution for formula : BugTracking-PT-q8m032-CTLCardinality-2024-01
Could not compute solution for formula : BugTracking-PT-q8m032-CTLCardinality-2024-02
Could not compute solution for formula : BugTracking-PT-q8m032-CTLCardinality-2024-03
Could not compute solution for formula : BugTracking-PT-q8m032-CTLCardinality-2024-04
Could not compute solution for formula : BugTracking-PT-q8m032-CTLCardinality-2024-05
Could not compute solution for formula : BugTracking-PT-q8m032-CTLCardinality-2024-06
Could not compute solution for formula : BugTracking-PT-q8m032-CTLCardinality-2024-07
Could not compute solution for formula : BugTracking-PT-q8m032-CTLCardinality-2024-08
Could not compute solution for formula : BugTracking-PT-q8m032-CTLCardinality-2024-09
Could not compute solution for formula : BugTracking-PT-q8m032-CTLCardinality-2024-10
Could not compute solution for formula : BugTracking-PT-q8m032-CTLCardinality-2024-11
Could not compute solution for formula : BugTracking-PT-q8m032-CTLCardinality-2023-12
Could not compute solution for formula : BugTracking-PT-q8m032-CTLCardinality-2023-13
Could not compute solution for formula : BugTracking-PT-q8m032-CTLCardinality-2023-14
Could not compute solution for formula : BugTracking-PT-q8m032-CTLCardinality-2023-15
BK_STOP 1717224624156
--------------------
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-q8m032-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/694/ctl_0_
ctl formula name BugTracking-PT-q8m032-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/694/ctl_1_
ctl formula name BugTracking-PT-q8m032-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/694/ctl_2_
ctl formula name BugTracking-PT-q8m032-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/694/ctl_3_
ctl formula name BugTracking-PT-q8m032-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/694/ctl_4_
ctl formula name BugTracking-PT-q8m032-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/694/ctl_5_
ctl formula name BugTracking-PT-q8m032-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/694/ctl_6_
ctl formula name BugTracking-PT-q8m032-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/694/ctl_7_
ctl formula name BugTracking-PT-q8m032-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/694/ctl_8_
ctl formula name BugTracking-PT-q8m032-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/694/ctl_9_
ctl formula name BugTracking-PT-q8m032-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/694/ctl_10_
ctl formula name BugTracking-PT-q8m032-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/694/ctl_11_
ctl formula name BugTracking-PT-q8m032-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/694/ctl_12_
ctl formula name BugTracking-PT-q8m032-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/694/ctl_13_
ctl formula name BugTracking-PT-q8m032-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/694/ctl_14_
ctl formula name BugTracking-PT-q8m032-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/694/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-q8m032"
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-q8m032, 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-171620399500417"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q8m032.tgz
mv BugTracking-PT-q8m032 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 '
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 ;