Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r472-tajo-171620399500433.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-q8m128, examination is CTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r472-tajo-171620399500433
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 16M
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 19 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 14K Apr 12 01:10 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K Apr 12 01:10 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 78K 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-q8m128-CTLCardinality-2024-00
FORMULA_NAME BugTracking-PT-q8m128-CTLCardinality-2024-01
FORMULA_NAME BugTracking-PT-q8m128-CTLCardinality-2024-02
FORMULA_NAME BugTracking-PT-q8m128-CTLCardinality-2024-03
FORMULA_NAME BugTracking-PT-q8m128-CTLCardinality-2024-04
FORMULA_NAME BugTracking-PT-q8m128-CTLCardinality-2024-05
FORMULA_NAME BugTracking-PT-q8m128-CTLCardinality-2024-06
FORMULA_NAME BugTracking-PT-q8m128-CTLCardinality-2024-07
FORMULA_NAME BugTracking-PT-q8m128-CTLCardinality-2024-08
FORMULA_NAME BugTracking-PT-q8m128-CTLCardinality-2024-09
FORMULA_NAME BugTracking-PT-q8m128-CTLCardinality-2024-10
FORMULA_NAME BugTracking-PT-q8m128-CTLCardinality-2024-11
FORMULA_NAME BugTracking-PT-q8m128-CTLCardinality-2023-12
FORMULA_NAME BugTracking-PT-q8m128-CTLCardinality-2023-13
FORMULA_NAME BugTracking-PT-q8m128-CTLCardinality-2023-14
FORMULA_NAME BugTracking-PT-q8m128-CTLCardinality-2023-15

=== Now, execution of the tool begins

