Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r488-tall-171631132000123.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is Dekker-PT-200, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631132000123
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 25M
-rw-r--r-- 1 mcc users 7.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K May 19 15:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 145K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Apr 12 04:34 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 29K Apr 12 04:34 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 25M 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 Dekker-PT-200-LTLCardinality-00
FORMULA_NAME Dekker-PT-200-LTLCardinality-01
FORMULA_NAME Dekker-PT-200-LTLCardinality-02
FORMULA_NAME Dekker-PT-200-LTLCardinality-03
FORMULA_NAME Dekker-PT-200-LTLCardinality-04
FORMULA_NAME Dekker-PT-200-LTLCardinality-05
FORMULA_NAME Dekker-PT-200-LTLCardinality-06
FORMULA_NAME Dekker-PT-200-LTLCardinality-07
FORMULA_NAME Dekker-PT-200-LTLCardinality-08
FORMULA_NAME Dekker-PT-200-LTLCardinality-09
FORMULA_NAME Dekker-PT-200-LTLCardinality-10
FORMULA_NAME Dekker-PT-200-LTLCardinality-11
FORMULA_NAME Dekker-PT-200-LTLCardinality-12
FORMULA_NAME Dekker-PT-200-LTLCardinality-13
FORMULA_NAME Dekker-PT-200-LTLCardinality-14
FORMULA_NAME Dekker-PT-200-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717186444240

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Dekker-PT-200
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 20:14:05] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 20:14:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 20:14:06] [INFO ] Load time of PNML (sax parser for PT used): 1230 ms
[2024-05-31 20:14:06] [INFO ] Transformed 1000 places.
[2024-05-31 20:14:07] [INFO ] Transformed 40400 transitions.
[2024-05-31 20:14:07] [INFO ] Found NUPN structural information;
[2024-05-31 20:14:07] [INFO ] Parsed PT model containing 1000 places and 40400 transitions and 320400 arcs in 1572 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Dekker-PT-200-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-200-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 1000 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1000/1000 places, 40400/40400 transitions.
Applied a total of 0 rules in 1418 ms. Remains 1000 /1000 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2024-05-31 20:14:08] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 1000 cols
[2024-05-31 20:14:08] [INFO ] Computed 600 invariants in 46 ms
[2024-05-31 20:14:39] [INFO ] Performed 767/1000 implicitness test of which 122 returned IMPLICIT in 30 seconds.
[2024-05-31 20:14:40] [INFO ] Implicit Places using invariants in 31749 ms returned [400, 403, 406, 409, 412, 415, 418, 421, 424, 427, 430, 436, 439, 442, 445, 448, 451, 454, 457, 460, 463, 466, 469, 472, 475, 478, 481, 484, 487, 490, 493, 496, 499, 502, 505, 508, 511, 514, 517, 520, 523, 526, 529, 532, 535, 538, 541, 544, 547, 550, 553, 556, 559, 562, 565, 568, 571, 574, 577, 580, 583, 586, 589, 592, 595, 598, 601, 604, 607, 610, 613, 616, 619, 622, 625, 628, 631, 634, 637, 640, 643, 646, 649, 652, 655, 658, 661, 664, 667, 670, 673, 676, 679, 682, 685, 688, 691, 694, 697, 700, 703, 706, 709, 712, 715, 718, 721, 724, 727, 730, 733, 736, 739, 742, 745, 748, 751, 754, 757, 760, 763, 766, 769, 772, 775, 778, 781, 784, 787, 790, 793, 796, 799, 802, 805, 808, 811, 814, 817, 820, 823, 826, 829, 832, 835, 838, 841, 844, 847, 850, 853, 856, 859, 862, 865, 868, 871, 874, 877, 880, 883, 886, 889, 892, 895, 898, 901, 904, 907, 910, 913, 916, 919, 922, 925, 931, 934, 937, 940, 943, 946, 949, 952, 955, 958, 961, 964, 967, 970, 973, 979, 982, 985, 988, 991, 994, 997]
Discarding 197 places :
Implicit Place search using SMT only with invariants took 31830 ms to find 197 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 803/1000 places, 40400/40400 transitions.
Applied a total of 0 rules in 906 ms. Remains 803 /803 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 34185 ms. Remains : 803/1000 places, 40400/40400 transitions.
Support contains 26 out of 803 places after structural reductions.
[2024-05-31 20:14:43] [INFO ] Flatten gal took : 1873 ms
[2024-05-31 20:14:45] [INFO ] Flatten gal took : 1500 ms
[2024-05-31 20:14:48] [INFO ] Input system was already deterministic with 40400 transitions.
Reduction of identical properties reduced properties to check from 17 to 16
RANDOM walk for 40000 steps (8 resets) in 5597 ms. (7 steps per ms) remains 5/16 properties
BEST_FIRST walk for 40004 steps (8 resets) in 286 ms. (139 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 344 ms. (115 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 572 ms. (69 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 271 ms. (147 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 232 ms. (171 steps per ms) remains 5/5 properties
[2024-05-31 20:14:50] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 803 cols
[2024-05-31 20:14:50] [INFO ] Computed 403 invariants in 4 ms
[2024-05-31 20:14:50] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 17/25 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 17/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:14:51] [INFO ] Deduced a trap composed of 4 places in 102 ms of which 7 ms to minimize.
[2024-05-31 20:14:51] [INFO ] Deduced a trap composed of 4 places in 193 ms of which 1 ms to minimize.
[2024-05-31 20:14:51] [INFO ] Deduced a trap composed of 4 places in 107 ms of which 1 ms to minimize.
[2024-05-31 20:14:51] [INFO ] Deduced a trap composed of 4 places in 94 ms of which 2 ms to minimize.
[2024-05-31 20:14:51] [INFO ] Deduced a trap composed of 4 places in 115 ms of which 0 ms to minimize.
[2024-05-31 20:14:51] [INFO ] Deduced a trap composed of 4 places in 81 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 6/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 7/32 variables, 7/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 7/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/32 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 32/64 variables, 32/86 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/64 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 384/448 variables, 200/286 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/448 variables, 0/286 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 963/1411 variables, 579/865 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1411 variables, 579/1444 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1411 variables, 189/1633 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1411 variables, 0/1633 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 192/1603 variables, 195/1828 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1603 variables, 192/2020 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1603 variables, 3/2023 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1603 variables, 192/2215 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1603 variables, 0/2215 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (OVERLAPS) 0/1603 variables, 0/2215 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1603/1603 variables, and 2215 constraints, problems are : Problem set: 0 solved, 5 unsolved in 4104 ms.
Refiners :[Domain max(s): 803/803 constraints, Positive P Invariants (semi-flows): 400/400 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 803/803 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 17/25 variables, 9/17 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/25 variables, 17/34 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 6/40 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-05-31 20:14:55] [INFO ] Deduced a trap composed of 4 places in 61 ms of which 0 ms to minimize.
[2024-05-31 20:14:55] [INFO ] Deduced a trap composed of 4 places in 70 ms of which 3 ms to minimize.
[2024-05-31 20:14:55] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 0 ms to minimize.
[2024-05-31 20:14:55] [INFO ] Deduced a trap composed of 4 places in 67 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 4/44 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 7/32 variables, 7/51 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/32 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/32 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 32/64 variables, 32/90 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/64 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 384/448 variables, 200/290 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/448 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 963/1411 variables, 579/869 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1411 variables, 579/1448 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1411 variables, 189/1637 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1411 variables, 5/1642 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1411 variables, 0/1642 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 19 (OVERLAPS) 192/1603 variables, 195/1837 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1603 variables, 192/2029 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1603 variables, 3/2032 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1603 variables, 192/2224 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1603 variables, 0/2224 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 24 (OVERLAPS) 0/1603 variables, 0/2224 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1603/1603 variables, and 2224 constraints, problems are : Problem set: 0 solved, 5 unsolved in 3417 ms.
Refiners :[Domain max(s): 803/803 constraints, Positive P Invariants (semi-flows): 400/400 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 803/803 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 10/10 constraints]
After SMT, in 7849ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 4 properties in 22303 ms.
Support contains 2 out of 803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 803/803 places, 40400/40400 transitions.
Applied a total of 0 rules in 1255 ms. Remains 803 /803 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1259 ms. Remains : 803/803 places, 40400/40400 transitions.
RANDOM walk for 40000 steps (8 resets) in 2634 ms. (15 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 274 ms. (145 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 263913 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :0 out of 1
Probabilistic random walk after 263913 steps, saw 253908 distinct states, run finished after 3004 ms. (steps per millisecond=87 ) properties seen :0
[2024-05-31 20:15:25] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-31 20:15:25] [INFO ] Invariant cache hit.
[2024-05-31 20:15:25] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 5/7 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:15:26] [INFO ] Deduced a trap composed of 4 places in 68 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/8 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/16 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/16 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 396/412 variables, 200/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/412 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 993/1405 variables, 597/818 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1405 variables, 597/1415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1405 variables, 195/1610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1405 variables, 0/1610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 198/1603 variables, 201/1811 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1603 variables, 198/2009 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1603 variables, 3/2012 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1603 variables, 198/2210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1603 variables, 0/2210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1603 variables, 0/2210 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1603/1603 variables, and 2210 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1193 ms.
Refiners :[Domain max(s): 803/803 constraints, Positive P Invariants (semi-flows): 400/400 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 803/803 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 5/7 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/8 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/16 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/16 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 396/412 variables, 200/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/412 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 993/1405 variables, 597/818 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1405 variables, 597/1415 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1405 variables, 195/1610 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1405 variables, 1/1611 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:15:28] [INFO ] Deduced a trap composed of 4 places in 644 ms of which 1 ms to minimize.
[2024-05-31 20:15:29] [INFO ] Deduced a trap composed of 4 places in 683 ms of which 1 ms to minimize.
[2024-05-31 20:15:29] [INFO ] Deduced a trap composed of 4 places in 614 ms of which 1 ms to minimize.
[2024-05-31 20:15:30] [INFO ] Deduced a trap composed of 4 places in 628 ms of which 1 ms to minimize.
[2024-05-31 20:15:31] [INFO ] Deduced a trap composed of 4 places in 596 ms of which 1 ms to minimize.
[2024-05-31 20:15:31] [INFO ] Deduced a trap composed of 4 places in 595 ms of which 1 ms to minimize.
[2024-05-31 20:15:32] [INFO ] Deduced a trap composed of 4 places in 580 ms of which 3 ms to minimize.
[2024-05-31 20:15:32] [INFO ] Deduced a trap composed of 4 places in 599 ms of which 1 ms to minimize.
[2024-05-31 20:15:33] [INFO ] Deduced a trap composed of 4 places in 595 ms of which 1 ms to minimize.
[2024-05-31 20:15:34] [INFO ] Deduced a trap composed of 4 places in 579 ms of which 3 ms to minimize.
[2024-05-31 20:15:34] [INFO ] Deduced a trap composed of 4 places in 554 ms of which 1 ms to minimize.
[2024-05-31 20:15:35] [INFO ] Deduced a trap composed of 4 places in 553 ms of which 4 ms to minimize.
[2024-05-31 20:15:35] [INFO ] Deduced a trap composed of 4 places in 540 ms of which 3 ms to minimize.
[2024-05-31 20:15:36] [INFO ] Deduced a trap composed of 4 places in 531 ms of which 1 ms to minimize.
[2024-05-31 20:15:36] [INFO ] Deduced a trap composed of 4 places in 533 ms of which 1 ms to minimize.
[2024-05-31 20:15:37] [INFO ] Deduced a trap composed of 4 places in 555 ms of which 1 ms to minimize.
[2024-05-31 20:15:38] [INFO ] Deduced a trap composed of 4 places in 552 ms of which 1 ms to minimize.
[2024-05-31 20:15:38] [INFO ] Deduced a trap composed of 4 places in 544 ms of which 1 ms to minimize.
[2024-05-31 20:15:39] [INFO ] Deduced a trap composed of 4 places in 534 ms of which 1 ms to minimize.
[2024-05-31 20:15:39] [INFO ] Deduced a trap composed of 4 places in 518 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1405 variables, 20/1631 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:15:40] [INFO ] Deduced a trap composed of 4 places in 523 ms of which 1 ms to minimize.
[2024-05-31 20:15:40] [INFO ] Deduced a trap composed of 4 places in 498 ms of which 1 ms to minimize.
[2024-05-31 20:15:41] [INFO ] Deduced a trap composed of 4 places in 494 ms of which 3 ms to minimize.
[2024-05-31 20:15:41] [INFO ] Deduced a trap composed of 4 places in 487 ms of which 1 ms to minimize.
[2024-05-31 20:15:42] [INFO ] Deduced a trap composed of 4 places in 464 ms of which 1 ms to minimize.
[2024-05-31 20:15:42] [INFO ] Deduced a trap composed of 4 places in 478 ms of which 1 ms to minimize.
[2024-05-31 20:15:43] [INFO ] Deduced a trap composed of 4 places in 496 ms of which 0 ms to minimize.
[2024-05-31 20:15:43] [INFO ] Deduced a trap composed of 4 places in 498 ms of which 0 ms to minimize.
[2024-05-31 20:15:44] [INFO ] Deduced a trap composed of 4 places in 495 ms of which 1 ms to minimize.
[2024-05-31 20:15:44] [INFO ] Deduced a trap composed of 4 places in 473 ms of which 1 ms to minimize.
[2024-05-31 20:15:45] [INFO ] Deduced a trap composed of 4 places in 489 ms of which 1 ms to minimize.
[2024-05-31 20:15:45] [INFO ] Deduced a trap composed of 4 places in 468 ms of which 1 ms to minimize.
[2024-05-31 20:15:46] [INFO ] Deduced a trap composed of 4 places in 452 ms of which 0 ms to minimize.
[2024-05-31 20:15:46] [INFO ] Deduced a trap composed of 4 places in 458 ms of which 0 ms to minimize.
[2024-05-31 20:15:47] [INFO ] Deduced a trap composed of 4 places in 438 ms of which 1 ms to minimize.
[2024-05-31 20:15:47] [INFO ] Deduced a trap composed of 4 places in 448 ms of which 1 ms to minimize.
[2024-05-31 20:15:48] [INFO ] Deduced a trap composed of 4 places in 435 ms of which 1 ms to minimize.
[2024-05-31 20:15:48] [INFO ] Deduced a trap composed of 4 places in 442 ms of which 1 ms to minimize.
[2024-05-31 20:15:49] [INFO ] Deduced a trap composed of 4 places in 444 ms of which 1 ms to minimize.
[2024-05-31 20:15:49] [INFO ] Deduced a trap composed of 4 places in 452 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1405 variables, 20/1651 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:15:50] [INFO ] Deduced a trap composed of 4 places in 507 ms of which 0 ms to minimize.
[2024-05-31 20:15:50] [INFO ] Deduced a trap composed of 4 places in 465 ms of which 1 ms to minimize.
[2024-05-31 20:15:51] [INFO ] Deduced a trap composed of 4 places in 444 ms of which 1 ms to minimize.
[2024-05-31 20:15:51] [INFO ] Deduced a trap composed of 4 places in 410 ms of which 1 ms to minimize.
[2024-05-31 20:15:52] [INFO ] Deduced a trap composed of 4 places in 409 ms of which 6 ms to minimize.
[2024-05-31 20:15:52] [INFO ] Deduced a trap composed of 4 places in 416 ms of which 1 ms to minimize.
[2024-05-31 20:15:53] [INFO ] Deduced a trap composed of 4 places in 391 ms of which 1 ms to minimize.
[2024-05-31 20:15:53] [INFO ] Deduced a trap composed of 4 places in 393 ms of which 0 ms to minimize.
[2024-05-31 20:15:53] [INFO ] Deduced a trap composed of 4 places in 382 ms of which 1 ms to minimize.
[2024-05-31 20:15:54] [INFO ] Deduced a trap composed of 4 places in 392 ms of which 1 ms to minimize.
[2024-05-31 20:15:54] [INFO ] Deduced a trap composed of 4 places in 366 ms of which 1 ms to minimize.
[2024-05-31 20:15:55] [INFO ] Deduced a trap composed of 4 places in 366 ms of which 0 ms to minimize.
[2024-05-31 20:15:55] [INFO ] Deduced a trap composed of 4 places in 357 ms of which 2 ms to minimize.
[2024-05-31 20:15:55] [INFO ] Deduced a trap composed of 4 places in 336 ms of which 1 ms to minimize.
[2024-05-31 20:15:56] [INFO ] Deduced a trap composed of 5 places in 332 ms of which 1 ms to minimize.
[2024-05-31 20:15:56] [INFO ] Deduced a trap composed of 4 places in 320 ms of which 0 ms to minimize.
[2024-05-31 20:15:56] [INFO ] Deduced a trap composed of 4 places in 301 ms of which 1 ms to minimize.
[2024-05-31 20:15:57] [INFO ] Deduced a trap composed of 4 places in 308 ms of which 0 ms to minimize.
[2024-05-31 20:15:57] [INFO ] Deduced a trap composed of 4 places in 294 ms of which 0 ms to minimize.
[2024-05-31 20:15:57] [INFO ] Deduced a trap composed of 4 places in 313 ms of which 0 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1405 variables, 20/1671 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:15:58] [INFO ] Deduced a trap composed of 4 places in 330 ms of which 0 ms to minimize.
[2024-05-31 20:15:58] [INFO ] Deduced a trap composed of 4 places in 455 ms of which 1 ms to minimize.
[2024-05-31 20:15:59] [INFO ] Deduced a trap composed of 4 places in 424 ms of which 1 ms to minimize.
[2024-05-31 20:15:59] [INFO ] Deduced a trap composed of 4 places in 436 ms of which 0 ms to minimize.
[2024-05-31 20:16:00] [INFO ] Deduced a trap composed of 4 places in 411 ms of which 1 ms to minimize.
[2024-05-31 20:16:00] [INFO ] Deduced a trap composed of 4 places in 415 ms of which 1 ms to minimize.
[2024-05-31 20:16:00] [INFO ] Deduced a trap composed of 4 places in 404 ms of which 1 ms to minimize.
[2024-05-31 20:16:01] [INFO ] Deduced a trap composed of 4 places in 395 ms of which 0 ms to minimize.
[2024-05-31 20:16:01] [INFO ] Deduced a trap composed of 4 places in 385 ms of which 0 ms to minimize.
[2024-05-31 20:16:02] [INFO ] Deduced a trap composed of 4 places in 375 ms of which 1 ms to minimize.
[2024-05-31 20:16:02] [INFO ] Deduced a trap composed of 4 places in 366 ms of which 0 ms to minimize.
[2024-05-31 20:16:02] [INFO ] Deduced a trap composed of 4 places in 360 ms of which 0 ms to minimize.
[2024-05-31 20:16:03] [INFO ] Deduced a trap composed of 4 places in 350 ms of which 1 ms to minimize.
[2024-05-31 20:16:03] [INFO ] Deduced a trap composed of 4 places in 333 ms of which 0 ms to minimize.
[2024-05-31 20:16:04] [INFO ] Deduced a trap composed of 4 places in 331 ms of which 1 ms to minimize.
[2024-05-31 20:16:04] [INFO ] Deduced a trap composed of 4 places in 322 ms of which 1 ms to minimize.
[2024-05-31 20:16:04] [INFO ] Deduced a trap composed of 4 places in 343 ms of which 1 ms to minimize.
[2024-05-31 20:16:05] [INFO ] Deduced a trap composed of 4 places in 324 ms of which 1 ms to minimize.
[2024-05-31 20:16:05] [INFO ] Deduced a trap composed of 4 places in 319 ms of which 0 ms to minimize.
[2024-05-31 20:16:05] [INFO ] Deduced a trap composed of 4 places in 377 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1405 variables, 20/1691 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:16:06] [INFO ] Deduced a trap composed of 4 places in 367 ms of which 1 ms to minimize.
[2024-05-31 20:16:06] [INFO ] Deduced a trap composed of 4 places in 372 ms of which 0 ms to minimize.
[2024-05-31 20:16:07] [INFO ] Deduced a trap composed of 4 places in 370 ms of which 1 ms to minimize.
[2024-05-31 20:16:07] [INFO ] Deduced a trap composed of 4 places in 367 ms of which 0 ms to minimize.
[2024-05-31 20:16:07] [INFO ] Deduced a trap composed of 4 places in 369 ms of which 0 ms to minimize.
[2024-05-31 20:16:08] [INFO ] Deduced a trap composed of 4 places in 355 ms of which 1 ms to minimize.
[2024-05-31 20:16:08] [INFO ] Deduced a trap composed of 4 places in 367 ms of which 0 ms to minimize.
[2024-05-31 20:16:08] [INFO ] Deduced a trap composed of 4 places in 359 ms of which 1 ms to minimize.
[2024-05-31 20:16:09] [INFO ] Deduced a trap composed of 4 places in 345 ms of which 0 ms to minimize.
[2024-05-31 20:16:09] [INFO ] Deduced a trap composed of 4 places in 336 ms of which 0 ms to minimize.
[2024-05-31 20:16:10] [INFO ] Deduced a trap composed of 4 places in 345 ms of which 1 ms to minimize.
[2024-05-31 20:16:10] [INFO ] Deduced a trap composed of 4 places in 334 ms of which 1 ms to minimize.
[2024-05-31 20:16:10] [INFO ] Deduced a trap composed of 4 places in 346 ms of which 0 ms to minimize.
[2024-05-31 20:16:11] [INFO ] Deduced a trap composed of 4 places in 339 ms of which 1 ms to minimize.
[2024-05-31 20:16:11] [INFO ] Deduced a trap composed of 4 places in 388 ms of which 0 ms to minimize.
[2024-05-31 20:16:11] [INFO ] Deduced a trap composed of 5 places in 352 ms of which 0 ms to minimize.
[2024-05-31 20:16:12] [INFO ] Deduced a trap composed of 4 places in 327 ms of which 1 ms to minimize.
SMT process timed out in 46624ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 803 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 803/803 places, 40400/40400 transitions.
Applied a total of 0 rules in 1147 ms. Remains 803 /803 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1147 ms. Remains : 803/803 places, 40400/40400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 803/803 places, 40400/40400 transitions.
Applied a total of 0 rules in 1185 ms. Remains 803 /803 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2024-05-31 20:16:14] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-31 20:16:14] [INFO ] Invariant cache hit.
[2024-05-31 20:16:21] [INFO ] Implicit Places using invariants in 6786 ms returned [422, 753, 786]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 6818 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 800/803 places, 40400/40400 transitions.
Applied a total of 0 rules in 878 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 8885 ms. Remains : 800/803 places, 40400/40400 transitions.
RANDOM walk for 40000 steps (8 resets) in 3082 ms. (12 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 229 ms. (173 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 256074 steps, run timeout after 3001 ms. (steps per millisecond=85 ) properties seen :0 out of 1
Probabilistic random walk after 256074 steps, saw 246409 distinct states, run finished after 3001 ms. (steps per millisecond=85 ) properties seen :0
[2024-05-31 20:16:26] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
// Phase 1: matrix 800 rows 800 cols
[2024-05-31 20:16:26] [INFO ] Computed 400 invariants in 9 ms
[2024-05-31 20:16:26] [INFO ] State equation strengthened by 200 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 5/7 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:16:26] [INFO ] Deduced a trap composed of 4 places in 65 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/8 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/16 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/16 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 396/412 variables, 200/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/412 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 990/1402 variables, 594/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1402 variables, 594/1409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1402 variables, 198/1607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1402 variables, 0/1607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 198/1600 variables, 198/1805 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1600 variables, 198/2003 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1600 variables, 198/2201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1600 variables, 0/2201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1600 variables, 0/2201 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1600/1600 variables, and 2201 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1015 ms.
Refiners :[Domain max(s): 800/800 constraints, Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 800/800 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 5/7 variables, 3/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/7 variables, 5/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/7 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/8 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/8 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/16 variables, 8/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/16 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 396/412 variables, 200/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/412 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 990/1402 variables, 594/815 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1402 variables, 594/1409 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1402 variables, 198/1607 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1402 variables, 1/1608 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:16:28] [INFO ] Deduced a trap composed of 4 places in 652 ms of which 1 ms to minimize.
[2024-05-31 20:16:29] [INFO ] Deduced a trap composed of 4 places in 635 ms of which 1 ms to minimize.
[2024-05-31 20:16:30] [INFO ] Deduced a trap composed of 4 places in 677 ms of which 1 ms to minimize.
[2024-05-31 20:16:30] [INFO ] Deduced a trap composed of 4 places in 623 ms of which 1 ms to minimize.
[2024-05-31 20:16:31] [INFO ] Deduced a trap composed of 4 places in 656 ms of which 1 ms to minimize.
[2024-05-31 20:16:32] [INFO ] Deduced a trap composed of 4 places in 636 ms of which 1 ms to minimize.
[2024-05-31 20:16:32] [INFO ] Deduced a trap composed of 4 places in 591 ms of which 1 ms to minimize.
[2024-05-31 20:16:33] [INFO ] Deduced a trap composed of 4 places in 634 ms of which 1 ms to minimize.
[2024-05-31 20:16:34] [INFO ] Deduced a trap composed of 4 places in 616 ms of which 1 ms to minimize.
[2024-05-31 20:16:34] [INFO ] Deduced a trap composed of 4 places in 560 ms of which 1 ms to minimize.
[2024-05-31 20:16:35] [INFO ] Deduced a trap composed of 4 places in 584 ms of which 1 ms to minimize.
[2024-05-31 20:16:35] [INFO ] Deduced a trap composed of 4 places in 566 ms of which 1 ms to minimize.
[2024-05-31 20:16:36] [INFO ] Deduced a trap composed of 4 places in 586 ms of which 1 ms to minimize.
[2024-05-31 20:16:37] [INFO ] Deduced a trap composed of 4 places in 552 ms of which 1 ms to minimize.
[2024-05-31 20:16:37] [INFO ] Deduced a trap composed of 4 places in 524 ms of which 0 ms to minimize.
[2024-05-31 20:16:38] [INFO ] Deduced a trap composed of 4 places in 521 ms of which 1 ms to minimize.
[2024-05-31 20:16:38] [INFO ] Deduced a trap composed of 4 places in 506 ms of which 1 ms to minimize.
[2024-05-31 20:16:39] [INFO ] Deduced a trap composed of 4 places in 534 ms of which 1 ms to minimize.
[2024-05-31 20:16:39] [INFO ] Deduced a trap composed of 4 places in 521 ms of which 1 ms to minimize.
[2024-05-31 20:16:40] [INFO ] Deduced a trap composed of 4 places in 526 ms of which 1 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/1402 variables, 20/1628 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:16:40] [INFO ] Deduced a trap composed of 4 places in 480 ms of which 0 ms to minimize.
[2024-05-31 20:16:41] [INFO ] Deduced a trap composed of 4 places in 497 ms of which 1 ms to minimize.
[2024-05-31 20:16:41] [INFO ] Deduced a trap composed of 4 places in 503 ms of which 0 ms to minimize.
[2024-05-31 20:16:42] [INFO ] Deduced a trap composed of 4 places in 545 ms of which 1 ms to minimize.
[2024-05-31 20:16:43] [INFO ] Deduced a trap composed of 4 places in 525 ms of which 1 ms to minimize.
[2024-05-31 20:16:43] [INFO ] Deduced a trap composed of 4 places in 482 ms of which 1 ms to minimize.
[2024-05-31 20:16:44] [INFO ] Deduced a trap composed of 4 places in 508 ms of which 0 ms to minimize.
[2024-05-31 20:16:44] [INFO ] Deduced a trap composed of 4 places in 517 ms of which 1 ms to minimize.
[2024-05-31 20:16:45] [INFO ] Deduced a trap composed of 4 places in 493 ms of which 1 ms to minimize.
[2024-05-31 20:16:45] [INFO ] Deduced a trap composed of 4 places in 491 ms of which 1 ms to minimize.
[2024-05-31 20:16:46] [INFO ] Deduced a trap composed of 4 places in 462 ms of which 0 ms to minimize.
[2024-05-31 20:16:46] [INFO ] Deduced a trap composed of 4 places in 457 ms of which 0 ms to minimize.
[2024-05-31 20:16:47] [INFO ] Deduced a trap composed of 4 places in 441 ms of which 3 ms to minimize.
[2024-05-31 20:16:47] [INFO ] Deduced a trap composed of 4 places in 399 ms of which 1 ms to minimize.
[2024-05-31 20:16:48] [INFO ] Deduced a trap composed of 4 places in 435 ms of which 1 ms to minimize.
[2024-05-31 20:16:48] [INFO ] Deduced a trap composed of 4 places in 401 ms of which 1 ms to minimize.
[2024-05-31 20:16:48] [INFO ] Deduced a trap composed of 4 places in 411 ms of which 0 ms to minimize.
[2024-05-31 20:16:49] [INFO ] Deduced a trap composed of 4 places in 387 ms of which 0 ms to minimize.
[2024-05-31 20:16:49] [INFO ] Deduced a trap composed of 4 places in 396 ms of which 1 ms to minimize.
[2024-05-31 20:16:50] [INFO ] Deduced a trap composed of 4 places in 383 ms of which 0 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/1402 variables, 20/1648 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:16:50] [INFO ] Deduced a trap composed of 4 places in 379 ms of which 0 ms to minimize.
[2024-05-31 20:16:50] [INFO ] Deduced a trap composed of 4 places in 343 ms of which 0 ms to minimize.
[2024-05-31 20:16:51] [INFO ] Deduced a trap composed of 4 places in 345 ms of which 0 ms to minimize.
[2024-05-31 20:16:51] [INFO ] Deduced a trap composed of 4 places in 377 ms of which 1 ms to minimize.
[2024-05-31 20:16:52] [INFO ] Deduced a trap composed of 4 places in 379 ms of which 1 ms to minimize.
[2024-05-31 20:16:52] [INFO ] Deduced a trap composed of 4 places in 348 ms of which 0 ms to minimize.
[2024-05-31 20:16:52] [INFO ] Deduced a trap composed of 4 places in 330 ms of which 0 ms to minimize.
[2024-05-31 20:16:53] [INFO ] Deduced a trap composed of 4 places in 384 ms of which 1 ms to minimize.
[2024-05-31 20:16:53] [INFO ] Deduced a trap composed of 4 places in 361 ms of which 1 ms to minimize.
[2024-05-31 20:16:54] [INFO ] Deduced a trap composed of 4 places in 372 ms of which 1 ms to minimize.
[2024-05-31 20:16:54] [INFO ] Deduced a trap composed of 4 places in 367 ms of which 1 ms to minimize.
[2024-05-31 20:16:54] [INFO ] Deduced a trap composed of 4 places in 384 ms of which 0 ms to minimize.
[2024-05-31 20:16:55] [INFO ] Deduced a trap composed of 4 places in 354 ms of which 0 ms to minimize.
[2024-05-31 20:16:55] [INFO ] Deduced a trap composed of 4 places in 365 ms of which 0 ms to minimize.
[2024-05-31 20:16:56] [INFO ] Deduced a trap composed of 4 places in 349 ms of which 1 ms to minimize.
[2024-05-31 20:16:56] [INFO ] Deduced a trap composed of 4 places in 349 ms of which 0 ms to minimize.
[2024-05-31 20:16:56] [INFO ] Deduced a trap composed of 4 places in 360 ms of which 0 ms to minimize.
[2024-05-31 20:16:57] [INFO ] Deduced a trap composed of 4 places in 349 ms of which 0 ms to minimize.
[2024-05-31 20:16:57] [INFO ] Deduced a trap composed of 4 places in 342 ms of which 1 ms to minimize.
[2024-05-31 20:16:57] [INFO ] Deduced a trap composed of 4 places in 330 ms of which 1 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/1402 variables, 20/1668 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:16:58] [INFO ] Deduced a trap composed of 4 places in 298 ms of which 0 ms to minimize.
[2024-05-31 20:16:58] [INFO ] Deduced a trap composed of 4 places in 333 ms of which 1 ms to minimize.
[2024-05-31 20:16:58] [INFO ] Deduced a trap composed of 4 places in 306 ms of which 0 ms to minimize.
[2024-05-31 20:16:59] [INFO ] Deduced a trap composed of 4 places in 314 ms of which 0 ms to minimize.
[2024-05-31 20:16:59] [INFO ] Deduced a trap composed of 4 places in 376 ms of which 1 ms to minimize.
[2024-05-31 20:17:00] [INFO ] Deduced a trap composed of 4 places in 349 ms of which 1 ms to minimize.
[2024-05-31 20:17:00] [INFO ] Deduced a trap composed of 4 places in 340 ms of which 1 ms to minimize.
[2024-05-31 20:17:00] [INFO ] Deduced a trap composed of 4 places in 344 ms of which 1 ms to minimize.
[2024-05-31 20:17:01] [INFO ] Deduced a trap composed of 4 places in 338 ms of which 0 ms to minimize.
[2024-05-31 20:17:01] [INFO ] Deduced a trap composed of 4 places in 330 ms of which 0 ms to minimize.
[2024-05-31 20:17:01] [INFO ] Deduced a trap composed of 4 places in 314 ms of which 0 ms to minimize.
[2024-05-31 20:17:02] [INFO ] Deduced a trap composed of 4 places in 300 ms of which 0 ms to minimize.
[2024-05-31 20:17:02] [INFO ] Deduced a trap composed of 4 places in 297 ms of which 1 ms to minimize.
[2024-05-31 20:17:02] [INFO ] Deduced a trap composed of 4 places in 298 ms of which 1 ms to minimize.
[2024-05-31 20:17:03] [INFO ] Deduced a trap composed of 4 places in 310 ms of which 1 ms to minimize.
[2024-05-31 20:17:03] [INFO ] Deduced a trap composed of 4 places in 305 ms of which 0 ms to minimize.
[2024-05-31 20:17:03] [INFO ] Deduced a trap composed of 4 places in 291 ms of which 1 ms to minimize.
[2024-05-31 20:17:04] [INFO ] Deduced a trap composed of 4 places in 347 ms of which 1 ms to minimize.
[2024-05-31 20:17:04] [INFO ] Deduced a trap composed of 4 places in 335 ms of which 1 ms to minimize.
[2024-05-31 20:17:04] [INFO ] Deduced a trap composed of 4 places in 337 ms of which 1 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/1402 variables, 20/1688 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:17:05] [INFO ] Deduced a trap composed of 4 places in 322 ms of which 1 ms to minimize.
[2024-05-31 20:17:05] [INFO ] Deduced a trap composed of 4 places in 317 ms of which 0 ms to minimize.
[2024-05-31 20:17:06] [INFO ] Deduced a trap composed of 4 places in 331 ms of which 1 ms to minimize.
[2024-05-31 20:17:06] [INFO ] Deduced a trap composed of 4 places in 328 ms of which 0 ms to minimize.
[2024-05-31 20:17:06] [INFO ] Deduced a trap composed of 4 places in 312 ms of which 0 ms to minimize.
[2024-05-31 20:17:07] [INFO ] Deduced a trap composed of 4 places in 305 ms of which 1 ms to minimize.
[2024-05-31 20:17:07] [INFO ] Deduced a trap composed of 4 places in 307 ms of which 0 ms to minimize.
[2024-05-31 20:17:07] [INFO ] Deduced a trap composed of 4 places in 305 ms of which 1 ms to minimize.
[2024-05-31 20:17:08] [INFO ] Deduced a trap composed of 4 places in 290 ms of which 1 ms to minimize.
[2024-05-31 20:17:08] [INFO ] Deduced a trap composed of 4 places in 301 ms of which 0 ms to minimize.
[2024-05-31 20:17:08] [INFO ] Deduced a trap composed of 4 places in 286 ms of which 1 ms to minimize.
[2024-05-31 20:17:09] [INFO ] Deduced a trap composed of 4 places in 345 ms of which 1 ms to minimize.
[2024-05-31 20:17:09] [INFO ] Deduced a trap composed of 4 places in 336 ms of which 1 ms to minimize.
[2024-05-31 20:17:09] [INFO ] Deduced a trap composed of 4 places in 323 ms of which 0 ms to minimize.
[2024-05-31 20:17:10] [INFO ] Deduced a trap composed of 4 places in 306 ms of which 0 ms to minimize.
[2024-05-31 20:17:10] [INFO ] Deduced a trap composed of 4 places in 319 ms of which 1 ms to minimize.
[2024-05-31 20:17:10] [INFO ] Deduced a trap composed of 4 places in 308 ms of which 1 ms to minimize.
[2024-05-31 20:17:11] [INFO ] Deduced a trap composed of 4 places in 343 ms of which 1 ms to minimize.
[2024-05-31 20:17:11] [INFO ] Deduced a trap composed of 4 places in 319 ms of which 0 ms to minimize.
[2024-05-31 20:17:11] [INFO ] Deduced a trap composed of 4 places in 306 ms of which 1 ms to minimize.
At refinement iteration 21 (INCLUDED_ONLY) 0/1402 variables, 20/1708 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:17:12] [INFO ] Deduced a trap composed of 4 places in 309 ms of which 0 ms to minimize.
[2024-05-31 20:17:12] [INFO ] Deduced a trap composed of 4 places in 305 ms of which 0 ms to minimize.
[2024-05-31 20:17:12] [INFO ] Deduced a trap composed of 4 places in 296 ms of which 0 ms to minimize.
[2024-05-31 20:17:13] [INFO ] Deduced a trap composed of 4 places in 290 ms of which 0 ms to minimize.
[2024-05-31 20:17:13] [INFO ] Deduced a trap composed of 4 places in 276 ms of which 0 ms to minimize.
[2024-05-31 20:17:13] [INFO ] Deduced a trap composed of 4 places in 281 ms of which 1 ms to minimize.
[2024-05-31 20:17:14] [INFO ] Deduced a trap composed of 4 places in 278 ms of which 0 ms to minimize.
[2024-05-31 20:17:14] [INFO ] Deduced a trap composed of 4 places in 284 ms of which 1 ms to minimize.
[2024-05-31 20:17:14] [INFO ] Deduced a trap composed of 4 places in 292 ms of which 0 ms to minimize.
[2024-05-31 20:17:14] [INFO ] Deduced a trap composed of 4 places in 277 ms of which 1 ms to minimize.
[2024-05-31 20:17:15] [INFO ] Deduced a trap composed of 4 places in 258 ms of which 0 ms to minimize.
[2024-05-31 20:17:15] [INFO ] Deduced a trap composed of 4 places in 266 ms of which 0 ms to minimize.
[2024-05-31 20:17:15] [INFO ] Deduced a trap composed of 4 places in 278 ms of which 0 ms to minimize.
[2024-05-31 20:17:16] [INFO ] Deduced a trap composed of 4 places in 263 ms of which 1 ms to minimize.
[2024-05-31 20:17:16] [INFO ] Deduced a trap composed of 4 places in 256 ms of which 1 ms to minimize.
[2024-05-31 20:17:16] [INFO ] Deduced a trap composed of 4 places in 248 ms of which 1 ms to minimize.
[2024-05-31 20:17:16] [INFO ] Deduced a trap composed of 4 places in 241 ms of which 0 ms to minimize.
[2024-05-31 20:17:17] [INFO ] Deduced a trap composed of 4 places in 239 ms of which 0 ms to minimize.
[2024-05-31 20:17:17] [INFO ] Deduced a trap composed of 4 places in 226 ms of which 1 ms to minimize.
[2024-05-31 20:17:17] [INFO ] Deduced a trap composed of 4 places in 278 ms of which 0 ms to minimize.
At refinement iteration 22 (INCLUDED_ONLY) 0/1402 variables, 20/1728 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:17:18] [INFO ] Deduced a trap composed of 4 places in 266 ms of which 0 ms to minimize.
[2024-05-31 20:17:18] [INFO ] Deduced a trap composed of 4 places in 275 ms of which 1 ms to minimize.
[2024-05-31 20:17:18] [INFO ] Deduced a trap composed of 4 places in 267 ms of which 2 ms to minimize.
[2024-05-31 20:17:19] [INFO ] Deduced a trap composed of 4 places in 262 ms of which 0 ms to minimize.
[2024-05-31 20:17:19] [INFO ] Deduced a trap composed of 4 places in 249 ms of which 0 ms to minimize.
[2024-05-31 20:17:19] [INFO ] Deduced a trap composed of 4 places in 241 ms of which 0 ms to minimize.
[2024-05-31 20:17:19] [INFO ] Deduced a trap composed of 4 places in 234 ms of which 0 ms to minimize.
[2024-05-31 20:17:20] [INFO ] Deduced a trap composed of 4 places in 231 ms of which 0 ms to minimize.
[2024-05-31 20:17:20] [INFO ] Deduced a trap composed of 4 places in 227 ms of which 1 ms to minimize.
[2024-05-31 20:17:20] [INFO ] Deduced a trap composed of 4 places in 220 ms of which 0 ms to minimize.
[2024-05-31 20:17:20] [INFO ] Deduced a trap composed of 4 places in 215 ms of which 1 ms to minimize.
[2024-05-31 20:17:21] [INFO ] Deduced a trap composed of 4 places in 210 ms of which 1 ms to minimize.
[2024-05-31 20:17:21] [INFO ] Deduced a trap composed of 4 places in 197 ms of which 1 ms to minimize.
[2024-05-31 20:17:21] [INFO ] Deduced a trap composed of 4 places in 265 ms of which 0 ms to minimize.
[2024-05-31 20:17:21] [INFO ] Deduced a trap composed of 4 places in 262 ms of which 1 ms to minimize.
[2024-05-31 20:17:22] [INFO ] Deduced a trap composed of 4 places in 253 ms of which 0 ms to minimize.
[2024-05-31 20:17:22] [INFO ] Deduced a trap composed of 4 places in 244 ms of which 1 ms to minimize.
[2024-05-31 20:17:22] [INFO ] Deduced a trap composed of 4 places in 223 ms of which 1 ms to minimize.
[2024-05-31 20:17:22] [INFO ] Deduced a trap composed of 4 places in 236 ms of which 0 ms to minimize.
[2024-05-31 20:17:23] [INFO ] Deduced a trap composed of 4 places in 222 ms of which 3 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/1402 variables, 20/1748 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-31 20:17:23] [INFO ] Deduced a trap composed of 4 places in 255 ms of which 0 ms to minimize.
[2024-05-31 20:17:23] [INFO ] Deduced a trap composed of 4 places in 242 ms of which 0 ms to minimize.
[2024-05-31 20:17:23] [INFO ] Deduced a trap composed of 4 places in 254 ms of which 1 ms to minimize.
[2024-05-31 20:17:24] [INFO ] Deduced a trap composed of 4 places in 257 ms of which 1 ms to minimize.
[2024-05-31 20:17:24] [INFO ] Deduced a trap composed of 4 places in 247 ms of which 0 ms to minimize.
[2024-05-31 20:17:24] [INFO ] Deduced a trap composed of 4 places in 237 ms of which 1 ms to minimize.
[2024-05-31 20:17:25] [INFO ] Deduced a trap composed of 4 places in 239 ms of which 2 ms to minimize.
[2024-05-31 20:17:25] [INFO ] Deduced a trap composed of 4 places in 227 ms of which 0 ms to minimize.
[2024-05-31 20:17:25] [INFO ] Deduced a trap composed of 4 places in 211 ms of which 0 ms to minimize.
[2024-05-31 20:17:25] [INFO ] Deduced a trap composed of 4 places in 202 ms of which 1 ms to minimize.
[2024-05-31 20:17:26] [INFO ] Deduced a trap composed of 4 places in 200 ms of which 0 ms to minimize.
[2024-05-31 20:17:26] [INFO ] Deduced a trap composed of 4 places in 225 ms of which 1 ms to minimize.
[2024-05-31 20:17:26] [INFO ] Deduced a trap composed of 4 places in 218 ms of which 1 ms to minimize.
[2024-05-31 20:17:26] [INFO ] Deduced a trap composed of 4 places in 206 ms of which 0 ms to minimize.
[2024-05-31 20:17:26] [INFO ] Deduced a trap composed of 4 places in 194 ms of which 0 ms to minimize.
At refinement iteration 24 (INCLUDED_ONLY) 0/1402 variables, 15/1763 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1402 variables, 0/1763 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 198/1600 variables, 198/1961 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/1600 variables, 198/2159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/1600 variables, 198/2357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/1600 variables, 0/2357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (OVERLAPS) 0/1600 variables, 0/2357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1600/1600 variables, and 2357 constraints, problems are : Problem set: 0 solved, 1 unsolved in 60407 ms.
Refiners :[Domain max(s): 800/800 constraints, Positive P Invariants (semi-flows): 400/400 constraints, State Equation: 800/800 constraints, ReadFeed: 200/200 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 156/156 constraints]
After SMT, in 61663ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 2705 ms.
Support contains 2 out of 800 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 800/800 places, 40400/40400 transitions.
Applied a total of 0 rules in 875 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 876 ms. Remains : 800/800 places, 40400/40400 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 800/800 places, 40400/40400 transitions.
Applied a total of 0 rules in 885 ms. Remains 800 /800 variables (removed 0) and now considering 40400/40400 (removed 0) transitions.
[2024-05-31 20:17:32] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-31 20:17:32] [INFO ] Invariant cache hit.
[2024-05-31 20:17:38] [INFO ] Implicit Places using invariants in 6246 ms returned []
Implicit Place search using SMT only with invariants took 6248 ms to find 0 implicit places.
Running 40200 sub problems to find dead transitions.
[2024-05-31 20:17:39] [INFO ] Flow matrix only has 800 transitions (discarded 39600 similar events)
[2024-05-31 20:17:39] [INFO ] Invariant cache hit.
[2024-05-31 20:17:39] [INFO ] State equation strengthened by 200 read => feed constraints.
Could not compute solution for formula : Dekker-PT-200-LTLCardinality-00
FORMULA Dekker-PT-200-LTLCardinality-01 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : Dekker-PT-200-LTLCardinality-02
Could not compute solution for formula : Dekker-PT-200-LTLCardinality-03
FORMULA Dekker-PT-200-LTLCardinality-04 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Dekker-PT-200-LTLCardinality-05 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : Dekker-PT-200-LTLCardinality-06
FORMULA Dekker-PT-200-LTLCardinality-07 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Dekker-PT-200-LTLCardinality-08 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Dekker-PT-200-LTLCardinality-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Dekker-PT-200-LTLCardinality-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Dekker-PT-200-LTLCardinality-11 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Dekker-PT-200-LTLCardinality-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : Dekker-PT-200-LTLCardinality-13
FORMULA Dekker-PT-200-LTLCardinality-14 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA Dekker-PT-200-LTLCardinality-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717187193192

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name Dekker-PT-200-LTLCardinality-00
ltl formula formula --ltl=/tmp/1337/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1000 places, 40400 transitions and 320400 arcs
pnml2lts-mc( 0/ 4): Petri net Dekker-PT-200 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 8.460 real 1.770 user 1.650 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1337/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1337/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1337/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1337/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1002 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1001, there are 40403 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~2500 levels ~10000 states ~2608336 transitions
pnml2lts-mc( 2/ 4): ~5000 levels ~20000 states ~5363880 transitions
pnml2lts-mc( 2/ 4): ~10000 levels ~40000 states ~11258760 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 35058
pnml2lts-mc( 0/ 4): unique transitions count: 9948808
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1196784
pnml2lts-mc( 0/ 4): - claim success count: 35061
pnml2lts-mc( 0/ 4): - cum. max stack depth: 35061
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 35061 states 9949058 transitions, fanout: 283.764
pnml2lts-mc( 0/ 4): Total exploration time 67.930 sec (66.810 sec minimum, 67.228 sec on average)
pnml2lts-mc( 0/ 4): States per second: 516, Transitions per second: 146460
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 114.2MB, 18.2 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 19.0%/100.0%
pnml2lts-mc( 0/ 4): Stored 41425 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 3MB
pnml2lts-mc( 0/ 4): Est. total memory use: 117.2MB (~259.0MB paged-in)
ltl formula name Dekker-PT-200-LTLCardinality-01
ltl formula formula --ltl=/tmp/1337/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1000 places, 40400 transitions and 320400 arcs
pnml2lts-mc( 0/ 4): Petri net Dekker-PT-200 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 8.160 real 1.820 user 1.380 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1337/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1337/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1337/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1337/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 1001 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1001, there are 40411 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~3!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 7
pnml2lts-mc( 0/ 4): unique transitions count: 1600
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 10
pnml2lts-mc( 0/ 4): - cum. max stack depth: 10
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 10 states 2804 transitions, fanout: 280.400
pnml2lts-mc( 0/ 4): Total exploration time 0.050 sec (0.030 sec minimum, 0.045 sec on average)
pnml2lts-mc( 0/ 4): States per second: 200, Transitions per second: 56080
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 38.8 B/state, compr.: 1.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 41425 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 3MB
pnml2lts-mc( 0/ 4): Est. total memory use: 3.1MB (~259.0MB paged-in)
ltl formula name Dekker-PT-200-LTLCardinality-02
ltl formula formula --ltl=/tmp/1337/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1000 places, 40400 transitions and 320400 arcs
pnml2lts-mc( 0/ 4): Petri net Dekker-PT-200 analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1337/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1337/ltl_2_
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 8.470 real 1.800 user 1.660 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1337/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1337/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1002 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1001, there are 40403 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~2500 levels ~10000 states ~2517104 transitions
pnml2lts-mc( 3/ 4): ~5000 levels ~20000 states ~6791976 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 30848
pnml2lts-mc( 0/ 4): unique transitions count: 9546688
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1005203
pnml2lts-mc( 0/ 4): - claim success count: 30851
pnml2lts-mc( 0/ 4): - cum. max stack depth: 30851
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 30851 states 9546766 transitions, fanout: 309.448
pnml2lts-mc( 0/ 4): Total exploration time 59.910 sec (58.800 sec minimum, 59.283 sec on average)
pnml2lts-mc( 0/ 4): States per second: 515, Transitions per second: 159352
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 108.2MB, 19.6 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 17.0%/100.0%
pnml2lts-mc( 0/ 4): Stored 41425 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 3MB
pnml2lts-mc( 0/ 4): Est. total memory use: 111.2MB (~259.0MB paged-in)
ltl formula name Dekker-PT-200-LTLCardinality-03
ltl formula formula --ltl=/tmp/1337/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1000 places, 40400 transitions and 320400 arcs
pnml2lts-mc( 0/ 4): Petri net Dekker-PT-200 analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1337/ltl_3_
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 8.580 real 1.780 user 1.550 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1337/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1337/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1337/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 1001 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1001, there are 40404 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4): ~2500 levels ~10000 states ~3937552 transitions
pnml2lts-mc( 1/ 4): ~5000 levels ~20000 states ~5287572 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 32900
pnml2lts-mc( 0/ 4): unique transitions count: 10280034
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1130098
pnml2lts-mc( 0/ 4): - claim success count: 32903
pnml2lts-mc( 0/ 4): - cum. max stack depth: 32903
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 32903 states 10280356 transitions, fanout: 312.444
pnml2lts-mc( 0/ 4): Total exploration time 62.390 sec (61.650 sec minimum, 61.930 sec on average)
pnml2lts-mc( 0/ 4): States per second: 527, Transitions per second: 164776
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 111.1MB, 18.9 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 18.0%/100.0%
pnml2lts-mc( 0/ 4): Stored 41425 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 3MB
pnml2lts-mc( 0/ 4): Est. total memory use: 114.1MB (~259.0MB paged-in)
ltl formula name Dekker-PT-200-LTLCardinality-04
ltl formula formula --ltl=/tmp/1337/ltl_4_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1000 places, 40400 transitions and 320400 arcs
pnml2lts-mc( 0/ 4): Petri net Dekker-PT-200 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 8.270 real 1.760 user 1.790 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1337/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1337/ltl_4_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1337/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1337/ltl_4_
pnml2lts-mc( 0/ 4): There are 1001 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1001, there are 40407 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~4!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 11
pnml2lts-mc( 0/ 4): unique transitions count: 3406
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 14
pnml2lts-mc( 0/ 4): - cum. max stack depth: 14
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 14 states 4010 transitions, fanout: 286.429
pnml2lts-mc( 0/ 4): Total exploration time 0.050 sec (0.040 sec minimum, 0.045 sec on average)
pnml2lts-mc( 0/ 4): States per second: 280, Transitions per second: 80200
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 39.0 B/state, compr.: 1.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 41425 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 3MB
pnml2lts-mc( 0/ 4): Est. total memory use: 3.1MB (~259.0MB paged-in)
ltl formula name Dekker-PT-200-LTLCardinality-05
ltl formula formula --ltl=/tmp/1337/ltl_5_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1000 places, 40400 transitions and 320400 arcs
pnml2lts-mc( 0/ 4): Petri net Dekker-PT-200 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 8.310 real 1.740 user 1.380 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1337/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1337/ltl_5_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1337/ltl_5_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1337/ltl_5_
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1002 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1001, there are 40412 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~7!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 19
pnml2lts-mc( 0/ 4): unique transitions count: 4498
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 22
pnml2lts-mc( 0/ 4): - cum. max stack depth: 22
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 22 states 5102 transitions, fanout: 231.909
pnml2lts-mc( 0/ 4): Total exploration time 0.080 sec (0.050 sec minimum, 0.067 sec on average)
pnml2lts-mc( 0/ 4): States per second: 275, Transitions per second: 63775
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 41.1 B/state, compr.: 1.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 41425 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 3MB
pnml2lts-mc( 0/ 4): Est. total memory use: 3.1MB (~259.0MB paged-in)
ltl formula name Dekker-PT-200-LTLCardinality-06
ltl formula formula --ltl=/tmp/1337/ltl_6_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1000 places, 40400 transitions and 320400 arcs
pnml2lts-mc( 0/ 4): Petri net Dekker-PT-200 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 7.850 real 1.600 user 1.690 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1337/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1337/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1337/ltl_6_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1337/ltl_6_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 1001 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1001, there are 40412 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4): ~2500 levels ~10000 states ~2545980 transitions
pnml2lts-mc( 1/ 4): ~5000 levels ~20000 states ~5227756 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 30312
pnml2lts-mc( 0/ 4): unique transitions count: 8614500
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 909174
pnml2lts-mc( 0/ 4): - claim success count: 30315
pnml2lts-mc( 0/ 4): - cum. max stack depth: 30315
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 30315 states 8614651 transitions, fanout: 284.171
pnml2lts-mc( 0/ 4): Total exploration time 44.420 sec (43.550 sec minimum, 44.053 sec on average)
pnml2lts-mc( 0/ 4): States per second: 682, Transitions per second: 193936
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 107.5MB, 19.8 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 16.0%/100.0%
pnml2lts-mc( 0/ 4): Stored 41425 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 3MB
pnml2lts-mc( 0/ 4): Est. total memory use: 110.5MB (~259.0MB paged-in)
ltl formula name Dekker-PT-200-LTLCardinality-07
ltl formula formula --ltl=/tmp/1337/ltl_7_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1000 places, 40400 transitions and 320400 arcs
pnml2lts-mc( 0/ 4): Petri net Dekker-PT-200 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 4.340 real 1.850 user 1.390 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1337/ltl_7_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1337/ltl_7_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1337/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1337/ltl_7_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 1001 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1001, there are 40404 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~12!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 48
pnml2lts-mc( 0/ 4): unique transitions count: 10492
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 161
pnml2lts-mc( 0/ 4): - claim success count: 51
pnml2lts-mc( 0/ 4): - cum. max stack depth: 51
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 51 states 11096 transitions, fanout: 217.569
pnml2lts-mc( 0/ 4): Total exploration time 0.160 sec (0.150 sec minimum, 0.155 sec on average)
pnml2lts-mc( 0/ 4): States per second: 319, Transitions per second: 69350
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.3MB, 33.4 B/state, compr.: 0.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 41425 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 3MB
pnml2lts-mc( 0/ 4): Est. total memory use: 3.3MB (~259.0MB paged-in)
ltl formula name Dekker-PT-200-LTLCardinality-08
ltl formula formula --ltl=/tmp/1337/ltl_8_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1000 places, 40400 transitions and 320400 arcs
pnml2lts-mc( 0/ 4): Petri net Dekker-PT-200 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 4.560 real 1.690 user 1.300 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1337/ltl_8_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1337/ltl_8_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1337/ltl_8_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1337/ltl_8_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1002 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1001, there are 40411 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 201
pnml2lts-mc( 0/ 4): unique states count: 201
pnml2lts-mc( 0/ 4): unique transitions count: 200
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 493
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 218
pnml2lts-mc( 0/ 4): - cum. max stack depth: 8
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 218 states 804 transitions, fanout: 3.688
pnml2lts-mc( 0/ 4): Total exploration time 0.270 sec (0.260 sec minimum, 0.262 sec on average)
pnml2lts-mc( 0/ 4): States per second: 807, Transitions per second: 2978
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 63.0 B/state, compr.: 1.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 41425 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 3MB
pnml2lts-mc( 0/ 4): Est. total memory use: 3.0MB (~259.0MB paged-in)
ltl formula name Dekker-PT-200-LTLCardinality-09
ltl formula formula --ltl=/tmp/1337/ltl_9_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1000 places, 40400 transitions and 320400 arcs
pnml2lts-mc( 0/ 4): Petri net Dekker-PT-200 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 4.320 real 1.830 user 1.430 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1337/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1337/ltl_9_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1337/ltl_9_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1337/ltl_9_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1002 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1001, there are 40405 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~3!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 9
pnml2lts-mc( 0/ 4): unique transitions count: 1800
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 12
pnml2lts-mc( 0/ 4): - cum. max stack depth: 12
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 12 states 2404 transitions, fanout: 200.333
pnml2lts-mc( 0/ 4): Total exploration time 0.040 sec (0.030 sec minimum, 0.032 sec on average)
pnml2lts-mc( 0/ 4): States per second: 300, Transitions per second: 60100
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 39.7 B/state, compr.: 1.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 41425 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 3MB
pnml2lts-mc( 0/ 4): Est. total memory use: 3.1MB (~259.0MB paged-in)
ltl formula name Dekker-PT-200-LTLCardinality-10
ltl formula formula --ltl=/tmp/1337/ltl_10_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1000 places, 40400 transitions and 320400 arcs
pnml2lts-mc( 0/ 4): Petri net Dekker-PT-200 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 4.460 real 1.740 user 1.280 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1337/ltl_10_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1337/ltl_10_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1337/ltl_10_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1337/ltl_10_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1002 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1001, there are 40403 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~4!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 10
pnml2lts-mc( 0/ 4): unique transitions count: 2003
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 13
pnml2lts-mc( 0/ 4): - cum. max stack depth: 13
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 13 states 2607 transitions, fanout: 200.538
pnml2lts-mc( 0/ 4): Total exploration time 0.050 sec (0.030 sec minimum, 0.043 sec on average)
pnml2lts-mc( 0/ 4): States per second: 260, Transitions per second: 52140
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 41.5 B/state, compr.: 1.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 41425 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 3MB
pnml2lts-mc( 0/ 4): Est. total memory use: 3.1MB (~259.0MB paged-in)
ltl formula name Dekker-PT-200-LTLCardinality-11
ltl formula formula --ltl=/tmp/1337/ltl_11_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1000 places, 40400 transitions and 320400 arcs
pnml2lts-mc( 0/ 4): Petri net Dekker-PT-200 analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1337/ltl_11_
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 7.940 real 1.750 user 1.620 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1337/ltl_11_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1337/ltl_11_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1337/ltl_11_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1002 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1001, there are 40403 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~4!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 398
pnml2lts-mc( 0/ 4): unique states count: 408
pnml2lts-mc( 0/ 4): unique transitions count: 1403
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 1
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 411
pnml2lts-mc( 0/ 4): - cum. max stack depth: 13
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 411 states 2007 transitions, fanout: 4.883
pnml2lts-mc( 0/ 4): Total exploration time 0.710 sec (0.680 sec minimum, 0.702 sec on average)
pnml2lts-mc( 0/ 4): States per second: 579, Transitions per second: 2827
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 42.3 B/state, compr.: 1.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 41425 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 3MB
pnml2lts-mc( 0/ 4): Est. total memory use: 3.1MB (~259.0MB paged-in)
ltl formula name Dekker-PT-200-LTLCardinality-12
ltl formula formula --ltl=/tmp/1337/ltl_12_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1000 places, 40400 transitions and 320400 arcs
pnml2lts-mc( 0/ 4): Petri net Dekker-PT-200 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 7.360 real 1.770 user 1.500 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1337/ltl_12_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1337/ltl_12_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1337/ltl_12_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1337/ltl_12_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1002 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1001, there are 40407 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~4!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 10
pnml2lts-mc( 0/ 4): unique transitions count: 2006
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 13
pnml2lts-mc( 0/ 4): - cum. max stack depth: 13
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 13 states 2610 transitions, fanout: 200.769
pnml2lts-mc( 0/ 4): Total exploration time 0.050 sec (0.040 sec minimum, 0.042 sec on average)
pnml2lts-mc( 0/ 4): States per second: 260, Transitions per second: 52200
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 41.3 B/state, compr.: 1.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 41425 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 3MB
pnml2lts-mc( 0/ 4): Est. total memory use: 3.1MB (~259.0MB paged-in)
ltl formula name Dekker-PT-200-LTLCardinality-13
ltl formula formula --ltl=/tmp/1337/ltl_13_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1000 places, 40400 transitions and 320400 arcs
pnml2lts-mc( 0/ 4): Petri net Dekker-PT-200 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 4.620 real 1.650 user 1.350 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1337/ltl_13_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1337/ltl_13_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1337/ltl_13_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1337/ltl_13_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): There are 1001 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1001, there are 40410 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~2500 levels ~10000 states ~2984896 transitions
pnml2lts-mc( 0/ 4): ~5000 levels ~20000 states ~5958728 transitions
pnml2lts-mc( 0/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 27201
pnml2lts-mc( 0/ 4): unique transitions count: 7976770
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 856073
pnml2lts-mc( 0/ 4): - claim success count: 27205
pnml2lts-mc( 0/ 4): - cum. max stack depth: 27205
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 27205 states 7977273 transitions, fanout: 293.228
pnml2lts-mc( 0/ 4): Total exploration time 38.840 sec (38.090 sec minimum, 38.432 sec on average)
pnml2lts-mc( 0/ 4): States per second: 700, Transitions per second: 205388
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 103.0MB, 21.1 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 15.0%/100.0%
pnml2lts-mc( 0/ 4): Stored 41425 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 3MB
pnml2lts-mc( 0/ 4): Est. total memory use: 106.0MB (~259.0MB paged-in)
ltl formula name Dekker-PT-200-LTLCardinality-14
ltl formula formula --ltl=/tmp/1337/ltl_14_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1000 places, 40400 transitions and 320400 arcs
pnml2lts-mc( 0/ 4): Petri net Dekker-PT-200 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 4.480 real 1.690 user 1.310 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1337/ltl_14_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1337/ltl_14_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1337/ltl_14_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1337/ltl_14_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1002 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1001, there are 40405 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~5!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 17
pnml2lts-mc( 0/ 4): unique transitions count: 3444
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 20
pnml2lts-mc( 0/ 4): - cum. max stack depth: 20
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 20 states 4048 transitions, fanout: 202.400
pnml2lts-mc( 0/ 4): Total exploration time 0.060 sec (0.060 sec minimum, 0.060 sec on average)
pnml2lts-mc( 0/ 4): States per second: 333, Transitions per second: 67467
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 38.6 B/state, compr.: 1.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 41425 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 3MB
pnml2lts-mc( 0/ 4): Est. total memory use: 3.1MB (~259.0MB paged-in)
ltl formula name Dekker-PT-200-LTLCardinality-15
ltl formula formula --ltl=/tmp/1337/ltl_15_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 1000 places, 40400 transitions and 320400 arcs
pnml2lts-mc( 0/ 4): Petri net Dekker-PT-200 analyzed
pnml2lts-mc( 0/ 4): There are safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 4.250 real 1.880 user 1.290 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1337/ltl_15_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1337/ltl_15_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1337/ltl_15_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1337/ltl_15_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 1002 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 1001, there are 40405 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 2/ 4): Accepting cycle FOUND at depth ~3!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 9
pnml2lts-mc( 0/ 4): unique transitions count: 1800
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 1
pnml2lts-mc( 0/ 4): - claim success count: 12
pnml2lts-mc( 0/ 4): - cum. max stack depth: 12
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 12 states 2404 transitions, fanout: 200.333
pnml2lts-mc( 0/ 4): Total exploration time 0.040 sec (0.030 sec minimum, 0.032 sec on average)
pnml2lts-mc( 0/ 4): States per second: 300, Transitions per second: 60100
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 39.6 B/state, compr.: 1.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 41425 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 3MB
pnml2lts-mc( 0/ 4): Est. total memory use: 3.1MB (~259.0MB paged-in)

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="Dekker-PT-200"
export BK_EXAMINATION="LTLCardinality"
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 Dekker-PT-200, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r488-tall-171631132000123"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-200.tgz
mv Dekker-PT-200 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;