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-171734921400163.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-21, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r579-smll-171734921400163
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 460K
-rw-r--r-- 1 mcc users 5.2K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 73K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K 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 18K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 71K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 73K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K 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 70K 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-21-LTLCardinality-00
FORMULA_NAME MedleyA-PT-21-LTLCardinality-01
FORMULA_NAME MedleyA-PT-21-LTLCardinality-02
FORMULA_NAME MedleyA-PT-21-LTLCardinality-03
FORMULA_NAME MedleyA-PT-21-LTLCardinality-04
FORMULA_NAME MedleyA-PT-21-LTLCardinality-05
FORMULA_NAME MedleyA-PT-21-LTLCardinality-06
FORMULA_NAME MedleyA-PT-21-LTLCardinality-07
FORMULA_NAME MedleyA-PT-21-LTLCardinality-08
FORMULA_NAME MedleyA-PT-21-LTLCardinality-09
FORMULA_NAME MedleyA-PT-21-LTLCardinality-10
FORMULA_NAME MedleyA-PT-21-LTLCardinality-11
FORMULA_NAME MedleyA-PT-21-LTLCardinality-12
FORMULA_NAME MedleyA-PT-21-LTLCardinality-13
FORMULA_NAME MedleyA-PT-21-LTLCardinality-14
FORMULA_NAME MedleyA-PT-21-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717363926148

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-21
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 21:32:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 21:32:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:32:08] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2024-06-02 21:32:08] [INFO ] Transformed 306 places.
[2024-06-02 21:32:08] [INFO ] Transformed 298 transitions.
[2024-06-02 21:32:08] [INFO ] Found NUPN structural information;
[2024-06-02 21:32:08] [INFO ] Parsed PT model containing 306 places and 298 transitions and 700 arcs in 278 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
FORMULA MedleyA-PT-21-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-21-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-21-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-21-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-21-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-21-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-21-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-21-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-21-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 306 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 306/306 places, 298/298 transitions.
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 39 place count 267 transition count 259
Iterating global reduction 0 with 39 rules applied. Total rules applied 78 place count 267 transition count 259
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 111 place count 234 transition count 226
Iterating global reduction 0 with 33 rules applied. Total rules applied 144 place count 234 transition count 226
Applied a total of 144 rules in 109 ms. Remains 234 /306 variables (removed 72) and now considering 226/298 (removed 72) transitions.
// Phase 1: matrix 226 rows 234 cols
[2024-06-02 21:32:08] [INFO ] Computed 20 invariants in 27 ms
[2024-06-02 21:32:08] [INFO ] Implicit Places using invariants in 435 ms returned []
[2024-06-02 21:32:08] [INFO ] Invariant cache hit.
[2024-06-02 21:32:09] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 838 ms to find 0 implicit places.
Running 225 sub problems to find dead transitions.
[2024-06-02 21:32:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-02 21:32:12] [INFO ] Deduced a trap composed of 18 places in 63 ms of which 13 ms to minimize.
[2024-06-02 21:32:12] [INFO ] Deduced a trap composed of 20 places in 32 ms of which 1 ms to minimize.
[2024-06-02 21:32:12] [INFO ] Deduced a trap composed of 19 places in 38 ms of which 3 ms to minimize.
[2024-06-02 21:32:12] [INFO ] Deduced a trap composed of 7 places in 146 ms of which 4 ms to minimize.
[2024-06-02 21:32:12] [INFO ] Deduced a trap composed of 33 places in 96 ms of which 3 ms to minimize.
[2024-06-02 21:32:12] [INFO ] Deduced a trap composed of 32 places in 71 ms of which 2 ms to minimize.
[2024-06-02 21:32:12] [INFO ] Deduced a trap composed of 37 places in 49 ms of which 1 ms to minimize.
[2024-06-02 21:32:12] [INFO ] Deduced a trap composed of 35 places in 49 ms of which 2 ms to minimize.
[2024-06-02 21:32:13] [INFO ] Deduced a trap composed of 34 places in 37 ms of which 1 ms to minimize.
[2024-06-02 21:32:13] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 2 ms to minimize.
[2024-06-02 21:32:13] [INFO ] Deduced a trap composed of 37 places in 58 ms of which 2 ms to minimize.
[2024-06-02 21:32:13] [INFO ] Deduced a trap composed of 48 places in 68 ms of which 2 ms to minimize.
[2024-06-02 21:32:13] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 2 ms to minimize.
[2024-06-02 21:32:14] [INFO ] Deduced a trap composed of 47 places in 52 ms of which 2 ms to minimize.
[2024-06-02 21:32:14] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-02 21:32:15] [INFO ] Deduced a trap composed of 25 places in 59 ms of which 3 ms to minimize.
[2024-06-02 21:32:15] [INFO ] Deduced a trap composed of 36 places in 55 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (OVERLAPS) 226/460 variables, 234/271 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-02 21:32:21] [INFO ] Deduced a trap composed of 40 places in 61 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 1/272 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 8 (OVERLAPS) 0/460 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 225 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 272 constraints, problems are : Problem set: 0 solved, 225 unsolved in 21737 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 18/18 constraints]
Escalating to Integer solving :Problem set: 0 solved, 225 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 1 (OVERLAPS) 1/234 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/234 variables, 18/38 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/234 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 4 (OVERLAPS) 226/460 variables, 234/272 constraints. Problems are: Problem set: 0 solved, 225 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/460 variables, 225/497 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-02 21:32:36] [INFO ] Deduced a trap composed of 10 places in 55 ms of which 2 ms to minimize.
[2024-06-02 21:32:38] [INFO ] Deduced a trap composed of 19 places in 206 ms of which 5 ms to minimize.
[2024-06-02 21:32:38] [INFO ] Deduced a trap composed of 25 places in 142 ms of which 4 ms to minimize.
[2024-06-02 21:32:38] [INFO ] Deduced a trap composed of 79 places in 125 ms of which 3 ms to minimize.
[2024-06-02 21:32:38] [INFO ] Deduced a trap composed of 40 places in 117 ms of which 3 ms to minimize.
[2024-06-02 21:32:39] [INFO ] Deduced a trap composed of 30 places in 56 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 6/503 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-02 21:32:41] [INFO ] Deduced a trap composed of 10 places in 175 ms of which 4 ms to minimize.
[2024-06-02 21:32:41] [INFO ] Deduced a trap composed of 66 places in 182 ms of which 4 ms to minimize.
[2024-06-02 21:32:43] [INFO ] Deduced a trap composed of 66 places in 157 ms of which 4 ms to minimize.
[2024-06-02 21:32:44] [INFO ] Deduced a trap composed of 28 places in 140 ms of which 4 ms to minimize.
[2024-06-02 21:32:44] [INFO ] Deduced a trap composed of 41 places in 116 ms of which 3 ms to minimize.
[2024-06-02 21:32:45] [INFO ] Deduced a trap composed of 41 places in 110 ms of which 2 ms to minimize.
[2024-06-02 21:32:45] [INFO ] Deduced a trap composed of 38 places in 68 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 7/510 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-02 21:32:51] [INFO ] Deduced a trap composed of 31 places in 86 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 1/511 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-02 21:32:54] [INFO ] Deduced a trap composed of 19 places in 156 ms of which 4 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/460 variables, 1/512 constraints. Problems are: Problem set: 0 solved, 225 unsolved
[2024-06-02 21:33:00] [INFO ] Deduced a trap composed of 29 places in 162 ms of which 4 ms to minimize.
[2024-06-02 21:33:01] [INFO ] Deduced a trap composed of 29 places in 138 ms of which 4 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 460/460 variables, and 514 constraints, problems are : Problem set: 0 solved, 225 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 225/225 constraints, Known Traps: 35/35 constraints]
After SMT, in 51891ms problems are : Problem set: 0 solved, 225 unsolved
Search for dead transitions found 0 dead transitions in 51924ms
Starting structural reductions in LTL mode, iteration 1 : 234/306 places, 226/298 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52905 ms. Remains : 234/306 places, 226/298 transitions.
Support contains 29 out of 234 places after structural reductions.
[2024-06-02 21:33:01] [INFO ] Flatten gal took : 98 ms
[2024-06-02 21:33:01] [INFO ] Flatten gal took : 41 ms
[2024-06-02 21:33:01] [INFO ] Input system was already deterministic with 226 transitions.
RANDOM walk for 40000 steps (8 resets) in 1922 ms. (20 steps per ms) remains 3/17 properties
BEST_FIRST walk for 40003 steps (8 resets) in 170 ms. (233 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 116 ms. (341 steps per ms) remains 2/3 properties
[2024-06-02 21:33:02] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 70/74 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 160/234 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 226/460 variables, 234/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/460 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/460 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 460/460 variables, and 254 constraints, problems are : Problem set: 0 solved, 2 unsolved in 240 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 70/74 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 160/234 variables, 15/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 21:33:03] [INFO ] Deduced a trap composed of 18 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 226/460 variables, 234/255 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/460 variables, 2/257 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 21:33:03] [INFO ] Deduced a trap composed of 23 places in 52 ms of which 1 ms to minimize.
[2024-06-02 21:33:03] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/460 variables, 2/259 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 21:33:03] [INFO ] Deduced a trap composed of 31 places in 73 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/460 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 21:33:03] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/460 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/460 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/460 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 460/460 variables, and 261 constraints, problems are : Problem set: 0 solved, 2 unsolved in 666 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints]
After SMT, in 917ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 697 ms.
Support contains 2 out of 234 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 234/234 places, 226/226 transitions.
Graph (trivial) has 160 edges and 234 vertex of which 6 / 234 are part of one of the 1 SCC in 5 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 229 transition count 169
Reduce places removed 51 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 52 rules applied. Total rules applied 104 place count 178 transition count 168
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 105 place count 177 transition count 168
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 105 place count 177 transition count 137
Deduced a syphon composed of 31 places in 0 ms
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 62 rules applied. Total rules applied 167 place count 146 transition count 137
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 175 place count 138 transition count 129
Iterating global reduction 3 with 8 rules applied. Total rules applied 183 place count 138 transition count 129
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 183 place count 138 transition count 123
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 195 place count 132 transition count 123
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 3 with 74 rules applied. Total rules applied 269 place count 95 transition count 86
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 275 place count 92 transition count 109
Free-agglomeration rule applied 27 times.
Iterating global reduction 3 with 27 rules applied. Total rules applied 302 place count 92 transition count 82
Reduce places removed 27 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 331 place count 65 transition count 80
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 332 place count 65 transition count 80
Applied a total of 332 rules in 123 ms. Remains 65 /234 variables (removed 169) and now considering 80/226 (removed 146) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 65/234 places, 80/226 transitions.
RANDOM walk for 899 steps (21 resets) in 20 ms. (42 steps per ms) remains 0/1 properties
FORMULA MedleyA-PT-21-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 37 stabilizing places and 37 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)&&X(p1))))'
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 226/226 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 225 transition count 217
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 225 transition count 217
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 220 transition count 212
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 220 transition count 212
Applied a total of 28 rules in 57 ms. Remains 220 /234 variables (removed 14) and now considering 212/226 (removed 14) transitions.
// Phase 1: matrix 212 rows 220 cols
[2024-06-02 21:33:04] [INFO ] Computed 20 invariants in 4 ms
[2024-06-02 21:33:05] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-06-02 21:33:05] [INFO ] Invariant cache hit.
[2024-06-02 21:33:05] [INFO ] Implicit Places using invariants and state equation in 373 ms returned []
Implicit Place search using SMT with State Equation took 534 ms to find 0 implicit places.
Running 211 sub problems to find dead transitions.
[2024-06-02 21:33:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-06-02 21:33:09] [INFO ] Deduced a trap composed of 18 places in 44 ms of which 2 ms to minimize.
[2024-06-02 21:33:09] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-02 21:33:09] [INFO ] Deduced a trap composed of 17 places in 34 ms of which 1 ms to minimize.
[2024-06-02 21:33:09] [INFO ] Deduced a trap composed of 7 places in 186 ms of which 4 ms to minimize.
[2024-06-02 21:33:09] [INFO ] Deduced a trap composed of 28 places in 129 ms of which 3 ms to minimize.
[2024-06-02 21:33:09] [INFO ] Deduced a trap composed of 26 places in 96 ms of which 3 ms to minimize.
[2024-06-02 21:33:09] [INFO ] Deduced a trap composed of 37 places in 60 ms of which 2 ms to minimize.
[2024-06-02 21:33:09] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 1 ms to minimize.
[2024-06-02 21:33:10] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 2 ms to minimize.
[2024-06-02 21:33:10] [INFO ] Deduced a trap composed of 34 places in 56 ms of which 2 ms to minimize.
[2024-06-02 21:33:10] [INFO ] Deduced a trap composed of 25 places in 45 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-06-02 21:33:12] [INFO ] Deduced a trap composed of 25 places in 64 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-06-02 21:33:15] [INFO ] Deduced a trap composed of 7 places in 169 ms of which 4 ms to minimize.
[2024-06-02 21:33:15] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/220 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 6 (OVERLAPS) 212/432 variables, 220/254 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 8 (OVERLAPS) 0/432 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Real declared 432/432 variables, and 254 constraints, problems are : Problem set: 0 solved, 211 unsolved in 20285 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 220/220 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 211 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/219 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 1 (OVERLAPS) 1/220 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/220 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/220 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 4 (OVERLAPS) 212/432 variables, 220/254 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/432 variables, 211/465 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-06-02 21:33:31] [INFO ] Deduced a trap composed of 26 places in 174 ms of which 4 ms to minimize.
[2024-06-02 21:33:32] [INFO ] Deduced a trap composed of 54 places in 168 ms of which 4 ms to minimize.
[2024-06-02 21:33:33] [INFO ] Deduced a trap composed of 40 places in 157 ms of which 20 ms to minimize.
[2024-06-02 21:33:33] [INFO ] Deduced a trap composed of 45 places in 117 ms of which 3 ms to minimize.
[2024-06-02 21:33:33] [INFO ] Deduced a trap composed of 40 places in 113 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/432 variables, 5/470 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-06-02 21:33:36] [INFO ] Deduced a trap composed of 45 places in 134 ms of which 4 ms to minimize.
[2024-06-02 21:33:37] [INFO ] Deduced a trap composed of 26 places in 130 ms of which 4 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 2/472 constraints. Problems are: Problem set: 0 solved, 211 unsolved
[2024-06-02 21:33:40] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 2 ms to minimize.
[2024-06-02 21:33:41] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 2/474 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/432 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 211 unsolved
At refinement iteration 10 (OVERLAPS) 0/432 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 211 unsolved
No progress, stopping.
After SMT solving in domain Int declared 432/432 variables, and 474 constraints, problems are : Problem set: 0 solved, 211 unsolved in 27330 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 220/220 constraints, PredecessorRefiner: 211/211 constraints, Known Traps: 23/23 constraints]
After SMT, in 47672ms problems are : Problem set: 0 solved, 211 unsolved
Search for dead transitions found 0 dead transitions in 47681ms
Starting structural reductions in LTL mode, iteration 1 : 220/234 places, 212/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 48275 ms. Remains : 220/234 places, 212/226 transitions.
Stuttering acceptance computed with spot in 458 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : MedleyA-PT-21-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 2 ms.
FORMULA MedleyA-PT-21-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-21-LTLCardinality-00 finished in 48867 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(X(X(F(p0))))&&F(p1)))'
Support contains 3 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 226/226 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 225 transition count 217
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 225 transition count 217
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 221 transition count 213
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 221 transition count 213
Applied a total of 26 rules in 21 ms. Remains 221 /234 variables (removed 13) and now considering 213/226 (removed 13) transitions.
// Phase 1: matrix 213 rows 221 cols
[2024-06-02 21:33:53] [INFO ] Computed 20 invariants in 6 ms
[2024-06-02 21:33:53] [INFO ] Implicit Places using invariants in 227 ms returned []
[2024-06-02 21:33:53] [INFO ] Invariant cache hit.
[2024-06-02 21:33:54] [INFO ] Implicit Places using invariants and state equation in 360 ms returned []
Implicit Place search using SMT with State Equation took 589 ms to find 0 implicit places.
Running 212 sub problems to find dead transitions.
[2024-06-02 21:33:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/221 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-02 21:33:57] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-02 21:33:57] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-02 21:33:57] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-02 21:33:57] [INFO ] Deduced a trap composed of 7 places in 181 ms of which 4 ms to minimize.
[2024-06-02 21:33:58] [INFO ] Deduced a trap composed of 32 places in 114 ms of which 3 ms to minimize.
[2024-06-02 21:33:58] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 2 ms to minimize.
[2024-06-02 21:33:58] [INFO ] Deduced a trap composed of 25 places in 61 ms of which 2 ms to minimize.
[2024-06-02 21:33:58] [INFO ] Deduced a trap composed of 33 places in 50 ms of which 2 ms to minimize.
[2024-06-02 21:33:58] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 2 ms to minimize.
[2024-06-02 21:33:59] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-06-02 21:33:59] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-02 21:34:00] [INFO ] Deduced a trap composed of 32 places in 70 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/221 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (OVERLAPS) 213/434 variables, 221/253 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 0/434 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 434/434 variables, and 253 constraints, problems are : Problem set: 0 solved, 212 unsolved in 18488 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/220 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (OVERLAPS) 1/221 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/221 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/221 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 213/434 variables, 221/253 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/434 variables, 212/465 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-02 21:34:17] [INFO ] Deduced a trap composed of 7 places in 44 ms of which 2 ms to minimize.
[2024-06-02 21:34:17] [INFO ] Deduced a trap composed of 10 places in 178 ms of which 4 ms to minimize.
[2024-06-02 21:34:20] [INFO ] Deduced a trap composed of 54 places in 137 ms of which 4 ms to minimize.
[2024-06-02 21:34:20] [INFO ] Deduced a trap composed of 80 places in 155 ms of which 3 ms to minimize.
[2024-06-02 21:34:20] [INFO ] Deduced a trap composed of 45 places in 133 ms of which 3 ms to minimize.
[2024-06-02 21:34:20] [INFO ] Deduced a trap composed of 40 places in 146 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/434 variables, 6/471 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-02 21:34:23] [INFO ] Deduced a trap composed of 29 places in 168 ms of which 4 ms to minimize.
[2024-06-02 21:34:24] [INFO ] Deduced a trap composed of 26 places in 158 ms of which 3 ms to minimize.
[2024-06-02 21:34:25] [INFO ] Deduced a trap composed of 40 places in 145 ms of which 4 ms to minimize.
[2024-06-02 21:34:25] [INFO ] Deduced a trap composed of 40 places in 157 ms of which 3 ms to minimize.
[2024-06-02 21:34:26] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/434 variables, 5/476 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-06-02 21:34:30] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/434 variables, 1/477 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/434 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 10 (OVERLAPS) 0/434 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Int declared 434/434 variables, and 477 constraints, problems are : Problem set: 0 solved, 212 unsolved in 29989 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 221/221 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 24/24 constraints]
After SMT, in 48532ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 48537ms
Starting structural reductions in LTL mode, iteration 1 : 221/234 places, 213/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49151 ms. Remains : 221/234 places, 213/226 transitions.
Stuttering acceptance computed with spot in 276 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-21-LTLCardinality-01
Product exploration explored 100000 steps with 0 reset in 439 ms.
Stack based approach found an accepted trace after 153 steps with 0 reset with depth 154 and stack size 154 in 2 ms.
FORMULA MedleyA-PT-21-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-21-LTLCardinality-01 finished in 49906 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(p0) U p1)||G(p2))))'
Support contains 5 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 226/226 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 226 transition count 218
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 226 transition count 218
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 222 transition count 214
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 222 transition count 214
Applied a total of 24 rules in 18 ms. Remains 222 /234 variables (removed 12) and now considering 214/226 (removed 12) transitions.
// Phase 1: matrix 214 rows 222 cols
[2024-06-02 21:34:43] [INFO ] Computed 20 invariants in 3 ms
[2024-06-02 21:34:43] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-06-02 21:34:43] [INFO ] Invariant cache hit.
[2024-06-02 21:34:44] [INFO ] Implicit Places using invariants and state equation in 319 ms returned []
Implicit Place search using SMT with State Equation took 512 ms to find 0 implicit places.
Running 213 sub problems to find dead transitions.
[2024-06-02 21:34:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/222 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-02 21:34:47] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 2 ms to minimize.
[2024-06-02 21:34:47] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 1 ms to minimize.
[2024-06-02 21:34:47] [INFO ] Deduced a trap composed of 17 places in 31 ms of which 1 ms to minimize.
[2024-06-02 21:34:47] [INFO ] Deduced a trap composed of 7 places in 190 ms of which 4 ms to minimize.
[2024-06-02 21:34:48] [INFO ] Deduced a trap composed of 28 places in 108 ms of which 3 ms to minimize.
[2024-06-02 21:34:48] [INFO ] Deduced a trap composed of 26 places in 81 ms of which 2 ms to minimize.
[2024-06-02 21:34:48] [INFO ] Deduced a trap composed of 37 places in 56 ms of which 1 ms to minimize.
[2024-06-02 21:34:48] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 2 ms to minimize.
[2024-06-02 21:34:48] [INFO ] Deduced a trap composed of 33 places in 57 ms of which 1 ms to minimize.
[2024-06-02 21:34:48] [INFO ] Deduced a trap composed of 26 places in 58 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (OVERLAPS) 214/436 variables, 222/252 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-02 21:34:54] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 1 ms to minimize.
[2024-06-02 21:34:55] [INFO ] Deduced a trap composed of 34 places in 59 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/436 variables, 2/254 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 7 (OVERLAPS) 0/436 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 213 unsolved
No progress, stopping.
After SMT solving in domain Real declared 436/436 variables, and 254 constraints, problems are : Problem set: 0 solved, 213 unsolved in 19280 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 0 solved, 213 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/221 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 1 (OVERLAPS) 1/222 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/222 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-02 21:35:05] [INFO ] Deduced a trap composed of 24 places in 53 ms of which 2 ms to minimize.
[2024-06-02 21:35:06] [INFO ] Deduced a trap composed of 25 places in 37 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/222 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/222 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 5 (OVERLAPS) 214/436 variables, 222/256 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 213/469 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-02 21:35:09] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 2 ms to minimize.
[2024-06-02 21:35:10] [INFO ] Deduced a trap composed of 53 places in 111 ms of which 3 ms to minimize.
[2024-06-02 21:35:10] [INFO ] Deduced a trap composed of 39 places in 162 ms of which 3 ms to minimize.
[2024-06-02 21:35:11] [INFO ] Deduced a trap composed of 28 places in 156 ms of which 4 ms to minimize.
[2024-06-02 21:35:12] [INFO ] Deduced a trap composed of 20 places in 123 ms of which 3 ms to minimize.
[2024-06-02 21:35:12] [INFO ] Deduced a trap composed of 39 places in 66 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 6/475 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-02 21:35:15] [INFO ] Deduced a trap composed of 10 places in 106 ms of which 3 ms to minimize.
[2024-06-02 21:35:16] [INFO ] Deduced a trap composed of 39 places in 154 ms of which 4 ms to minimize.
[2024-06-02 21:35:17] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 3/478 constraints. Problems are: Problem set: 0 solved, 213 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-02 21:35:27] [INFO ] Deduced a trap composed of 31 places in 65 ms of which 2 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/436 variables, 1/479 constraints. Problems are: Problem set: 0 solved, 213 unsolved
[2024-06-02 21:35:32] [INFO ] Deduced a trap composed of 39 places in 158 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 436/436 variables, and 480 constraints, problems are : Problem set: 0 solved, 213 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 222/222 constraints, PredecessorRefiner: 213/213 constraints, Known Traps: 25/25 constraints]
After SMT, in 49333ms problems are : Problem set: 0 solved, 213 unsolved
Search for dead transitions found 0 dead transitions in 49338ms
Starting structural reductions in LTL mode, iteration 1 : 222/234 places, 214/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 49871 ms. Remains : 222/234 places, 214/226 transitions.
Stuttering acceptance computed with spot in 314 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : MedleyA-PT-21-LTLCardinality-05
Product exploration explored 100000 steps with 50000 reset in 371 ms.
Product exploration explored 100000 steps with 50000 reset in 298 ms.
Computed a total of 36 stabilizing places and 36 stable transitions
Computed a total of 36 stabilizing places and 36 stable transitions
Knowledge obtained : [(AND p1 p2 p0), (X p2), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X p0), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 18 factoid took 25 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-21-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-21-LTLCardinality-05 finished in 50939 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(X(p1))&&p0))||(!p1 U (p2||G(!p1))))))'
Support contains 5 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 226/226 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 227 transition count 219
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 227 transition count 219
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 223 transition count 215
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 223 transition count 215
Applied a total of 22 rules in 8 ms. Remains 223 /234 variables (removed 11) and now considering 215/226 (removed 11) transitions.
// Phase 1: matrix 215 rows 223 cols
[2024-06-02 21:35:34] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 21:35:34] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-02 21:35:34] [INFO ] Invariant cache hit.
[2024-06-02 21:35:34] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 338 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2024-06-02 21:35:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/223 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-02 21:35:38] [INFO ] Deduced a trap composed of 18 places in 29 ms of which 1 ms to minimize.
[2024-06-02 21:35:38] [INFO ] Deduced a trap composed of 18 places in 31 ms of which 1 ms to minimize.
[2024-06-02 21:35:38] [INFO ] Deduced a trap composed of 17 places in 28 ms of which 1 ms to minimize.
[2024-06-02 21:35:38] [INFO ] Deduced a trap composed of 7 places in 152 ms of which 3 ms to minimize.
[2024-06-02 21:35:38] [INFO ] Deduced a trap composed of 27 places in 92 ms of which 2 ms to minimize.
[2024-06-02 21:35:38] [INFO ] Deduced a trap composed of 32 places in 106 ms of which 3 ms to minimize.
[2024-06-02 21:35:38] [INFO ] Deduced a trap composed of 27 places in 95 ms of which 3 ms to minimize.
[2024-06-02 21:35:39] [INFO ] Deduced a trap composed of 26 places in 60 ms of which 1 ms to minimize.
[2024-06-02 21:35:39] [INFO ] Deduced a trap composed of 38 places in 61 ms of which 2 ms to minimize.
[2024-06-02 21:35:39] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 2 ms to minimize.
[2024-06-02 21:35:39] [INFO ] Deduced a trap composed of 34 places in 48 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 11/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 215/438 variables, 223/254 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-02 21:35:44] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 2 ms to minimize.
[2024-06-02 21:35:45] [INFO ] Deduced a trap composed of 39 places in 55 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 2/256 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 0/256 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-02 21:35:53] [INFO ] Deduced a trap composed of 39 places in 71 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/438 variables, 1/257 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (OVERLAPS) 0/438 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 438/438 variables, and 257 constraints, problems are : Problem set: 0 solved, 214 unsolved in 26906 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 223/223 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/223 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 14/34 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-02 21:36:04] [INFO ] Deduced a trap composed of 27 places in 63 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (OVERLAPS) 215/438 variables, 223/258 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 214/472 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-02 21:36:08] [INFO ] Deduced a trap composed of 7 places in 68 ms of which 2 ms to minimize.
[2024-06-02 21:36:09] [INFO ] Deduced a trap composed of 10 places in 179 ms of which 4 ms to minimize.
[2024-06-02 21:36:10] [INFO ] Deduced a trap composed of 26 places in 168 ms of which 4 ms to minimize.
[2024-06-02 21:36:10] [INFO ] Deduced a trap composed of 35 places in 169 ms of which 4 ms to minimize.
[2024-06-02 21:36:10] [INFO ] Deduced a trap composed of 21 places in 164 ms of which 4 ms to minimize.
[2024-06-02 21:36:11] [INFO ] Deduced a trap composed of 40 places in 138 ms of which 4 ms to minimize.
[2024-06-02 21:36:11] [INFO ] Deduced a trap composed of 38 places in 159 ms of which 3 ms to minimize.
[2024-06-02 21:36:11] [INFO ] Deduced a trap composed of 64 places in 158 ms of which 3 ms to minimize.
[2024-06-02 21:36:12] [INFO ] Deduced a trap composed of 26 places in 147 ms of which 4 ms to minimize.
[2024-06-02 21:36:12] [INFO ] Deduced a trap composed of 40 places in 140 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 10/482 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-02 21:36:17] [INFO ] Deduced a trap composed of 25 places in 99 ms of which 3 ms to minimize.
[2024-06-02 21:36:17] [INFO ] Deduced a trap composed of 19 places in 105 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 2/484 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-02 21:36:21] [INFO ] Deduced a trap composed of 40 places in 141 ms of which 3 ms to minimize.
[2024-06-02 21:36:22] [INFO ] Deduced a trap composed of 18 places in 81 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 2/486 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-02 21:36:26] [INFO ] Deduced a trap composed of 24 places in 72 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/438 variables, 1/487 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/438 variables, 0/487 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/438 variables, and 487 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 223/223 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 30/30 constraints]
After SMT, in 56958ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 56962ms
Starting structural reductions in LTL mode, iteration 1 : 223/234 places, 215/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 57309 ms. Remains : 223/234 places, 215/226 transitions.
Stuttering acceptance computed with spot in 535 ms :[(AND (NOT p0) (NOT p2) p1), (AND (NOT p0) (NOT p2) p1), false, (NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1), false, false]
Running random walk in product with property : MedleyA-PT-21-LTLCardinality-06
Product exploration explored 100000 steps with 0 reset in 201 ms.
Stack based approach found an accepted trace after 205 steps with 0 reset with depth 206 and stack size 206 in 1 ms.
FORMULA MedleyA-PT-21-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-21-LTLCardinality-06 finished in 58072 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)&&(!p1 U (p2||G(!p1))))))'
Support contains 6 out of 234 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 234/234 places, 226/226 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 227 transition count 219
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 227 transition count 219
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 18 place count 223 transition count 215
Iterating global reduction 0 with 4 rules applied. Total rules applied 22 place count 223 transition count 215
Applied a total of 22 rules in 13 ms. Remains 223 /234 variables (removed 11) and now considering 215/226 (removed 11) transitions.
// Phase 1: matrix 215 rows 223 cols
[2024-06-02 21:36:32] [INFO ] Computed 20 invariants in 3 ms
[2024-06-02 21:36:32] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-06-02 21:36:32] [INFO ] Invariant cache hit.
[2024-06-02 21:36:33] [INFO ] Implicit Places using invariants and state equation in 324 ms returned []
Implicit Place search using SMT with State Equation took 516 ms to find 0 implicit places.
Running 214 sub problems to find dead transitions.
[2024-06-02 21:36:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/223 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-02 21:36:36] [INFO ] Deduced a trap composed of 18 places in 26 ms of which 3 ms to minimize.
[2024-06-02 21:36:36] [INFO ] Deduced a trap composed of 18 places in 21 ms of which 1 ms to minimize.
[2024-06-02 21:36:36] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 1 ms to minimize.
[2024-06-02 21:36:36] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 2 ms to minimize.
[2024-06-02 21:36:36] [INFO ] Deduced a trap composed of 7 places in 118 ms of which 2 ms to minimize.
[2024-06-02 21:36:36] [INFO ] Deduced a trap composed of 32 places in 125 ms of which 3 ms to minimize.
[2024-06-02 21:36:37] [INFO ] Deduced a trap composed of 26 places in 91 ms of which 2 ms to minimize.
[2024-06-02 21:36:37] [INFO ] Deduced a trap composed of 25 places in 62 ms of which 2 ms to minimize.
[2024-06-02 21:36:37] [INFO ] Deduced a trap composed of 33 places in 56 ms of which 1 ms to minimize.
[2024-06-02 21:36:37] [INFO ] Deduced a trap composed of 25 places in 55 ms of which 2 ms to minimize.
[2024-06-02 21:36:37] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2024-06-02 21:36:38] [INFO ] Deduced a trap composed of 34 places in 54 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 12/32 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-02 21:36:39] [INFO ] Deduced a trap composed of 25 places in 57 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-02 21:36:42] [INFO ] Deduced a trap composed of 33 places in 61 ms of which 2 ms to minimize.
[2024-06-02 21:36:43] [INFO ] Deduced a trap composed of 32 places in 50 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/223 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/223 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 6 (OVERLAPS) 215/438 variables, 223/258 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 8 (OVERLAPS) 0/438 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 214 unsolved
No progress, stopping.
After SMT solving in domain Real declared 438/438 variables, and 258 constraints, problems are : Problem set: 0 solved, 214 unsolved in 20991 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 223/223 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 214 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/222 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 1 (OVERLAPS) 1/223 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/223 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/223 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 4 (OVERLAPS) 215/438 variables, 223/258 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/438 variables, 214/472 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-02 21:37:00] [INFO ] Deduced a trap composed of 20 places in 169 ms of which 4 ms to minimize.
[2024-06-02 21:37:00] [INFO ] Deduced a trap composed of 45 places in 173 ms of which 4 ms to minimize.
[2024-06-02 21:37:01] [INFO ] Deduced a trap composed of 40 places in 160 ms of which 3 ms to minimize.
[2024-06-02 21:37:01] [INFO ] Deduced a trap composed of 10 places in 122 ms of which 2 ms to minimize.
[2024-06-02 21:37:02] [INFO ] Deduced a trap composed of 43 places in 84 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/438 variables, 5/477 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-02 21:37:06] [INFO ] Deduced a trap composed of 48 places in 161 ms of which 3 ms to minimize.
[2024-06-02 21:37:07] [INFO ] Deduced a trap composed of 30 places in 63 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/438 variables, 2/479 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-02 21:37:10] [INFO ] Deduced a trap composed of 26 places in 136 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/438 variables, 1/480 constraints. Problems are: Problem set: 0 solved, 214 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/438 variables, 0/480 constraints. Problems are: Problem set: 0 solved, 214 unsolved
[2024-06-02 21:37:21] [INFO ] Deduced a trap composed of 40 places in 130 ms of which 4 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/438 variables, 1/481 constraints. Problems are: Problem set: 0 solved, 214 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 438/438 variables, and 481 constraints, problems are : Problem set: 0 solved, 214 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 223/223 constraints, PredecessorRefiner: 214/214 constraints, Known Traps: 24/24 constraints]
After SMT, in 51044ms problems are : Problem set: 0 solved, 214 unsolved
Search for dead transitions found 0 dead transitions in 51048ms
Starting structural reductions in LTL mode, iteration 1 : 223/234 places, 215/226 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 51581 ms. Remains : 223/234 places, 215/226 transitions.
Stuttering acceptance computed with spot in 182 ms :[true, (OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (OR (NOT p0) (AND p1 (NOT p2)))]
Running random walk in product with property : MedleyA-PT-21-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-21-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-21-LTLCardinality-08 finished in 51815 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)))'
Support contains 2 out of 234 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 234/234 places, 226/226 transitions.
Graph (trivial) has 160 edges and 234 vertex of which 6 / 234 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 51 transitions
Trivial Post-agglo rules discarded 51 transitions
Performed 51 trivial Post agglomeration. Transition count delta: 51
Iterating post reduction 0 with 51 rules applied. Total rules applied 52 place count 228 transition count 169
Reduce places removed 51 places and 0 transitions.
Iterating post reduction 1 with 51 rules applied. Total rules applied 103 place count 177 transition count 169
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 32 Pre rules applied. Total rules applied 103 place count 177 transition count 137
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 64 rules applied. Total rules applied 167 place count 145 transition count 137
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 174 place count 138 transition count 130
Iterating global reduction 2 with 7 rules applied. Total rules applied 181 place count 138 transition count 130
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 181 place count 138 transition count 124
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 193 place count 132 transition count 124
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 267 place count 95 transition count 87
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 273 place count 92 transition count 110
Applied a total of 273 rules in 68 ms. Remains 92 /234 variables (removed 142) and now considering 110/226 (removed 116) transitions.
// Phase 1: matrix 110 rows 92 cols
[2024-06-02 21:37:24] [INFO ] Computed 20 invariants in 2 ms
[2024-06-02 21:37:24] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-06-02 21:37:24] [INFO ] Invariant cache hit.
[2024-06-02 21:37:24] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-06-02 21:37:24] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 407 ms to find 0 implicit places.
[2024-06-02 21:37:24] [INFO ] Redundant transitions in 4 ms returned []
Running 92 sub problems to find dead transitions.
[2024-06-02 21:37:24] [INFO ] Invariant cache hit.
[2024-06-02 21:37:24] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 92 unsolved
[2024-06-02 21:37:25] [INFO ] Deduced a trap composed of 5 places in 42 ms of which 2 ms to minimize.
[2024-06-02 21:37:25] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
[2024-06-02 21:37:25] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 1 ms to minimize.
[2024-06-02 21:37:26] [INFO ] Deduced a trap composed of 13 places in 32 ms of which 1 ms to minimize.
[2024-06-02 21:37:26] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (OVERLAPS) 109/201 variables, 92/117 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 13/130 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 0/130 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (OVERLAPS) 1/202 variables, 1/131 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/202 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (OVERLAPS) 0/202 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 131 constraints, problems are : Problem set: 0 solved, 92 unsolved in 4854 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 92/92 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 92 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/91 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/91 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 2 (OVERLAPS) 1/92 variables, 19/20 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/92 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/92 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 5 (OVERLAPS) 109/201 variables, 92/117 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/201 variables, 13/130 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 92/222 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 9 (OVERLAPS) 1/202 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/202 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 92 unsolved
At refinement iteration 11 (OVERLAPS) 0/202 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 92 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 223 constraints, problems are : Problem set: 0 solved, 92 unsolved in 5652 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 92/92 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 92/92 constraints, Known Traps: 5/5 constraints]
After SMT, in 10579ms problems are : Problem set: 0 solved, 92 unsolved
Search for dead transitions found 0 dead transitions in 10581ms
Starting structural reductions in SI_LTL mode, iteration 1 : 92/234 places, 110/226 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11069 ms. Remains : 92/234 places, 110/226 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-21-LTLCardinality-11
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-21-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-21-LTLCardinality-11 finished in 11131 ms.
All properties solved by simple procedures.
Total runtime 327751 ms.
ITS solved all properties within timeout

BK_STOP 1717364255579

--------------------
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-21"
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-21, 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-171734921400163"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-21.tgz
mv MedleyA-PT-21 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 ;