MCC'2024- Execution of r492-smll-171636266300147

About the Execution of LTSMin+red for EisenbergMcGuire-PT-03

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
510.096	494505.00	562994.00	1696.10	FTFFTFFFTFFFFFFT	normal

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.r492-smll-171636266300147.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 EisenbergMcGuire-PT-03, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r492-smll-171636266300147
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 7.2K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 22 14:43 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:43 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Apr 22 14:43 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:43 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 16:32 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Apr 12 16:32 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K Apr 12 16:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 122K Apr 12 16:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:43 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:43 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 3 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 121K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717220633943

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EisenbergMcGuire-PT-03
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 05:43:56] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 05:43:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 05:43:56] [INFO ] Load time of PNML (sax parser for PT used): 172 ms
[2024-06-01 05:43:56] [INFO ] Transformed 117 places.
[2024-06-01 05:43:56] [INFO ] Transformed 216 transitions.
[2024-06-01 05:43:56] [INFO ] Found NUPN structural information;
[2024-06-01 05:43:56] [INFO ] Parsed PT model containing 117 places and 216 transitions and 900 arcs in 416 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA EisenbergMcGuire-PT-03-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-03-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-03-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-03-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-03-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-03-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-03-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-03-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EisenbergMcGuire-PT-03-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 117 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 117/117 places, 216/216 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 112 transition count 201
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 112 transition count 201
Applied a total of 10 rules in 60 ms. Remains 112 /117 variables (removed 5) and now considering 201/216 (removed 15) transitions.
[2024-06-01 05:43:57] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
// Phase 1: matrix 138 rows 112 cols
[2024-06-01 05:43:57] [INFO ] Computed 10 invariants in 27 ms
[2024-06-01 05:43:57] [INFO ] Implicit Places using invariants in 476 ms returned []
[2024-06-01 05:43:57] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
[2024-06-01 05:43:57] [INFO ] Invariant cache hit.
[2024-06-01 05:43:58] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-06-01 05:43:58] [INFO ] Implicit Places using invariants and state equation in 475 ms returned []
Implicit Place search using SMT with State Equation took 1040 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2024-06-01 05:43:58] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
[2024-06-01 05:43:58] [INFO ] Invariant cache hit.
[2024-06-01 05:43:58] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 05:44:00] [INFO ] Deduced a trap composed of 29 places in 110 ms of which 20 ms to minimize.
[2024-06-01 05:44:00] [INFO ] Deduced a trap composed of 31 places in 119 ms of which 4 ms to minimize.
[2024-06-01 05:44:00] [INFO ] Deduced a trap composed of 21 places in 107 ms of which 3 ms to minimize.
[2024-06-01 05:44:00] [INFO ] Deduced a trap composed of 29 places in 98 ms of which 3 ms to minimize.
[2024-06-01 05:44:00] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 3 ms to minimize.
[2024-06-01 05:44:00] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 3 ms to minimize.
[2024-06-01 05:44:01] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 2 ms to minimize.
[2024-06-01 05:44:01] [INFO ] Deduced a trap composed of 3 places in 93 ms of which 3 ms to minimize.
[2024-06-01 05:44:01] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 2 ms to minimize.
[2024-06-01 05:44:01] [INFO ] Deduced a trap composed of 36 places in 93 ms of which 2 ms to minimize.
[2024-06-01 05:44:01] [INFO ] Deduced a trap composed of 22 places in 83 ms of which 2 ms to minimize.
[2024-06-01 05:44:01] [INFO ] Deduced a trap composed of 24 places in 105 ms of which 2 ms to minimize.
[2024-06-01 05:44:01] [INFO ] Deduced a trap composed of 25 places in 118 ms of which 5 ms to minimize.
[2024-06-01 05:44:02] [INFO ] Deduced a trap composed of 17 places in 117 ms of which 2 ms to minimize.
[2024-06-01 05:44:02] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 2 ms to minimize.
[2024-06-01 05:44:02] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 2 ms to minimize.
[2024-06-01 05:44:02] [INFO ] Deduced a trap composed of 31 places in 63 ms of which 5 ms to minimize.
[2024-06-01 05:44:02] [INFO ] Deduced a trap composed of 34 places in 61 ms of which 1 ms to minimize.
[2024-06-01 05:44:03] [INFO ] Deduced a trap composed of 36 places in 54 ms of which 1 ms to minimize.
[2024-06-01 05:44:03] [INFO ] Deduced a trap composed of 36 places in 69 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 05:44:03] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 1 ms to minimize.
[2024-06-01 05:44:03] [INFO ] Deduced a trap composed of 37 places in 92 ms of which 3 ms to minimize.
[2024-06-01 05:44:04] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 138/250 variables, 112/145 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 46/191 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 05:44:09] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (OVERLAPS) 0/250 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 192 constraints, problems are : Problem set: 0 solved, 198 unsolved in 19271 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 05:44:19] [INFO ] Deduced a trap composed of 33 places in 54 ms of which 2 ms to minimize.
[2024-06-01 05:44:19] [INFO ] Deduced a trap composed of 24 places in 68 ms of which 2 ms to minimize.
[2024-06-01 05:44:19] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 3 ms to minimize.
[2024-06-01 05:44:19] [INFO ] Deduced a trap composed of 31 places in 78 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 138/250 variables, 112/150 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 46/196 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 198/394 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 05:44:23] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 3 ms to minimize.
[2024-06-01 05:44:23] [INFO ] Deduced a trap composed of 30 places in 107 ms of which 3 ms to minimize.
[2024-06-01 05:44:23] [INFO ] Deduced a trap composed of 37 places in 98 ms of which 3 ms to minimize.
[2024-06-01 05:44:23] [INFO ] Deduced a trap composed of 26 places in 87 ms of which 2 ms to minimize.
[2024-06-01 05:44:24] [INFO ] Deduced a trap composed of 27 places in 78 ms of which 2 ms to minimize.
[2024-06-01 05:44:25] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 6/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 05:44:27] [INFO ] Deduced a trap composed of 36 places in 90 ms of which 6 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 05:44:30] [INFO ] Deduced a trap composed of 40 places in 75 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 1/402 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 05:44:33] [INFO ] Deduced a trap composed of 32 places in 53 ms of which 1 ms to minimize.
[2024-06-01 05:44:33] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 2/404 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 05:44:38] [INFO ] Deduced a trap composed of 34 places in 49 ms of which 2 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 1/405 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/250 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 05:44:44] [INFO ] Deduced a trap composed of 32 places in 90 ms of which 2 ms to minimize.
[2024-06-01 05:44:44] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 3 ms to minimize.
At refinement iteration 14 (OVERLAPS) 0/250 variables, 2/407 constraints. Problems are: Problem set: 0 solved, 198 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 250/250 variables, and 407 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 41/41 constraints]
After SMT, in 49540ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 49580ms
Starting structural reductions in LTL mode, iteration 1 : 112/117 places, 201/216 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 50729 ms. Remains : 112/117 places, 201/216 transitions.
Support contains 26 out of 112 places after structural reductions.
[2024-06-01 05:44:48] [INFO ] Flatten gal took : 86 ms
[2024-06-01 05:44:48] [INFO ] Flatten gal took : 35 ms
[2024-06-01 05:44:48] [INFO ] Input system was already deterministic with 201 transitions.
Reduction of identical properties reduced properties to check from 19 to 18
RANDOM walk for 40000 steps (8 resets) in 2196 ms. (18 steps per ms) remains 6/18 properties
BEST_FIRST walk for 40004 steps (8 resets) in 332 ms. (120 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 53 ms. (740 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 66 ms. (597 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 99 ms. (400 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 108 ms. (367 steps per ms) remains 6/6 properties
[2024-06-01 05:44:49] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
[2024-06-01 05:44:49] [INFO ] Invariant cache hit.
[2024-06-01 05:44:49] [INFO ] State equation strengthened by 46 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 93/106 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 6/112 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 138/250 variables, 112/122 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 46/168 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/250 variables, 0/168 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 168 constraints, problems are : Problem set: 0 solved, 6 unsolved in 244 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem AtomicPropp11 is UNSAT
At refinement iteration 1 (OVERLAPS) 93/106 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 6/112 variables, 3/10 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 05:44:49] [INFO ] Deduced a trap composed of 3 places in 90 ms of which 3 ms to minimize.
[2024-06-01 05:44:50] [INFO ] Deduced a trap composed of 51 places in 112 ms of which 3 ms to minimize.
[2024-06-01 05:44:50] [INFO ] Deduced a trap composed of 20 places in 95 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 3/13 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 05:44:50] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 2 ms to minimize.
[2024-06-01 05:44:50] [INFO ] Deduced a trap composed of 19 places in 65 ms of which 2 ms to minimize.
[2024-06-01 05:44:50] [INFO ] Deduced a trap composed of 31 places in 58 ms of which 1 ms to minimize.
[2024-06-01 05:44:50] [INFO ] Deduced a trap composed of 32 places in 59 ms of which 2 ms to minimize.
[2024-06-01 05:44:50] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 2 ms to minimize.
[2024-06-01 05:44:50] [INFO ] Deduced a trap composed of 4 places in 56 ms of which 1 ms to minimize.
[2024-06-01 05:44:50] [INFO ] Deduced a trap composed of 27 places in 46 ms of which 2 ms to minimize.
[2024-06-01 05:44:50] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-06-01 05:44:50] [INFO ] Deduced a trap composed of 31 places in 54 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 9/22 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 05:44:50] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 2 ms to minimize.
[2024-06-01 05:44:50] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 2/24 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/112 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 138/250 variables, 112/136 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 46/182 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 5/187 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-01 05:44:51] [INFO ] Deduced a trap composed of 32 places in 69 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 1/188 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 0/188 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/250 variables, 0/188 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 250/250 variables, and 188 constraints, problems are : Problem set: 1 solved, 5 unsolved in 1669 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 15/15 constraints]
After SMT, in 1929ms problems are : Problem set: 1 solved, 5 unsolved
Parikh walk visited 2 properties in 1709 ms.
Support contains 5 out of 112 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 112/112 places, 201/201 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 112 transition count 198
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 109 transition count 198
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 26 Pre rules applied. Total rules applied 6 place count 109 transition count 172
Deduced a syphon composed of 26 places in 2 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 2 with 52 rules applied. Total rules applied 58 place count 83 transition count 172
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 59 place count 82 transition count 169
Iterating global reduction 2 with 1 rules applied. Total rules applied 60 place count 82 transition count 169
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 72 place count 76 transition count 163
Applied a total of 72 rules in 66 ms. Remains 76 /112 variables (removed 36) and now considering 163/201 (removed 38) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 66 ms. Remains : 76/112 places, 163/201 transitions.
RANDOM walk for 40000 steps (8 resets) in 379 ms. (105 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 173 ms. (229 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 112 ms. (354 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 3/3 properties
Probably explored full state space saw : 6166 states, properties seen :2
Probabilistic random walk after 24664 steps, saw 6166 distinct states, run finished after 220 ms. (steps per millisecond=112 ) properties seen :2
Explored full state space saw : 6166 states, properties seen :0
Exhaustive walk after 24664 steps, saw 6166 distinct states, run finished after 83 ms. (steps per millisecond=297 ) properties seen :0
Successfully simplified 2 atomic propositions for a total of 7 simplifications.
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(F((X(F((p2||G(F(p3)))))&&p1))))))'
Support contains 6 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 201/201 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 111 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 111 transition count 198
Applied a total of 2 rules in 9 ms. Remains 111 /112 variables (removed 1) and now considering 198/201 (removed 3) transitions.
[2024-06-01 05:44:54] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
// Phase 1: matrix 135 rows 111 cols
[2024-06-01 05:44:54] [INFO ] Computed 10 invariants in 3 ms
[2024-06-01 05:44:54] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-01 05:44:54] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-06-01 05:44:54] [INFO ] Invariant cache hit.
[2024-06-01 05:44:54] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 05:44:54] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 395 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-06-01 05:44:54] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-06-01 05:44:54] [INFO ] Invariant cache hit.
[2024-06-01 05:44:54] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 05:44:55] [INFO ] Deduced a trap composed of 29 places in 52 ms of which 1 ms to minimize.
[2024-06-01 05:44:55] [INFO ] Deduced a trap composed of 31 places in 97 ms of which 3 ms to minimize.
[2024-06-01 05:44:56] [INFO ] Deduced a trap composed of 21 places in 112 ms of which 3 ms to minimize.
[2024-06-01 05:44:56] [INFO ] Deduced a trap composed of 29 places in 96 ms of which 2 ms to minimize.
[2024-06-01 05:44:56] [INFO ] Deduced a trap composed of 40 places in 85 ms of which 2 ms to minimize.
[2024-06-01 05:44:56] [INFO ] Deduced a trap composed of 4 places in 116 ms of which 2 ms to minimize.
[2024-06-01 05:44:56] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 2 ms to minimize.
[2024-06-01 05:44:56] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 3 ms to minimize.
[2024-06-01 05:44:56] [INFO ] Deduced a trap composed of 20 places in 64 ms of which 1 ms to minimize.
[2024-06-01 05:44:57] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 2 ms to minimize.
[2024-06-01 05:44:57] [INFO ] Deduced a trap composed of 15 places in 64 ms of which 2 ms to minimize.
[2024-06-01 05:44:57] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2024-06-01 05:44:57] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 1 ms to minimize.
[2024-06-01 05:44:57] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-06-01 05:44:57] [INFO ] Deduced a trap composed of 45 places in 74 ms of which 3 ms to minimize.
[2024-06-01 05:44:57] [INFO ] Deduced a trap composed of 40 places in 79 ms of which 2 ms to minimize.
[2024-06-01 05:44:57] [INFO ] Deduced a trap composed of 21 places in 54 ms of which 2 ms to minimize.
[2024-06-01 05:44:57] [INFO ] Deduced a trap composed of 39 places in 53 ms of which 1 ms to minimize.
[2024-06-01 05:44:57] [INFO ] Deduced a trap composed of 35 places in 45 ms of which 2 ms to minimize.
[2024-06-01 05:44:57] [INFO ] Deduced a trap composed of 39 places in 82 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 05:44:58] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-06-01 05:44:58] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 2 ms to minimize.
[2024-06-01 05:44:58] [INFO ] Deduced a trap composed of 41 places in 76 ms of which 2 ms to minimize.
[2024-06-01 05:44:58] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 2 ms to minimize.
[2024-06-01 05:44:59] [INFO ] Deduced a trap composed of 30 places in 95 ms of which 2 ms to minimize.
[2024-06-01 05:44:59] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 2 ms to minimize.
[2024-06-01 05:44:59] [INFO ] Deduced a trap composed of 33 places in 87 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 111/148 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 44/192 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 05:45:04] [INFO ] Deduced a trap composed of 35 places in 99 ms of which 3 ms to minimize.
[2024-06-01 05:45:04] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 0/246 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 194 constraints, problems are : Problem set: 0 solved, 195 unsolved in 17223 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 29/39 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 05:45:13] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 111/151 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 44/195 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 195/390 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 05:45:16] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 2 ms to minimize.
[2024-06-01 05:45:16] [INFO ] Deduced a trap composed of 48 places in 96 ms of which 3 ms to minimize.
[2024-06-01 05:45:16] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
[2024-06-01 05:45:18] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 4/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (OVERLAPS) 0/246 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 394 constraints, problems are : Problem set: 0 solved, 195 unsolved in 15698 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 34/34 constraints]
After SMT, in 33010ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 33017ms
Starting structural reductions in LTL mode, iteration 1 : 111/112 places, 198/201 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33425 ms. Remains : 111/112 places, 198/201 transitions.
Stuttering acceptance computed with spot in 522 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p2) (NOT p3))]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLCardinality-00
Product exploration explored 100000 steps with 0 reset in 492 ms.
Stack based approach found an accepted trace after 17 steps with 0 reset with depth 18 and stack size 18 in 1 ms.
FORMULA EisenbergMcGuire-PT-03-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLCardinality-00 finished in 34529 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((p0&&G((p1&&X((G(p3)||p2)))))))'
Support contains 6 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 201/201 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 111 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 111 transition count 198
Applied a total of 2 rules in 15 ms. Remains 111 /112 variables (removed 1) and now considering 198/201 (removed 3) transitions.
[2024-06-01 05:45:28] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-06-01 05:45:28] [INFO ] Invariant cache hit.
[2024-06-01 05:45:28] [INFO ] Implicit Places using invariants in 192 ms returned []
[2024-06-01 05:45:28] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-06-01 05:45:28] [INFO ] Invariant cache hit.
[2024-06-01 05:45:28] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 05:45:29] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 527 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-06-01 05:45:29] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-06-01 05:45:29] [INFO ] Invariant cache hit.
[2024-06-01 05:45:29] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 05:45:30] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
[2024-06-01 05:45:30] [INFO ] Deduced a trap composed of 31 places in 55 ms of which 1 ms to minimize.
[2024-06-01 05:45:30] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 2 ms to minimize.
[2024-06-01 05:45:30] [INFO ] Deduced a trap composed of 29 places in 92 ms of which 2 ms to minimize.
[2024-06-01 05:45:30] [INFO ] Deduced a trap composed of 40 places in 116 ms of which 2 ms to minimize.
[2024-06-01 05:45:30] [INFO ] Deduced a trap composed of 4 places in 100 ms of which 3 ms to minimize.
[2024-06-01 05:45:30] [INFO ] Deduced a trap composed of 5 places in 52 ms of which 2 ms to minimize.
[2024-06-01 05:45:31] [INFO ] Deduced a trap composed of 35 places in 111 ms of which 2 ms to minimize.
[2024-06-01 05:45:31] [INFO ] Deduced a trap composed of 20 places in 65 ms of which 2 ms to minimize.
[2024-06-01 05:45:31] [INFO ] Deduced a trap composed of 19 places in 98 ms of which 2 ms to minimize.
[2024-06-01 05:45:31] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 1 ms to minimize.
[2024-06-01 05:45:31] [INFO ] Deduced a trap composed of 17 places in 111 ms of which 3 ms to minimize.
[2024-06-01 05:45:31] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 2 ms to minimize.
[2024-06-01 05:45:31] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-06-01 05:45:31] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 2 ms to minimize.
[2024-06-01 05:45:31] [INFO ] Deduced a trap composed of 40 places in 103 ms of which 2 ms to minimize.
[2024-06-01 05:45:32] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 2 ms to minimize.
[2024-06-01 05:45:32] [INFO ] Deduced a trap composed of 39 places in 88 ms of which 2 ms to minimize.
[2024-06-01 05:45:32] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 2 ms to minimize.
[2024-06-01 05:45:32] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 05:45:32] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-01 05:45:32] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 2 ms to minimize.
[2024-06-01 05:45:32] [INFO ] Deduced a trap composed of 41 places in 73 ms of which 2 ms to minimize.
[2024-06-01 05:45:32] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 2 ms to minimize.
[2024-06-01 05:45:33] [INFO ] Deduced a trap composed of 30 places in 80 ms of which 2 ms to minimize.
[2024-06-01 05:45:34] [INFO ] Deduced a trap composed of 31 places in 98 ms of which 2 ms to minimize.
[2024-06-01 05:45:34] [INFO ] Deduced a trap composed of 33 places in 89 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 111/148 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 44/192 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 05:45:39] [INFO ] Deduced a trap composed of 35 places in 92 ms of which 2 ms to minimize.
[2024-06-01 05:45:39] [INFO ] Deduced a trap composed of 24 places in 83 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 0/246 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 194 constraints, problems are : Problem set: 0 solved, 195 unsolved in 17360 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 29/39 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 05:45:47] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 111/151 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 44/195 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 195/390 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 05:45:51] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 2 ms to minimize.
[2024-06-01 05:45:51] [INFO ] Deduced a trap composed of 48 places in 87 ms of which 2 ms to minimize.
[2024-06-01 05:45:51] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 3 ms to minimize.
[2024-06-01 05:45:53] [INFO ] Deduced a trap composed of 35 places in 62 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 4/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (OVERLAPS) 0/246 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 394 constraints, problems are : Problem set: 0 solved, 195 unsolved in 14939 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 34/34 constraints]
After SMT, in 32376ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 32382ms
Starting structural reductions in LTL mode, iteration 1 : 111/112 places, 198/201 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32925 ms. Remains : 111/112 places, 198/201 transitions.
Stuttering acceptance computed with spot in 215 ms :[true, (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p3) (NOT p1))]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-03-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLCardinality-02 finished in 33174 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((p0&&F((X(G(p1))&&G(p2))))))'
Support contains 4 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 201/201 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 111 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 111 transition count 198
Applied a total of 2 rules in 8 ms. Remains 111 /112 variables (removed 1) and now considering 198/201 (removed 3) transitions.
[2024-06-01 05:46:01] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-06-01 05:46:01] [INFO ] Invariant cache hit.
[2024-06-01 05:46:01] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-06-01 05:46:01] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-06-01 05:46:01] [INFO ] Invariant cache hit.
[2024-06-01 05:46:02] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 05:46:02] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-06-01 05:46:02] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-06-01 05:46:02] [INFO ] Invariant cache hit.
[2024-06-01 05:46:02] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 05:46:03] [INFO ] Deduced a trap composed of 29 places in 55 ms of which 1 ms to minimize.
[2024-06-01 05:46:03] [INFO ] Deduced a trap composed of 31 places in 94 ms of which 2 ms to minimize.
[2024-06-01 05:46:03] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 2 ms to minimize.
[2024-06-01 05:46:03] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 2 ms to minimize.
[2024-06-01 05:46:04] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 1 ms to minimize.
[2024-06-01 05:46:04] [INFO ] Deduced a trap composed of 4 places in 97 ms of which 2 ms to minimize.
[2024-06-01 05:46:04] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 2 ms to minimize.
[2024-06-01 05:46:04] [INFO ] Deduced a trap composed of 35 places in 90 ms of which 2 ms to minimize.
[2024-06-01 05:46:04] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 2 ms to minimize.
[2024-06-01 05:46:04] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 2 ms to minimize.
[2024-06-01 05:46:04] [INFO ] Deduced a trap composed of 15 places in 86 ms of which 3 ms to minimize.
[2024-06-01 05:46:04] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 2 ms to minimize.
[2024-06-01 05:46:05] [INFO ] Deduced a trap composed of 3 places in 39 ms of which 1 ms to minimize.
[2024-06-01 05:46:05] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-06-01 05:46:05] [INFO ] Deduced a trap composed of 45 places in 94 ms of which 2 ms to minimize.
[2024-06-01 05:46:05] [INFO ] Deduced a trap composed of 40 places in 102 ms of which 2 ms to minimize.
[2024-06-01 05:46:05] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 2 ms to minimize.
[2024-06-01 05:46:05] [INFO ] Deduced a trap composed of 39 places in 90 ms of which 2 ms to minimize.
[2024-06-01 05:46:05] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 2 ms to minimize.
[2024-06-01 05:46:05] [INFO ] Deduced a trap composed of 39 places in 110 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 05:46:05] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-01 05:46:06] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 2 ms to minimize.
[2024-06-01 05:46:06] [INFO ] Deduced a trap composed of 41 places in 92 ms of which 2 ms to minimize.
[2024-06-01 05:46:06] [INFO ] Deduced a trap composed of 34 places in 97 ms of which 2 ms to minimize.
[2024-06-01 05:46:07] [INFO ] Deduced a trap composed of 30 places in 73 ms of which 2 ms to minimize.
[2024-06-01 05:46:07] [INFO ] Deduced a trap composed of 31 places in 106 ms of which 2 ms to minimize.
[2024-06-01 05:46:07] [INFO ] Deduced a trap composed of 33 places in 94 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 111/148 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 44/192 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 05:46:12] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 2 ms to minimize.
[2024-06-01 05:46:12] [INFO ] Deduced a trap composed of 24 places in 97 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 0/246 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 194 constraints, problems are : Problem set: 0 solved, 195 unsolved in 18502 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 29/39 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 05:46:22] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 111/151 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 44/195 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 195/390 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 05:46:25] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 2 ms to minimize.
[2024-06-01 05:46:25] [INFO ] Deduced a trap composed of 48 places in 82 ms of which 2 ms to minimize.
[2024-06-01 05:46:26] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 2 ms to minimize.
[2024-06-01 05:46:27] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 4/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (OVERLAPS) 0/246 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 394 constraints, problems are : Problem set: 0 solved, 195 unsolved in 15990 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 34/34 constraints]
After SMT, in 34556ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 34564ms
Starting structural reductions in LTL mode, iteration 1 : 111/112 places, 198/201 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 35003 ms. Remains : 111/112 places, 198/201 transitions.
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (OR (NOT p0) (NOT p2) (NOT p1)), true, (OR (NOT p2) (NOT p1)), (NOT p1), (NOT p2)]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA EisenbergMcGuire-PT-03-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLCardinality-06 finished in 35258 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)))))'
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 201/201 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 111 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 111 transition count 198
Applied a total of 2 rules in 4 ms. Remains 111 /112 variables (removed 1) and now considering 198/201 (removed 3) transitions.
[2024-06-01 05:46:37] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-06-01 05:46:37] [INFO ] Invariant cache hit.
[2024-06-01 05:46:37] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-01 05:46:37] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-06-01 05:46:37] [INFO ] Invariant cache hit.
[2024-06-01 05:46:37] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 05:46:37] [INFO ] Implicit Places using invariants and state equation in 226 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-06-01 05:46:37] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-06-01 05:46:37] [INFO ] Invariant cache hit.
[2024-06-01 05:46:37] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 05:46:38] [INFO ] Deduced a trap composed of 29 places in 35 ms of which 2 ms to minimize.
[2024-06-01 05:46:38] [INFO ] Deduced a trap composed of 31 places in 82 ms of which 2 ms to minimize.
[2024-06-01 05:46:38] [INFO ] Deduced a trap composed of 21 places in 101 ms of which 2 ms to minimize.
[2024-06-01 05:46:38] [INFO ] Deduced a trap composed of 29 places in 87 ms of which 2 ms to minimize.
[2024-06-01 05:46:38] [INFO ] Deduced a trap composed of 40 places in 80 ms of which 2 ms to minimize.
[2024-06-01 05:46:38] [INFO ] Deduced a trap composed of 4 places in 95 ms of which 2 ms to minimize.
[2024-06-01 05:46:38] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 1 ms to minimize.
[2024-06-01 05:46:39] [INFO ] Deduced a trap composed of 35 places in 110 ms of which 2 ms to minimize.
[2024-06-01 05:46:39] [INFO ] Deduced a trap composed of 20 places in 73 ms of which 2 ms to minimize.
[2024-06-01 05:46:39] [INFO ] Deduced a trap composed of 19 places in 109 ms of which 2 ms to minimize.
[2024-06-01 05:46:39] [INFO ] Deduced a trap composed of 15 places in 84 ms of which 2 ms to minimize.
[2024-06-01 05:46:39] [INFO ] Deduced a trap composed of 17 places in 105 ms of which 3 ms to minimize.
[2024-06-01 05:46:39] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-06-01 05:46:39] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-06-01 05:46:39] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 2 ms to minimize.
[2024-06-01 05:46:40] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 2 ms to minimize.
[2024-06-01 05:46:40] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 2 ms to minimize.
[2024-06-01 05:46:40] [INFO ] Deduced a trap composed of 39 places in 91 ms of which 2 ms to minimize.
[2024-06-01 05:46:40] [INFO ] Deduced a trap composed of 35 places in 78 ms of which 2 ms to minimize.
[2024-06-01 05:46:40] [INFO ] Deduced a trap composed of 39 places in 107 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 05:46:40] [INFO ] Deduced a trap composed of 14 places in 47 ms of which 1 ms to minimize.
[2024-06-01 05:46:40] [INFO ] Deduced a trap composed of 30 places in 82 ms of which 2 ms to minimize.
[2024-06-01 05:46:41] [INFO ] Deduced a trap composed of 41 places in 74 ms of which 2 ms to minimize.
[2024-06-01 05:46:41] [INFO ] Deduced a trap composed of 34 places in 93 ms of which 2 ms to minimize.
[2024-06-01 05:46:41] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 2 ms to minimize.
[2024-06-01 05:46:42] [INFO ] Deduced a trap composed of 31 places in 99 ms of which 2 ms to minimize.
[2024-06-01 05:46:42] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 111/148 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 44/192 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 05:46:47] [INFO ] Deduced a trap composed of 35 places in 102 ms of which 2 ms to minimize.
[2024-06-01 05:46:47] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 0/246 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 194 constraints, problems are : Problem set: 0 solved, 195 unsolved in 17790 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 29/39 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 05:46:56] [INFO ] Deduced a trap composed of 29 places in 68 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 111/151 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 44/195 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 195/390 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 05:46:59] [INFO ] Deduced a trap composed of 21 places in 49 ms of which 1 ms to minimize.
[2024-06-01 05:46:59] [INFO ] Deduced a trap composed of 48 places in 57 ms of which 2 ms to minimize.
[2024-06-01 05:46:59] [INFO ] Deduced a trap composed of 23 places in 48 ms of which 1 ms to minimize.
[2024-06-01 05:47:01] [INFO ] Deduced a trap composed of 35 places in 63 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 4/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (OVERLAPS) 0/246 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 394 constraints, problems are : Problem set: 0 solved, 195 unsolved in 14656 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 34/34 constraints]
After SMT, in 32499ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 32503ms
Starting structural reductions in LTL mode, iteration 1 : 111/112 places, 198/201 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32843 ms. Remains : 111/112 places, 198/201 transitions.
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLCardinality-08
Product exploration explored 100000 steps with 25000 reset in 430 ms.
Product exploration explored 100000 steps with 25000 reset in 357 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 128 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 297 steps (0 resets) in 15 ms. (18 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 102 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 198/198 transitions.
Applied a total of 0 rules in 3 ms. Remains 111 /111 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2024-06-01 05:47:11] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-06-01 05:47:11] [INFO ] Invariant cache hit.
[2024-06-01 05:47:11] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-06-01 05:47:11] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-06-01 05:47:11] [INFO ] Invariant cache hit.
[2024-06-01 05:47:11] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 05:47:12] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-06-01 05:47:12] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-06-01 05:47:12] [INFO ] Invariant cache hit.
[2024-06-01 05:47:12] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 05:47:13] [INFO ] Deduced a trap composed of 29 places in 47 ms of which 2 ms to minimize.
[2024-06-01 05:47:13] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 2 ms to minimize.
[2024-06-01 05:47:13] [INFO ] Deduced a trap composed of 21 places in 111 ms of which 3 ms to minimize.
[2024-06-01 05:47:13] [INFO ] Deduced a trap composed of 29 places in 84 ms of which 2 ms to minimize.
[2024-06-01 05:47:14] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 3 ms to minimize.
[2024-06-01 05:47:14] [INFO ] Deduced a trap composed of 4 places in 104 ms of which 2 ms to minimize.
[2024-06-01 05:47:14] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 2 ms to minimize.
[2024-06-01 05:47:14] [INFO ] Deduced a trap composed of 35 places in 116 ms of which 2 ms to minimize.
[2024-06-01 05:47:14] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 2 ms to minimize.
[2024-06-01 05:47:14] [INFO ] Deduced a trap composed of 19 places in 108 ms of which 3 ms to minimize.
[2024-06-01 05:47:14] [INFO ] Deduced a trap composed of 15 places in 82 ms of which 2 ms to minimize.
[2024-06-01 05:47:14] [INFO ] Deduced a trap composed of 17 places in 103 ms of which 2 ms to minimize.
[2024-06-01 05:47:15] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-06-01 05:47:15] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-06-01 05:47:15] [INFO ] Deduced a trap composed of 45 places in 101 ms of which 2 ms to minimize.
[2024-06-01 05:47:15] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 2 ms to minimize.
[2024-06-01 05:47:15] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 2 ms to minimize.
[2024-06-01 05:47:15] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 2 ms to minimize.
[2024-06-01 05:47:15] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 2 ms to minimize.
[2024-06-01 05:47:15] [INFO ] Deduced a trap composed of 39 places in 101 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 05:47:16] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-06-01 05:47:16] [INFO ] Deduced a trap composed of 30 places in 70 ms of which 2 ms to minimize.
[2024-06-01 05:47:16] [INFO ] Deduced a trap composed of 41 places in 86 ms of which 2 ms to minimize.
[2024-06-01 05:47:16] [INFO ] Deduced a trap composed of 34 places in 100 ms of which 2 ms to minimize.
[2024-06-01 05:47:17] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 2 ms to minimize.
[2024-06-01 05:47:17] [INFO ] Deduced a trap composed of 31 places in 85 ms of which 2 ms to minimize.
[2024-06-01 05:47:17] [INFO ] Deduced a trap composed of 33 places in 88 ms of which 3 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 111/148 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 44/192 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 05:47:22] [INFO ] Deduced a trap composed of 35 places in 82 ms of which 3 ms to minimize.
[2024-06-01 05:47:22] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 0/246 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 194 constraints, problems are : Problem set: 0 solved, 195 unsolved in 17873 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 29/39 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 05:47:31] [INFO ] Deduced a trap composed of 29 places in 64 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 111/151 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 44/195 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 195/390 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 05:47:34] [INFO ] Deduced a trap composed of 21 places in 72 ms of which 2 ms to minimize.
[2024-06-01 05:47:34] [INFO ] Deduced a trap composed of 48 places in 88 ms of which 2 ms to minimize.
[2024-06-01 05:47:35] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 2 ms to minimize.
[2024-06-01 05:47:36] [INFO ] Deduced a trap composed of 35 places in 73 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 4/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (OVERLAPS) 0/246 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 394 constraints, problems are : Problem set: 0 solved, 195 unsolved in 15386 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 34/34 constraints]
After SMT, in 33334ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 33338ms
Finished structural reductions in LTL mode , in 1 iterations and 33864 ms. Remains : 111/111 places, 198/198 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 97 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 314 steps (0 resets) in 6 ms. (44 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 128 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 185 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 186 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 205 ms.
Product exploration explored 100000 steps with 25000 reset in 234 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 111 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 111/111 places, 198/198 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 111 transition count 198
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 25 Pre rules applied. Total rules applied 3 place count 111 transition count 228
Deduced a syphon composed of 28 places in 0 ms
Iterating global reduction 1 with 25 rules applied. Total rules applied 28 place count 111 transition count 228
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 1 with 9 rules applied. Total rules applied 37 place count 111 transition count 228
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 40 place count 108 transition count 225
Deduced a syphon composed of 34 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 43 place count 108 transition count 225
Deduced a syphon composed of 34 places in 0 ms
Applied a total of 43 rules in 31 ms. Remains 108 /111 variables (removed 3) and now considering 225/198 (removed -27) transitions.
[2024-06-01 05:47:47] [INFO ] Redundant transitions in 10 ms returned []
Running 222 sub problems to find dead transitions.
[2024-06-01 05:47:47] [INFO ] Flow matrix only has 147 transitions (discarded 78 similar events)
// Phase 1: matrix 147 rows 108 cols
[2024-06-01 05:47:47] [INFO ] Computed 10 invariants in 2 ms
[2024-06-01 05:47:47] [INFO ] State equation strengthened by 66 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/108 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/108 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 222 unsolved
[2024-06-01 05:47:48] [INFO ] Deduced a trap composed of 6 places in 46 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
[2024-06-01 05:47:48] [INFO ] Deduced a trap composed of 6 places in 47 ms of which 1 ms to minimize.
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
[2024-06-01 05:47:48] [INFO ] Deduced a trap composed of 6 places in 51 ms of which 1 ms to minimize.
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
[2024-06-01 05:47:49] [INFO ] Deduced a trap composed of 21 places in 92 ms of which 2 ms to minimize.
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
[2024-06-01 05:47:49] [INFO ] Deduced a trap composed of 3 places in 107 ms of which 2 ms to minimize.
[2024-06-01 05:47:49] [INFO ] Deduced a trap composed of 18 places in 49 ms of which 3 ms to minimize.
[2024-06-01 05:47:49] [INFO ] Deduced a trap composed of 6 places in 73 ms of which 1 ms to minimize.
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
[2024-06-01 05:47:49] [INFO ] Deduced a trap composed of 23 places in 99 ms of which 2 ms to minimize.
[2024-06-01 05:47:49] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 2 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
[2024-06-01 05:47:49] [INFO ] Deduced a trap composed of 3 places in 42 ms of which 1 ms to minimize.
[2024-06-01 05:47:49] [INFO ] Deduced a trap composed of 16 places in 79 ms of which 2 ms to minimize.
[2024-06-01 05:47:49] [INFO ] Deduced a trap composed of 29 places in 99 ms of which 2 ms to minimize.
[2024-06-01 05:47:49] [INFO ] Deduced a trap composed of 19 places in 100 ms of which 2 ms to minimize.
[2024-06-01 05:47:50] [INFO ] Deduced a trap composed of 11 places in 111 ms of which 2 ms to minimize.
[2024-06-01 05:47:50] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 2 ms to minimize.
[2024-06-01 05:47:50] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 2 ms to minimize.
[2024-06-01 05:47:50] [INFO ] Deduced a trap composed of 28 places in 101 ms of which 2 ms to minimize.
[2024-06-01 05:47:50] [INFO ] Deduced a trap composed of 23 places in 89 ms of which 2 ms to minimize.
[2024-06-01 05:47:50] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 2 ms to minimize.
[2024-06-01 05:47:50] [INFO ] Deduced a trap composed of 26 places in 86 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD223 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 20/30 constraints. Problems are: Problem set: 64 solved, 158 unsolved
[2024-06-01 05:47:51] [INFO ] Deduced a trap composed of 24 places in 77 ms of which 2 ms to minimize.
[2024-06-01 05:47:51] [INFO ] Deduced a trap composed of 19 places in 90 ms of which 2 ms to minimize.
[2024-06-01 05:47:51] [INFO ] Deduced a trap composed of 28 places in 96 ms of which 4 ms to minimize.
[2024-06-01 05:47:51] [INFO ] Deduced a trap composed of 22 places in 90 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/108 variables, 4/34 constraints. Problems are: Problem set: 64 solved, 158 unsolved
[2024-06-01 05:47:53] [INFO ] Deduced a trap composed of 23 places in 101 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 1/35 constraints. Problems are: Problem set: 64 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/35 constraints. Problems are: Problem set: 64 solved, 158 unsolved
At refinement iteration 6 (OVERLAPS) 147/255 variables, 108/143 constraints. Problems are: Problem set: 64 solved, 158 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 66/209 constraints. Problems are: Problem set: 64 solved, 158 unsolved
[2024-06-01 05:47:57] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
[2024-06-01 05:47:57] [INFO ] Deduced a trap composed of 26 places in 70 ms of which 2 ms to minimize.
[2024-06-01 05:47:57] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 2 ms to minimize.
[2024-06-01 05:47:57] [INFO ] Deduced a trap composed of 24 places in 85 ms of which 3 ms to minimize.
[2024-06-01 05:47:57] [INFO ] Deduced a trap composed of 25 places in 85 ms of which 6 ms to minimize.
[2024-06-01 05:47:57] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 6/215 constraints. Problems are: Problem set: 64 solved, 158 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 0/215 constraints. Problems are: Problem set: 64 solved, 158 unsolved
At refinement iteration 10 (OVERLAPS) 0/255 variables, 0/215 constraints. Problems are: Problem set: 64 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Real declared 255/255 variables, and 215 constraints, problems are : Problem set: 64 solved, 158 unsolved in 15260 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 108/108 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 222/222 constraints, Known Traps: 31/31 constraints]
Escalating to Integer solving :Problem set: 64 solved, 158 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 1/1 constraints. Problems are: Problem set: 64 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 31/32 constraints. Problems are: Problem set: 64 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/32 constraints. Problems are: Problem set: 64 solved, 158 unsolved
At refinement iteration 3 (OVERLAPS) 34/108 variables, 6/38 constraints. Problems are: Problem set: 64 solved, 158 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/108 variables, 3/41 constraints. Problems are: Problem set: 64 solved, 158 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/108 variables, 0/41 constraints. Problems are: Problem set: 64 solved, 158 unsolved
At refinement iteration 6 (OVERLAPS) 147/255 variables, 108/149 constraints. Problems are: Problem set: 64 solved, 158 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/255 variables, 66/215 constraints. Problems are: Problem set: 64 solved, 158 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/255 variables, 158/373 constraints. Problems are: Problem set: 64 solved, 158 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/255 variables, 0/373 constraints. Problems are: Problem set: 64 solved, 158 unsolved
At refinement iteration 10 (OVERLAPS) 0/255 variables, 0/373 constraints. Problems are: Problem set: 64 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Int declared 255/255 variables, and 373 constraints, problems are : Problem set: 64 solved, 158 unsolved in 10350 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 108/108 constraints, ReadFeed: 66/66 constraints, PredecessorRefiner: 158/222 constraints, Known Traps: 31/31 constraints]
After SMT, in 25659ms problems are : Problem set: 64 solved, 158 unsolved
Search for dead transitions found 64 dead transitions in 25664ms
Found 64 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 64 transitions
Dead transitions reduction (with SMT) removed 64 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 108/111 places, 161/198 transitions.
Graph (complete) has 455 edges and 108 vertex of which 74 are kept as prefixes of interest. Removing 34 places using SCC suffix rule.4 ms
Discarding 34 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 20 ms. Remains 74 /108 variables (removed 34) and now considering 161/161 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 74/111 places, 161/198 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 25747 ms. Remains : 74/111 places, 161/198 transitions.
Support contains 2 out of 111 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 111/111 places, 198/198 transitions.
Applied a total of 0 rules in 2 ms. Remains 111 /111 variables (removed 0) and now considering 198/198 (removed 0) transitions.
[2024-06-01 05:48:13] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
// Phase 1: matrix 135 rows 111 cols
[2024-06-01 05:48:13] [INFO ] Computed 10 invariants in 3 ms
[2024-06-01 05:48:13] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-06-01 05:48:13] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-06-01 05:48:13] [INFO ] Invariant cache hit.
[2024-06-01 05:48:13] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 05:48:13] [INFO ] Implicit Places using invariants and state equation in 345 ms returned []
Implicit Place search using SMT with State Equation took 554 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-06-01 05:48:13] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-06-01 05:48:13] [INFO ] Invariant cache hit.
[2024-06-01 05:48:13] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 05:48:14] [INFO ] Deduced a trap composed of 29 places in 37 ms of which 1 ms to minimize.
[2024-06-01 05:48:14] [INFO ] Deduced a trap composed of 31 places in 66 ms of which 1 ms to minimize.
[2024-06-01 05:48:14] [INFO ] Deduced a trap composed of 21 places in 96 ms of which 2 ms to minimize.
[2024-06-01 05:48:15] [INFO ] Deduced a trap composed of 29 places in 105 ms of which 2 ms to minimize.
[2024-06-01 05:48:15] [INFO ] Deduced a trap composed of 40 places in 100 ms of which 3 ms to minimize.
[2024-06-01 05:48:15] [INFO ] Deduced a trap composed of 4 places in 103 ms of which 2 ms to minimize.
[2024-06-01 05:48:15] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 2 ms to minimize.
[2024-06-01 05:48:15] [INFO ] Deduced a trap composed of 35 places in 115 ms of which 2 ms to minimize.
[2024-06-01 05:48:15] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
[2024-06-01 05:48:15] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 2 ms to minimize.
[2024-06-01 05:48:15] [INFO ] Deduced a trap composed of 15 places in 92 ms of which 2 ms to minimize.
[2024-06-01 05:48:16] [INFO ] Deduced a trap composed of 17 places in 99 ms of which 3 ms to minimize.
[2024-06-01 05:48:16] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 1 ms to minimize.
[2024-06-01 05:48:16] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-06-01 05:48:16] [INFO ] Deduced a trap composed of 45 places in 97 ms of which 2 ms to minimize.
[2024-06-01 05:48:16] [INFO ] Deduced a trap composed of 40 places in 91 ms of which 2 ms to minimize.
[2024-06-01 05:48:16] [INFO ] Deduced a trap composed of 21 places in 89 ms of which 2 ms to minimize.
[2024-06-01 05:48:16] [INFO ] Deduced a trap composed of 39 places in 87 ms of which 2 ms to minimize.
[2024-06-01 05:48:16] [INFO ] Deduced a trap composed of 35 places in 80 ms of which 2 ms to minimize.
[2024-06-01 05:48:16] [INFO ] Deduced a trap composed of 39 places in 98 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 05:48:17] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-06-01 05:48:17] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 2 ms to minimize.
[2024-06-01 05:48:17] [INFO ] Deduced a trap composed of 41 places in 85 ms of which 2 ms to minimize.
[2024-06-01 05:48:17] [INFO ] Deduced a trap composed of 34 places in 91 ms of which 2 ms to minimize.
[2024-06-01 05:48:18] [INFO ] Deduced a trap composed of 30 places in 79 ms of which 2 ms to minimize.
[2024-06-01 05:48:18] [INFO ] Deduced a trap composed of 31 places in 83 ms of which 3 ms to minimize.
[2024-06-01 05:48:18] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 111/148 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 44/192 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 05:48:24] [INFO ] Deduced a trap composed of 35 places in 89 ms of which 3 ms to minimize.
[2024-06-01 05:48:24] [INFO ] Deduced a trap composed of 24 places in 96 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 0/246 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 194 constraints, problems are : Problem set: 0 solved, 195 unsolved in 18596 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 29/39 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 05:48:34] [INFO ] Deduced a trap composed of 29 places in 72 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 111/151 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 44/195 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 195/390 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 05:48:37] [INFO ] Deduced a trap composed of 21 places in 77 ms of which 2 ms to minimize.
[2024-06-01 05:48:37] [INFO ] Deduced a trap composed of 48 places in 89 ms of which 2 ms to minimize.
[2024-06-01 05:48:37] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
[2024-06-01 05:48:39] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 4/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (OVERLAPS) 0/246 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 394 constraints, problems are : Problem set: 0 solved, 195 unsolved in 15932 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 34/34 constraints]
After SMT, in 34572ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 34579ms
Finished structural reductions in LTL mode , in 1 iterations and 35140 ms. Remains : 111/111 places, 198/198 transitions.
Treatment of property EisenbergMcGuire-PT-03-LTLCardinality-08 finished in 131452 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 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 201/201 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 111 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 111 transition count 198
Applied a total of 2 rules in 3 ms. Remains 111 /112 variables (removed 1) and now considering 198/201 (removed 3) transitions.
[2024-06-01 05:48:48] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-06-01 05:48:48] [INFO ] Invariant cache hit.
[2024-06-01 05:48:48] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-01 05:48:48] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-06-01 05:48:48] [INFO ] Invariant cache hit.
[2024-06-01 05:48:48] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 05:48:48] [INFO ] Implicit Places using invariants and state equation in 279 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-06-01 05:48:48] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-06-01 05:48:48] [INFO ] Invariant cache hit.
[2024-06-01 05:48:48] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 05:48:50] [INFO ] Deduced a trap composed of 29 places in 44 ms of which 2 ms to minimize.
[2024-06-01 05:48:50] [INFO ] Deduced a trap composed of 31 places in 89 ms of which 3 ms to minimize.
[2024-06-01 05:48:50] [INFO ] Deduced a trap composed of 21 places in 86 ms of which 2 ms to minimize.
[2024-06-01 05:48:50] [INFO ] Deduced a trap composed of 29 places in 90 ms of which 2 ms to minimize.
[2024-06-01 05:48:50] [INFO ] Deduced a trap composed of 40 places in 94 ms of which 2 ms to minimize.
[2024-06-01 05:48:50] [INFO ] Deduced a trap composed of 4 places in 96 ms of which 2 ms to minimize.
[2024-06-01 05:48:50] [INFO ] Deduced a trap composed of 5 places in 53 ms of which 2 ms to minimize.
[2024-06-01 05:48:51] [INFO ] Deduced a trap composed of 35 places in 103 ms of which 3 ms to minimize.
[2024-06-01 05:48:51] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
[2024-06-01 05:48:51] [INFO ] Deduced a trap composed of 19 places in 86 ms of which 2 ms to minimize.
[2024-06-01 05:48:51] [INFO ] Deduced a trap composed of 15 places in 78 ms of which 2 ms to minimize.
[2024-06-01 05:48:51] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 2 ms to minimize.
[2024-06-01 05:48:51] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-06-01 05:48:51] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-06-01 05:48:51] [INFO ] Deduced a trap composed of 45 places in 96 ms of which 2 ms to minimize.
[2024-06-01 05:48:51] [INFO ] Deduced a trap composed of 40 places in 93 ms of which 2 ms to minimize.
[2024-06-01 05:48:52] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 2 ms to minimize.
[2024-06-01 05:48:52] [INFO ] Deduced a trap composed of 39 places in 84 ms of which 2 ms to minimize.
[2024-06-01 05:48:52] [INFO ] Deduced a trap composed of 35 places in 72 ms of which 1 ms to minimize.
[2024-06-01 05:48:52] [INFO ] Deduced a trap composed of 39 places in 102 ms of which 3 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 05:48:52] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-06-01 05:48:52] [INFO ] Deduced a trap composed of 30 places in 64 ms of which 2 ms to minimize.
[2024-06-01 05:48:52] [INFO ] Deduced a trap composed of 41 places in 80 ms of which 2 ms to minimize.
[2024-06-01 05:48:52] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 4 ms to minimize.
[2024-06-01 05:48:53] [INFO ] Deduced a trap composed of 30 places in 71 ms of which 1 ms to minimize.
[2024-06-01 05:48:53] [INFO ] Deduced a trap composed of 31 places in 92 ms of which 3 ms to minimize.
[2024-06-01 05:48:54] [INFO ] Deduced a trap composed of 33 places in 93 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 111/148 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 44/192 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 05:48:58] [INFO ] Deduced a trap composed of 35 places in 84 ms of which 2 ms to minimize.
[2024-06-01 05:48:58] [INFO ] Deduced a trap composed of 24 places in 84 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 0/246 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 194 constraints, problems are : Problem set: 0 solved, 195 unsolved in 17189 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 29/39 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 05:49:07] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 111/151 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 44/195 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 195/390 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 05:49:11] [INFO ] Deduced a trap composed of 21 places in 69 ms of which 1 ms to minimize.
[2024-06-01 05:49:11] [INFO ] Deduced a trap composed of 48 places in 80 ms of which 2 ms to minimize.
[2024-06-01 05:49:11] [INFO ] Deduced a trap composed of 23 places in 71 ms of which 2 ms to minimize.
[2024-06-01 05:49:13] [INFO ] Deduced a trap composed of 35 places in 64 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 4/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (OVERLAPS) 0/246 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 394 constraints, problems are : Problem set: 0 solved, 195 unsolved in 15155 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 34/34 constraints]
After SMT, in 32402ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 32405ms
Starting structural reductions in LTL mode, iteration 1 : 111/112 places, 198/201 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32788 ms. Remains : 111/112 places, 198/201 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 118 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-03-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLCardinality-09 finished in 32892 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&&F(p1)))))'
Support contains 3 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 201/201 transitions.
Applied a total of 0 rules in 4 ms. Remains 112 /112 variables (removed 0) and now considering 201/201 (removed 0) transitions.
[2024-06-01 05:49:21] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
// Phase 1: matrix 138 rows 112 cols
[2024-06-01 05:49:21] [INFO ] Computed 10 invariants in 3 ms
[2024-06-01 05:49:21] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-06-01 05:49:21] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
[2024-06-01 05:49:21] [INFO ] Invariant cache hit.
[2024-06-01 05:49:21] [INFO ] State equation strengthened by 46 read => feed constraints.
[2024-06-01 05:49:21] [INFO ] Implicit Places using invariants and state equation in 210 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Running 198 sub problems to find dead transitions.
[2024-06-01 05:49:21] [INFO ] Flow matrix only has 138 transitions (discarded 63 similar events)
[2024-06-01 05:49:21] [INFO ] Invariant cache hit.
[2024-06-01 05:49:21] [INFO ] State equation strengthened by 46 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 05:49:22] [INFO ] Deduced a trap composed of 29 places in 46 ms of which 2 ms to minimize.
[2024-06-01 05:49:22] [INFO ] Deduced a trap composed of 31 places in 79 ms of which 2 ms to minimize.
[2024-06-01 05:49:23] [INFO ] Deduced a trap composed of 21 places in 113 ms of which 2 ms to minimize.
[2024-06-01 05:49:23] [INFO ] Deduced a trap composed of 29 places in 86 ms of which 1 ms to minimize.
[2024-06-01 05:49:23] [INFO ] Deduced a trap composed of 41 places in 93 ms of which 3 ms to minimize.
[2024-06-01 05:49:23] [INFO ] Deduced a trap composed of 3 places in 99 ms of which 2 ms to minimize.
[2024-06-01 05:49:23] [INFO ] Deduced a trap composed of 14 places in 55 ms of which 1 ms to minimize.
[2024-06-01 05:49:23] [INFO ] Deduced a trap composed of 3 places in 100 ms of which 3 ms to minimize.
[2024-06-01 05:49:23] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-06-01 05:49:23] [INFO ] Deduced a trap composed of 36 places in 110 ms of which 3 ms to minimize.
[2024-06-01 05:49:24] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 3 ms to minimize.
[2024-06-01 05:49:24] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 2 ms to minimize.
[2024-06-01 05:49:24] [INFO ] Deduced a trap composed of 25 places in 90 ms of which 2 ms to minimize.
[2024-06-01 05:49:24] [INFO ] Deduced a trap composed of 17 places in 88 ms of which 1 ms to minimize.
[2024-06-01 05:49:25] [INFO ] Deduced a trap composed of 30 places in 91 ms of which 2 ms to minimize.
[2024-06-01 05:49:25] [INFO ] Deduced a trap composed of 33 places in 103 ms of which 3 ms to minimize.
[2024-06-01 05:49:25] [INFO ] Deduced a trap composed of 31 places in 75 ms of which 2 ms to minimize.
[2024-06-01 05:49:25] [INFO ] Deduced a trap composed of 34 places in 95 ms of which 2 ms to minimize.
[2024-06-01 05:49:25] [INFO ] Deduced a trap composed of 36 places in 91 ms of which 2 ms to minimize.
[2024-06-01 05:49:25] [INFO ] Deduced a trap composed of 36 places in 74 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 05:49:25] [INFO ] Deduced a trap composed of 33 places in 62 ms of which 2 ms to minimize.
[2024-06-01 05:49:26] [INFO ] Deduced a trap composed of 37 places in 85 ms of which 3 ms to minimize.
[2024-06-01 05:49:27] [INFO ] Deduced a trap composed of 33 places in 81 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 138/250 variables, 112/145 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 46/191 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 05:49:32] [INFO ] Deduced a trap composed of 35 places in 87 ms of which 3 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 1/192 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 9 (OVERLAPS) 0/250 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 198 unsolved
No progress, stopping.
After SMT solving in domain Real declared 250/250 variables, and 192 constraints, problems are : Problem set: 0 solved, 198 unsolved in 18985 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 24/24 constraints]
Escalating to Integer solving :Problem set: 0 solved, 198 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/112 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/112 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/112 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 05:49:42] [INFO ] Deduced a trap composed of 33 places in 75 ms of which 2 ms to minimize.
[2024-06-01 05:49:42] [INFO ] Deduced a trap composed of 24 places in 103 ms of which 3 ms to minimize.
[2024-06-01 05:49:42] [INFO ] Deduced a trap composed of 33 places in 112 ms of which 2 ms to minimize.
[2024-06-01 05:49:42] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/112 variables, 4/38 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 5 (OVERLAPS) 138/250 variables, 112/150 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/250 variables, 46/196 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/250 variables, 198/394 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 05:49:45] [INFO ] Deduced a trap composed of 39 places in 75 ms of which 1 ms to minimize.
[2024-06-01 05:49:45] [INFO ] Deduced a trap composed of 30 places in 83 ms of which 2 ms to minimize.
[2024-06-01 05:49:46] [INFO ] Deduced a trap composed of 37 places in 74 ms of which 2 ms to minimize.
[2024-06-01 05:49:46] [INFO ] Deduced a trap composed of 26 places in 77 ms of which 2 ms to minimize.
[2024-06-01 05:49:47] [INFO ] Deduced a trap composed of 27 places in 77 ms of which 2 ms to minimize.
[2024-06-01 05:49:48] [INFO ] Deduced a trap composed of 39 places in 86 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/250 variables, 6/400 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 05:49:50] [INFO ] Deduced a trap composed of 36 places in 94 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/250 variables, 1/401 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 05:49:53] [INFO ] Deduced a trap composed of 40 places in 71 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/250 variables, 1/402 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 05:49:56] [INFO ] Deduced a trap composed of 32 places in 68 ms of which 2 ms to minimize.
[2024-06-01 05:49:56] [INFO ] Deduced a trap composed of 21 places in 78 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/250 variables, 2/404 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 05:50:02] [INFO ] Deduced a trap composed of 34 places in 62 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/250 variables, 1/405 constraints. Problems are: Problem set: 0 solved, 198 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/250 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 198 unsolved
[2024-06-01 05:50:07] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 2 ms to minimize.
[2024-06-01 05:50:08] [INFO ] Deduced a trap composed of 39 places in 72 ms of which 1 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 1)
(s2 0)
(s3 0)
(s4 0)
(s5 1)
(s6 0)
(s7 0)
(s8 1)
(s9 0)
(s10 0)
(s11 1)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 1)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 1)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 1)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 250/250 variables, and 407 constraints, problems are : Problem set: 0 solved, 198 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 112/112 constraints, ReadFeed: 46/46 constraints, PredecessorRefiner: 198/198 constraints, Known Traps: 41/41 constraints]
After SMT, in 49041ms problems are : Problem set: 0 solved, 198 unsolved
Search for dead transitions found 0 dead transitions in 49044ms
Finished structural reductions in LTL mode , in 1 iterations and 49381 ms. Remains : 112/112 places, 201/201 transitions.
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA EisenbergMcGuire-PT-03-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EisenbergMcGuire-PT-03-LTLCardinality-10 finished in 49572 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(p0)||G(p1)))))'
Support contains 4 out of 112 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 112/112 places, 201/201 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 111 transition count 198
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 111 transition count 198
Applied a total of 2 rules in 6 ms. Remains 111 /112 variables (removed 1) and now considering 198/201 (removed 3) transitions.
[2024-06-01 05:50:10] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
// Phase 1: matrix 135 rows 111 cols
[2024-06-01 05:50:10] [INFO ] Computed 10 invariants in 2 ms
[2024-06-01 05:50:11] [INFO ] Implicit Places using invariants in 189 ms returned []
[2024-06-01 05:50:11] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-06-01 05:50:11] [INFO ] Invariant cache hit.
[2024-06-01 05:50:11] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 05:50:11] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
Running 195 sub problems to find dead transitions.
[2024-06-01 05:50:11] [INFO ] Flow matrix only has 135 transitions (discarded 63 similar events)
[2024-06-01 05:50:11] [INFO ] Invariant cache hit.
[2024-06-01 05:50:11] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 05:50:12] [INFO ] Deduced a trap composed of 29 places in 45 ms of which 2 ms to minimize.
[2024-06-01 05:50:12] [INFO ] Deduced a trap composed of 31 places in 90 ms of which 2 ms to minimize.
[2024-06-01 05:50:13] [INFO ] Deduced a trap composed of 21 places in 88 ms of which 2 ms to minimize.
[2024-06-01 05:50:13] [INFO ] Deduced a trap composed of 29 places in 82 ms of which 2 ms to minimize.
[2024-06-01 05:50:13] [INFO ] Deduced a trap composed of 40 places in 92 ms of which 2 ms to minimize.
[2024-06-01 05:50:13] [INFO ] Deduced a trap composed of 4 places in 99 ms of which 3 ms to minimize.
[2024-06-01 05:50:13] [INFO ] Deduced a trap composed of 5 places in 56 ms of which 2 ms to minimize.
[2024-06-01 05:50:13] [INFO ] Deduced a trap composed of 35 places in 100 ms of which 3 ms to minimize.
[2024-06-01 05:50:13] [INFO ] Deduced a trap composed of 20 places in 70 ms of which 2 ms to minimize.
[2024-06-01 05:50:13] [INFO ] Deduced a trap composed of 19 places in 101 ms of which 2 ms to minimize.
[2024-06-01 05:50:14] [INFO ] Deduced a trap composed of 15 places in 81 ms of which 2 ms to minimize.
[2024-06-01 05:50:14] [INFO ] Deduced a trap composed of 17 places in 90 ms of which 3 ms to minimize.
[2024-06-01 05:50:14] [INFO ] Deduced a trap composed of 3 places in 43 ms of which 1 ms to minimize.
[2024-06-01 05:50:14] [INFO ] Deduced a trap composed of 3 places in 37 ms of which 1 ms to minimize.
[2024-06-01 05:50:14] [INFO ] Deduced a trap composed of 45 places in 94 ms of which 2 ms to minimize.
[2024-06-01 05:50:14] [INFO ] Deduced a trap composed of 40 places in 98 ms of which 2 ms to minimize.
[2024-06-01 05:50:14] [INFO ] Deduced a trap composed of 21 places in 79 ms of which 2 ms to minimize.
[2024-06-01 05:50:14] [INFO ] Deduced a trap composed of 39 places in 78 ms of which 2 ms to minimize.
[2024-06-01 05:50:14] [INFO ] Deduced a trap composed of 35 places in 60 ms of which 1 ms to minimize.
[2024-06-01 05:50:14] [INFO ] Deduced a trap composed of 39 places in 89 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 20/30 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 05:50:15] [INFO ] Deduced a trap composed of 14 places in 43 ms of which 1 ms to minimize.
[2024-06-01 05:50:15] [INFO ] Deduced a trap composed of 30 places in 69 ms of which 2 ms to minimize.
[2024-06-01 05:50:15] [INFO ] Deduced a trap composed of 41 places in 88 ms of which 2 ms to minimize.
[2024-06-01 05:50:15] [INFO ] Deduced a trap composed of 34 places in 103 ms of which 2 ms to minimize.
[2024-06-01 05:50:16] [INFO ] Deduced a trap composed of 30 places in 108 ms of which 2 ms to minimize.
[2024-06-01 05:50:16] [INFO ] Deduced a trap composed of 31 places in 102 ms of which 2 ms to minimize.
[2024-06-01 05:50:16] [INFO ] Deduced a trap composed of 33 places in 79 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 7/37 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 111/148 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 44/192 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 05:50:21] [INFO ] Deduced a trap composed of 35 places in 91 ms of which 2 ms to minimize.
[2024-06-01 05:50:22] [INFO ] Deduced a trap composed of 24 places in 93 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 2/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (OVERLAPS) 0/246 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Real declared 246/246 variables, and 194 constraints, problems are : Problem set: 0 solved, 195 unsolved in 18458 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 29/29 constraints]
Escalating to Integer solving :Problem set: 0 solved, 195 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/111 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/111 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/111 variables, 29/39 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 05:50:31] [INFO ] Deduced a trap composed of 29 places in 67 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/111 variables, 1/40 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/111 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 5 (OVERLAPS) 135/246 variables, 111/151 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/246 variables, 44/195 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/246 variables, 195/390 constraints. Problems are: Problem set: 0 solved, 195 unsolved
[2024-06-01 05:50:35] [INFO ] Deduced a trap composed of 21 places in 46 ms of which 1 ms to minimize.
[2024-06-01 05:50:35] [INFO ] Deduced a trap composed of 48 places in 51 ms of which 2 ms to minimize.
[2024-06-01 05:50:35] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 2 ms to minimize.
[2024-06-01 05:50:36] [INFO ] Deduced a trap composed of 35 places in 68 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/246 variables, 4/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/246 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
At refinement iteration 10 (OVERLAPS) 0/246 variables, 0/394 constraints. Problems are: Problem set: 0 solved, 195 unsolved
No progress, stopping.
After SMT solving in domain Int declared 246/246 variables, and 394 constraints, problems are : Problem set: 0 solved, 195 unsolved in 13980 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 111/111 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 195/195 constraints, Known Traps: 34/34 constraints]
After SMT, in 32503ms problems are : Problem set: 0 solved, 195 unsolved
Search for dead transitions found 0 dead transitions in 32509ms
Starting structural reductions in LTL mode, iteration 1 : 111/112 places, 198/201 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33062 ms. Remains : 111/112 places, 198/201 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLCardinality-15
Product exploration explored 100000 steps with 33333 reset in 109 ms.
Product exploration explored 100000 steps with 33333 reset in 146 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 19 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EisenbergMcGuire-PT-03-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EisenbergMcGuire-PT-03-LTLCardinality-15 finished in 33482 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)))))'
Found a Shortening insensitive property : EisenbergMcGuire-PT-03-LTLCardinality-08
Stuttering acceptance computed with spot in 162 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 112 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 112/112 places, 201/201 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 112 transition count 198
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 109 transition count 198
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 28 Pre rules applied. Total rules applied 6 place count 109 transition count 170
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 2 with 56 rules applied. Total rules applied 62 place count 81 transition count 170
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 63 place count 80 transition count 167
Iterating global reduction 2 with 1 rules applied. Total rules applied 64 place count 80 transition count 167
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 76 place count 74 transition count 161
Applied a total of 76 rules in 20 ms. Remains 74 /112 variables (removed 38) and now considering 161/201 (removed 40) transitions.
[2024-06-01 05:50:44] [INFO ] Flow matrix only has 98 transitions (discarded 63 similar events)
// Phase 1: matrix 98 rows 74 cols
[2024-06-01 05:50:44] [INFO ] Computed 10 invariants in 1 ms
[2024-06-01 05:50:44] [INFO ] Implicit Places using invariants in 111 ms returned []
[2024-06-01 05:50:44] [INFO ] Flow matrix only has 98 transitions (discarded 63 similar events)
[2024-06-01 05:50:44] [INFO ] Invariant cache hit.
[2024-06-01 05:50:44] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 05:50:45] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 386 ms to find 0 implicit places.
Running 158 sub problems to find dead transitions.
[2024-06-01 05:50:45] [INFO ] Flow matrix only has 98 transitions (discarded 63 similar events)
[2024-06-01 05:50:45] [INFO ] Invariant cache hit.
[2024-06-01 05:50:45] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 05:50:46] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 1 ms to minimize.
[2024-06-01 05:50:46] [INFO ] Deduced a trap composed of 22 places in 63 ms of which 2 ms to minimize.
[2024-06-01 05:50:46] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 2 ms to minimize.
[2024-06-01 05:50:46] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 2 ms to minimize.
[2024-06-01 05:50:46] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-06-01 05:50:46] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-06-01 05:50:46] [INFO ] Deduced a trap composed of 23 places in 63 ms of which 2 ms to minimize.
[2024-06-01 05:50:46] [INFO ] Deduced a trap composed of 14 places in 65 ms of which 1 ms to minimize.
[2024-06-01 05:50:46] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 2 ms to minimize.
[2024-06-01 05:50:46] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-06-01 05:50:46] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-06-01 05:50:47] [INFO ] Deduced a trap composed of 16 places in 72 ms of which 2 ms to minimize.
[2024-06-01 05:50:47] [INFO ] Deduced a trap composed of 23 places in 65 ms of which 2 ms to minimize.
[2024-06-01 05:50:47] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-06-01 05:50:47] [INFO ] Deduced a trap composed of 28 places in 69 ms of which 2 ms to minimize.
[2024-06-01 05:50:47] [INFO ] Deduced a trap composed of 17 places in 83 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 05:50:47] [INFO ] Deduced a trap composed of 21 places in 65 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (OVERLAPS) 98/172 variables, 74/101 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 44/145 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 05:50:50] [INFO ] Deduced a trap composed of 24 places in 58 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 05:50:51] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 10 (OVERLAPS) 0/172 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/172 variables, and 147 constraints, problems are : Problem set: 0 solved, 158 unsolved in 10153 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 158 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 19/29 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 05:50:55] [INFO ] Deduced a trap composed of 22 places in 38 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (OVERLAPS) 98/172 variables, 74/104 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 44/148 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 158/306 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 05:50:58] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 10 (OVERLAPS) 0/172 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Int declared 172/172 variables, and 307 constraints, problems are : Problem set: 0 solved, 158 unsolved in 7699 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 21/21 constraints]
After SMT, in 17913ms problems are : Problem set: 0 solved, 158 unsolved
Search for dead transitions found 0 dead transitions in 17917ms
Starting structural reductions in LI_LTL mode, iteration 1 : 74/112 places, 161/201 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 18324 ms. Remains : 74/112 places, 161/201 transitions.
Running random walk in product with property : EisenbergMcGuire-PT-03-LTLCardinality-08
Product exploration explored 100000 steps with 25000 reset in 114 ms.
Product exploration explored 100000 steps with 25000 reset in 130 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 95 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 169 steps (0 resets) in 4 ms. (33 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 128 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 161/161 transitions.
Applied a total of 0 rules in 2 ms. Remains 74 /74 variables (removed 0) and now considering 161/161 (removed 0) transitions.
[2024-06-01 05:51:04] [INFO ] Flow matrix only has 98 transitions (discarded 63 similar events)
[2024-06-01 05:51:04] [INFO ] Invariant cache hit.
[2024-06-01 05:51:04] [INFO ] Implicit Places using invariants in 159 ms returned []
[2024-06-01 05:51:04] [INFO ] Flow matrix only has 98 transitions (discarded 63 similar events)
[2024-06-01 05:51:04] [INFO ] Invariant cache hit.
[2024-06-01 05:51:04] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 05:51:04] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
Running 158 sub problems to find dead transitions.
[2024-06-01 05:51:04] [INFO ] Flow matrix only has 98 transitions (discarded 63 similar events)
[2024-06-01 05:51:04] [INFO ] Invariant cache hit.
[2024-06-01 05:51:04] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 05:51:05] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 1 ms to minimize.
[2024-06-01 05:51:05] [INFO ] Deduced a trap composed of 22 places in 61 ms of which 2 ms to minimize.
[2024-06-01 05:51:05] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 2 ms to minimize.
[2024-06-01 05:51:05] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 2 ms to minimize.
[2024-06-01 05:51:05] [INFO ] Deduced a trap composed of 11 places in 59 ms of which 2 ms to minimize.
[2024-06-01 05:51:05] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2024-06-01 05:51:06] [INFO ] Deduced a trap composed of 23 places in 67 ms of which 2 ms to minimize.
[2024-06-01 05:51:06] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 2 ms to minimize.
[2024-06-01 05:51:06] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 2 ms to minimize.
[2024-06-01 05:51:06] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-06-01 05:51:06] [INFO ] Deduced a trap composed of 24 places in 63 ms of which 1 ms to minimize.
[2024-06-01 05:51:06] [INFO ] Deduced a trap composed of 16 places in 73 ms of which 2 ms to minimize.
[2024-06-01 05:51:06] [INFO ] Deduced a trap composed of 23 places in 76 ms of which 2 ms to minimize.
[2024-06-01 05:51:06] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-06-01 05:51:06] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 2 ms to minimize.
[2024-06-01 05:51:06] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 05:51:07] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (OVERLAPS) 98/172 variables, 74/101 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 44/145 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 05:51:10] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 05:51:11] [INFO ] Deduced a trap composed of 26 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 10 (OVERLAPS) 0/172 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/172 variables, and 147 constraints, problems are : Problem set: 0 solved, 158 unsolved in 11301 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 158 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 19/29 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 05:51:16] [INFO ] Deduced a trap composed of 22 places in 49 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (OVERLAPS) 98/172 variables, 74/104 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 44/148 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 158/306 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 05:51:20] [INFO ] Deduced a trap composed of 17 places in 58 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 10 (OVERLAPS) 0/172 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Int declared 172/172 variables, and 307 constraints, problems are : Problem set: 0 solved, 158 unsolved in 9596 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 21/21 constraints]
After SMT, in 20953ms problems are : Problem set: 0 solved, 158 unsolved
Search for dead transitions found 0 dead transitions in 20959ms
Finished structural reductions in LTL mode , in 1 iterations and 21401 ms. Remains : 74/74 places, 161/161 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 93 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 161 steps (0 resets) in 5 ms. (26 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 132 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 190 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 196 ms.
Product exploration explored 100000 steps with 25000 reset in 222 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 187 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 74/74 places, 161/161 transitions.
Applied a total of 0 rules in 11 ms. Remains 74 /74 variables (removed 0) and now considering 161/161 (removed 0) transitions.
[2024-06-01 05:51:27] [INFO ] Redundant transitions in 9 ms returned []
Running 158 sub problems to find dead transitions.
[2024-06-01 05:51:27] [INFO ] Flow matrix only has 98 transitions (discarded 63 similar events)
[2024-06-01 05:51:27] [INFO ] Invariant cache hit.
[2024-06-01 05:51:27] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 05:51:28] [INFO ] Deduced a trap composed of 3 places in 63 ms of which 2 ms to minimize.
[2024-06-01 05:51:28] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
[2024-06-01 05:51:28] [INFO ] Deduced a trap composed of 20 places in 72 ms of which 2 ms to minimize.
[2024-06-01 05:51:28] [INFO ] Deduced a trap composed of 29 places in 65 ms of which 1 ms to minimize.
[2024-06-01 05:51:28] [INFO ] Deduced a trap composed of 11 places in 60 ms of which 2 ms to minimize.
[2024-06-01 05:51:28] [INFO ] Deduced a trap composed of 3 places in 33 ms of which 1 ms to minimize.
[2024-06-01 05:51:28] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 2 ms to minimize.
[2024-06-01 05:51:28] [INFO ] Deduced a trap composed of 14 places in 74 ms of which 2 ms to minimize.
[2024-06-01 05:51:29] [INFO ] Deduced a trap composed of 16 places in 59 ms of which 2 ms to minimize.
[2024-06-01 05:51:29] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-06-01 05:51:29] [INFO ] Deduced a trap composed of 24 places in 62 ms of which 2 ms to minimize.
[2024-06-01 05:51:29] [INFO ] Deduced a trap composed of 16 places in 78 ms of which 2 ms to minimize.
[2024-06-01 05:51:29] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-06-01 05:51:29] [INFO ] Deduced a trap composed of 13 places in 40 ms of which 1 ms to minimize.
[2024-06-01 05:51:29] [INFO ] Deduced a trap composed of 28 places in 64 ms of which 2 ms to minimize.
[2024-06-01 05:51:29] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 05:51:30] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (OVERLAPS) 98/172 variables, 74/101 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 44/145 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 05:51:33] [INFO ] Deduced a trap composed of 24 places in 65 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 05:51:33] [INFO ] Deduced a trap composed of 26 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 10 (OVERLAPS) 0/172 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/172 variables, and 147 constraints, problems are : Problem set: 0 solved, 158 unsolved in 10676 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 158 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 19/29 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 05:51:38] [INFO ] Deduced a trap composed of 22 places in 65 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (OVERLAPS) 98/172 variables, 74/104 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 44/148 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 158/306 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 05:51:42] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 10 (OVERLAPS) 0/172 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Int declared 172/172 variables, and 307 constraints, problems are : Problem set: 0 solved, 158 unsolved in 9313 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 21/21 constraints]
After SMT, in 20045ms problems are : Problem set: 0 solved, 158 unsolved
Search for dead transitions found 0 dead transitions in 20049ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 20076 ms. Remains : 74/74 places, 161/161 transitions.
Support contains 2 out of 74 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 74/74 places, 161/161 transitions.
Applied a total of 0 rules in 1 ms. Remains 74 /74 variables (removed 0) and now considering 161/161 (removed 0) transitions.
[2024-06-01 05:51:47] [INFO ] Flow matrix only has 98 transitions (discarded 63 similar events)
[2024-06-01 05:51:47] [INFO ] Invariant cache hit.
[2024-06-01 05:51:47] [INFO ] Implicit Places using invariants in 163 ms returned []
[2024-06-01 05:51:47] [INFO ] Flow matrix only has 98 transitions (discarded 63 similar events)
[2024-06-01 05:51:47] [INFO ] Invariant cache hit.
[2024-06-01 05:51:47] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-06-01 05:51:47] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
Running 158 sub problems to find dead transitions.
[2024-06-01 05:51:47] [INFO ] Flow matrix only has 98 transitions (discarded 63 similar events)
[2024-06-01 05:51:47] [INFO ] Invariant cache hit.
[2024-06-01 05:51:47] [INFO ] State equation strengthened by 44 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 05:51:48] [INFO ] Deduced a trap composed of 3 places in 62 ms of which 2 ms to minimize.
[2024-06-01 05:51:48] [INFO ] Deduced a trap composed of 22 places in 56 ms of which 1 ms to minimize.
[2024-06-01 05:51:48] [INFO ] Deduced a trap composed of 20 places in 67 ms of which 1 ms to minimize.
[2024-06-01 05:51:48] [INFO ] Deduced a trap composed of 29 places in 63 ms of which 2 ms to minimize.
[2024-06-01 05:51:49] [INFO ] Deduced a trap composed of 11 places in 61 ms of which 1 ms to minimize.
[2024-06-01 05:51:49] [INFO ] Deduced a trap composed of 3 places in 35 ms of which 1 ms to minimize.
[2024-06-01 05:51:49] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 2 ms to minimize.
[2024-06-01 05:51:49] [INFO ] Deduced a trap composed of 14 places in 78 ms of which 2 ms to minimize.
[2024-06-01 05:51:49] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 2 ms to minimize.
[2024-06-01 05:51:49] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 1 ms to minimize.
[2024-06-01 05:51:49] [INFO ] Deduced a trap composed of 24 places in 67 ms of which 2 ms to minimize.
[2024-06-01 05:51:49] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 1 ms to minimize.
[2024-06-01 05:51:49] [INFO ] Deduced a trap composed of 23 places in 61 ms of which 2 ms to minimize.
[2024-06-01 05:51:49] [INFO ] Deduced a trap composed of 13 places in 29 ms of which 1 ms to minimize.
[2024-06-01 05:51:49] [INFO ] Deduced a trap composed of 28 places in 49 ms of which 1 ms to minimize.
[2024-06-01 05:51:50] [INFO ] Deduced a trap composed of 17 places in 55 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 16/26 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 05:51:50] [INFO ] Deduced a trap composed of 21 places in 70 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (OVERLAPS) 98/172 variables, 74/101 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 44/145 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 05:51:53] [INFO ] Deduced a trap composed of 24 places in 61 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 1/146 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 05:51:54] [INFO ] Deduced a trap composed of 26 places in 45 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 1/147 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 10 (OVERLAPS) 0/172 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/172 variables, and 147 constraints, problems are : Problem set: 0 solved, 158 unsolved in 11093 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 19/19 constraints]
Escalating to Integer solving :Problem set: 0 solved, 158 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/74 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/74 variables, 3/10 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 19/29 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 05:51:59] [INFO ] Deduced a trap composed of 22 places in 60 ms of which 2 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/74 variables, 0/30 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 5 (OVERLAPS) 98/172 variables, 74/104 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/172 variables, 44/148 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/172 variables, 158/306 constraints. Problems are: Problem set: 0 solved, 158 unsolved
[2024-06-01 05:52:03] [INFO ] Deduced a trap composed of 17 places in 60 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/172 variables, 1/307 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/172 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 158 unsolved
At refinement iteration 10 (OVERLAPS) 0/172 variables, 0/307 constraints. Problems are: Problem set: 0 solved, 158 unsolved
No progress, stopping.
After SMT solving in domain Int declared 172/172 variables, and 307 constraints, problems are : Problem set: 0 solved, 158 unsolved in 9005 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 74/74 constraints, ReadFeed: 44/44 constraints, PredecessorRefiner: 158/158 constraints, Known Traps: 21/21 constraints]
After SMT, in 20161ms problems are : Problem set: 0 solved, 158 unsolved
Search for dead transitions found 0 dead transitions in 20165ms
Finished structural reductions in LTL mode , in 1 iterations and 20562 ms. Remains : 74/74 places, 161/161 transitions.
Treatment of property EisenbergMcGuire-PT-03-LTLCardinality-08 finished in 83598 ms.
[2024-06-01 05:52:08] [INFO ] Flatten gal took : 21 ms
[2024-06-01 05:52:08] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-06-01 05:52:08] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 112 places, 201 transitions and 840 arcs took 10 ms.
Total runtime 491677 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA EisenbergMcGuire-PT-03-LTLCardinality-08 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717221128448

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name EisenbergMcGuire-PT-03-LTLCardinality-08
ltl formula formula --ltl=/tmp/2673/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 112 places, 201 transitions and 840 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.010 user 0.020 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/2673/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/2673/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/2673/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/2673/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 114 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 113, there are 208 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 20
pnml2lts-mc( 0/ 4): unique states count: 20
pnml2lts-mc( 0/ 4): unique transitions count: 30
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 18
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 41
pnml2lts-mc( 0/ 4): - cum. max stack depth: 16
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 41 states 82 transitions, fanout: 2.000
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 4100, Transitions per second: 8200
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 65.6 B/state, compr.: 14.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 201 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="EisenbergMcGuire-PT-03"
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 EisenbergMcGuire-PT-03, 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 r492-smll-171636266300147"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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