About the Execution of LTSMin+red for BugTracking-PT-q8m064
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 166146.00 | 0.00 | 0.00 | F?F??FFF?FT?F??F | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r472-tajo-171620399500425.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-q8m064, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399500425
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 8.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 73K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 8.5K May 19 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.1K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 65K 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-q8m064-CTLCardinality-2024-00
FORMULA_NAME BugTracking-PT-q8m064-CTLCardinality-2024-01
FORMULA_NAME BugTracking-PT-q8m064-CTLCardinality-2024-02
FORMULA_NAME BugTracking-PT-q8m064-CTLCardinality-2024-03
FORMULA_NAME BugTracking-PT-q8m064-CTLCardinality-2024-04
FORMULA_NAME BugTracking-PT-q8m064-CTLCardinality-2024-05
FORMULA_NAME BugTracking-PT-q8m064-CTLCardinality-2024-06
FORMULA_NAME BugTracking-PT-q8m064-CTLCardinality-2024-07
FORMULA_NAME BugTracking-PT-q8m064-CTLCardinality-2024-08
FORMULA_NAME BugTracking-PT-q8m064-CTLCardinality-2024-09
FORMULA_NAME BugTracking-PT-q8m064-CTLCardinality-2024-10
FORMULA_NAME BugTracking-PT-q8m064-CTLCardinality-2024-11
FORMULA_NAME BugTracking-PT-q8m064-CTLCardinality-2023-12
FORMULA_NAME BugTracking-PT-q8m064-CTLCardinality-2023-13
FORMULA_NAME BugTracking-PT-q8m064-CTLCardinality-2023-14
FORMULA_NAME BugTracking-PT-q8m064-CTLCardinality-2023-15
=== Now, execution of the tool begins
BK_START 1717224461508
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-q8m064
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:47:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 06:47:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:47:43] [INFO ] Load time of PNML (sax parser for PT used): 814 ms
[2024-06-01 06:47:43] [INFO ] Transformed 754 places.
[2024-06-01 06:47:43] [INFO ] Transformed 27370 transitions.
[2024-06-01 06:47:43] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1048 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 18 ms.
Deduced a syphon composed of 474 places in 93 ms
Reduce places removed 474 places and 23466 transitions.
Support contains 24 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 94 ms. Remains 277 /280 variables (removed 3) and now considering 3871/3904 (removed 33) transitions.
[2024-06-01 06:47:44] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
// Phase 1: matrix 3707 rows 277 cols
[2024-06-01 06:47:44] [INFO ] Computed 8 invariants in 57 ms
[2024-06-01 06:47:45] [INFO ] Implicit Places using invariants in 752 ms returned []
[2024-06-01 06:47:45] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-06-01 06:47:45] [INFO ] Invariant cache hit.
[2024-06-01 06:47:45] [INFO ] State equation strengthened by 282 read => feed constraints.
[2024-06-01 06:47:47] [INFO ] Implicit Places using invariants and state equation in 2461 ms returned []
Implicit Place search using SMT with State Equation took 3269 ms to find 0 implicit places.
Running 3869 sub problems to find dead transitions.
[2024-06-01 06:47:47] [INFO ] Flow matrix only has 3707 transitions (discarded 164 similar events)
[2024-06-01 06:47:47] [INFO ] Invariant cache hit.
[2024-06-01 06:47:47] [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:48:54] [INFO ] Deduced a trap composed of 10 places in 216 ms of which 15 ms to minimize.
[2024-06-01 06:48:54] [INFO ] Deduced a trap composed of 7 places in 237 ms of which 2 ms to minimize.
[2024-06-01 06:48:54] [INFO ] Deduced a trap composed of 23 places in 145 ms of which 1 ms to minimize.
[2024-06-01 06:49:04] [INFO ] Deduced a trap composed of 11 places in 53 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:49:34] [INFO ] Deduced a trap composed of 23 places in 123 ms of which 1 ms to minimize.
Problem TDEAD2716 is UNSAT
Problem TDEAD2728 is UNSAT
[2024-06-01 06:49:34] [INFO ] Deduced a trap composed of 12 places in 92 ms of which 1 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:49:34] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 0 ms to minimize.
SMT process timed out in 107191ms, After SMT, problems are : Problem set: 45 solved, 3824 unsolved
Search for dead transitions found 55 dead transitions in 107366ms
Found 55 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 55 transitions
Dead transitions reduction (with SMT) removed 55 transitions
Starting structural reductions in LTL mode, iteration 1 : 277/280 places, 3816/3904 transitions.
Reduce places removed 13 places and 433 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 264 transition count 3383
Reduce places removed 7 places and 210 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 20 place count 257 transition count 3173
Reduce places removed 6 places and 168 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 26 place count 251 transition count 3005
Reduce places removed 3 places and 81 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 29 place count 248 transition count 2924
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 30 place count 247 transition count 2901
Deduced a syphon composed of 1 places in 3 ms
Iterating global reduction 4 with 1 rules applied. Total rules applied 31 place count 247 transition count 2901
Deduced a syphon composed of 1 places in 3 ms
Applied a total of 31 rules in 55 ms. Remains 247 /277 variables (removed 30) and now considering 2901/3816 (removed 915) transitions.
[2024-06-01 06:49:35] [INFO ] Flow matrix only has 2782 transitions (discarded 119 similar events)
// Phase 1: matrix 2782 rows 247 cols
[2024-06-01 06:49:35] [INFO ] Computed 9 invariants in 19 ms
[2024-06-01 06:49:35] [INFO ] Implicit Places using invariants in 925 ms returned []
[2024-06-01 06:49:35] [INFO ] Flow matrix only has 2782 transitions (discarded 119 similar events)
[2024-06-01 06:49:35] [INFO ] Invariant cache hit.
[2024-06-01 06:49:36] [INFO ] State equation strengthened by 234 read => feed constraints.
[2024-06-01 06:49:37] [INFO ] Implicit Places using invariants and state equation in 1816 ms returned []
Implicit Place search using SMT with State Equation took 2765 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 247/280 places, 2901/3904 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 113615 ms. Remains : 247/280 places, 2901/3904 transitions.
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Support contains 22 out of 246 places after structural reductions.
[2024-06-01 06:49:38] [INFO ] Initial state reduction rules for CTL removed 6 formulas.
[2024-06-01 06:49:38] [INFO ] Flatten gal took : 470 ms
[2024-06-01 06:49:38] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
FORMULA BugTracking-PT-q8m064-CTLCardinality-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:49:38] [INFO ] Initial state reduction rules for CTL removed 1 formulas.
FORMULA BugTracking-PT-q8m064-CTLCardinality-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-CTLCardinality-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-CTLCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-CTLCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-CTLCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-CTLCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m064-CTLCardinality-2024-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:49:38] [INFO ] Flatten gal took : 260 ms
[2024-06-01 06:49:39] [INFO ] Input system was already deterministic with 2901 transitions.
Support contains 5 out of 246 places (down from 22) after GAL structural reductions.
RANDOM walk for 40000 steps (32 resets) in 1790 ms. (22 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40001 steps (9 resets) in 358 ms. (111 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 127 ms. (312 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 147 ms. (270 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 183 ms. (217 steps per ms) remains 4/4 properties
[2024-06-01 06:49:40] [INFO ] Flow matrix only has 2782 transitions (discarded 119 similar events)
// Phase 1: matrix 2782 rows 246 cols
[2024-06-01 06:49:40] [INFO ] Computed 8 invariants in 10 ms
[2024-06-01 06:49:40] [INFO ] State equation strengthened by 234 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp2 is UNSAT
At refinement iteration 1 (OVERLAPS) 28/32 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 803/835 variables, 32/33 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/835 variables, 4/37 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/835 variables, 0/37 constraints. Problems are: Problem set: 2 solved, 2 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 1544/2379 variables, 90/127 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2379 variables, 2/129 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2379 variables, 161/290 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2379 variables, 0/290 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 4/2383 variables, 2/292 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2383 variables, 1/293 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2383 variables, 0/293 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 596/2979 variables, 96/389 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2979 variables, 1/390 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2979 variables, 62/452 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2979 variables, 0/452 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 4/2983 variables, 1/453 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2983 variables, 0/453 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 45/3028 variables, 27/480 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/3028 variables, 1/481 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3028 variables, 7/488 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/3028 variables, 0/488 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 23 (OVERLAPS) 0/3028 variables, 0/488 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3028/3028 variables, and 488 constraints, problems are : Problem set: 2 solved, 2 unsolved in 1651 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 246/246 constraints, ReadFeed: 234/234 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 57/59 variables, 2/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/59 variables, 2/4 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/59 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 2250/2309 variables, 63/67 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2309 variables, 2/69 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2309 variables, 161/230 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2309 variables, 0/230 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 7/2316 variables, 2/232 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2316 variables, 0/232 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 642/2958 variables, 152/384 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2958 variables, 2/386 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2958 variables, 60/446 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2958 variables, 2/448 constraints. Problems are: Problem set: 2 solved, 2 unsolved
[2024-06-01 06:49:43] [INFO ] Deduced a trap composed of 18 places in 412 ms of which 3 ms to minimize.
Problem AtomicPropp1 is UNSAT
[2024-06-01 06:49:44] [INFO ] Deduced a trap composed of 6 places in 376 ms of which 2 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/2958 variables, 2/450 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2958 variables, 0/450 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 68/3026 variables, 27/477 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3026 variables, 1/478 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3026 variables, 11/489 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3026 variables, 0/489 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/3028 variables, 1/490 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/3028 variables, 2/492 constraints. Problems are: Problem set: 3 solved, 1 unsolved
[2024-06-01 06:49:45] [INFO ] Deduced a trap composed of 10 places in 357 ms of which 3 ms to minimize.
[2024-06-01 06:49:45] [INFO ] Deduced a trap composed of 42 places in 293 ms of which 2 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/3028 variables, 2/494 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/3028 variables, 0/494 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 0/3028 variables, 0/494 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3028/3028 variables, and 494 constraints, problems are : Problem set: 3 solved, 1 unsolved in 3355 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 246/246 constraints, ReadFeed: 234/234 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 4/4 constraints]
After SMT, in 5083ms problems are : Problem set: 3 solved, 1 unsolved
Parikh walk visited 0 properties in 495 ms.
Support contains 1 out of 246 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 246/246 places, 2901/2901 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 244 transition count 2905
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 244 transition count 2899
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 238 transition count 2899
Applied a total of 16 rules in 226 ms. Remains 238 /246 variables (removed 8) and now considering 2899/2901 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 227 ms. Remains : 238/246 places, 2899/2901 transitions.
RANDOM walk for 40080 steps (8 resets) in 249 ms. (160 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 132209 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :0 out of 1
Probabilistic random walk after 132209 steps, saw 52532 distinct states, run finished after 3006 ms. (steps per millisecond=43 ) properties seen :0
[2024-06-01 06:49:49] [INFO ] Flow matrix only has 2774 transitions (discarded 125 similar events)
// Phase 1: matrix 2774 rows 238 cols
[2024-06-01 06:49:49] [INFO ] Computed 8 invariants in 11 ms
[2024-06-01 06:49:49] [INFO ] State equation strengthened by 235 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1725/1759 variables, 37/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1759 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1759 variables, 137/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1759 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/1764 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1764 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1764 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1134/2898 variables, 146/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/2898 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2898 variables, 81/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2898 variables, 0/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 114/3012 variables, 53/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/3012 variables, 3/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3012 variables, 16/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3012 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/3012 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3012/3012 variables, and 481 constraints, problems are : Problem set: 0 solved, 1 unsolved in 948 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 238/238 constraints, ReadFeed: 235/235 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/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 33/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1725/1759 variables, 37/39 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1759 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1759 variables, 137/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1759 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 5/1764 variables, 2/179 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1764 variables, 1/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1764 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1134/2898 variables, 146/326 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2898 variables, 2/328 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2898 variables, 81/409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2898 variables, 1/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2898 variables, 0/410 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 114/3012 variables, 53/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/3012 variables, 3/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/3012 variables, 16/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/3012 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/3012 variables, 0/482 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3012/3012 variables, and 482 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1114 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 238/238 constraints, ReadFeed: 235/235 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 2096ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 54 ms.
Support contains 1 out of 238 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 2899/2899 transitions.
Applied a total of 0 rules in 63 ms. Remains 238 /238 variables (removed 0) and now considering 2899/2899 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63 ms. Remains : 238/238 places, 2899/2899 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 238/238 places, 2899/2899 transitions.
Applied a total of 0 rules in 86 ms. Remains 238 /238 variables (removed 0) and now considering 2899/2899 (removed 0) transitions.
[2024-06-01 06:49:51] [INFO ] Flow matrix only has 2774 transitions (discarded 125 similar events)
[2024-06-01 06:49:51] [INFO ] Invariant cache hit.
[2024-06-01 06:49:53] [INFO ] Implicit Places using invariants in 1197 ms returned []
[2024-06-01 06:49:53] [INFO ] Flow matrix only has 2774 transitions (discarded 125 similar events)
[2024-06-01 06:49:53] [INFO ] Invariant cache hit.
[2024-06-01 06:49:53] [INFO ] State equation strengthened by 235 read => feed constraints.
[2024-06-01 06:49:55] [INFO ] Implicit Places using invariants and state equation in 2100 ms returned []
Implicit Place search using SMT with State Equation took 3321 ms to find 0 implicit places.
[2024-06-01 06:49:55] [INFO ] Redundant transitions in 175 ms returned []
Running 2898 sub problems to find dead transitions.
[2024-06-01 06:49:55] [INFO ] Flow matrix only has 2774 transitions (discarded 125 similar events)
[2024-06-01 06:49:55] [INFO ] Invariant cache hit.
[2024-06-01 06:49:55] [INFO ] State equation strengthened by 235 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-q8m064-CTLCardinality-2024-00
Could not compute solution for formula : BugTracking-PT-q8m064-CTLCardinality-2024-01
Could not compute solution for formula : BugTracking-PT-q8m064-CTLCardinality-2024-02
Could not compute solution for formula : BugTracking-PT-q8m064-CTLCardinality-2024-03
Could not compute solution for formula : BugTracking-PT-q8m064-CTLCardinality-2024-04
Could not compute solution for formula : BugTracking-PT-q8m064-CTLCardinality-2024-05
Could not compute solution for formula : BugTracking-PT-q8m064-CTLCardinality-2024-06
Could not compute solution for formula : BugTracking-PT-q8m064-CTLCardinality-2024-07
Could not compute solution for formula : BugTracking-PT-q8m064-CTLCardinality-2024-08
Could not compute solution for formula : BugTracking-PT-q8m064-CTLCardinality-2024-09
Could not compute solution for formula : BugTracking-PT-q8m064-CTLCardinality-2024-10
Could not compute solution for formula : BugTracking-PT-q8m064-CTLCardinality-2024-11
Could not compute solution for formula : BugTracking-PT-q8m064-CTLCardinality-2023-12
Could not compute solution for formula : BugTracking-PT-q8m064-CTLCardinality-2023-13
Could not compute solution for formula : BugTracking-PT-q8m064-CTLCardinality-2023-14
Could not compute solution for formula : BugTracking-PT-q8m064-CTLCardinality-2023-15
BK_STOP 1717224627654
--------------------
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-q8m064-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/609/ctl_0_
ctl formula name BugTracking-PT-q8m064-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/609/ctl_1_
ctl formula name BugTracking-PT-q8m064-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/609/ctl_2_
ctl formula name BugTracking-PT-q8m064-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/609/ctl_3_
ctl formula name BugTracking-PT-q8m064-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/609/ctl_4_
ctl formula name BugTracking-PT-q8m064-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/609/ctl_5_
ctl formula name BugTracking-PT-q8m064-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/609/ctl_6_
ctl formula name BugTracking-PT-q8m064-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/609/ctl_7_
ctl formula name BugTracking-PT-q8m064-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/609/ctl_8_
ctl formula name BugTracking-PT-q8m064-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/609/ctl_9_
ctl formula name BugTracking-PT-q8m064-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/609/ctl_10_
ctl formula name BugTracking-PT-q8m064-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/609/ctl_11_
ctl formula name BugTracking-PT-q8m064-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/609/ctl_12_
ctl formula name BugTracking-PT-q8m064-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/609/ctl_13_
ctl formula name BugTracking-PT-q8m064-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/609/ctl_14_
ctl formula name BugTracking-PT-q8m064-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/609/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-q8m064"
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-q8m064, 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-171620399500425"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q8m064.tgz
mv BugTracking-PT-q8m064 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 ;