Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 480K
-rw-r--r-- 1 mcc users 5.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 59K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 28K Jun 2 16:33 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 MedleyA-PT-04-LTLCardinality-00
FORMULA_NAME MedleyA-PT-04-LTLCardinality-01
FORMULA_NAME MedleyA-PT-04-LTLCardinality-02
FORMULA_NAME MedleyA-PT-04-LTLCardinality-03
FORMULA_NAME MedleyA-PT-04-LTLCardinality-04
FORMULA_NAME MedleyA-PT-04-LTLCardinality-05
FORMULA_NAME MedleyA-PT-04-LTLCardinality-06
FORMULA_NAME MedleyA-PT-04-LTLCardinality-07
FORMULA_NAME MedleyA-PT-04-LTLCardinality-08
FORMULA_NAME MedleyA-PT-04-LTLCardinality-09
FORMULA_NAME MedleyA-PT-04-LTLCardinality-10
FORMULA_NAME MedleyA-PT-04-LTLCardinality-11
FORMULA_NAME MedleyA-PT-04-LTLCardinality-12
FORMULA_NAME MedleyA-PT-04-LTLCardinality-13
FORMULA_NAME MedleyA-PT-04-LTLCardinality-14
FORMULA_NAME MedleyA-PT-04-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717352051365

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-04
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:14:13] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 18:14:13] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:14:14] [INFO ] Load time of PNML (sax parser for PT used): 111 ms
[2024-06-02 18:14:14] [INFO ] Transformed 115 places.
[2024-06-02 18:14:14] [INFO ] Transformed 107 transitions.
[2024-06-02 18:14:14] [INFO ] Found NUPN structural information;
[2024-06-02 18:14:14] [INFO ] Parsed PT model containing 115 places and 107 transitions and 300 arcs in 342 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 27 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA MedleyA-PT-04-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-04-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-04-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-04-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-04-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-04-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-04-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-04-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-04-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-04-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 115 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 115/115 places, 107/107 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 114 transition count 107
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 11 place count 104 transition count 97
Iterating global reduction 1 with 10 rules applied. Total rules applied 21 place count 104 transition count 97
Applied a total of 21 rules in 76 ms. Remains 104 /115 variables (removed 11) and now considering 97/107 (removed 10) transitions.
// Phase 1: matrix 97 rows 104 cols
[2024-06-02 18:14:14] [INFO ] Computed 8 invariants in 29 ms
[2024-06-02 18:14:15] [INFO ] Implicit Places using invariants in 432 ms returned []
[2024-06-02 18:14:15] [INFO ] Invariant cache hit.
[2024-06-02 18:14:15] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 790 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-06-02 18:14:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-02 18:14:16] [INFO ] Deduced a trap composed of 13 places in 138 ms of which 29 ms to minimize.
[2024-06-02 18:14:17] [INFO ] Deduced a trap composed of 16 places in 81 ms of which 2 ms to minimize.
[2024-06-02 18:14:17] [INFO ] Deduced a trap composed of 15 places in 99 ms of which 2 ms to minimize.
[2024-06-02 18:14:17] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
[2024-06-02 18:14:17] [INFO ] Deduced a trap composed of 13 places in 59 ms of which 2 ms to minimize.
[2024-06-02 18:14:17] [INFO ] Deduced a trap composed of 19 places in 76 ms of which 3 ms to minimize.
[2024-06-02 18:14:17] [INFO ] Deduced a trap composed of 18 places in 68 ms of which 2 ms to minimize.
[2024-06-02 18:14:17] [INFO ] Deduced a trap composed of 20 places in 60 ms of which 3 ms to minimize.
[2024-06-02 18:14:17] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 2 ms to minimize.
[2024-06-02 18:14:17] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 5 ms to minimize.
[2024-06-02 18:14:17] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 2 ms to minimize.
[2024-06-02 18:14:17] [INFO ] Deduced a trap composed of 15 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:14:17] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 1 ms to minimize.
[2024-06-02 18:14:18] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 1 ms to minimize.
[2024-06-02 18:14:18] [INFO ] Deduced a trap composed of 28 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:14:18] [INFO ] Deduced a trap composed of 22 places in 43 ms of which 1 ms to minimize.
[2024-06-02 18:14:18] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 2 ms to minimize.
[2024-06-02 18:14:18] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 2 ms to minimize.
[2024-06-02 18:14:18] [INFO ] Deduced a trap composed of 19 places in 41 ms of which 4 ms to minimize.
[2024-06-02 18:14:18] [INFO ] Deduced a trap composed of 18 places in 34 ms of which 4 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-02 18:14:18] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 2 ms to minimize.
[2024-06-02 18:14:18] [INFO ] Deduced a trap composed of 23 places in 68 ms of which 2 ms to minimize.
[2024-06-02 18:14:18] [INFO ] Deduced a trap composed of 26 places in 65 ms of which 1 ms to minimize.
[2024-06-02 18:14:18] [INFO ] Deduced a trap composed of 23 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:14:18] [INFO ] Deduced a trap composed of 26 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:14:19] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 2 ms to minimize.
[2024-06-02 18:14:19] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-06-02 18:14:19] [INFO ] Deduced a trap composed of 21 places in 40 ms of which 2 ms to minimize.
[2024-06-02 18:14:19] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 9/37 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-02 18:14:19] [INFO ] Deduced a trap composed of 20 places in 34 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 1/38 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 97/201 variables, 104/142 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-02 18:14:21] [INFO ] Deduced a trap composed of 11 places in 83 ms of which 3 ms to minimize.
[2024-06-02 18:14:21] [INFO ] Deduced a trap composed of 15 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:14:21] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 2 ms to minimize.
[2024-06-02 18:14:21] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 3 ms to minimize.
[2024-06-02 18:14:21] [INFO ] Deduced a trap composed of 23 places in 88 ms of which 10 ms to minimize.
[2024-06-02 18:14:22] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 6/148 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-02 18:14:22] [INFO ] Deduced a trap composed of 11 places in 56 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/201 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 149 constraints, problems are : Problem set: 0 solved, 96 unsolved in 9567 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 37/37 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (OVERLAPS) 1/104 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 37/45 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-02 18:14:26] [INFO ] Deduced a trap composed of 18 places in 54 ms of which 1 ms to minimize.
[2024-06-02 18:14:26] [INFO ] Deduced a trap composed of 17 places in 51 ms of which 2 ms to minimize.
[2024-06-02 18:14:26] [INFO ] Deduced a trap composed of 26 places in 54 ms of which 3 ms to minimize.
[2024-06-02 18:14:26] [INFO ] Deduced a trap composed of 26 places in 53 ms of which 2 ms to minimize.
[2024-06-02 18:14:26] [INFO ] Deduced a trap composed of 17 places in 47 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 5/50 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-02 18:14:26] [INFO ] Deduced a trap composed of 23 places in 59 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 1/51 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-02 18:14:27] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 2 ms to minimize.
[2024-06-02 18:14:27] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 2/53 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/104 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (OVERLAPS) 97/201 variables, 104/157 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 96/253 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-02 18:14:28] [INFO ] Deduced a trap composed of 26 places in 48 ms of which 2 ms to minimize.
[2024-06-02 18:14:28] [INFO ] Deduced a trap composed of 31 places in 46 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 2/255 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-02 18:14:30] [INFO ] Deduced a trap composed of 28 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:14:30] [INFO ] Deduced a trap composed of 34 places in 34 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-02 18:14:33] [INFO ] Deduced a trap composed of 21 places in 42 ms of which 1 ms to minimize.
[2024-06-02 18:14:33] [INFO ] Deduced a trap composed of 42 places in 43 ms of which 2 ms to minimize.
[2024-06-02 18:14:33] [INFO ] Deduced a trap composed of 36 places in 39 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/201 variables, 3/260 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-06-02 18:14:36] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/201 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/201 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 14 (OVERLAPS) 0/201 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 261 constraints, problems are : Problem set: 0 solved, 96 unsolved in 25461 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 53/53 constraints]
After SMT, in 35213ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 35252ms
Starting structural reductions in LTL mode, iteration 1 : 104/115 places, 97/107 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 36169 ms. Remains : 104/115 places, 97/107 transitions.
Support contains 20 out of 104 places after structural reductions.
[2024-06-02 18:14:50] [INFO ] Flatten gal took : 59 ms
[2024-06-02 18:14:51] [INFO ] Flatten gal took : 25 ms
[2024-06-02 18:14:51] [INFO ] Input system was already deterministic with 97 transitions.
Reduction of identical properties reduced properties to check from 15 to 14
RANDOM walk for 30558 steps (850 resets) in 1174 ms. (26 steps per ms) remains 0/14 properties
Computed a total of 104 stabilizing places and 97 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 104 transition count 97
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&(p1||(X(p1)&&p2)))))'
Support contains 4 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 97/97 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 103 transition count 87
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 94 transition count 87
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 18 place count 94 transition count 75
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 42 place count 82 transition count 75
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 45 place count 79 transition count 72
Iterating global reduction 2 with 3 rules applied. Total rules applied 48 place count 79 transition count 72
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 88 place count 59 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 89 place count 58 transition count 51
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 91 place count 57 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 92 place count 56 transition count 50
Applied a total of 92 rules in 47 ms. Remains 56 /104 variables (removed 48) and now considering 50/97 (removed 47) transitions.
// Phase 1: matrix 50 rows 56 cols
[2024-06-02 18:14:51] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 18:14:51] [INFO ] Implicit Places using invariants in 72 ms returned []
[2024-06-02 18:14:51] [INFO ] Invariant cache hit.
[2024-06-02 18:14:52] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 164 ms to find 0 implicit places.
[2024-06-02 18:14:52] [INFO ] Redundant transitions in 0 ms returned []
Running 49 sub problems to find dead transitions.
[2024-06-02 18:14:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-02 18:14:52] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 1 ms to minimize.
[2024-06-02 18:14:52] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-06-02 18:14:52] [INFO ] Deduced a trap composed of 4 places in 28 ms of which 0 ms to minimize.
[2024-06-02 18:14:52] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-06-02 18:14:52] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (OVERLAPS) 50/105 variables, 55/67 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 1/106 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 0/106 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/106 variables, and 68 constraints, problems are : Problem set: 0 solved, 49 unsolved in 1173 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/55 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (OVERLAPS) 50/105 variables, 55/67 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/105 variables, 49/116 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/105 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 1/106 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/106 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 0/106 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/106 variables, and 117 constraints, problems are : Problem set: 0 solved, 49 unsolved in 1973 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 5/5 constraints]
After SMT, in 3203ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 3205ms
Starting structural reductions in SI_LTL mode, iteration 1 : 56/104 places, 50/97 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3424 ms. Remains : 56/104 places, 50/97 transitions.
Stuttering acceptance computed with spot in 292 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-04-LTLCardinality-03
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 2 ms.
FORMULA MedleyA-PT-04-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLCardinality-03 finished in 3809 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 97/97 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 99 transition count 92
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 99 transition count 92
Applied a total of 10 rules in 13 ms. Remains 99 /104 variables (removed 5) and now considering 92/97 (removed 5) transitions.
// Phase 1: matrix 92 rows 99 cols
[2024-06-02 18:14:55] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 18:14:55] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-02 18:14:55] [INFO ] Invariant cache hit.
[2024-06-02 18:14:55] [INFO ] Implicit Places using invariants and state equation in 190 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-06-02 18:14:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:14:56] [INFO ] Deduced a trap composed of 14 places in 51 ms of which 1 ms to minimize.
[2024-06-02 18:14:56] [INFO ] Deduced a trap composed of 15 places in 42 ms of which 2 ms to minimize.
[2024-06-02 18:14:56] [INFO ] Deduced a trap composed of 20 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:14:56] [INFO ] Deduced a trap composed of 19 places in 37 ms of which 1 ms to minimize.
[2024-06-02 18:14:56] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-02 18:14:56] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:14:56] [INFO ] Deduced a trap composed of 17 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:14:57] [INFO ] Deduced a trap composed of 15 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/191 variables, 99/115 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:14:57] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 2 ms to minimize.
[2024-06-02 18:14:57] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 1 ms to minimize.
[2024-06-02 18:14:57] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 3/118 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/191 variables, 0/118 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 118 constraints, problems are : Problem set: 0 solved, 91 unsolved in 4358 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 11/19 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/191 variables, 99/118 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 91/209 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:15:01] [INFO ] Deduced a trap composed of 10 places in 60 ms of which 1 ms to minimize.
[2024-06-02 18:15:01] [INFO ] Deduced a trap composed of 20 places in 50 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 2/211 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:15:03] [INFO ] Deduced a trap composed of 25 places in 68 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:15:05] [INFO ] Deduced a trap composed of 15 places in 52 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:15:08] [INFO ] Deduced a trap composed of 21 places in 37 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/191 variables, 1/214 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:15:10] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 1/215 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/191 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 13 (OVERLAPS) 0/191 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 215 constraints, problems are : Problem set: 0 solved, 91 unsolved in 17572 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 17/17 constraints]
After SMT, in 21966ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 21969ms
Starting structural reductions in LTL mode, iteration 1 : 99/104 places, 92/97 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 22252 ms. Remains : 99/104 places, 92/97 transitions.
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-04-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 23 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-04-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLCardinality-05 finished in 22353 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)&&X(p1))))'
Support contains 3 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 97/97 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 99 transition count 92
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 99 transition count 92
Applied a total of 10 rules in 7 ms. Remains 99 /104 variables (removed 5) and now considering 92/97 (removed 5) transitions.
// Phase 1: matrix 92 rows 99 cols
[2024-06-02 18:15:17] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 18:15:18] [INFO ] Implicit Places using invariants in 74 ms returned []
[2024-06-02 18:15:18] [INFO ] Invariant cache hit.
[2024-06-02 18:15:18] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-06-02 18:15:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:15:18] [INFO ] Deduced a trap composed of 17 places in 61 ms of which 2 ms to minimize.
[2024-06-02 18:15:19] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:15:19] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:15:19] [INFO ] Deduced a trap composed of 18 places in 41 ms of which 2 ms to minimize.
[2024-06-02 18:15:19] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:15:19] [INFO ] Deduced a trap composed of 19 places in 40 ms of which 2 ms to minimize.
[2024-06-02 18:15:19] [INFO ] Deduced a trap composed of 17 places in 39 ms of which 2 ms to minimize.
[2024-06-02 18:15:19] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 8/16 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/191 variables, 99/115 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:15:20] [INFO ] Deduced a trap composed of 10 places in 79 ms of which 4 ms to minimize.
[2024-06-02 18:15:20] [INFO ] Deduced a trap composed of 19 places in 39 ms of which 1 ms to minimize.
[2024-06-02 18:15:20] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:15:20] [INFO ] Deduced a trap composed of 16 places in 35 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/191 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 119 constraints, problems are : Problem set: 0 solved, 91 unsolved in 4493 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/191 variables, 99/119 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 91/210 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:15:24] [INFO ] Deduced a trap composed of 15 places in 74 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:15:26] [INFO ] Deduced a trap composed of 20 places in 63 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:15:29] [INFO ] Deduced a trap composed of 30 places in 43 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 10 (OVERLAPS) 0/191 variables, 0/213 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 213 constraints, problems are : Problem set: 0 solved, 91 unsolved in 12978 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 15/15 constraints]
After SMT, in 17503ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 17507ms
Starting structural reductions in LTL mode, iteration 1 : 99/104 places, 92/97 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17727 ms. Remains : 99/104 places, 92/97 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-04-LTLCardinality-06
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-04-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLCardinality-06 finished in 17870 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((((G(p0) U !p1) U p2)||X(G(p3))))))'
Support contains 6 out of 104 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 97/97 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 98 transition count 91
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 98 transition count 91
Applied a total of 12 rules in 7 ms. Remains 98 /104 variables (removed 6) and now considering 91/97 (removed 6) transitions.
// Phase 1: matrix 91 rows 98 cols
[2024-06-02 18:15:35] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 18:15:35] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-02 18:15:35] [INFO ] Invariant cache hit.
[2024-06-02 18:15:36] [INFO ] Implicit Places using invariants and state equation in 177 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Running 90 sub problems to find dead transitions.
[2024-06-02 18:15:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:15:36] [INFO ] Deduced a trap composed of 13 places in 46 ms of which 1 ms to minimize.
[2024-06-02 18:15:37] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:15:37] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-02 18:15:37] [INFO ] Deduced a trap composed of 19 places in 26 ms of which 1 ms to minimize.
[2024-06-02 18:15:37] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:15:37] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:15:37] [INFO ] Deduced a trap composed of 20 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/98 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (OVERLAPS) 91/189 variables, 98/113 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:15:38] [INFO ] Deduced a trap composed of 11 places in 49 ms of which 1 ms to minimize.
[2024-06-02 18:15:38] [INFO ] Deduced a trap composed of 12 places in 31 ms of which 2 ms to minimize.
[2024-06-02 18:15:38] [INFO ] Deduced a trap composed of 16 places in 38 ms of which 1 ms to minimize.
[2024-06-02 18:15:38] [INFO ] Deduced a trap composed of 10 places in 27 ms of which 1 ms to minimize.
[2024-06-02 18:15:38] [INFO ] Deduced a trap composed of 16 places in 22 ms of which 0 ms to minimize.
[2024-06-02 18:15:38] [INFO ] Deduced a trap composed of 17 places in 25 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 6/119 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:15:39] [INFO ] Deduced a trap composed of 18 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Real declared 189/189 variables, and 120 constraints, problems are : Problem set: 0 solved, 90 unsolved in 5340 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 90 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 1 (OVERLAPS) 1/98 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 14/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 4 (OVERLAPS) 91/189 variables, 98/120 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/189 variables, 90/210 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:15:43] [INFO ] Deduced a trap composed of 15 places in 59 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/189 variables, 1/211 constraints. Problems are: Problem set: 0 solved, 90 unsolved
[2024-06-02 18:15:44] [INFO ] Deduced a trap composed of 20 places in 45 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/189 variables, 1/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/189 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
At refinement iteration 9 (OVERLAPS) 0/189 variables, 0/212 constraints. Problems are: Problem set: 0 solved, 90 unsolved
No progress, stopping.
After SMT solving in domain Int declared 189/189 variables, and 212 constraints, problems are : Problem set: 0 solved, 90 unsolved in 11771 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 98/98 constraints, PredecessorRefiner: 90/90 constraints, Known Traps: 16/16 constraints]
After SMT, in 17152ms problems are : Problem set: 0 solved, 90 unsolved
Search for dead transitions found 0 dead transitions in 17154ms
Starting structural reductions in LTL mode, iteration 1 : 98/104 places, 91/97 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17442 ms. Remains : 98/104 places, 91/97 transitions.
Stuttering acceptance computed with spot in 539 ms :[(AND (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (AND (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p3)), (AND p0 p1 (NOT p3)), true, (NOT p0), p1, (NOT p2)]
Running random walk in product with property : MedleyA-PT-04-LTLCardinality-08
Stuttering criterion allowed to conclude after 4761 steps with 132 reset in 94 ms.
FORMULA MedleyA-PT-04-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLCardinality-08 finished in 18107 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 97/97 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 103 transition count 84
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 91 transition count 84
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 24 place count 91 transition count 74
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 44 place count 81 transition count 74
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 46 place count 79 transition count 72
Iterating global reduction 2 with 2 rules applied. Total rules applied 48 place count 79 transition count 72
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 21
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 90 place count 58 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 91 place count 57 transition count 50
Reduce places removed 1 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 93 place count 56 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 94 place count 55 transition count 49
Applied a total of 94 rules in 38 ms. Remains 55 /104 variables (removed 49) and now considering 49/97 (removed 48) transitions.
// Phase 1: matrix 49 rows 55 cols
[2024-06-02 18:15:53] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 18:15:54] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 18:15:54] [INFO ] Invariant cache hit.
[2024-06-02 18:15:54] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2024-06-02 18:15:54] [INFO ] Redundant transitions in 1 ms returned []
Running 46 sub problems to find dead transitions.
[2024-06-02 18:15:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-06-02 18:15:54] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-06-02 18:15:54] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:15:54] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
[2024-06-02 18:15:54] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-06-02 18:15:54] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 2 ms to minimize.
[2024-06-02 18:15:55] [INFO ] Deduced a trap composed of 6 places in 25 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 49/103 variables, 54/67 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 1/104 variables, 1/68 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 10 (OVERLAPS) 0/104 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 68 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1692 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 2/54 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/54 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 49/103 variables, 54/67 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/103 variables, 46/113 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/103 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (OVERLAPS) 1/104 variables, 1/114 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-06-02 18:15:57] [INFO ] Deduced a trap composed of 4 places in 35 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/104 variables, 1/115 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/104 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 13 (OVERLAPS) 0/104 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 115 constraints, problems are : Problem set: 0 solved, 46 unsolved in 3742 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 55/55 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 7/7 constraints]
After SMT, in 5467ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 5468ms
Starting structural reductions in SI_LTL mode, iteration 1 : 55/104 places, 49/97 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 5728 ms. Remains : 55/104 places, 49/97 transitions.
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-04-LTLCardinality-13
Stuttering criterion allowed to conclude after 26 steps with 4 reset in 1 ms.
FORMULA MedleyA-PT-04-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-04-LTLCardinality-13 finished in 5868 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((X(((F(p2) U p3)||p1))||p0))))'
Support contains 4 out of 104 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 104/104 places, 97/97 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 99 transition count 92
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 99 transition count 92
Applied a total of 10 rules in 4 ms. Remains 99 /104 variables (removed 5) and now considering 92/97 (removed 5) transitions.
// Phase 1: matrix 92 rows 99 cols
[2024-06-02 18:15:59] [INFO ] Computed 8 invariants in 6 ms
[2024-06-02 18:15:59] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-02 18:15:59] [INFO ] Invariant cache hit.
[2024-06-02 18:16:00] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 322 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-06-02 18:16:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:16:00] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-06-02 18:16:01] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-06-02 18:16:01] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
[2024-06-02 18:16:01] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
[2024-06-02 18:16:01] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-02 18:16:01] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 6/14 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/191 variables, 99/113 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:16:02] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 2 ms to minimize.
[2024-06-02 18:16:02] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-06-02 18:16:02] [INFO ] Deduced a trap composed of 17 places in 35 ms of which 1 ms to minimize.
[2024-06-02 18:16:02] [INFO ] Deduced a trap composed of 20 places in 36 ms of which 2 ms to minimize.
[2024-06-02 18:16:02] [INFO ] Deduced a trap composed of 18 places in 36 ms of which 1 ms to minimize.
[2024-06-02 18:16:02] [INFO ] Deduced a trap composed of 17 places in 32 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 6/119 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 7 (OVERLAPS) 0/191 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Real declared 191/191 variables, and 119 constraints, problems are : Problem set: 0 solved, 91 unsolved in 4043 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 91 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/98 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (OVERLAPS) 1/99 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/99 variables, 12/20 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/99 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 4 (OVERLAPS) 92/191 variables, 99/119 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/191 variables, 91/210 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:16:05] [INFO ] Deduced a trap composed of 15 places in 72 ms of which 3 ms to minimize.
[2024-06-02 18:16:06] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/191 variables, 2/212 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:16:07] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/191 variables, 1/213 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:16:10] [INFO ] Deduced a trap composed of 21 places in 34 ms of which 1 ms to minimize.
[2024-06-02 18:16:10] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/191 variables, 2/215 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/191 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 18:16:16] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/191 variables, 1/216 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/191 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 12 (OVERLAPS) 0/191 variables, 0/216 constraints. Problems are: Problem set: 0 solved, 91 unsolved
No progress, stopping.
After SMT solving in domain Int declared 191/191 variables, and 216 constraints, problems are : Problem set: 0 solved, 91 unsolved in 19895 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 99/99 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 18/18 constraints]
After SMT, in 23981ms problems are : Problem set: 0 solved, 91 unsolved
Search for dead transitions found 0 dead transitions in 23984ms
Starting structural reductions in LTL mode, iteration 1 : 99/104 places, 92/97 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24311 ms. Remains : 99/104 places, 92/97 transitions.
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : MedleyA-PT-04-LTLCardinality-15
Product exploration explored 100000 steps with 50000 reset in 269 ms.
Product exploration explored 100000 steps with 50000 reset in 386 ms.
Computed a total of 99 stabilizing places and 92 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 99 transition count 92
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p0 p1 p3), (X p0), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p3))))), (X (X p0)), (X (X p1)), (F (G p0)), (F (G p1)), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 22 ms. Reduced automaton from 3 states, 3 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-04-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-04-LTLCardinality-15 finished in 25198 ms.
All properties solved by simple procedures.
Total runtime 131148 ms.
ITS solved all properties within timeout

BK_STOP 1717352185315

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

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="MedleyA-PT-04"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is MedleyA-PT-04, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r579-smll-171734921100027"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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