BK_START 1717224590502

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=CTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m128
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 06:49:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 06:49:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 06:49:53] [INFO ] Load time of PNML (sax parser for PT used): 1032 ms
[2024-06-01 06:49:53] [INFO ] Transformed 754 places.
[2024-06-01 06:49:53] [INFO ] Transformed 27370 transitions.
[2024-06-01 06:49:53] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1277 ms.
Parsed 16 properties from file /home/mcc/execution/CTLCardinality.xml in 16 ms.
Deduced a syphon composed of 474 places in 143 ms
Reduce places removed 474 places and 23466 transitions.
FORMULA BugTracking-PT-q8m128-CTLCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 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 89 ms. Remains 278 /280 variables (removed 2) and now considering 3904/3904 (removed 0) transitions.
[2024-06-01 06:49:53] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 278 cols
[2024-06-01 06:49:53] [INFO ] Computed 8 invariants in 60 ms
[2024-06-01 06:49:54] [INFO ] Implicit Places using invariants in 842 ms returned []
[2024-06-01 06:49:54] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
[2024-06-01 06:49:54] [INFO ] Invariant cache hit.
[2024-06-01 06:49:55] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-06-01 06:49:57] [INFO ] Implicit Places using invariants and state equation in 3237 ms returned []
Implicit Place search using SMT with State Equation took 4117 ms to find 0 implicit places.
Running 3902 sub problems to find dead transitions.
[2024-06-01 06:49:58] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
[2024-06-01 06:49:58] [INFO ] Invariant cache hit.
[2024-06-01 06:49:58] [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:51:00] [INFO ] Deduced a trap composed of 10 places in 328 ms of which 16 ms to minimize.
[2024-06-01 06:51:00] [INFO ] Deduced a trap composed of 18 places in 165 ms of which 2 ms to minimize.
[2024-06-01 06:51:01] [INFO ] Deduced a trap composed of 14 places in 214 ms of which 2 ms to minimize.
[2024-06-01 06:51:01] [INFO ] Deduced a trap composed of 7 places in 80 ms of which 0 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 30076 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:51:21] [INFO ] Deduced a trap composed of 11 places in 52 ms of which 1 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 30057 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 102534ms problems are : Problem set: 125 solved, 3777 unsolved
Search for dead transitions found 125 dead transitions in 102674ms
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 20 places and 600 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 258 transition count 3179
Reduce places removed 15 places and 328 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 35 place count 243 transition count 2851
Reduce places removed 5 places and 133 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 40 place count 238 transition count 2718
Reduce places removed 5 places and 113 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 45 place count 233 transition count 2605
Reduce places removed 2 places and 52 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 47 place count 231 transition count 2553
Reduce places removed 1 places and 30 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 48 place count 230 transition count 2523
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 50 place count 228 transition count 2497
Deduced a syphon composed of 5 places in 2 ms
Iterating global reduction 6 with 2 rules applied. Total rules applied 52 place count 228 transition count 2497
Deduced a syphon composed of 5 places in 6 ms
Applied a total of 52 rules in 51 ms. Remains 228 /278 variables (removed 50) and now considering 2497/3779 (removed 1282) transitions.
[2024-06-01 06:51:40] [INFO ] Flow matrix only has 2386 transitions (discarded 111 similar events)
// Phase 1: matrix 2386 rows 228 cols
[2024-06-01 06:51:40] [INFO ] Computed 13 invariants in 12 ms
[2024-06-01 06:51:41] [INFO ] Implicit Places using invariants in 468 ms returned []
[2024-06-01 06:51:41] [INFO ] Flow matrix only has 2386 transitions (discarded 111 similar events)
[2024-06-01 06:51:41] [INFO ] Invariant cache hit.
[2024-06-01 06:51:41] [INFO ] State equation strengthened by 209 read => feed constraints.
[2024-06-01 06:51:42] [INFO ] Implicit Places using invariants and state equation in 1784 ms returned []
Implicit Place search using SMT with State Equation took 2272 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 228/280 places, 2497/3904 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 109270 ms. Remains : 228/280 places, 2497/3904 transitions.
Deduced a syphon composed of 5 places in 3 ms
Reduce places removed 5 places and 0 transitions.
Support contains 14 out of 223 places after structural reductions.
[2024-06-01 06:51:43] [INFO ] Initial state reduction rules for CTL removed 2 formulas.
[2024-06-01 06:51:43] [INFO ] Flatten gal took : 274 ms
[2024-06-01 06:51:43] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
FORMULA BugTracking-PT-q8m128-CTLCardinality-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLCardinality-2024-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLCardinality-2024-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 06:51:43] [INFO ] Flatten gal took : 130 ms
[2024-06-01 06:51:43] [INFO ] Input system was already deterministic with 2497 transitions.
Support contains 11 out of 223 places (down from 14) after GAL structural reductions.
RANDOM walk for 40003 steps (19 resets) in 1458 ms. (27 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 141 ms. (281 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (8 resets) in 155 ms. (256 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 96 ms. (412 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (8 resets) in 81 ms. (487 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 91 ms. (434 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (8 resets) in 78 ms. (506 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 46 ms. (851 steps per ms) remains 8/8 properties
[2024-06-01 06:51:44] [INFO ] Flow matrix only has 2386 transitions (discarded 111 similar events)
// Phase 1: matrix 2386 rows 223 cols
[2024-06-01 06:51:44] [INFO ] Computed 8 invariants in 17 ms
[2024-06-01 06:51:44] [INFO ] State equation strengthened by 209 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp9 is UNSAT
At refinement iteration 1 (OVERLAPS) 54/63 variables, 4/4 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 1770/1833 variables, 63/67 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1833 variables, 60/127 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1833 variables, 0/127 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 685/2518 variables, 110/237 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2518 variables, 1/238 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2518 variables, 125/363 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2518 variables, 0/363 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 5/2523 variables, 2/365 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2523 variables, 1/366 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2523 variables, 0/366 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 86/2609 variables, 49/415 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2609 variables, 1/416 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2609 variables, 24/440 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2609 variables, 0/440 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/2609 variables, 0/440 constraints. Problems are: Problem set: 4 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2609/2609 variables, and 440 constraints, problems are : Problem set: 4 solved, 4 unsolved in 1604 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 223/223 constraints, ReadFeed: 209/209 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 29/34 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 835/869 variables, 34/35 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/869 variables, 3/38 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/869 variables, 0/38 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 1340/2209 variables, 64/102 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2209 variables, 1/103 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2209 variables, 145/248 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2209 variables, 2/250 constraints. Problems are: Problem set: 4 solved, 4 unsolved
[2024-06-01 06:51:47] [INFO ] Deduced a trap composed of 28 places in 221 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2209 variables, 1/251 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2209 variables, 0/251 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 9/2218 variables, 2/253 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2218 variables, 0/253 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 298/2516 variables, 87/340 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2516 variables, 1/341 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2516 variables, 43/384 constraints. Problems are: Problem set: 4 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2516 variables, 2/386 constraints. Problems are: Problem set: 4 solved, 4 unsolved
[2024-06-01 06:51:48] [INFO ] Deduced a trap composed of 31 places in 177 ms of which 1 ms to minimize.
[2024-06-01 06:51:48] [INFO ] Deduced a trap composed of 30 places in 169 ms of which 1 ms to minimize.
[2024-06-01 06:51:48] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 1 ms to minimize.
Problem AtomicPropp3 is UNSAT
[2024-06-01 06:51:49] [INFO ] Deduced a trap composed of 28 places in 349 ms of which 2 ms to minimize.
At refinement iteration 18 (INCLUDED_ONLY) 0/2516 variables, 4/390 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2516 variables, 0/390 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 3/2519 variables, 1/391 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2519 variables, 0/391 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 85/2604 variables, 35/426 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2604 variables, 2/428 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/2604 variables, 18/446 constraints. Problems are: Problem set: 5 solved, 3 unsolved
[2024-06-01 06:51:49] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 2 ms to minimize.
At refinement iteration 25 (INCLUDED_ONLY) 0/2604 variables, 1/447 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2604 variables, 0/447 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 27 (OVERLAPS) 5/2609 variables, 3/450 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2609 variables, 0/450 constraints. Problems are: Problem set: 5 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 0/2609 variables, 0/450 constraints. Problems are: Problem set: 5 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2609/2609 variables, and 450 constraints, problems are : Problem set: 5 solved, 3 unsolved in 3664 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 223/223 constraints, ReadFeed: 209/209 constraints, PredecessorRefiner: 4/8 constraints, Known Traps: 6/6 constraints]
After SMT, in 5318ms problems are : Problem set: 5 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2250 ms.
Support contains 4 out of 223 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY 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
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 10 place count 221 transition count 2496
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 16 place count 215 transition count 2496
Applied a total of 16 rules in 180 ms. Remains 215 /223 variables (removed 8) and now considering 2496/2497 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 181 ms. Remains : 215/223 places, 2496/2497 transitions.
RANDOM walk for 40362 steps (8 resets) in 249 ms. (161 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 212 ms. (187 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 153 ms. (259 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 116 ms. (341 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 130648 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :0 out of 3
Probabilistic random walk after 130648 steps, saw 54610 distinct states, run finished after 3018 ms. (steps per millisecond=43 ) properties seen :0
[2024-06-01 06:51:56] [INFO ] Flow matrix only has 2378 transitions (discarded 118 similar events)
// Phase 1: matrix 2378 rows 215 cols
[2024-06-01 06:51:56] [INFO ] Computed 8 invariants in 10 ms
[2024-06-01 06:51:56] [INFO ] State equation strengthened by 210 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 29/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 804/837 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/837 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/837 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1371/2208 variables, 64/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2208 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2208 variables, 147/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2208 variables, 0/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 6/2214 variables, 2/250 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2214 variables, 2/252 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2214 variables, 0/252 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 299/2513 variables, 82/334 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2513 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2513 variables, 50/385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2513 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 1/2514 variables, 1/386 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2514 variables, 1/387 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/2514 variables, 0/387 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 78/2592 variables, 32/419 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/2592 variables, 2/421 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2592 variables, 11/432 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2592 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 1/2593 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2593 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (OVERLAPS) 0/2593 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2593/2593 variables, and 433 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1354 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 215/215 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 29/33 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 804/837 variables, 33/34 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/837 variables, 2/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/837 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 1371/2208 variables, 64/100 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/2208 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/2208 variables, 147/248 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/2208 variables, 2/250 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 06:51:58] [INFO ] Deduced a trap composed of 29 places in 220 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/2208 variables, 1/251 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/2208 variables, 0/251 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 6/2214 variables, 2/253 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2214 variables, 2/255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2214 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 299/2513 variables, 82/337 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2513 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2513 variables, 50/388 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2513 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 06:51:59] [INFO ] Deduced a trap composed of 10 places in 125 ms of which 1 ms to minimize.
[2024-06-01 06:51:59] [INFO ] Deduced a trap composed of 28 places in 210 ms of which 3 ms to minimize.
[2024-06-01 06:51:59] [INFO ] Deduced a trap composed of 62 places in 305 ms of which 3 ms to minimize.
At refinement iteration 19 (INCLUDED_ONLY) 0/2513 variables, 3/392 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/2513 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 1/2514 variables, 1/393 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/2514 variables, 1/394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/2514 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 24 (OVERLAPS) 78/2592 variables, 32/426 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/2592 variables, 2/428 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/2592 variables, 11/439 constraints. Problems are: Problem set: 0 solved, 3 unsolved
[2024-06-01 06:52:00] [INFO ] Deduced a trap composed of 5 places in 192 ms of which 1 ms to minimize.
At refinement iteration 27 (INCLUDED_ONLY) 0/2592 variables, 1/440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/2592 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 29 (OVERLAPS) 1/2593 variables, 1/441 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/2593 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 31 (OVERLAPS) 0/2593 variables, 0/441 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2593/2593 variables, and 441 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3922 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 215/215 constraints, ReadFeed: 210/210 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints]
After SMT, in 5346ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2482 ms.
Support contains 4 out of 215 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 215/215 places, 2496/2496 transitions.
Applied a total of 0 rules in 42 ms. Remains 215 /215 variables (removed 0) and now considering 2496/2496 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 215/215 places, 2496/2496 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 215/215 places, 2496/2496 transitions.
Applied a total of 0 rules in 42 ms. Remains 215 /215 variables (removed 0) and now considering 2496/2496 (removed 0) transitions.
[2024-06-01 06:52:03] [INFO ] Flow matrix only has 2378 transitions (discarded 118 similar events)
[2024-06-01 06:52:03] [INFO ] Invariant cache hit.
[2024-06-01 06:52:04] [INFO ] Implicit Places using invariants in 417 ms returned []
[2024-06-01 06:52:04] [INFO ] Flow matrix only has 2378 transitions (discarded 118 similar events)
[2024-06-01 06:52:04] [INFO ] Invariant cache hit.
[2024-06-01 06:52:04] [INFO ] State equation strengthened by 210 read => feed constraints.
[2024-06-01 06:52:05] [INFO ] Implicit Places using invariants and state equation in 1398 ms returned []
Implicit Place search using SMT with State Equation took 1829 ms to find 0 implicit places.
[2024-06-01 06:52:06] [INFO ] Redundant transitions in 217 ms returned []
Running 2495 sub problems to find dead transitions.
[2024-06-01 06:52:06] [INFO ] Flow matrix only has 2378 transitions (discarded 118 similar events)
[2024-06-01 06:52:06] [INFO ] Invariant cache hit.
[2024-06-01 06:52:06] [INFO ] State equation strengthened by 210 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2495 unsolved
[2024-06-01 06:52:54] [INFO ] Deduced a trap composed of 10 places in 127 ms of which 7 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:52:54] [INFO ] Deduced a trap composed of 8 places in 108 ms of which 11 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
[2024-06-01 06:53:01] [INFO ] Deduced a trap composed of 22 places in 69 ms of which 0 ms to minimize.
Problem TDEAD2456 is UNSAT
Problem TDEAD2457 is UNSAT
Problem TDEAD2468 is UNSAT
Problem TDEAD2469 is UNSAT
Problem TDEAD2470 is UNSAT
Problem TDEAD2480 is UNSAT
Problem TDEAD2481 is UNSAT
Problem TDEAD2492 is UNSAT
Problem TDEAD2493 is UNSAT
Problem TDEAD2494 is UNSAT
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, 3/11 constraints. Problems are: Problem set: 299 solved, 2196 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 215/2593 variables, and 11 constraints, problems are : Problem set: 299 solved, 2196 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/215 constraints, ReadFeed: 0/210 constraints, PredecessorRefiner: 2495/2495 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 299 solved, 2196 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/215 variables, 8/8 constraints. Problems are: Problem set: 299 solved, 2196 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/215 variables, 3/11 constraints. Problems are: Problem set: 299 solved, 2196 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/215 variables, 0/11 constraints. Problems are: Problem set: 299 solved, 2196 unsolved
At refinement iteration 3 (OVERLAPS) 2378/2593 variables, 215/226 constraints. Problems are: Problem set: 299 solved, 2196 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2593 variables, 210/436 constraints. Problems are: Problem set: 299 solved, 2196 unsolved
Usage: pnml2lts-sym [-gvqh] [--order=]
[--mu-opt] [--saturation=]
[--sat-granularity=] [--save-sat-levels]
[--guidance=] [-d|--deadlock]
[--action=] [-i|--invariant=STRING] [-n|--no-exit]
[--trace=] [--type=]
[--mu=.mu] [--ctl-star=.ctl]
[--ctl=.ctl] [--ltl=.ltl] [--dot=STRING]
[--save-levels=STRING] [--pg-solve] [--attr=]
[--saturating-attractor] [--write-strategy=.spg]
[--check-strategy] [--interactive-play] [--player]
[--pg-write=.spg] [--no-matrix] [--noack=<1|2>]
[--edge-label=] [--labels] [-m|--matrix]
[--mucalc=.mcf|] [-c|--cache]
[--allow-undefined-edges] [--allow-undefined-values]
[-p|--por= (default: heur)]
[--weak=[valmari] (default: uses stronger left-commutativity)]
[--leap] [-r|--regroup=<(T,)+>] [--sloan-w1=] [--sloan-w2=]
[--cw-max-cols=] [--cw-max-rows=] [--col-ins=<(C.C',)+>]
[--mh-timeout=] [--row-perm=<(R,)+>] [--col-perm=<(C,)+>]
[--graph-metrics] [--regroup-exit] [--regroup-time]
[-g|--pins-guards] [--vset=] [--ldd32-step=]
[--ldd32-cache=] [--ldd-step=] [--ldd-cache=]
[--cache-ratio=] [--max-increase=]
[--min-free-nodes=] [--fdd-bits=]
[--fdd-reorder=]
[--vset-cache-diff=] [--no-soundness-check] [--precise]
[--next-union] [--peak-nodes] [--maxsum=]
[--block-size=] [--cluster-size=] [-v] [-q]
[--debug=] [--stats] [--where] [--when]
[--timeout=INT] [--version] [-h|--help] [--usage]
[OPTIONS] []
Could not compute solution for formula : BugTracking-PT-q8m128-CTLCardinality-2024-00
Could not compute solution for formula : BugTracking-PT-q8m128-CTLCardinality-2024-01
Could not compute solution for formula : BugTracking-PT-q8m128-CTLCardinality-2024-02
Could not compute solution for formula : BugTracking-PT-q8m128-CTLCardinality-2024-03
Could not compute solution for formula : BugTracking-PT-q8m128-CTLCardinality-2024-04
Could not compute solution for formula : BugTracking-PT-q8m128-CTLCardinality-2024-05
Could not compute solution for formula : BugTracking-PT-q8m128-CTLCardinality-2024-06
Could not compute solution for formula : BugTracking-PT-q8m128-CTLCardinality-2024-07
Could not compute solution for formula : BugTracking-PT-q8m128-CTLCardinality-2024-08
Could not compute solution for formula : BugTracking-PT-q8m128-CTLCardinality-2024-09
Could not compute solution for formula : BugTracking-PT-q8m128-CTLCardinality-2024-10
Could not compute solution for formula : BugTracking-PT-q8m128-CTLCardinality-2024-11
Could not compute solution for formula : BugTracking-PT-q8m128-CTLCardinality-2023-12
Could not compute solution for formula : BugTracking-PT-q8m128-CTLCardinality-2023-13
Could not compute solution for formula : BugTracking-PT-q8m128-CTLCardinality-2023-14
Could not compute solution for formula : BugTracking-PT-q8m128-CTLCardinality-2023-15

BK_STOP 1717224814711

--------------------
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:
++ 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
++ sed s/.jar//
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLCardinality -timeout 360 -rebuildPNML
mcc2024
ctl formula name BugTracking-PT-q8m128-CTLCardinality-2024-00
ctl formula formula --ctl=/tmp/640/ctl_0_
ctl formula name BugTracking-PT-q8m128-CTLCardinality-2024-01
ctl formula formula --ctl=/tmp/640/ctl_1_
ctl formula name BugTracking-PT-q8m128-CTLCardinality-2024-02
ctl formula formula --ctl=/tmp/640/ctl_2_
ctl formula name BugTracking-PT-q8m128-CTLCardinality-2024-03
ctl formula formula --ctl=/tmp/640/ctl_3_
ctl formula name BugTracking-PT-q8m128-CTLCardinality-2024-04
ctl formula formula --ctl=/tmp/640/ctl_4_
ctl formula name BugTracking-PT-q8m128-CTLCardinality-2024-05
ctl formula formula --ctl=/tmp/640/ctl_5_
ctl formula name BugTracking-PT-q8m128-CTLCardinality-2024-06
ctl formula formula --ctl=/tmp/640/ctl_6_
ctl formula name BugTracking-PT-q8m128-CTLCardinality-2024-07
ctl formula formula --ctl=/tmp/640/ctl_7_
ctl formula name BugTracking-PT-q8m128-CTLCardinality-2024-08
ctl formula formula --ctl=/tmp/640/ctl_8_
ctl formula name BugTracking-PT-q8m128-CTLCardinality-2024-09
ctl formula formula --ctl=/tmp/640/ctl_9_
ctl formula name BugTracking-PT-q8m128-CTLCardinality-2024-10
ctl formula formula --ctl=/tmp/640/ctl_10_
ctl formula name BugTracking-PT-q8m128-CTLCardinality-2024-11
ctl formula formula --ctl=/tmp/640/ctl_11_
ctl formula name BugTracking-PT-q8m128-CTLCardinality-2023-12
ctl formula formula --ctl=/tmp/640/ctl_12_
ctl formula name BugTracking-PT-q8m128-CTLCardinality-2023-13
ctl formula formula --ctl=/tmp/640/ctl_13_
ctl formula name BugTracking-PT-q8m128-CTLCardinality-2023-14
ctl formula formula --ctl=/tmp/640/ctl_14_
ctl formula name BugTracking-PT-q8m128-CTLCardinality-2023-15
ctl formula formula --ctl=/tmp/640/ctl_15_
pnml2lts-sym, ** error **: unknown vector set implementation lddmc

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BugTracking-PT-q8m128"
export BK_EXAMINATION="CTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is BugTracking-PT-q8m128, examination is CTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r472-tajo-171620399500433"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BugTracking-PT-q8m128.tgz
mv BugTracking-PT-q8m128 execution
cd execution
if [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "UpperBounds" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] || [ "CTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "CTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "CTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' CTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLCardinality" = "ReachabilityDeadlock" ] || [ "CTLCardinality" = "QuasiLiveness" ] || [ "CTLCardinality" = "StableMarking" ] || [ "CTLCardinality" = "Liveness" ] || [ "CTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;