Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r472-tajo-171620399500419.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is BugTracking-PT-q8m032, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399500419
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 9.4K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 83K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 46K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K May 19 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 22 14:30 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 22 14:30 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 41K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 16M May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME BugTracking-PT-q8m032-LTLCardinality-00
FORMULA_NAME BugTracking-PT-q8m032-LTLCardinality-01
FORMULA_NAME BugTracking-PT-q8m032-LTLCardinality-02
FORMULA_NAME BugTracking-PT-q8m032-LTLCardinality-03
FORMULA_NAME BugTracking-PT-q8m032-LTLCardinality-04
FORMULA_NAME BugTracking-PT-q8m032-LTLCardinality-05
FORMULA_NAME BugTracking-PT-q8m032-LTLCardinality-06
FORMULA_NAME BugTracking-PT-q8m032-LTLCardinality-07
FORMULA_NAME BugTracking-PT-q8m032-LTLCardinality-08
FORMULA_NAME BugTracking-PT-q8m032-LTLCardinality-09
FORMULA_NAME BugTracking-PT-q8m032-LTLCardinality-10
FORMULA_NAME BugTracking-PT-q8m032-LTLCardinality-11
FORMULA_NAME BugTracking-PT-q8m032-LTLCardinality-12
FORMULA_NAME BugTracking-PT-q8m032-LTLCardinality-13
FORMULA_NAME BugTracking-PT-q8m032-LTLCardinality-14
FORMULA_NAME BugTracking-PT-q8m032-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717224342501

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m032
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:45:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 06:45:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:45:45] [INFO ] Load time of PNML (sax parser for PT used): 846 ms
[2024-06-01 06:45:45] [INFO ] Transformed 754 places.
[2024-06-01 06:45:45] [INFO ] Transformed 27370 transitions.
[2024-06-01 06:45:45] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1091 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 474 places in 99 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m032-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m032-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 7 out of 280 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 280/280 places, 3904/3904 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 278 transition count 3904
Applied a total of 2 rules in 80 ms. Remains 278 /280 variables (removed 2) and now considering 3904/3904 (removed 0) transitions.
[2024-06-01 06:45:45] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 278 cols
[2024-06-01 06:45:45] [INFO ] Computed 8 invariants in 49 ms
[2024-06-01 06:45:46] [INFO ] Implicit Places using invariants in 871 ms returned []
[2024-06-01 06:45:46] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
[2024-06-01 06:45:46] [INFO ] Invariant cache hit.
[2024-06-01 06:45:47] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-06-01 06:45:49] [INFO ] Implicit Places using invariants and state equation in 3159 ms returned []
Implicit Place search using SMT with State Equation took 4068 ms to find 0 implicit places.
Running 3902 sub problems to find dead transitions.
[2024-06-01 06:45:50] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
[2024-06-01 06:45:50] [INFO ] Invariant cache hit.
[2024-06-01 06:45:50] [INFO ] State equation strengthened by 303 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3902 unsolved
[2024-06-01 06:46:56] [INFO ] Deduced a trap composed of 10 places in 318 ms of which 15 ms to minimize.
[2024-06-01 06:46:56] [INFO ] Deduced a trap composed of 18 places in 251 ms of which 2 ms to minimize.
[2024-06-01 06:46:56] [INFO ] Deduced a trap composed of 14 places in 227 ms of which 1 ms to minimize.
[2024-06-01 06:46:56] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 277/4007 variables, and 12 constraints, problems are : Problem set: 0 solved, 3902 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/278 constraints, ReadFeed: 0/303 constraints, PredecessorRefiner: 3902/2705 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3902 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 3902 unsolved
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Problem TDEAD2782 is UNSAT
Problem TDEAD2783 is UNSAT
Problem TDEAD2784 is UNSAT
Problem TDEAD2785 is UNSAT
Problem TDEAD2786 is UNSAT
Problem TDEAD2787 is UNSAT
Problem TDEAD2788 is UNSAT
Problem TDEAD2789 is UNSAT
Problem TDEAD2794 is UNSAT
Problem TDEAD2795 is UNSAT
Problem TDEAD2796 is UNSAT
Problem TDEAD2797 is UNSAT
Problem TDEAD2798 is UNSAT
Problem TDEAD2799 is UNSAT
Problem TDEAD2800 is UNSAT
Problem TDEAD2801 is UNSAT
Problem TDEAD2802 is UNSAT
Problem TDEAD2803 is UNSAT
Problem TDEAD2804 is UNSAT
Problem TDEAD2805 is UNSAT
Problem TDEAD3740 is UNSAT
Problem TDEAD3741 is UNSAT
Problem TDEAD3742 is UNSAT
Problem TDEAD3743 is UNSAT
Problem TDEAD3749 is UNSAT
Problem TDEAD3750 is UNSAT
Problem TDEAD3751 is UNSAT
Problem TDEAD3752 is UNSAT
Problem TDEAD3753 is UNSAT
Problem TDEAD3754 is UNSAT
Problem TDEAD3755 is UNSAT
Problem TDEAD3756 is UNSAT
Problem TDEAD3757 is UNSAT
Problem TDEAD3758 is UNSAT
Problem TDEAD3759 is UNSAT
Problem TDEAD3764 is UNSAT
Problem TDEAD3769 is UNSAT
Problem TDEAD3770 is UNSAT
Problem TDEAD3771 is UNSAT
Problem TDEAD3806 is UNSAT
Problem TDEAD3807 is UNSAT
Problem TDEAD3808 is UNSAT
Problem TDEAD3809 is UNSAT
Problem TDEAD3815 is UNSAT
Problem TDEAD3816 is UNSAT
Problem TDEAD3817 is UNSAT
Problem TDEAD3818 is UNSAT
Problem TDEAD3819 is UNSAT
Problem TDEAD3820 is UNSAT
Problem TDEAD3821 is UNSAT
Problem TDEAD3822 is UNSAT
Problem TDEAD3823 is UNSAT
Problem TDEAD3824 is UNSAT
Problem TDEAD3825 is UNSAT
Problem TDEAD3830 is UNSAT
Problem TDEAD3835 is UNSAT
Problem TDEAD3836 is UNSAT
Problem TDEAD3837 is UNSAT
Problem TDEAD3839 is UNSAT
Problem TDEAD3840 is UNSAT
Problem TDEAD3841 is UNSAT
Problem TDEAD3842 is UNSAT
Problem TDEAD3844 is UNSAT
Problem TDEAD3848 is UNSAT
Problem TDEAD3849 is UNSAT
Problem TDEAD3850 is UNSAT
Problem TDEAD3851 is UNSAT
Problem TDEAD3852 is UNSAT
Problem TDEAD3853 is UNSAT
Problem TDEAD3854 is UNSAT
Problem TDEAD3855 is UNSAT
Problem TDEAD3856 is UNSAT
Problem TDEAD3857 is UNSAT
Problem TDEAD3858 is UNSAT
Problem TDEAD3859 is UNSAT
Problem TDEAD3860 is UNSAT
Problem TDEAD3861 is UNSAT
Problem TDEAD3862 is UNSAT
Problem TDEAD3863 is UNSAT
Problem TDEAD3864 is UNSAT
Problem TDEAD3865 is UNSAT
Problem TDEAD3866 is UNSAT
Problem TDEAD3867 is UNSAT
Problem TDEAD3872 is UNSAT
Problem TDEAD3873 is UNSAT
Problem TDEAD3874 is UNSAT
Problem TDEAD3875 is UNSAT
Problem TDEAD3877 is UNSAT
Problem TDEAD3881 is UNSAT
Problem TDEAD3882 is UNSAT
Problem TDEAD3883 is UNSAT
Problem TDEAD3884 is UNSAT
Problem TDEAD3885 is UNSAT
Problem TDEAD3886 is UNSAT
Problem TDEAD3887 is UNSAT
Problem TDEAD3888 is UNSAT
Problem TDEAD3889 is UNSAT
Problem TDEAD3890 is UNSAT
Problem TDEAD3891 is UNSAT
Problem TDEAD3892 is UNSAT
Problem TDEAD3893 is UNSAT
Problem TDEAD3894 is UNSAT
Problem TDEAD3895 is UNSAT
Problem TDEAD3896 is UNSAT
Problem TDEAD3897 is UNSAT
Problem TDEAD3898 is UNSAT
Problem TDEAD3899 is UNSAT
Problem TDEAD3900 is UNSAT
Problem TDEAD3901 is UNSAT
Problem TDEAD3902 is UNSAT
Problem TDEAD3903 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/277 variables, 4/12 constraints. Problems are: Problem set: 120 solved, 3782 unsolved
[2024-06-01 06:47:17] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 2 ms to minimize.
Problem TDEAD784 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD814 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 277/4007 variables, and 13 constraints, problems are : Problem set: 125 solved, 3777 unsolved in 30115 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/278 constraints, ReadFeed: 0/303 constraints, PredecessorRefiner: 1197/2705 constraints, Known Traps: 5/5 constraints]
After SMT, in 106064ms problems are : Problem set: 125 solved, 3777 unsolved
Search for dead transitions found 125 dead transitions in 106159ms
Found 125 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 125 transitions
Dead transitions reduction (with SMT) removed 125 transitions
Starting structural reductions in LTL mode, iteration 1 : 278/280 places, 3779/3904 transitions.
Reduce places removed 21 places and 600 transitions.
Iterating post reduction 0 with 21 rules applied. Total rules applied 21 place count 257 transition count 3179
Reduce places removed 16 places and 328 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 37 place count 241 transition count 2851
Reduce places removed 7 places and 133 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 44 place count 234 transition count 2718
Reduce places removed 6 places and 113 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 50 place count 228 transition count 2605
Reduce places removed 2 places and 52 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 52 place count 226 transition count 2553
Reduce places removed 1 places and 30 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 53 place count 225 transition count 2523
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 55 place count 223 transition count 2497
Iterating global reduction 6 with 2 rules applied. Total rules applied 57 place count 223 transition count 2497
Applied a total of 57 rules in 108 ms. Remains 223 /278 variables (removed 55) and now considering 2497/3779 (removed 1282) transitions.
[2024-06-01 06:47:36] [INFO ] Flow matrix only has 2386 transitions (discarded 111 similar events)
// Phase 1: matrix 2386 rows 223 cols
[2024-06-01 06:47:36] [INFO ] Computed 8 invariants in 22 ms
[2024-06-01 06:47:36] [INFO ] Implicit Places using invariants in 638 ms returned []
[2024-06-01 06:47:36] [INFO ] Flow matrix only has 2386 transitions (discarded 111 similar events)
[2024-06-01 06:47:36] [INFO ] Invariant cache hit.
[2024-06-01 06:47:37] [INFO ] State equation strengthened by 209 read => feed constraints.
[2024-06-01 06:47:39] [INFO ] Implicit Places using invariants and state equation in 2418 ms returned []
Implicit Place search using SMT with State Equation took 3060 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 223/280 places, 2497/3904 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 113533 ms. Remains : 223/280 places, 2497/3904 transitions.
Support contains 7 out of 223 places after structural reductions.
[2024-06-01 06:47:40] [INFO ] Flatten gal took : 450 ms
[2024-06-01 06:47:40] [INFO ] Flatten gal took : 240 ms
[2024-06-01 06:47:40] [INFO ] Input system was already deterministic with 2497 transitions.
RANDOM walk for 40002 steps (86 resets) in 1994 ms. (20 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (11 resets) in 359 ms. (111 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (14 resets) in 245 ms. (162 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (13 resets) in 189 ms. (210 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (10 resets) in 217 ms. (183 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (12 resets) in 184 ms. (216 steps per ms) remains 5/5 properties
[2024-06-01 06:47:42] [INFO ] Flow matrix only has 2386 transitions (discarded 111 similar events)
[2024-06-01 06:47:42] [INFO ] Invariant cache hit.
[2024-06-01 06:47:42] [INFO ] State equation strengthened by 209 read => feed constraints.
Problem AtomicPropp3 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 59/64 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2037/2101 variables, 64/67 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2101 variables, 60/127 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2101 variables, 0/127 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 406/2507 variables, 132/259 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2507 variables, 3/262 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2507 variables, 126/388 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2507 variables, 0/388 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 77/2584 variables, 9/397 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2584 variables, 16/413 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2584 variables, 0/413 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 3/2587 variables, 1/414 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2587 variables, 0/414 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 22/2609 variables, 18/432 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2609 variables, 1/433 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2609 variables, 7/440 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2609 variables, 0/440 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/2609 variables, 0/440 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2609/2609 variables, and 440 constraints, problems are : Problem set: 1 solved, 4 unsolved in 2028 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 223/223 constraints, ReadFeed: 209/209 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 59/64 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2037/2101 variables, 64/67 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2101 variables, 60/127 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2101 variables, 0/127 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 406/2507 variables, 132/259 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2507 variables, 3/262 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2507 variables, 126/388 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2507 variables, 4/392 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/2507 variables, 0/392 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 77/2584 variables, 9/401 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2584 variables, 16/417 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2584 variables, 0/417 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 3/2587 variables, 1/418 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2587 variables, 0/418 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 22/2609 variables, 18/436 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2609 variables, 1/437 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2609 variables, 7/444 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2609 variables, 0/444 constraints. Problems are: Problem set: 1 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 0/2609 variables, 0/444 constraints. Problems are: Problem set: 1 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2609/2609 variables, and 444 constraints, problems are : Problem set: 1 solved, 4 unsolved in 3333 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 223/223 constraints, ReadFeed: 209/209 constraints, PredecessorRefiner: 4/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 5484ms problems are : Problem set: 1 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 5802 ms.
Support contains 5 out of 223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 223/223 places, 2497/2497 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 18 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 222 transition count 2500
Free-agglomeration rule applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 9 place count 222 transition count 2493
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 16 place count 215 transition count 2493
Applied a total of 16 rules in 330 ms. Remains 215 /223 variables (removed 8) and now considering 2493/2497 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 331 ms. Remains : 215/223 places, 2493/2497 transitions.
RANDOM walk for 40074 steps (8 resets) in 237 ms. (168 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (8 resets) in 268 ms. (148 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 181 ms. (219 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 132 ms. (300 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 144 ms. (275 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 67299 steps, run timeout after 3001 ms. (steps per millisecond=22 ) properties seen :0 out of 4
Probabilistic random walk after 67299 steps, saw 43799 distinct states, run finished after 3005 ms. (steps per millisecond=22 ) properties seen :0
[2024-06-01 06:47:57] [INFO ] Flow matrix only has 2378 transitions (discarded 115 similar events)
// Phase 1: matrix 2378 rows 215 cols
[2024-06-01 06:47:57] [INFO ] Computed 8 invariants in 11 ms
[2024-06-01 06:47:57] [INFO ] State equation strengthened by 209 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 58/63 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2036/2099 variables, 63/66 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2099 variables, 60/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2099 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 408/2507 variables, 130/256 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2507 variables, 3/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2507 variables, 132/391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2507 variables, 0/391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 77/2584 variables, 13/404 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2584 variables, 17/421 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2584 variables, 0/421 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/2585 variables, 1/422 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2585 variables, 1/423 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2585 variables, 0/423 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 8/2593 variables, 8/431 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2593 variables, 1/432 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2593 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/2593 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2593/2593 variables, and 432 constraints, problems are : Problem set: 0 solved, 4 unsolved in 1725 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 215/215 constraints, ReadFeed: 209/209 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 58/63 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 2036/2099 variables, 63/66 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2099 variables, 60/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/2099 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 408/2507 variables, 130/256 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2507 variables, 3/259 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2507 variables, 132/391 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2507 variables, 4/395 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 06:48:00] [INFO ] Deduced a trap composed of 10 places in 87 ms of which 2 ms to minimize.
[2024-06-01 06:48:00] [INFO ] Deduced a trap composed of 14 places in 200 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2507 variables, 2/397 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2507 variables, 0/397 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 77/2584 variables, 13/410 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2584 variables, 17/427 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2584 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1/2585 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2585 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2585 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 8/2593 variables, 8/437 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2593 variables, 1/438 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-01 06:48:02] [INFO ] Deduced a trap composed of 4 places in 263 ms of which 4 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/2593 variables, 1/439 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2593 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (OVERLAPS) 0/2593 variables, 0/439 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2593/2593 variables, and 439 constraints, problems are : Problem set: 0 solved, 4 unsolved in 4310 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 215/215 constraints, ReadFeed: 209/209 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 6086ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 934 ms.
Support contains 5 out of 215 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 215/215 places, 2493/2493 transitions.
Applied a total of 0 rules in 67 ms. Remains 215 /215 variables (removed 0) and now considering 2493/2493 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 215/215 places, 2493/2493 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 215/215 places, 2493/2493 transitions.
Applied a total of 0 rules in 77 ms. Remains 215 /215 variables (removed 0) and now considering 2493/2493 (removed 0) transitions.
[2024-06-01 06:48:04] [INFO ] Flow matrix only has 2378 transitions (discarded 115 similar events)
[2024-06-01 06:48:04] [INFO ] Invariant cache hit.
[2024-06-01 06:48:04] [INFO ] Implicit Places using invariants in 475 ms returned []
[2024-06-01 06:48:04] [INFO ] Flow matrix only has 2378 transitions (discarded 115 similar events)
[2024-06-01 06:48:04] [INFO ] Invariant cache hit.
[2024-06-01 06:48:05] [INFO ] State equation strengthened by 209 read => feed constraints.
[2024-06-01 06:48:06] [INFO ] Implicit Places using invariants and state equation in 1406 ms returned []
Implicit Place search using SMT with State Equation took 1908 ms to find 0 implicit places.
[2024-06-01 06:48:06] [INFO ] Redundant transitions in 150 ms returned []
Running 2492 sub problems to find dead transitions.
[2024-06-01 06:48:06] [INFO ] Flow matrix only has 2378 transitions (discarded 115 similar events)
[2024-06-01 06:48:06] [INFO ] Invariant cache hit.
[2024-06-01 06:48:06] [INFO ] State equation strengthened by 209 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2492 unsolved
[2024-06-01 06:49:02] [INFO ] Deduced a trap composed of 10 places in 135 ms of which 1 ms to minimize.
Problem TDEAD1416 is UNSAT
Problem TDEAD1417 is UNSAT
Problem TDEAD1418 is UNSAT
Problem TDEAD1419 is UNSAT
Problem TDEAD1420 is UNSAT
Problem TDEAD1421 is UNSAT
Problem TDEAD1422 is UNSAT
[2024-06-01 06:49:02] [INFO ] Deduced a trap composed of 8 places in 126 ms of which 1 ms to minimize.
Problem TDEAD1423 is UNSAT
Problem TDEAD1424 is UNSAT
Problem TDEAD1425 is UNSAT
Problem TDEAD1426 is UNSAT
Problem TDEAD1427 is UNSAT
Problem TDEAD1428 is UNSAT
Problem TDEAD1429 is UNSAT
Problem TDEAD1430 is UNSAT
Problem TDEAD1431 is UNSAT
Problem TDEAD1432 is UNSAT
Problem TDEAD1433 is UNSAT
Problem TDEAD1434 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 215/2593 variables, and 10 constraints, problems are : Problem set: 19 solved, 2473 unsolved in 30077 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/215 constraints, ReadFeed: 0/209 constraints, PredecessorRefiner: 2492/2492 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 19 solved, 2473 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 8/8 constraints. Problems are: Problem set: 19 solved, 2473 unsolved
Problem TDEAD986 is UNSAT
Problem TDEAD987 is UNSAT
Problem TDEAD988 is UNSAT
Problem TDEAD989 is UNSAT
Problem TDEAD990 is UNSAT
Problem TDEAD991 is UNSAT
Problem TDEAD992 is UNSAT
Problem TDEAD993 is UNSAT
Problem TDEAD994 is UNSAT
Problem TDEAD996 is UNSAT
Problem TDEAD997 is UNSAT
Problem TDEAD998 is UNSAT
Problem TDEAD1002 is UNSAT
Problem TDEAD1003 is UNSAT
Problem TDEAD1004 is UNSAT
Problem TDEAD1005 is UNSAT
Problem TDEAD1006 is UNSAT
Problem TDEAD1007 is UNSAT
Problem TDEAD1008 is UNSAT
Problem TDEAD1009 is UNSAT
Problem TDEAD1010 is UNSAT
Problem TDEAD1013 is UNSAT
Problem TDEAD1014 is UNSAT
Problem TDEAD1015 is UNSAT
Problem TDEAD1016 is UNSAT
Problem TDEAD1017 is UNSAT
Problem TDEAD1018 is UNSAT
Problem TDEAD1022 is UNSAT
Problem TDEAD1023 is UNSAT
Problem TDEAD1024 is UNSAT
Problem TDEAD1025 is UNSAT
Problem TDEAD1026 is UNSAT
Problem TDEAD1027 is UNSAT
Problem TDEAD1028 is UNSAT
Problem TDEAD1029 is UNSAT
Problem TDEAD1030 is UNSAT
Problem TDEAD1033 is UNSAT
Problem TDEAD1034 is UNSAT
Problem TDEAD1035 is UNSAT
Problem TDEAD1036 is UNSAT
Problem TDEAD1037 is UNSAT
Problem TDEAD1038 is UNSAT
Problem TDEAD1042 is UNSAT
Problem TDEAD1043 is UNSAT
Problem TDEAD1044 is UNSAT
Problem TDEAD1045 is UNSAT
Problem TDEAD1046 is UNSAT
Problem TDEAD1047 is UNSAT
Problem TDEAD1048 is UNSAT
Problem TDEAD1049 is UNSAT
Problem TDEAD1050 is UNSAT
Problem TDEAD1052 is UNSAT
Problem TDEAD1053 is UNSAT
Problem TDEAD1054 is UNSAT
Problem TDEAD1055 is UNSAT
Problem TDEAD1056 is UNSAT
Problem TDEAD1057 is UNSAT
Problem TDEAD1058 is UNSAT
Problem TDEAD1059 is UNSAT
Problem TDEAD1060 is UNSAT
Problem TDEAD1061 is UNSAT
Problem TDEAD1062 is UNSAT
Problem TDEAD1063 is UNSAT
Problem TDEAD1064 is UNSAT
Problem TDEAD1065 is UNSAT
Problem TDEAD1066 is UNSAT
Problem TDEAD1067 is UNSAT
Problem TDEAD1068 is UNSAT
Problem TDEAD1069 is UNSAT
Problem TDEAD1070 is UNSAT
Problem TDEAD1071 is UNSAT
Problem TDEAD1072 is UNSAT
Problem TDEAD1073 is UNSAT
Problem TDEAD1074 is UNSAT
Problem TDEAD1075 is UNSAT
Problem TDEAD1076 is UNSAT
Problem TDEAD1077 is UNSAT
Problem TDEAD1078 is UNSAT
Problem TDEAD1079 is UNSAT
Problem TDEAD1080 is UNSAT
Problem TDEAD1081 is UNSAT
Problem TDEAD1082 is UNSAT
Problem TDEAD1083 is UNSAT
Problem TDEAD1084 is UNSAT
Problem TDEAD1085 is UNSAT
Problem TDEAD1086 is UNSAT
Problem TDEAD1087 is UNSAT
Problem TDEAD1088 is UNSAT
Problem TDEAD1089 is UNSAT
Problem TDEAD1090 is UNSAT
Problem TDEAD1091 is UNSAT
Problem TDEAD1092 is UNSAT
Problem TDEAD1093 is UNSAT
Problem TDEAD1094 is UNSAT
Problem TDEAD1095 is UNSAT
Problem TDEAD1096 is UNSAT
Problem TDEAD1097 is UNSAT
Problem TDEAD1098 is UNSAT
Problem TDEAD1099 is UNSAT
Problem TDEAD1100 is UNSAT
Problem TDEAD1101 is UNSAT
Problem TDEAD1102 is UNSAT
Problem TDEAD1103 is UNSAT
Problem TDEAD1104 is UNSAT
Problem TDEAD1105 is UNSAT
Problem TDEAD1106 is UNSAT
Problem TDEAD1107 is UNSAT
Problem TDEAD1108 is UNSAT
Problem TDEAD1109 is UNSAT
Problem TDEAD1110 is UNSAT
Problem TDEAD1111 is UNSAT
Problem TDEAD1112 is UNSAT
Problem TDEAD1113 is UNSAT
Problem TDEAD1114 is UNSAT
Problem TDEAD1115 is UNSAT
Problem TDEAD1116 is UNSAT
Problem TDEAD1117 is UNSAT
Problem TDEAD1118 is UNSAT
Problem TDEAD1119 is UNSAT
Problem TDEAD1120 is UNSAT
Problem TDEAD1121 is UNSAT
Problem TDEAD1122 is UNSAT
Problem TDEAD1123 is UNSAT
Problem TDEAD1124 is UNSAT
Problem TDEAD1125 is UNSAT
Problem TDEAD1126 is UNSAT
Problem TDEAD1199 is UNSAT
Problem TDEAD1200 is UNSAT
Problem TDEAD1201 is UNSAT
Problem TDEAD1202 is UNSAT
Problem TDEAD1203 is UNSAT
Problem TDEAD1204 is UNSAT
Problem TDEAD1205 is UNSAT
Problem TDEAD1206 is UNSAT
Problem TDEAD1207 is UNSAT
Problem TDEAD1208 is UNSAT
Problem TDEAD1209 is UNSAT
Problem TDEAD1210 is UNSAT
Problem TDEAD1211 is UNSAT
Problem TDEAD1212 is UNSAT
Problem TDEAD1213 is UNSAT
Problem TDEAD1214 is UNSAT
Problem TDEAD1215 is UNSAT
Problem TDEAD1216 is UNSAT
Problem TDEAD1217 is UNSAT
Problem TDEAD1218 is UNSAT
Problem TDEAD1219 is UNSAT
Problem TDEAD1220 is UNSAT
Problem TDEAD1221 is UNSAT
Problem TDEAD1222 is UNSAT
Problem TDEAD1223 is UNSAT
Problem TDEAD1224 is UNSAT
Problem TDEAD1225 is UNSAT
Problem TDEAD1226 is UNSAT
Problem TDEAD1227 is UNSAT
Problem TDEAD1228 is UNSAT
Problem TDEAD1229 is UNSAT
Problem TDEAD1230 is UNSAT
Problem TDEAD1231 is UNSAT
Problem TDEAD1232 is UNSAT
Problem TDEAD1233 is UNSAT
Problem TDEAD1234 is UNSAT
Problem TDEAD1235 is UNSAT
Problem TDEAD1236 is UNSAT
Problem TDEAD1237 is UNSAT
Problem TDEAD1238 is UNSAT
Problem TDEAD1239 is UNSAT
Problem TDEAD1240 is UNSAT
Problem TDEAD1241 is UNSAT
Problem TDEAD1242 is UNSAT
Problem TDEAD1243 is UNSAT
Problem TDEAD1244 is UNSAT
Problem TDEAD1245 is UNSAT
Problem TDEAD1246 is UNSAT
Problem TDEAD1247 is UNSAT
Problem TDEAD1248 is UNSAT
Problem TDEAD1249 is UNSAT
Problem TDEAD1250 is UNSAT
Problem TDEAD1251 is UNSAT
Problem TDEAD1252 is UNSAT
Problem TDEAD1253 is UNSAT
Problem TDEAD1254 is UNSAT
Problem TDEAD1255 is UNSAT
Problem TDEAD1256 is UNSAT
Problem TDEAD1257 is UNSAT
Problem TDEAD1258 is UNSAT
Problem TDEAD1259 is UNSAT
Problem TDEAD1260 is UNSAT
Problem TDEAD1261 is UNSAT
Problem TDEAD1262 is UNSAT
Problem TDEAD1263 is UNSAT
Problem TDEAD1264 is UNSAT
Problem TDEAD1265 is UNSAT
Problem TDEAD1266 is UNSAT
Problem TDEAD1267 is UNSAT
Problem TDEAD1268 is UNSAT
Problem TDEAD1269 is UNSAT
Problem TDEAD1270 is UNSAT
Problem TDEAD1271 is UNSAT
Problem TDEAD1272 is UNSAT
Problem TDEAD1273 is UNSAT
Problem TDEAD1274 is UNSAT
Problem TDEAD1275 is UNSAT
Problem TDEAD1276 is UNSAT
Problem TDEAD1277 is UNSAT
Problem TDEAD1278 is UNSAT
Problem TDEAD1279 is UNSAT
Problem TDEAD1280 is UNSAT
Problem TDEAD1281 is UNSAT
Problem TDEAD1282 is UNSAT
Problem TDEAD1283 is UNSAT
Problem TDEAD1284 is UNSAT
Problem TDEAD1285 is UNSAT
Problem TDEAD1286 is UNSAT
Problem TDEAD1287 is UNSAT
Problem TDEAD1288 is UNSAT
Problem TDEAD1289 is UNSAT
Problem TDEAD1290 is UNSAT
Problem TDEAD1291 is UNSAT
Problem TDEAD1292 is UNSAT
Problem TDEAD1293 is UNSAT
Problem TDEAD1294 is UNSAT
Problem TDEAD1295 is UNSAT
Problem TDEAD1296 is UNSAT
Problem TDEAD1297 is UNSAT
Problem TDEAD1298 is UNSAT
Problem TDEAD1299 is UNSAT
Problem TDEAD1300 is UNSAT
Problem TDEAD1301 is UNSAT
Problem TDEAD1302 is UNSAT
Problem TDEAD1303 is UNSAT
Problem TDEAD1304 is UNSAT
Problem TDEAD1305 is UNSAT
Problem TDEAD1306 is UNSAT
Problem TDEAD1307 is UNSAT
Problem TDEAD1308 is UNSAT
Problem TDEAD1309 is UNSAT
Problem TDEAD1310 is UNSAT
Problem TDEAD1311 is UNSAT
Problem TDEAD1312 is UNSAT
Problem TDEAD1313 is UNSAT
Problem TDEAD1314 is UNSAT
Problem TDEAD1315 is UNSAT
Problem TDEAD1316 is UNSAT
Problem TDEAD1317 is UNSAT
Problem TDEAD1318 is UNSAT
Problem TDEAD1319 is UNSAT
Problem TDEAD1320 is UNSAT
Problem TDEAD1321 is UNSAT
Problem TDEAD1322 is UNSAT
Problem TDEAD1323 is UNSAT
Problem TDEAD1324 is UNSAT
Problem TDEAD1325 is UNSAT
Problem TDEAD1326 is UNSAT
Problem TDEAD1327 is UNSAT
Problem TDEAD1328 is UNSAT
Problem TDEAD1329 is UNSAT
Problem TDEAD1330 is UNSAT
Problem TDEAD1331 is UNSAT
Problem TDEAD1332 is UNSAT
Problem TDEAD1333 is UNSAT
Problem TDEAD1334 is UNSAT
Problem TDEAD1335 is UNSAT
Problem TDEAD1336 is UNSAT
Problem TDEAD1337 is UNSAT
Problem TDEAD1338 is UNSAT
Problem TDEAD1339 is UNSAT
Problem TDEAD1340 is UNSAT
Problem TDEAD1341 is UNSAT
Problem TDEAD1342 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 2/10 constraints. Problems are: Problem set: 289 solved, 2203 unsolved
[2024-06-01 06:49:27] [INFO ] Deduced a trap composed of 22 places in 170 ms of which 2 ms to minimize.
Problem TDEAD2441 is UNSAT
Problem TDEAD2442 is UNSAT
Problem TDEAD2453 is UNSAT
Problem TDEAD2454 is UNSAT
Problem TDEAD2455 is UNSAT
Problem TDEAD2465 is UNSAT
Problem TDEAD2466 is UNSAT
Problem TDEAD2477 is UNSAT
Problem TDEAD2478 is UNSAT
Problem TDEAD2479 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 1/11 constraints. Problems are: Problem set: 299 solved, 2193 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 215/2593 variables, and 11 constraints, problems are : Problem set: 299 solved, 2193 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/215 constraints, ReadFeed: 0/209 constraints, PredecessorRefiner: 0/2492 constraints, Known Traps: 3/3 constraints]
After SMT, in 93315ms problems are : Problem set: 299 solved, 2193 unsolved
Search for dead transitions found 299 dead transitions in 93353ms
Found 299 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 299 transitions
Dead transitions reduction (with SMT) removed 299 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 215/215 places, 2194/2493 transitions.
Reduce places removed 6 places and 180 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 209 transition count 2014
Reduce places removed 5 places and 103 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 11 place count 204 transition count 1911
Reduce places removed 6 places and 168 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 17 place count 198 transition count 1743
Reduce places removed 4 places and 88 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 21 place count 194 transition count 1655
Discarding 12 places :
Symmetric choice reduction at 4 with 12 rule applications. Total rules 33 place count 182 transition count 1614
Iterating global reduction 4 with 12 rules applied. Total rules applied 45 place count 182 transition count 1614
Discarding 11 places :
Symmetric choice reduction at 4 with 11 rule applications. Total rules 56 place count 171 transition count 1526
Iterating global reduction 4 with 11 rules applied. Total rules applied 67 place count 171 transition count 1526
Applied a total of 67 rules in 147 ms. Remains 171 /215 variables (removed 44) and now considering 1526/2194 (removed 668) transitions.
[2024-06-01 06:49:40] [INFO ] Flow matrix only has 1417 transitions (discarded 109 similar events)
// Phase 1: matrix 1417 rows 171 cols
[2024-06-01 06:49:40] [INFO ] Computed 8 invariants in 5 ms
[2024-06-01 06:49:40] [INFO ] Implicit Places using invariants in 209 ms returned []
[2024-06-01 06:49:40] [INFO ] Flow matrix only has 1417 transitions (discarded 109 similar events)
[2024-06-01 06:49:40] [INFO ] Invariant cache hit.
[2024-06-01 06:49:40] [INFO ] State equation strengthened by 142 read => feed constraints.
[2024-06-01 06:49:41] [INFO ] Implicit Places using invariants and state equation in 1607 ms returned []
Implicit Place search using SMT with State Equation took 1833 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 171/215 places, 1526/2493 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 97536 ms. Remains : 171/215 places, 1526/2493 transitions.
Successfully simplified 1 atomic propositions for a total of 5 simplifications.
Computed a total of 6 stabilizing places and 131 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 223 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 223/223 places, 2497/2497 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 221 transition count 2502
Applied a total of 4 rules in 159 ms. Remains 221 /223 variables (removed 2) and now considering 2502/2497 (removed -5) transitions.
[2024-06-01 06:49:42] [INFO ] Flow matrix only has 2384 transitions (discarded 118 similar events)
// Phase 1: matrix 2384 rows 221 cols
[2024-06-01 06:49:42] [INFO ] Computed 8 invariants in 14 ms
[2024-06-01 06:49:42] [INFO ] Implicit Places using invariants in 402 ms returned []
[2024-06-01 06:49:42] [INFO ] Flow matrix only has 2384 transitions (discarded 118 similar events)
[2024-06-01 06:49:42] [INFO ] Invariant cache hit.
[2024-06-01 06:49:43] [INFO ] State equation strengthened by 210 read => feed constraints.
[2024-06-01 06:49:44] [INFO ] Implicit Places using invariants and state equation in 1473 ms returned []
Implicit Place search using SMT with State Equation took 1894 ms to find 0 implicit places.
[2024-06-01 06:49:44] [INFO ] Redundant transitions in 104 ms returned []
Running 2500 sub problems to find dead transitions.
[2024-06-01 06:49:44] [INFO ] Flow matrix only has 2384 transitions (discarded 118 similar events)
[2024-06-01 06:49:44] [INFO ] Invariant cache hit.
[2024-06-01 06:49:44] [INFO ] State equation strengthened by 210 read => feed constraints.
Could not compute solution for formula : BugTracking-PT-q8m032-LTLCardinality-00
FORMULA BugTracking-PT-q8m032-LTLCardinality-01 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BugTracking-PT-q8m032-LTLCardinality-02 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : BugTracking-PT-q8m032-LTLCardinality-03
FORMULA BugTracking-PT-q8m032-LTLCardinality-04 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : BugTracking-PT-q8m032-LTLCardinality-05
FORMULA BugTracking-PT-q8m032-LTLCardinality-06 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : BugTracking-PT-q8m032-LTLCardinality-07
FORMULA BugTracking-PT-q8m032-LTLCardinality-08 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BugTracking-PT-q8m032-LTLCardinality-09 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BugTracking-PT-q8m032-LTLCardinality-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BugTracking-PT-q8m032-LTLCardinality-11 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BugTracking-PT-q8m032-LTLCardinality-12 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA BugTracking-PT-q8m032-LTLCardinality-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : BugTracking-PT-q8m032-LTLCardinality-14
FORMULA BugTracking-PT-q8m032-LTLCardinality-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717225815257

--------------------
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 BugTracking-PT-q8m032-LTLCardinality-00
ltl formula formula --ltl=/tmp/643/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 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q8 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 6.180 real 1.410 user 1.390 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/643/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/643/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/643/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/643/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 753 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27374 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 ~36656 transitions
pnml2lts-mc( 2/ 4): ~5000 levels ~20000 states ~73324 transitions
pnml2lts-mc( 1/ 4): ~10000 levels ~40000 states ~91536 transitions
pnml2lts-mc( 1/ 4): ~20000 levels ~80000 states ~182964 transitions
pnml2lts-mc( 0/ 4): ~5964 levels ~160000 states ~320220 transitions
pnml2lts-mc( 1/ 4): ~80000 levels ~320000 states ~731536 transitions
ltl formula name BugTracking-PT-q8m032-LTLCardinality-01
ltl formula formula --ltl=/tmp/643/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 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q8 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.770 real 1.370 user 1.120 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/643/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/643/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/643/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/643/ltl_1_
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 754 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27376 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 ~33!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 62
pnml2lts-mc( 0/ 4): unique transitions count: 152
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 76
pnml2lts-mc( 0/ 4): - cum. max stack depth: 76
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 76 states 193 transitions, fanout: 2.539
pnml2lts-mc( 0/ 4): Total exploration time 0.080 sec (0.080 sec minimum, 0.080 sec on average)
pnml2lts-mc( 0/ 4): States per second: 950, Transitions per second: 2412
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, 71.2 B/state, compr.: 2.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 27880 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name BugTracking-PT-q8m032-LTLCardinality-02
ltl formula formula --ltl=/tmp/643/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 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q8 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 4.050 real 1.360 user 1.190 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/643/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/643/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/643/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/643/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 753 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27378 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 ~33!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 74
pnml2lts-mc( 0/ 4): unique transitions count: 191
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 84
pnml2lts-mc( 0/ 4): - cum. max stack depth: 84
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 84 states 225 transitions, fanout: 2.679
pnml2lts-mc( 0/ 4): Total exploration time 0.070 sec (0.070 sec minimum, 0.070 sec on average)
pnml2lts-mc( 0/ 4): States per second: 1200, Transitions per second: 3214
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, 61.5 B/state, compr.: 2.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 27880 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name BugTracking-PT-q8m032-LTLCardinality-03
ltl formula formula --ltl=/tmp/643/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 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q8 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.840 real 1.200 user 1.250 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/643/ltl_3_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/643/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/643/ltl_3_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/643/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 753 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27374 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( 3/ 4): ~2416 levels ~10000 states ~31556 transitions
pnml2lts-mc( 3/ 4): ~4906 levels ~20000 states ~64708 transitions
pnml2lts-mc( 3/ 4): ~9813 levels ~40000 states ~129460 transitions
pnml2lts-mc( 3/ 4): ~19732 levels ~80000 states ~260056 transitions
pnml2lts-mc( 0/ 4): ~206 levels ~160000 states ~409736 transitions
pnml2lts-mc( 0/ 4): ~231 levels ~320000 states ~857800 transitions
ltl formula name BugTracking-PT-q8m032-LTLCardinality-04
ltl formula formula --ltl=/tmp/643/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 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q8 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 5.660 real 1.350 user 1.140 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/643/ltl_4_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/643/ltl_4_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/643/ltl_4_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/643/ltl_4_
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 754 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27375 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 ~33!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 96
pnml2lts-mc( 0/ 4): unique transitions count: 253
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 135
pnml2lts-mc( 0/ 4): - cum. max stack depth: 135
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 135 states 367 transitions, fanout: 2.719
pnml2lts-mc( 0/ 4): Total exploration time 0.150 sec (0.130 sec minimum, 0.145 sec on average)
pnml2lts-mc( 0/ 4): States per second: 900, Transitions per second: 2447
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, 69.6 B/state, compr.: 2.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 27880 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name BugTracking-PT-q8m032-LTLCardinality-05
ltl formula formula --ltl=/tmp/643/ltl_5_
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 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q8 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 6.600 real 1.360 user 1.420 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/643/ltl_5_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/643/ltl_5_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/643/ltl_5_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/643/ltl_5_
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 754 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27374 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): ~652 levels ~10000 states ~18464 transitions
pnml2lts-mc( 2/ 4): ~2692 levels ~20000 states ~35376 transitions
pnml2lts-mc( 2/ 4): ~6692 levels ~40000 states ~68376 transitions
pnml2lts-mc( 2/ 4): ~14692 levels ~80000 states ~134376 transitions
pnml2lts-mc( 2/ 4): ~30692 levels ~160000 states ~266376 transitions
pnml2lts-mc( 0/ 4): ~80000 levels ~320000 states ~960108 transitions
ltl formula name BugTracking-PT-q8m032-LTLCardinality-06
ltl formula formula --ltl=/tmp/643/ltl_6_
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 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q8 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 7.240 real 1.510 user 1.650 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/643/ltl_6_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/643/ltl_6_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/643/ltl_6_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/643/ltl_6_
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 754 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27375 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( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~33!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 87
pnml2lts-mc( 0/ 4): unique transitions count: 237
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 92
pnml2lts-mc( 0/ 4): - cum. max stack depth: 92
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 92 states 252 transitions, fanout: 2.739
pnml2lts-mc( 0/ 4): Total exploration time 0.100 sec (0.080 sec minimum, 0.090 sec on average)
pnml2lts-mc( 0/ 4): States per second: 920, Transitions per second: 2520
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.2 B/state, compr.: 2.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 27880 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name BugTracking-PT-q8m032-LTLCardinality-07
ltl formula formula --ltl=/tmp/643/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 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q8 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 6.780 real 1.530 user 1.780 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/643/ltl_7_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/643/ltl_7_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/643/ltl_7_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/643/ltl_7_
pnml2lts-mc( 0/ 4): buchi has 7 states
pnml2lts-mc( 0/ 4): There are 753 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27392 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 ~29828 transitions
pnml2lts-mc( 3/ 4): ~3715 levels ~20000 states ~39784 transitions
pnml2lts-mc( 3/ 4): ~7465 levels ~40000 states ~79784 transitions
pnml2lts-mc( 2/ 4): ~20000 levels ~80000 states ~239832 transitions
pnml2lts-mc( 3/ 4): ~29965 levels ~160000 states ~319784 transitions
pnml2lts-mc( 3/ 4): ~59965 levels ~320000 states ~639784 transitions
ltl formula name BugTracking-PT-q8m032-LTLCardinality-08
ltl formula formula --ltl=/tmp/643/ltl_8_
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 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q8 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 7.010 real 1.560 user 1.390 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/643/ltl_8_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/643/ltl_8_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/643/ltl_8_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/643/ltl_8_
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 754 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27373 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 ~33!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 118
pnml2lts-mc( 0/ 4): unique transitions count: 334
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 126
pnml2lts-mc( 0/ 4): - cum. max stack depth: 126
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 126 states 356 transitions, fanout: 2.825
pnml2lts-mc( 0/ 4): Total exploration time 0.140 sec (0.130 sec minimum, 0.137 sec on average)
pnml2lts-mc( 0/ 4): States per second: 900, Transitions per second: 2543
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, 58.9 B/state, compr.: 1.9%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 27880 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name BugTracking-PT-q8m032-LTLCardinality-09
ltl formula formula --ltl=/tmp/643/ltl_9_
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): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q8 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 6.930 real 1.460 user 1.660 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/643/ltl_9_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/643/ltl_9_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/643/ltl_9_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/643/ltl_9_
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 754 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27372 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: 1
pnml2lts-mc( 0/ 4): unique states count: 1
pnml2lts-mc( 0/ 4): unique transitions count: 0
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4 states 4 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
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, 288.0 B/state, compr.: 9.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 27880 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name BugTracking-PT-q8m032-LTLCardinality-10
ltl formula formula --ltl=/tmp/643/ltl_10_
Warning: program compiled against libxml 210 using older 209
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
pnml2lts-mc( 0/ 4): Petri net has 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q8 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 4.060 real 1.370 user 1.100 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/643/ltl_10_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/643/ltl_10_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/643/ltl_10_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/643/ltl_10_
pnml2lts-mc( 0/ 4): buchi has 8 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 754 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27384 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 ~33!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 67
pnml2lts-mc( 0/ 4): unique transitions count: 178
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 77
pnml2lts-mc( 0/ 4): - cum. max stack depth: 77
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 77 states 218 transitions, fanout: 2.831
pnml2lts-mc( 0/ 4): Total exploration time 0.080 sec (0.070 sec minimum, 0.075 sec on average)
pnml2lts-mc( 0/ 4): States per second: 962, Transitions per second: 2725
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.9 B/state, compr.: 2.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 27880 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name BugTracking-PT-q8m032-LTLCardinality-11
ltl formula formula --ltl=/tmp/643/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 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q8 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 5.750 real 1.400 user 1.290 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/643/ltl_11_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/643/ltl_11_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/643/ltl_11_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/643/ltl_11_
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 754 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27377 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: 1
pnml2lts-mc( 0/ 4): unique states count: 1
pnml2lts-mc( 0/ 4): unique transitions count: 0
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 4
pnml2lts-mc( 0/ 4): - cum. max stack depth: 4
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 4 states 4 transitions, fanout: 1.000
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
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, 288.0 B/state, compr.: 9.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 27880 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name BugTracking-PT-q8m032-LTLCardinality-12
ltl formula formula --ltl=/tmp/643/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 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q8 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 7.090 real 1.600 user 1.450 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/643/ltl_12_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/643/ltl_12_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/643/ltl_12_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/643/ltl_12_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 754 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27381 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 ~33!
pnml2lts-mc( 2/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 118
pnml2lts-mc( 0/ 4): unique transitions count: 336
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 123
pnml2lts-mc( 0/ 4): - cum. max stack depth: 123
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 123 states 352 transitions, fanout: 2.862
pnml2lts-mc( 0/ 4): Total exploration time 0.150 sec (0.140 sec minimum, 0.145 sec on average)
pnml2lts-mc( 0/ 4): States per second: 820, Transitions per second: 2347
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, 52.2 B/state, compr.: 1.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 27880 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name BugTracking-PT-q8m032-LTLCardinality-13
ltl formula formula --ltl=/tmp/643/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 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q8 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 6.840 real 1.580 user 1.560 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/643/ltl_13_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/643/ltl_13_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/643/ltl_13_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/643/ltl_13_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): There are 753 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27374 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 ~33!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 114
pnml2lts-mc( 0/ 4): unique transitions count: 305
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 127
pnml2lts-mc( 0/ 4): - cum. max stack depth: 127
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 127 states 337 transitions, fanout: 2.654
pnml2lts-mc( 0/ 4): Total exploration time 0.130 sec (0.120 sec minimum, 0.127 sec on average)
pnml2lts-mc( 0/ 4): States per second: 977, Transitions per second: 2592
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, 60.3 B/state, compr.: 2.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 27880 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.0MB paged-in)
ltl formula name BugTracking-PT-q8m032-LTLCardinality-14
ltl formula formula --ltl=/tmp/643/ltl_14_
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 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q8 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 6.920 real 1.460 user 1.800 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/643/ltl_14_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/643/ltl_14_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/643/ltl_14_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/643/ltl_14_
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 754 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27372 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 ~29840 transitions
pnml2lts-mc( 0/ 4): ~5000 levels ~20000 states ~59844 transitions
pnml2lts-mc( 0/ 4): ~10000 levels ~40000 states ~119840 transitions
pnml2lts-mc( 0/ 4): ~20000 levels ~80000 states ~239844 transitions
pnml2lts-mc( 0/ 4): ~40000 levels ~160000 states ~479840 transitions
pnml2lts-mc( 0/ 4): ~80000 levels ~320000 states ~959844 transitions
ltl formula name BugTracking-PT-q8m032-LTLCardinality-15
ltl formula formula --ltl=/tmp/643/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 754 places, 27370 transitions and 136172 arcs
pnml2lts-mc( 0/ 4): Petri net BugTracking-PT-q8 analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 3.910 real 1.260 user 1.230 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/643/ltl_15_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/643/ltl_15_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/643/ltl_15_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/643/ltl_15_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 753 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 755, there are 27378 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 ~33!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 74
pnml2lts-mc( 0/ 4): unique transitions count: 197
pnml2lts-mc( 0/ 4): - self-loop count: 1
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 79
pnml2lts-mc( 0/ 4): - cum. max stack depth: 79
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 79 states 218 transitions, fanout: 2.759
pnml2lts-mc( 0/ 4): Total exploration time 0.080 sec (0.080 sec minimum, 0.080 sec on average)
pnml2lts-mc( 0/ 4): States per second: 988, Transitions per second: 2725
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, 66.9 B/state, compr.: 2.2%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 27880 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 1MB
pnml2lts-mc( 0/ 4): Est. total memory use: 1.0MB (~257.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="BugTracking-PT-q8m032"
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 BugTracking-PT-q8m032, 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 r472-tajo-171620399500419"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q8m032.tgz
mv BugTracking-PT-q8m032 execution
cd execution
if [ "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 ;