fond
Model Checking Contest 2024
14th edition, Geneva, Switzerland, June 25, 2024
Execution of r048-tajo-171620399500434
Last Updated
July 7, 2024

About the Execution of ITS-Tools for BugTracking-PT-q8m128

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 228951.00 0.00 0.00 TTTFFFT?F?T?FFTF normal

Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2024-input.r048-tajo-171620399500434.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 itstools
Input is BugTracking-PT-q8m128, examination is CTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r048-tajo-171620399500434
=====================================================================

--------------------
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-CTLFireability-2024-00
FORMULA_NAME BugTracking-PT-q8m128-CTLFireability-2024-01
FORMULA_NAME BugTracking-PT-q8m128-CTLFireability-2024-02
FORMULA_NAME BugTracking-PT-q8m128-CTLFireability-2024-03
FORMULA_NAME BugTracking-PT-q8m128-CTLFireability-2024-04
FORMULA_NAME BugTracking-PT-q8m128-CTLFireability-2024-05
FORMULA_NAME BugTracking-PT-q8m128-CTLFireability-2024-06
FORMULA_NAME BugTracking-PT-q8m128-CTLFireability-2024-07
FORMULA_NAME BugTracking-PT-q8m128-CTLFireability-2024-08
FORMULA_NAME BugTracking-PT-q8m128-CTLFireability-2024-09
FORMULA_NAME BugTracking-PT-q8m128-CTLFireability-2024-10
FORMULA_NAME BugTracking-PT-q8m128-CTLFireability-2024-11
FORMULA_NAME BugTracking-PT-q8m128-CTLFireability-2023-12
FORMULA_NAME BugTracking-PT-q8m128-CTLFireability-2023-13
FORMULA_NAME BugTracking-PT-q8m128-CTLFireability-2023-14
FORMULA_NAME BugTracking-PT-q8m128-CTLFireability-2023-15

=== Now, execution of the tool begins

BK_START 1716333324094

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=CTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BugTracking-PT-q8m128
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
CTLFireability PT
Running Version 202405141337
[2024-05-21 23:15:25] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, CTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 23:15:25] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:15:26] [INFO ] Load time of PNML (sax parser for PT used): 793 ms
[2024-05-21 23:15:26] [INFO ] Transformed 754 places.
[2024-05-21 23:15:26] [INFO ] Transformed 27370 transitions.
[2024-05-21 23:15:26] [INFO ] Parsed PT model containing 754 places and 27370 transitions and 136172 arcs in 1020 ms.
Parsed 16 properties from file /home/mcc/execution/CTLFireability.xml in 21 ms.
Deduced a syphon composed of 474 places in 115 ms
Reduce places removed 474 places and 23466 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA BugTracking-PT-q8m128-CTLFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLFireability-2024-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLFireability-2023-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 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 66 ms. Remains 278 /280 variables (removed 2) and now considering 3904/3904 (removed 0) transitions.
[2024-05-21 23:15:26] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
// Phase 1: matrix 3729 rows 278 cols
[2024-05-21 23:15:26] [INFO ] Computed 8 invariants in 47 ms
[2024-05-21 23:15:27] [INFO ] Implicit Places using invariants in 554 ms returned []
[2024-05-21 23:15:27] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
[2024-05-21 23:15:27] [INFO ] Invariant cache hit.
[2024-05-21 23:15:27] [INFO ] State equation strengthened by 303 read => feed constraints.
[2024-05-21 23:15:31] [INFO ] Implicit Places using invariants and state equation in 3993 ms returned []
Implicit Place search using SMT with State Equation took 4582 ms to find 0 implicit places.
Running 3902 sub problems to find dead transitions.
[2024-05-21 23:15:31] [INFO ] Flow matrix only has 3729 transitions (discarded 175 similar events)
[2024-05-21 23:15:31] [INFO ] Invariant cache hit.
[2024-05-21 23:15:31] [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-05-21 23:16:26] [INFO ] Deduced a trap composed of 10 places in 363 ms of which 15 ms to minimize.
[2024-05-21 23:16:26] [INFO ] Deduced a trap composed of 18 places in 226 ms of which 2 ms to minimize.
[2024-05-21 23:16:26] [INFO ] Deduced a trap composed of 14 places in 244 ms of which 1 ms to minimize.
[2024-05-21 23:16:27] [INFO ] Deduced a trap composed of 7 places in 88 ms of which 1 ms to minimize.
[2024-05-21 23:16:35] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 1 ms to minimize.
Problem TDEAD784 is UNSAT
Problem TDEAD790 is UNSAT
Problem TDEAD796 is UNSAT
Problem TDEAD802 is UNSAT
Problem TDEAD808 is UNSAT
Problem TDEAD809 is UNSAT
Problem TDEAD810 is UNSAT
Problem TDEAD811 is UNSAT
Problem TDEAD812 is UNSAT
Problem TDEAD813 is UNSAT
Problem TDEAD814 is UNSAT
Problem TDEAD817 is UNSAT
Problem TDEAD818 is UNSAT
Problem TDEAD819 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 277/4007 variables, and 13 constraints, problems are : Problem set: 14 solved, 3888 unsolved in 30091 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: 5/5 constraints]
Escalating to Integer solving :Problem set: 14 solved, 3888 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/277 variables, 8/8 constraints. Problems are: Problem set: 14 solved, 3888 unsolved
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, 5/13 constraints. Problems are: Problem set: 125 solved, 3777 unsolved
[2024-05-21 23:17:10] [INFO ] Deduced a trap composed of 23 places in 90 ms of which 1 ms to minimize.
Problem TDEAD2706 is UNSAT
Problem TDEAD2715 is UNSAT
Problem TDEAD2716 is UNSAT
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 277/4007 variables, and 14 constraints, problems are : Problem set: 128 solved, 3774 unsolved in 30121 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: 6/6 constraints]
After SMT, in 98824ms problems are : Problem set: 128 solved, 3774 unsolved
Search for dead transitions found 128 dead transitions in 98927ms
Found 128 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 128 transitions
Dead transitions reduction (with SMT) removed 128 transitions
Starting structural reductions in LTL mode, iteration 1 : 278/280 places, 3776/3904 transitions.
Reduce places removed 20 places and 623 transitions.
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 258 transition count 3153
Reduce places removed 16 places and 328 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 36 place count 242 transition count 2825
Reduce places removed 7 places and 132 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 43 place count 235 transition count 2693
Reduce places removed 6 places and 112 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 49 place count 229 transition count 2581
Reduce places removed 2 places and 52 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 51 place count 227 transition count 2529
Reduce places removed 1 places and 30 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 52 place count 226 transition count 2499
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 54 place count 224 transition count 2473
Deduced a syphon composed of 2 places in 3 ms
Iterating global reduction 6 with 2 rules applied. Total rules applied 56 place count 224 transition count 2473
Deduced a syphon composed of 2 places in 3 ms
Applied a total of 56 rules in 51 ms. Remains 224 /278 variables (removed 54) and now considering 2473/3776 (removed 1303) transitions.
[2024-05-21 23:17:10] [INFO ] Flow matrix only has 2364 transitions (discarded 109 similar events)
// Phase 1: matrix 2364 rows 224 cols
[2024-05-21 23:17:10] [INFO ] Computed 10 invariants in 22 ms
[2024-05-21 23:17:10] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-05-21 23:17:10] [INFO ] Flow matrix only has 2364 transitions (discarded 109 similar events)
[2024-05-21 23:17:10] [INFO ] Invariant cache hit.
[2024-05-21 23:17:11] [INFO ] State equation strengthened by 209 read => feed constraints.
[2024-05-21 23:17:12] [INFO ] Implicit Places using invariants and state equation in 1421 ms returned []
Implicit Place search using SMT with State Equation took 1724 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 224/280 places, 2473/3904 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 105411 ms. Remains : 224/280 places, 2473/3904 transitions.
Deduced a syphon composed of 2 places in 4 ms
Reduce places removed 2 places and 0 transitions.
Support contains 13 out of 222 places after structural reductions.
[2024-05-21 23:17:12] [INFO ] Initial state reduction rules for CTL removed 5 formulas.
[2024-05-21 23:17:12] [INFO ] Flatten gal took : 258 ms
[2024-05-21 23:17:12] [INFO ] Initial state reduction rules for CTL removed 3 formulas.
FORMULA BugTracking-PT-q8m128-CTLFireability-2023-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLFireability-2023-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLFireability-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLFireability-2024-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BugTracking-PT-q8m128-CTLFireability-2024-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-05-21 23:17:12] [INFO ] Flatten gal took : 130 ms
[2024-05-21 23:17:13] [INFO ] Input system was already deterministic with 2473 transitions.
Support contains 0 out of 222 places (down from 13) after GAL structural reductions.
FORMULA BugTracking-PT-q8m128-CTLFireability-2023-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 0 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/0 properties
Finished probabilistic random walk after 0 steps, run visited all 0 properties in 0 ms. (steps per millisecond=0 )
[2024-05-21 23:17:13] [INFO ] Flatten gal took : 94 ms
[2024-05-21 23:17:13] [INFO ] Flatten gal took : 112 ms
[2024-05-21 23:17:13] [INFO ] Input system was already deterministic with 2473 transitions.
Computed a total of 7 stabilizing places and 148 stable transitions
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 2473/2473 transitions.
Applied a total of 0 rules in 11 ms. Remains 222 /222 variables (removed 0) and now considering 2473/2473 (removed 0) transitions.
[2024-05-21 23:17:13] [INFO ] Flow matrix only has 2364 transitions (discarded 109 similar events)
// Phase 1: matrix 2364 rows 222 cols
[2024-05-21 23:17:13] [INFO ] Computed 8 invariants in 19 ms
[2024-05-21 23:17:13] [INFO ] Implicit Places using invariants in 349 ms returned []
[2024-05-21 23:17:13] [INFO ] Flow matrix only has 2364 transitions (discarded 109 similar events)
[2024-05-21 23:17:13] [INFO ] Invariant cache hit.
[2024-05-21 23:17:14] [INFO ] State equation strengthened by 209 read => feed constraints.
[2024-05-21 23:17:15] [INFO ] Implicit Places using invariants and state equation in 1371 ms returned []
Implicit Place search using SMT with State Equation took 1723 ms to find 0 implicit places.
Running 2471 sub problems to find dead transitions.
[2024-05-21 23:17:15] [INFO ] Flow matrix only has 2364 transitions (discarded 109 similar events)
[2024-05-21 23:17:15] [INFO ] Invariant cache hit.
[2024-05-21 23:17:15] [INFO ] State equation strengthened by 209 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 2471 unsolved
[2024-05-21 23:18:01] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 1 ms to minimize.
Problem TDEAD1597 is UNSAT
Problem TDEAD1598 is UNSAT
[2024-05-21 23:18:01] [INFO ] Deduced a trap composed of 8 places in 99 ms of which 14 ms to minimize.
Problem TDEAD1600 is UNSAT
Problem TDEAD1601 is UNSAT
Problem TDEAD1602 is UNSAT
Problem TDEAD1603 is UNSAT
Problem TDEAD1604 is UNSAT
Problem TDEAD1605 is UNSAT
Problem TDEAD1606 is UNSAT
Problem TDEAD1607 is UNSAT
Problem TDEAD1608 is UNSAT
Problem TDEAD1609 is UNSAT
Problem TDEAD1610 is UNSAT
Problem TDEAD1611 is UNSAT
Problem TDEAD1612 is UNSAT
Problem TDEAD1613 is UNSAT
Problem TDEAD1614 is UNSAT
Problem TDEAD1615 is UNSAT
Problem TDEAD1616 is UNSAT
Problem TDEAD1617 is UNSAT
Problem TDEAD1618 is UNSAT
Problem TDEAD1619 is UNSAT
Problem TDEAD1623 is UNSAT
Problem TDEAD1631 is UNSAT
Problem TDEAD1632 is UNSAT
Problem TDEAD1643 is UNSAT
Problem TDEAD1644 is UNSAT
[2024-05-21 23:18:01] [INFO ] Deduced a trap composed of 9 places in 75 ms of which 1 ms to minimize.
Problem TDEAD1646 is UNSAT
[2024-05-21 23:18:01] [INFO ] Deduced a trap composed of 22 places in 58 ms of which 0 ms to minimize.
Problem TDEAD1647 is UNSAT
[2024-05-21 23:18:01] [INFO ] Deduced a trap composed of 16 places in 69 ms of which 1 ms to minimize.
Problem TDEAD1655 is UNSAT
Problem TDEAD1656 is UNSAT
Problem TDEAD1657 is UNSAT
Problem TDEAD1658 is UNSAT
Problem TDEAD1659 is UNSAT
Problem TDEAD1660 is UNSAT
Problem TDEAD1661 is UNSAT
Problem TDEAD1662 is UNSAT
Problem TDEAD1663 is UNSAT
Problem TDEAD1664 is UNSAT
Problem TDEAD1665 is UNSAT
Problem TDEAD1666 is UNSAT
Problem TDEAD1667 is UNSAT
Problem TDEAD1668 is UNSAT
Problem TDEAD1669 is UNSAT
Problem TDEAD1670 is UNSAT
Problem TDEAD1672 is UNSAT
Problem TDEAD1673 is UNSAT
Problem TDEAD1674 is UNSAT
Problem TDEAD1675 is UNSAT
Problem TDEAD1680 is UNSAT
Problem TDEAD1681 is UNSAT
Problem TDEAD1682 is UNSAT
Problem TDEAD1683 is UNSAT
Problem TDEAD1684 is UNSAT
Problem TDEAD1685 is UNSAT
Problem TDEAD1686 is UNSAT
Problem TDEAD1687 is UNSAT
Problem TDEAD1688 is UNSAT
Problem TDEAD1689 is UNSAT
Problem TDEAD1690 is UNSAT
Problem TDEAD1691 is UNSAT
Problem TDEAD1692 is UNSAT
Problem TDEAD1693 is UNSAT
Problem TDEAD1694 is UNSAT
Problem TDEAD1695 is UNSAT
Problem TDEAD1699 is UNSAT
Problem TDEAD1700 is UNSAT
Problem TDEAD1701 is UNSAT
Problem TDEAD1702 is UNSAT
Problem TDEAD1703 is UNSAT
Problem TDEAD1704 is UNSAT
Problem TDEAD1705 is UNSAT
Problem TDEAD1706 is UNSAT
Problem TDEAD1707 is UNSAT
Problem TDEAD1708 is UNSAT
Problem TDEAD1709 is UNSAT
Problem TDEAD1710 is UNSAT
Problem TDEAD1715 is UNSAT
Problem TDEAD1716 is UNSAT
Problem TDEAD1717 is UNSAT
Problem TDEAD1718 is UNSAT
Problem TDEAD1719 is UNSAT
Problem TDEAD1720 is UNSAT
Problem TDEAD1721 is UNSAT
Problem TDEAD1722 is UNSAT
Problem TDEAD1723 is UNSAT
Problem TDEAD1724 is UNSAT
Problem TDEAD1725 is UNSAT
Problem TDEAD1726 is UNSAT
Problem TDEAD1727 is UNSAT
Problem TDEAD1728 is UNSAT
Problem TDEAD1729 is UNSAT
Problem TDEAD1730 is UNSAT
Problem TDEAD1734 is UNSAT
Problem TDEAD1735 is UNSAT
Problem TDEAD1736 is UNSAT
Problem TDEAD1737 is UNSAT
Problem TDEAD1738 is UNSAT
Problem TDEAD1739 is UNSAT
Problem TDEAD1740 is UNSAT
Problem TDEAD1741 is UNSAT
Problem TDEAD1742 is UNSAT
Problem TDEAD1743 is UNSAT
Problem TDEAD1744 is UNSAT
Problem TDEAD1745 is UNSAT
Problem TDEAD1750 is UNSAT
Problem TDEAD1751 is UNSAT
Problem TDEAD1752 is UNSAT
Problem TDEAD1753 is UNSAT
Problem TDEAD1754 is UNSAT
Problem TDEAD1755 is UNSAT
Problem TDEAD1756 is UNSAT
Problem TDEAD1757 is UNSAT
Problem TDEAD1758 is UNSAT
Problem TDEAD1759 is UNSAT
Problem TDEAD1760 is UNSAT
Problem TDEAD1761 is UNSAT
Problem TDEAD1762 is UNSAT
Problem TDEAD1763 is UNSAT
Problem TDEAD1764 is UNSAT
Problem TDEAD1765 is UNSAT
Problem TDEAD1768 is UNSAT
Problem TDEAD1769 is UNSAT
Problem TDEAD1770 is UNSAT
Problem TDEAD1771 is UNSAT
Problem TDEAD1772 is UNSAT
Problem TDEAD1773 is UNSAT
Problem TDEAD1774 is UNSAT
Problem TDEAD1775 is UNSAT
Problem TDEAD1851 is UNSAT
Problem TDEAD1852 is UNSAT
Problem TDEAD1853 is UNSAT
Problem TDEAD1854 is UNSAT
Problem TDEAD1855 is UNSAT
Problem TDEAD1856 is UNSAT
Problem TDEAD1857 is UNSAT
Problem TDEAD1858 is UNSAT
Problem TDEAD1859 is UNSAT
Problem TDEAD1860 is UNSAT
Problem TDEAD1861 is UNSAT
Problem TDEAD1862 is UNSAT
Problem TDEAD1863 is UNSAT
Problem TDEAD1864 is UNSAT
Problem TDEAD1865 is UNSAT
Problem TDEAD1866 is UNSAT
Problem TDEAD1867 is UNSAT
Problem TDEAD1868 is UNSAT
Problem TDEAD1869 is UNSAT
Problem TDEAD1870 is UNSAT
Problem TDEAD1871 is UNSAT
Problem TDEAD1872 is UNSAT
Problem TDEAD1873 is UNSAT
Problem TDEAD1874 is UNSAT
Problem TDEAD1875 is UNSAT
Problem TDEAD1876 is UNSAT
Problem TDEAD1877 is UNSAT
Problem TDEAD1878 is UNSAT
Problem TDEAD1879 is UNSAT
Problem TDEAD1880 is UNSAT
Problem TDEAD1881 is UNSAT
Problem TDEAD1882 is UNSAT
Problem TDEAD1883 is UNSAT
Problem TDEAD1884 is UNSAT
Problem TDEAD1885 is UNSAT
Problem TDEAD1886 is UNSAT
Problem TDEAD1887 is UNSAT
Problem TDEAD1888 is UNSAT
Problem TDEAD1889 is UNSAT
Problem TDEAD1890 is UNSAT
Problem TDEAD1891 is UNSAT
Problem TDEAD1892 is UNSAT
Problem TDEAD1893 is UNSAT
Problem TDEAD1894 is UNSAT
Problem TDEAD1895 is UNSAT
Problem TDEAD1896 is UNSAT
Problem TDEAD1897 is UNSAT
Problem TDEAD1898 is UNSAT
Problem TDEAD1899 is UNSAT
Problem TDEAD1900 is UNSAT
Problem TDEAD1901 is UNSAT
Problem TDEAD1902 is UNSAT
Problem TDEAD1903 is UNSAT
Problem TDEAD1904 is UNSAT
Problem TDEAD1905 is UNSAT
Problem TDEAD1906 is UNSAT
Problem TDEAD1907 is UNSAT
Problem TDEAD1908 is UNSAT
Problem TDEAD1909 is UNSAT
Problem TDEAD1910 is UNSAT
Problem TDEAD1911 is UNSAT
Problem TDEAD1912 is UNSAT
Problem TDEAD1913 is UNSAT
Problem TDEAD1914 is UNSAT
Problem TDEAD1915 is UNSAT
Problem TDEAD1916 is UNSAT
Problem TDEAD1917 is UNSAT
Problem TDEAD1918 is UNSAT
Problem TDEAD1919 is UNSAT
Problem TDEAD1920 is UNSAT
Problem TDEAD1921 is UNSAT
Problem TDEAD1922 is UNSAT
Problem TDEAD1923 is UNSAT
Problem TDEAD1924 is UNSAT
Problem TDEAD1925 is UNSAT
Problem TDEAD1926 is UNSAT
Problem TDEAD1927 is UNSAT
Problem TDEAD1928 is UNSAT
Problem TDEAD1929 is UNSAT
Problem TDEAD1930 is UNSAT
Problem TDEAD1931 is UNSAT
Problem TDEAD1932 is UNSAT
Problem TDEAD1933 is UNSAT
Problem TDEAD1934 is UNSAT
Problem TDEAD1935 is UNSAT
Problem TDEAD1936 is UNSAT
Problem TDEAD1937 is UNSAT
Problem TDEAD1938 is UNSAT
Problem TDEAD1939 is UNSAT
Problem TDEAD1940 is UNSAT
Problem TDEAD1941 is UNSAT
Problem TDEAD1942 is UNSAT
Problem TDEAD1943 is UNSAT
Problem TDEAD1944 is UNSAT
Problem TDEAD1945 is UNSAT
Problem TDEAD1946 is UNSAT
Problem TDEAD1947 is UNSAT
Problem TDEAD1948 is UNSAT
Problem TDEAD1949 is UNSAT
Problem TDEAD1950 is UNSAT
Problem TDEAD1951 is UNSAT
Problem TDEAD1952 is UNSAT
Problem TDEAD1953 is UNSAT
Problem TDEAD1954 is UNSAT
Problem TDEAD1955 is UNSAT
Problem TDEAD1956 is UNSAT
Problem TDEAD1957 is UNSAT
Problem TDEAD1958 is UNSAT
Problem TDEAD1959 is UNSAT
Problem TDEAD1960 is UNSAT
Problem TDEAD1961 is UNSAT
Problem TDEAD1962 is UNSAT
Problem TDEAD1963 is UNSAT
Problem TDEAD1964 is UNSAT
Problem TDEAD1965 is UNSAT
Problem TDEAD1966 is UNSAT
Problem TDEAD1967 is UNSAT
Problem TDEAD1968 is UNSAT
Problem TDEAD1969 is UNSAT
Problem TDEAD1970 is UNSAT
Problem TDEAD1971 is UNSAT
Problem TDEAD1972 is UNSAT
Problem TDEAD1973 is UNSAT
Problem TDEAD1974 is UNSAT
Problem TDEAD1975 is UNSAT
Problem TDEAD1976 is UNSAT
Problem TDEAD1977 is UNSAT
Problem TDEAD1978 is UNSAT
Problem TDEAD1979 is UNSAT
Problem TDEAD1980 is UNSAT
Problem TDEAD1981 is UNSAT
Problem TDEAD1982 is UNSAT
Problem TDEAD1983 is UNSAT
Problem TDEAD1984 is UNSAT
Problem TDEAD1985 is UNSAT
Problem TDEAD1986 is UNSAT
Problem TDEAD1987 is UNSAT
Problem TDEAD1988 is UNSAT
Problem TDEAD1989 is UNSAT
Problem TDEAD1990 is UNSAT
Problem TDEAD1991 is UNSAT
Problem TDEAD1992 is UNSAT
Problem TDEAD1993 is UNSAT
Problem TDEAD1994 is UNSAT
Problem TDEAD1995 is UNSAT
Problem TDEAD1996 is UNSAT
Problem TDEAD1997 is UNSAT
Problem TDEAD1998 is UNSAT
Problem TDEAD1999 is UNSAT
Problem TDEAD2000 is UNSAT
Problem TDEAD2001 is UNSAT
Problem TDEAD2002 is UNSAT
Problem TDEAD2003 is UNSAT
Problem TDEAD2004 is UNSAT
Problem TDEAD2005 is UNSAT
Problem TDEAD2006 is UNSAT
Problem TDEAD2007 is UNSAT
Problem TDEAD2008 is UNSAT
Problem TDEAD2009 is UNSAT
Problem TDEAD2010 is UNSAT
Problem TDEAD2011 is UNSAT
Problem TDEAD2012 is UNSAT
Problem TDEAD2013 is UNSAT
Problem TDEAD2014 is UNSAT
Problem TDEAD2015 is UNSAT
Problem TDEAD2016 is UNSAT
Problem TDEAD2017 is UNSAT
Problem TDEAD2018 is UNSAT
Problem TDEAD2019 is UNSAT
Problem TDEAD2020 is UNSAT
Problem TDEAD2021 is UNSAT
Problem TDEAD2022 is UNSAT
Problem TDEAD2023 is UNSAT
Problem TDEAD2024 is UNSAT
Problem TDEAD2025 is UNSAT
Problem TDEAD2026 is UNSAT
Problem TDEAD2027 is UNSAT
Problem TDEAD2028 is UNSAT
Problem TDEAD2029 is UNSAT
Problem TDEAD2030 is UNSAT
Problem TDEAD2031 is UNSAT
Problem TDEAD2032 is UNSAT
Problem TDEAD2033 is UNSAT
Problem TDEAD2034 is UNSAT
Problem TDEAD2035 is UNSAT
Problem TDEAD2036 is UNSAT
Problem TDEAD2037 is UNSAT
Problem TDEAD2038 is UNSAT
Problem TDEAD2039 is UNSAT
Problem TDEAD2040 is UNSAT
Problem TDEAD2041 is UNSAT
Problem TDEAD2042 is UNSAT
Problem TDEAD2043 is UNSAT
Problem TDEAD2044 is UNSAT
Problem TDEAD2045 is UNSAT
Problem TDEAD2046 is UNSAT
Problem TDEAD2047 is UNSAT
Problem TDEAD2048 is UNSAT
Problem TDEAD2049 is UNSAT
Problem TDEAD2050 is UNSAT
Problem TDEAD2051 is UNSAT
Problem TDEAD2052 is UNSAT
Problem TDEAD2053 is UNSAT
Problem TDEAD2054 is UNSAT
Problem TDEAD2055 is UNSAT
Problem TDEAD2056 is UNSAT
Problem TDEAD2057 is UNSAT
Problem TDEAD2058 is UNSAT
Problem TDEAD2059 is UNSAT
Problem TDEAD2060 is UNSAT
Problem TDEAD2061 is UNSAT
Problem TDEAD2062 is UNSAT
Problem TDEAD2063 is UNSAT
Problem TDEAD2064 is UNSAT
Problem TDEAD2065 is UNSAT
Problem TDEAD2066 is UNSAT
Problem TDEAD2067 is UNSAT
Problem TDEAD2068 is UNSAT
Problem TDEAD2069 is UNSAT
Problem TDEAD2070 is UNSAT
Problem TDEAD2071 is UNSAT
Problem TDEAD2072 is UNSAT
Problem TDEAD2073 is UNSAT
Problem TDEAD2074 is UNSAT
Problem TDEAD2075 is UNSAT
Problem TDEAD2076 is UNSAT
Problem TDEAD2077 is UNSAT
Problem TDEAD2078 is UNSAT
Problem TDEAD2079 is UNSAT
Problem TDEAD2080 is UNSAT
Problem TDEAD2081 is UNSAT
Problem TDEAD2082 is UNSAT
Problem TDEAD2083 is UNSAT
Problem TDEAD2084 is UNSAT
Problem TDEAD2085 is UNSAT
Problem TDEAD2086 is UNSAT
Problem TDEAD2087 is UNSAT
Problem TDEAD2088 is UNSAT
Problem TDEAD2089 is UNSAT
Problem TDEAD2090 is UNSAT
Problem TDEAD2091 is UNSAT
Problem TDEAD2092 is UNSAT
Problem TDEAD2093 is UNSAT
Problem TDEAD2094 is UNSAT
Problem TDEAD2095 is UNSAT
Problem TDEAD2096 is UNSAT
Problem TDEAD2097 is UNSAT
Problem TDEAD2098 is UNSAT
Problem TDEAD2099 is UNSAT
Problem TDEAD2100 is UNSAT
Problem TDEAD2101 is UNSAT
Problem TDEAD2102 is UNSAT
Problem TDEAD2103 is UNSAT
Problem TDEAD2104 is UNSAT
Problem TDEAD2105 is UNSAT
Problem TDEAD2106 is UNSAT
Problem TDEAD2107 is UNSAT
Problem TDEAD2108 is UNSAT
Problem TDEAD2109 is UNSAT
Problem TDEAD2110 is UNSAT
Problem TDEAD2111 is UNSAT
Problem TDEAD2112 is UNSAT
Problem TDEAD2113 is UNSAT
Problem TDEAD2114 is UNSAT
Problem TDEAD2115 is UNSAT
Problem TDEAD2116 is UNSAT
Problem TDEAD2117 is UNSAT
Problem TDEAD2118 is UNSAT
Problem TDEAD2119 is UNSAT
Problem TDEAD2120 is UNSAT
Problem TDEAD2121 is UNSAT
Problem TDEAD2122 is UNSAT
Problem TDEAD2123 is UNSAT
Problem TDEAD2124 is UNSAT
Problem TDEAD2125 is UNSAT
[2024-05-21 23:18:04] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 1 ms to minimize.
Problem TDEAD2351 is UNSAT
Problem TDEAD2352 is UNSAT
Problem TDEAD2353 is UNSAT
Problem TDEAD2354 is UNSAT
Problem TDEAD2355 is UNSAT
Problem TDEAD2356 is UNSAT
Problem TDEAD2357 is UNSAT
Problem TDEAD2358 is UNSAT
Problem TDEAD2359 is UNSAT
Problem TDEAD2360 is UNSAT
Problem TDEAD2361 is UNSAT
Problem TDEAD2362 is UNSAT
Problem TDEAD2363 is UNSAT
Problem TDEAD2364 is UNSAT
Problem TDEAD2365 is UNSAT
Problem TDEAD2366 is UNSAT
Problem TDEAD2367 is UNSAT
Problem TDEAD2368 is UNSAT
Problem TDEAD2369 is UNSAT
Problem TDEAD2370 is UNSAT
Problem TDEAD2371 is UNSAT
Problem TDEAD2372 is UNSAT
Problem TDEAD2373 is UNSAT
Problem TDEAD2374 is UNSAT
Problem TDEAD2375 is UNSAT
Problem TDEAD2376 is UNSAT
Problem TDEAD2377 is UNSAT
Problem TDEAD2378 is UNSAT
Problem TDEAD2379 is UNSAT
Problem TDEAD2380 is UNSAT
Problem TDEAD2381 is UNSAT
Problem TDEAD2382 is UNSAT
Problem TDEAD2383 is UNSAT
Problem TDEAD2384 is UNSAT
Problem TDEAD2385 is UNSAT
Problem TDEAD2386 is UNSAT
Problem TDEAD2387 is UNSAT
Problem TDEAD2388 is UNSAT
Problem TDEAD2389 is UNSAT
Problem TDEAD2390 is UNSAT
Problem TDEAD2391 is UNSAT
Problem TDEAD2392 is UNSAT
Problem TDEAD2393 is UNSAT
Problem TDEAD2394 is UNSAT
Problem TDEAD2395 is UNSAT
Problem TDEAD2396 is UNSAT
Problem TDEAD2397 is UNSAT
Problem TDEAD2398 is UNSAT
Problem TDEAD2399 is UNSAT
Problem TDEAD2400 is UNSAT
[2024-05-21 23:18:04] [INFO ] Deduced a trap composed of 11 places in 124 ms of which 1 ms to minimize.
Problem TDEAD2409 is UNSAT
Problem TDEAD2410 is UNSAT
[2024-05-21 23:18:04] [INFO ] Deduced a trap composed of 12 places in 135 ms of which 0 ms to minimize.
Problem TDEAD2411 is UNSAT
Problem TDEAD2412 is UNSAT
Problem TDEAD2413 is UNSAT
Problem TDEAD2414 is UNSAT
Problem TDEAD2415 is UNSAT
Problem TDEAD2416 is UNSAT
Problem TDEAD2421 is UNSAT
Problem TDEAD2422 is UNSAT
Problem TDEAD2423 is UNSAT
Problem TDEAD2424 is UNSAT
Problem TDEAD2425 is UNSAT
Problem TDEAD2426 is UNSAT
Problem TDEAD2427 is UNSAT
Problem TDEAD2428 is UNSAT
Problem TDEAD2429 is UNSAT
Problem TDEAD2430 is UNSAT
Problem TDEAD2431 is UNSAT
Problem TDEAD2432 is UNSAT
Problem TDEAD2433 is UNSAT
Problem TDEAD2434 is UNSAT
Problem TDEAD2435 is UNSAT
Problem TDEAD2436 is UNSAT
Problem TDEAD2437 is UNSAT
Problem TDEAD2438 is UNSAT
Problem TDEAD2439 is UNSAT
Problem TDEAD2440 is UNSAT
[2024-05-21 23:18:04] [INFO ] Deduced a trap composed of 14 places in 109 ms of which 0 ms to minimize.
Problem TDEAD2445 is UNSAT
Problem TDEAD2446 is UNSAT
Problem TDEAD2447 is UNSAT
Problem TDEAD2448 is UNSAT
Problem TDEAD2449 is UNSAT
Problem TDEAD2450 is UNSAT
Problem TDEAD2451 is UNSAT
Problem TDEAD2452 is UNSAT
Problem TDEAD2453 is UNSAT
Problem TDEAD2454 is UNSAT
Problem TDEAD2455 is UNSAT
Problem TDEAD2456 is UNSAT
Problem TDEAD2457 is UNSAT
Problem TDEAD2458 is UNSAT
Problem TDEAD2463 is UNSAT
Problem TDEAD2464 is UNSAT
[2024-05-21 23:18:04] [INFO ] Deduced a trap composed of 13 places in 142 ms of which 1 ms to minimize.
Problem TDEAD2465 is UNSAT
Problem TDEAD2466 is UNSAT
Problem TDEAD2469 is UNSAT
Problem TDEAD2470 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/221 variables, 10/18 constraints. Problems are: Problem set: 502 solved, 1969 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 221/2586 variables, and 18 constraints, problems are : Problem set: 502 solved, 1969 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 0/222 constraints, ReadFeed: 0/209 constraints, PredecessorRefiner: 2471/2471 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 502 solved, 1969 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/206 variables, 7/7 constraints. Problems are: Problem set: 502 solved, 1969 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/206 variables, 10/17 constraints. Problems are: Problem set: 502 solved, 1969 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/206 variables, 0/17 constraints. Problems are: Problem set: 502 solved, 1969 unsolved
At refinement iteration 3 (OVERLAPS) 15/221 variables, 1/18 constraints. Problems are: Problem set: 502 solved, 1969 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/18 constraints. Problems are: Problem set: 502 solved, 1969 unsolved
At refinement iteration 5 (OVERLAPS) 2364/2585 variables, 221/239 constraints. Problems are: Problem set: 502 solved, 1969 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/2585 variables, 209/448 constraints. Problems are: Problem set: 502 solved, 1969 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2585/2586 variables, and 2341 constraints, problems are : Problem set: 502 solved, 1969 unsolved in 34245 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 221/222 constraints, ReadFeed: 209/209 constraints, PredecessorRefiner: 1893/2471 constraints, Known Traps: 10/10 constraints]
After SMT, in 90627ms problems are : Problem set: 502 solved, 1969 unsolved
Search for dead transitions found 502 dead transitions in 90674ms
Found 502 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 502 transitions
Dead transitions reduction (with SMT) removed 502 transitions
Starting structural reductions in LTL mode, iteration 1 : 222/222 places, 1971/2473 transitions.
Reduce places removed 41 places and 589 transitions.
Iterating post reduction 0 with 41 rules applied. Total rules applied 41 place count 181 transition count 1382
Reduce places removed 12 places and 180 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 53 place count 169 transition count 1202
Reduce places removed 8 places and 122 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 61 place count 161 transition count 1080
Reduce places removed 5 places and 74 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 66 place count 156 transition count 1006
Reduce places removed 1 places and 16 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 67 place count 155 transition count 990
Discarding 10 places :
Symmetric choice reduction at 5 with 10 rule applications. Total rules 77 place count 145 transition count 894
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 30 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 89 place count 143 transition count 864
Applied a total of 89 rules in 16 ms. Remains 143 /222 variables (removed 79) and now considering 864/1971 (removed 1107) transitions.
[2024-05-21 23:18:46] [INFO ] Flow matrix only has 813 transitions (discarded 51 similar events)
// Phase 1: matrix 813 rows 143 cols
[2024-05-21 23:18:46] [INFO ] Computed 7 invariants in 8 ms
[2024-05-21 23:18:46] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-21 23:18:46] [INFO ] Flow matrix only has 813 transitions (discarded 51 similar events)
[2024-05-21 23:18:46] [INFO ] Invariant cache hit.
[2024-05-21 23:18:46] [INFO ] State equation strengthened by 110 read => feed constraints.
[2024-05-21 23:18:46] [INFO ] Implicit Places using invariants and state equation in 633 ms returned []
Implicit Place search using SMT with State Equation took 811 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 143/222 places, 864/2473 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 93247 ms. Remains : 143/222 places, 864/2473 transitions.
[2024-05-21 23:18:46] [INFO ] Flatten gal took : 56 ms
[2024-05-21 23:18:46] [INFO ] Flatten gal took : 43 ms
[2024-05-21 23:18:47] [INFO ] Input system was already deterministic with 864 transitions.
[2024-05-21 23:18:47] [INFO ] Flatten gal took : 39 ms
[2024-05-21 23:18:47] [INFO ] Flatten gal took : 40 ms
[2024-05-21 23:18:47] [INFO ] Time to serialize gal into /tmp/CTLFireability9357730396401102374.gal : 38 ms
[2024-05-21 23:18:47] [INFO ] Time to serialize properties into /tmp/CTLFireability7446342953483424904.ctl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/CTLFireability9357730396401102374.gal' '-t' 'CGAL' '-ctl' '/tmp/CTLFireability7446342953483424904.ctl' '--gen-order' 'FOLLOW'

its-ctl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202405141337/bin/its-ctl-linux64 --gc-threshold 2000000 --quiet -...283
No direction supplied, using forward translation only.
Parsed 1 CTL formulae.

BK_STOP 1716333553045

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ CTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination CTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

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="CTLFireability"
export BK_TOOL="itstools"
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 itstools"
echo " Input is BugTracking-PT-q8m128, examination is CTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r048-tajo-171620399500434"
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 [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "UpperBounds" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] || [ "CTLFireability" = "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 [ "CTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "CTLFireability" != "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 "CTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property CTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "CTLFireability.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 '' CTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "CTLFireability" = "ReachabilityDeadlock" ] || [ "CTLFireability" = "QuasiLiveness" ] || [ "CTLFireability" = "StableMarking" ] || [ "CTLFireability" = "Liveness" ] || [ "CTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME CTLFireability"
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 ;