MCC'2024- Execution of r480-tall-171624189900755

About the Execution of LTSMin+red for DES-PT-60b

Execution Summary
Max Memory Used (MB)	Time wait (ms)	CPU Usage (ms)	I/O Wait (ms)	Computed Result	Execution Status
1030.600	1798019.00	4422557.00	2354.90	FTFTT?TTFTFTF?FT	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.r480-tall-171624189900755.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 DES-PT-60b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r480-tall-171624189900755
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 5.3K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 55K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 65K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:27 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 12 08:27 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.0K Apr 12 08:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Apr 12 08:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 139K 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 DES-PT-60b-LTLCardinality-00
FORMULA_NAME DES-PT-60b-LTLCardinality-01
FORMULA_NAME DES-PT-60b-LTLCardinality-02
FORMULA_NAME DES-PT-60b-LTLCardinality-03
FORMULA_NAME DES-PT-60b-LTLCardinality-04
FORMULA_NAME DES-PT-60b-LTLCardinality-05
FORMULA_NAME DES-PT-60b-LTLCardinality-06
FORMULA_NAME DES-PT-60b-LTLCardinality-07
FORMULA_NAME DES-PT-60b-LTLCardinality-08
FORMULA_NAME DES-PT-60b-LTLCardinality-09
FORMULA_NAME DES-PT-60b-LTLCardinality-10
FORMULA_NAME DES-PT-60b-LTLCardinality-11
FORMULA_NAME DES-PT-60b-LTLCardinality-12
FORMULA_NAME DES-PT-60b-LTLCardinality-13
FORMULA_NAME DES-PT-60b-LTLCardinality-14
FORMULA_NAME DES-PT-60b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717200099885

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-60b
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 00:01:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 00:01:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 00:01:41] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2024-06-01 00:01:41] [INFO ] Transformed 519 places.
[2024-06-01 00:01:41] [INFO ] Transformed 470 transitions.
[2024-06-01 00:01:41] [INFO ] Found NUPN structural information;
[2024-06-01 00:01:41] [INFO ] Parsed PT model containing 519 places and 470 transitions and 1623 arcs in 213 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA DES-PT-60b-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-60b-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 16 out of 519 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 519/519 places, 470/470 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 516 transition count 470
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 27 place count 492 transition count 446
Iterating global reduction 1 with 24 rules applied. Total rules applied 51 place count 492 transition count 446
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 66 place count 477 transition count 431
Iterating global reduction 1 with 15 rules applied. Total rules applied 81 place count 477 transition count 431
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 93 place count 477 transition count 419
Applied a total of 93 rules in 131 ms. Remains 477 /519 variables (removed 42) and now considering 419/470 (removed 51) transitions.
// Phase 1: matrix 419 rows 477 cols
[2024-06-01 00:01:41] [INFO ] Computed 62 invariants in 47 ms
[2024-06-01 00:01:42] [INFO ] Implicit Places using invariants in 453 ms returned []
[2024-06-01 00:01:42] [INFO ] Invariant cache hit.
[2024-06-01 00:01:43] [INFO ] Implicit Places using invariants and state equation in 777 ms returned []
Implicit Place search using SMT with State Equation took 1264 ms to find 0 implicit places.
Running 418 sub problems to find dead transitions.
[2024-06-01 00:01:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/476 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/476 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 2 (OVERLAPS) 1/477 variables, 33/51 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/477 variables, 11/62 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/477 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 5 (OVERLAPS) 419/896 variables, 477/539 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-06-01 00:01:56] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 18 ms to minimize.
[2024-06-01 00:01:56] [INFO ] Deduced a trap composed of 18 places in 132 ms of which 3 ms to minimize.
[2024-06-01 00:01:57] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 2 ms to minimize.
[2024-06-01 00:02:00] [INFO ] Deduced a trap composed of 55 places in 109 ms of which 2 ms to minimize.
[2024-06-01 00:02:00] [INFO ] Deduced a trap composed of 40 places in 81 ms of which 1 ms to minimize.
[2024-06-01 00:02:01] [INFO ] Deduced a trap composed of 46 places in 86 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/896 variables, 6/545 constraints. Problems are: Problem set: 0 solved, 418 unsolved
[2024-06-01 00:02:10] [INFO ] Deduced a trap composed of 22 places in 157 ms of which 13 ms to minimize.
[2024-06-01 00:02:10] [INFO ] Deduced a trap composed of 9 places in 142 ms of which 2 ms to minimize.
[2024-06-01 00:02:13] [INFO ] Deduced a trap composed of 13 places in 3591 ms of which 32 ms to minimize.
SMT process timed out in 30871ms, After SMT, problems are : Problem set: 0 solved, 418 unsolved
Search for dead transitions found 0 dead transitions in 30902ms
Starting structural reductions in LTL mode, iteration 1 : 477/519 places, 419/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32323 ms. Remains : 477/519 places, 419/470 transitions.
Support contains 16 out of 477 places after structural reductions.
[2024-06-01 00:02:14] [INFO ] Flatten gal took : 65 ms
[2024-06-01 00:02:14] [INFO ] Flatten gal took : 32 ms
[2024-06-01 00:02:14] [INFO ] Input system was already deterministic with 419 transitions.
Support contains 14 out of 477 places (down from 16) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (352 resets) in 1146 ms. (34 steps per ms) remains 1/9 properties
BEST_FIRST walk for 40004 steps (53 resets) in 177 ms. (224 steps per ms) remains 1/1 properties
[2024-06-01 00:02:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 122/123 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 208/331 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 105/436 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 26/462 variables, 18/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/462 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 406/868 variables, 462/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/868 variables, 0/524 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/886 variables, 10/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/886 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 6/892 variables, 3/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/892 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 2/894 variables, 1/538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/894 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/896 variables, 1/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/896 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/896 variables, 0/539 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 896/896 variables, and 539 constraints, problems are : Problem set: 0 solved, 1 unsolved in 564 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 477/477 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 122/123 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/123 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 208/331 variables, 10/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/331 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 105/436 variables, 33/44 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 00:02:15] [INFO ] Deduced a trap composed of 9 places in 137 ms of which 3 ms to minimize.
[2024-06-01 00:02:15] [INFO ] Deduced a trap composed of 7 places in 128 ms of which 6 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/436 variables, 2/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/436 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/462 variables, 18/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/462 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 868/896 variables, and 526 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1143 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 462/477 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 2/2 constraints]
After SMT, in 1742ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 141 ms.
Support contains 1 out of 477 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 477/477 places, 419/419 transitions.
Graph (complete) has 1133 edges and 477 vertex of which 471 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.17 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 471 transition count 397
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 37 place count 454 transition count 397
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 37 place count 454 transition count 384
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 63 place count 441 transition count 384
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 64 place count 440 transition count 383
Iterating global reduction 2 with 1 rules applied. Total rules applied 65 place count 440 transition count 383
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 67 place count 440 transition count 381
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 69 place count 439 transition count 380
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 221 place count 363 transition count 304
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 227 place count 360 transition count 312
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 228 place count 360 transition count 311
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 229 place count 359 transition count 311
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 230 place count 359 transition count 311
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 231 place count 358 transition count 310
Applied a total of 231 rules in 386 ms. Remains 358 /477 variables (removed 119) and now considering 310/419 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 387 ms. Remains : 358/477 places, 310/419 transitions.
RANDOM walk for 40000 steps (1921 resets) in 884 ms. (45 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (350 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1239253 steps, run timeout after 3001 ms. (steps per millisecond=412 ) properties seen :0 out of 1
Probabilistic random walk after 1239253 steps, saw 171804 distinct states, run finished after 3004 ms. (steps per millisecond=412 ) properties seen :0
// Phase 1: matrix 310 rows 358 cols
[2024-06-01 00:02:20] [INFO ] Computed 61 invariants in 15 ms
[2024-06-01 00:02:20] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 62/65 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 63/128 variables, 59/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 2/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 18/148 variables, 8/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/148 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/148 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 2/150 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/150 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/154 variables, 2/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/154 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 195/349 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/349 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 40/389 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/389 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 21 (OVERLAPS) 32/421 variables, 22/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/421 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 9/430 variables, 9/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/430 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 238/668 variables, 286/417 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/668 variables, 2/419 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (INCLUDED_ONLY) 0/668 variables, 8/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/668 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 0/668 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 668/668 variables, and 427 constraints, problems are : Problem set: 0 solved, 1 unsolved in 347 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 358/358 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 62/65 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 63/128 variables, 59/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 2/130 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/130 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/148 variables, 8/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/148 variables, 2/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/148 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 2/150 variables, 1/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/150 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/154 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/154 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 195/349 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/349 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 40/389 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/389 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 32/421 variables, 22/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-01 00:02:21] [INFO ] Deduced a trap composed of 14 places in 61 ms of which 2 ms to minimize.
[2024-06-01 00:02:21] [INFO ] Deduced a trap composed of 12 places in 65 ms of which 1 ms to minimize.
[2024-06-01 00:02:21] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
At refinement iteration 23 (INCLUDED_ONLY) 0/421 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/421 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 9/430 variables, 9/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/430 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 238/668 variables, 286/421 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/668 variables, 2/423 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 29 (INCLUDED_ONLY) 0/668 variables, 8/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/668 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 31 (OVERLAPS) 0/668 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 668/668 variables, and 431 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1018 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 358/358 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 1391ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 662 ms.
Support contains 1 out of 358 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 310/310 transitions.
Applied a total of 0 rules in 14 ms. Remains 358 /358 variables (removed 0) and now considering 310/310 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 358/358 places, 310/310 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 358/358 places, 310/310 transitions.
Applied a total of 0 rules in 17 ms. Remains 358 /358 variables (removed 0) and now considering 310/310 (removed 0) transitions.
[2024-06-01 00:02:22] [INFO ] Invariant cache hit.
[2024-06-01 00:02:22] [INFO ] Implicit Places using invariants in 384 ms returned []
[2024-06-01 00:02:22] [INFO ] Invariant cache hit.
[2024-06-01 00:02:23] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 00:02:24] [INFO ] Implicit Places using invariants and state equation in 1741 ms returned []
Implicit Place search using SMT with State Equation took 2129 ms to find 0 implicit places.
[2024-06-01 00:02:24] [INFO ] Redundant transitions in 17 ms returned []
Running 307 sub problems to find dead transitions.
[2024-06-01 00:02:24] [INFO ] Invariant cache hit.
[2024-06-01 00:02:24] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 17/54 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 307 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (OVERLAPS) 2/357 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/357 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (OVERLAPS) 310/667 variables, 357/418 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/667 variables, 8/426 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-01 00:02:33] [INFO ] Deduced a trap composed of 6 places in 41 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/667 variables, 1/427 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/667 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 9 (OVERLAPS) 1/668 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-01 00:02:45] [INFO ] Deduced a trap composed of 14 places in 103 ms of which 2 ms to minimize.
[2024-06-01 00:02:45] [INFO ] Deduced a trap composed of 13 places in 89 ms of which 2 ms to minimize.
[2024-06-01 00:02:47] [INFO ] Deduced a trap composed of 27 places in 153 ms of which 2 ms to minimize.
[2024-06-01 00:02:47] [INFO ] Deduced a trap composed of 16 places in 91 ms of which 1 ms to minimize.
[2024-06-01 00:02:49] [INFO ] Deduced a trap composed of 19 places in 112 ms of which 2 ms to minimize.
[2024-06-01 00:02:49] [INFO ] Deduced a trap composed of 20 places in 101 ms of which 2 ms to minimize.
[2024-06-01 00:02:50] [INFO ] Deduced a trap composed of 13 places in 94 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/668 variables, 7/435 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/668 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 668/668 variables, and 435 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 358/358 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/355 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/355 variables, 17/54 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/355 variables, 4/58 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/355 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 2/357 variables, 7/65 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/357 variables, 4/69 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/357 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (OVERLAPS) 310/667 variables, 357/426 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/667 variables, 8/434 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/667 variables, 307/741 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 667/668 variables, and 741 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 37/37 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 357/358 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 8/8 constraints]
After SMT, in 60365ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 60370ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62547 ms. Remains : 358/358 places, 310/310 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 1256 edges and 358 vertex of which 357 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 357 transition count 310
Applied a total of 2 rules in 28 ms. Remains 357 /358 variables (removed 1) and now considering 310/310 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 310 rows 357 cols
[2024-06-01 00:03:25] [INFO ] Computed 60 invariants in 13 ms
[2024-06-01 00:03:25] [INFO ] [Real]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-06-01 00:03:25] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2024-06-01 00:03:25] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-01 00:03:25] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-06-01 00:03:25] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 14 ms returned sat
[2024-06-01 00:03:25] [INFO ] After 141ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2024-06-01 00:03:25] [INFO ] Deduced a trap composed of 5 places in 43 ms of which 1 ms to minimize.
[2024-06-01 00:03:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
TRAPS : Iteration 1
[2024-06-01 00:03:25] [INFO ] After 244ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2024-06-01 00:03:25] [INFO ] After 425ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 559 ms.
FORMULA DES-PT-60b-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 297 stabilizing places and 289 stable transitions
Graph (complete) has 1133 edges and 477 vertex of which 471 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.29 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 477 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 477/477 places, 419/419 transitions.
Graph (complete) has 1133 edges and 477 vertex of which 471 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 470 transition count 400
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 455 transition count 400
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 31 place count 455 transition count 387
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 57 place count 442 transition count 387
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 441 transition count 386
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 441 transition count 386
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 61 place count 441 transition count 384
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 63 place count 440 transition count 383
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 4 with 146 rules applied. Total rules applied 209 place count 367 transition count 310
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 215 place count 364 transition count 318
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 217 place count 362 transition count 316
Applied a total of 217 rules in 72 ms. Remains 362 /477 variables (removed 115) and now considering 316/419 (removed 103) transitions.
// Phase 1: matrix 316 rows 362 cols
[2024-06-01 00:03:26] [INFO ] Computed 59 invariants in 5 ms
[2024-06-01 00:03:26] [INFO ] Implicit Places using invariants in 413 ms returned []
[2024-06-01 00:03:26] [INFO ] Invariant cache hit.
[2024-06-01 00:03:26] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 00:03:26] [INFO ] Implicit Places using invariants and state equation in 517 ms returned []
Implicit Place search using SMT with State Equation took 934 ms to find 0 implicit places.
[2024-06-01 00:03:26] [INFO ] Redundant transitions in 12 ms returned []
Running 311 sub problems to find dead transitions.
[2024-06-01 00:03:26] [INFO ] Invariant cache hit.
[2024-06-01 00:03:26] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/357 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (OVERLAPS) 2/359 variables, 4/52 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (OVERLAPS) 2/361 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (OVERLAPS) 316/677 variables, 361/420 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/677 variables, 8/428 constraints. Problems are: Problem set: 0 solved, 311 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/677 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 10 (OVERLAPS) 1/678 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-01 00:03:53] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/678 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 678/678 variables, and 430 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 362/362 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 30/30 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/357 variables, 18/48 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 1/49 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (OVERLAPS) 2/359 variables, 4/53 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (OVERLAPS) 2/361 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 8 (OVERLAPS) 316/677 variables, 361/421 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/677 variables, 8/429 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/677 variables, 311/740 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 677/678 variables, and 740 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 361/362 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 1/1 constraints]
After SMT, in 60295ms problems are : Problem set: 0 solved, 311 unsolved
Search for dead transitions found 0 dead transitions in 60299ms
Starting structural reductions in SI_LTL mode, iteration 1 : 362/477 places, 316/419 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61326 ms. Remains : 362/477 places, 316/419 transitions.
Stuttering acceptance computed with spot in 183 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-60b-LTLCardinality-00
Stuttering criterion allowed to conclude after 24 steps with 1 reset in 2 ms.
FORMULA DES-PT-60b-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-LTLCardinality-00 finished in 61566 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 477 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 477/477 places, 419/419 transitions.
Graph (complete) has 1133 edges and 477 vertex of which 471 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 470 transition count 401
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 456 transition count 400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 455 transition count 400
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 13 Pre rules applied. Total rules applied 31 place count 455 transition count 387
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 26 rules applied. Total rules applied 57 place count 442 transition count 387
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 58 place count 441 transition count 386
Iterating global reduction 3 with 1 rules applied. Total rules applied 59 place count 441 transition count 386
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 61 place count 441 transition count 384
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 63 place count 440 transition count 383
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 5 with 152 rules applied. Total rules applied 215 place count 364 transition count 307
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 221 place count 361 transition count 315
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 223 place count 359 transition count 313
Applied a total of 223 rules in 58 ms. Remains 359 /477 variables (removed 118) and now considering 313/419 (removed 106) transitions.
// Phase 1: matrix 313 rows 359 cols
[2024-06-01 00:04:27] [INFO ] Computed 59 invariants in 4 ms
[2024-06-01 00:04:27] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-06-01 00:04:27] [INFO ] Invariant cache hit.
[2024-06-01 00:04:27] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 00:04:28] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 736 ms to find 0 implicit places.
[2024-06-01 00:04:28] [INFO ] Redundant transitions in 4 ms returned []
Running 310 sub problems to find dead transitions.
[2024-06-01 00:04:28] [INFO ] Invariant cache hit.
[2024-06-01 00:04:28] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 18/52 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (OVERLAPS) 2/358 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (OVERLAPS) 313/671 variables, 358/417 constraints. Problems are: Problem set: 0 solved, 310 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/671 variables, 8/425 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/671 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 8 (OVERLAPS) 1/672 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/672 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 10 (OVERLAPS) 0/672 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 310 unsolved
No progress, stopping.
After SMT solving in domain Real declared 672/672 variables, and 426 constraints, problems are : Problem set: 0 solved, 310 unsolved in 21312 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 359/359 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 310 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 18/52 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (OVERLAPS) 2/358 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (OVERLAPS) 313/671 variables, 358/417 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/671 variables, 8/425 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/671 variables, 310/735 constraints. Problems are: Problem set: 0 solved, 310 unsolved
[2024-06-01 00:05:14] [INFO ] Deduced a trap composed of 14 places in 57 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 671/672 variables, and 736 constraints, problems are : Problem set: 0 solved, 310 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 358/359 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 1/1 constraints]
After SMT, in 51584ms problems are : Problem set: 0 solved, 310 unsolved
Search for dead transitions found 0 dead transitions in 51587ms
Starting structural reductions in SI_LTL mode, iteration 1 : 359/477 places, 313/419 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 52393 ms. Remains : 359/477 places, 313/419 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60b-LTLCardinality-03
Product exploration explored 100000 steps with 5541 reset in 368 ms.
Product exploration explored 100000 steps with 5540 reset in 312 ms.
Computed a total of 256 stabilizing places and 257 stable transitions
Computed a total of 256 stabilizing places and 257 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 2787 steps (154 resets) in 22 ms. (121 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 359 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 359/359 places, 313/313 transitions.
Applied a total of 0 rules in 9 ms. Remains 359 /359 variables (removed 0) and now considering 313/313 (removed 0) transitions.
[2024-06-01 00:05:21] [INFO ] Invariant cache hit.
[2024-06-01 00:05:21] [INFO ] Implicit Places using invariants in 212 ms returned []
[2024-06-01 00:05:21] [INFO ] Invariant cache hit.
[2024-06-01 00:05:21] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 00:05:21] [INFO ] Implicit Places using invariants and state equation in 505 ms returned []
Implicit Place search using SMT with State Equation took 718 ms to find 0 implicit places.
[2024-06-01 00:05:21] [INFO ] Redundant transitions in 1 ms returned []
Running 310 sub problems to find dead transitions.
[2024-06-01 00:05:21] [INFO ] Invariant cache hit.
[2024-06-01 00:05:21] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 18/52 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (OVERLAPS) 2/358 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (OVERLAPS) 313/671 variables, 358/417 constraints. Problems are: Problem set: 0 solved, 310 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/671 variables, 8/425 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/671 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 8 (OVERLAPS) 1/672 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/672 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 10 (OVERLAPS) 0/672 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 310 unsolved
No progress, stopping.
After SMT solving in domain Real declared 672/672 variables, and 426 constraints, problems are : Problem set: 0 solved, 310 unsolved in 21602 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 359/359 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 310 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 18/52 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (OVERLAPS) 2/358 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (OVERLAPS) 313/671 variables, 358/417 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/671 variables, 8/425 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/671 variables, 310/735 constraints. Problems are: Problem set: 0 solved, 310 unsolved
[2024-06-01 00:06:08] [INFO ] Deduced a trap composed of 14 places in 54 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 671/672 variables, and 736 constraints, problems are : Problem set: 0 solved, 310 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 358/359 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 1/1 constraints]
After SMT, in 51885ms problems are : Problem set: 0 solved, 310 unsolved
Search for dead transitions found 0 dead transitions in 51888ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 52626 ms. Remains : 359/359 places, 313/313 transitions.
Computed a total of 256 stabilizing places and 257 stable transitions
Computed a total of 256 stabilizing places and 257 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1332 steps (73 resets) in 14 ms. (88 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 163 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5561 reset in 240 ms.
Product exploration explored 100000 steps with 5555 reset in 270 ms.
Support contains 2 out of 359 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 359/359 places, 313/313 transitions.
Applied a total of 0 rules in 9 ms. Remains 359 /359 variables (removed 0) and now considering 313/313 (removed 0) transitions.
[2024-06-01 00:06:14] [INFO ] Invariant cache hit.
[2024-06-01 00:06:15] [INFO ] Implicit Places using invariants in 187 ms returned []
[2024-06-01 00:06:15] [INFO ] Invariant cache hit.
[2024-06-01 00:06:15] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 00:06:15] [INFO ] Implicit Places using invariants and state equation in 499 ms returned []
Implicit Place search using SMT with State Equation took 688 ms to find 0 implicit places.
[2024-06-01 00:06:15] [INFO ] Redundant transitions in 4 ms returned []
Running 310 sub problems to find dead transitions.
[2024-06-01 00:06:15] [INFO ] Invariant cache hit.
[2024-06-01 00:06:15] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 18/52 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (OVERLAPS) 2/358 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (OVERLAPS) 313/671 variables, 358/417 constraints. Problems are: Problem set: 0 solved, 310 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/671 variables, 8/425 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/671 variables, 0/425 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 8 (OVERLAPS) 1/672 variables, 1/426 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/672 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 10 (OVERLAPS) 0/672 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 310 unsolved
No progress, stopping.
After SMT solving in domain Real declared 672/672 variables, and 426 constraints, problems are : Problem set: 0 solved, 310 unsolved in 22113 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 359/359 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 310 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/356 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/356 variables, 18/52 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/356 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (OVERLAPS) 2/358 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/358 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (OVERLAPS) 313/671 variables, 358/417 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/671 variables, 8/425 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/671 variables, 310/735 constraints. Problems are: Problem set: 0 solved, 310 unsolved
[2024-06-01 00:07:02] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 671/672 variables, and 736 constraints, problems are : Problem set: 0 solved, 310 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 358/359 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 1/1 constraints]
After SMT, in 52380ms problems are : Problem set: 0 solved, 310 unsolved
Search for dead transitions found 0 dead transitions in 52383ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 53088 ms. Remains : 359/359 places, 313/313 transitions.
Treatment of property DES-PT-60b-LTLCardinality-03 finished in 160558 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 477 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 477/477 places, 419/419 transitions.
Graph (complete) has 1133 edges and 477 vertex of which 471 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 470 transition count 400
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 455 transition count 400
Performed 13 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 13 Pre rules applied. Total rules applied 31 place count 455 transition count 387
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 57 place count 442 transition count 387
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 58 place count 441 transition count 386
Iterating global reduction 2 with 1 rules applied. Total rules applied 59 place count 441 transition count 386
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 61 place count 441 transition count 384
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 63 place count 440 transition count 383
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 213 place count 365 transition count 308
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 219 place count 362 transition count 316
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 221 place count 360 transition count 314
Applied a total of 221 rules in 75 ms. Remains 360 /477 variables (removed 117) and now considering 314/419 (removed 105) transitions.
// Phase 1: matrix 314 rows 360 cols
[2024-06-01 00:07:08] [INFO ] Computed 59 invariants in 3 ms
[2024-06-01 00:07:08] [INFO ] Implicit Places using invariants in 315 ms returned []
[2024-06-01 00:07:08] [INFO ] Invariant cache hit.
[2024-06-01 00:07:08] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 00:07:08] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 852 ms to find 0 implicit places.
[2024-06-01 00:07:08] [INFO ] Redundant transitions in 2 ms returned []
Running 311 sub problems to find dead transitions.
[2024-06-01 00:07:08] [INFO ] Invariant cache hit.
[2024-06-01 00:07:08] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/357 variables, 18/52 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (OVERLAPS) 2/359 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (OVERLAPS) 314/673 variables, 359/418 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/673 variables, 8/426 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/673 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 8 (OVERLAPS) 1/674 variables, 1/427 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-01 00:07:25] [INFO ] Deduced a trap composed of 16 places in 90 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/674 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/674 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-01 00:07:34] [INFO ] Deduced a trap composed of 14 places in 100 ms of which 1 ms to minimize.
[2024-06-01 00:07:35] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 2 ms to minimize.
[2024-06-01 00:07:35] [INFO ] Deduced a trap composed of 13 places in 73 ms of which 1 ms to minimize.
[2024-06-01 00:07:36] [INFO ] Deduced a trap composed of 10 places in 74 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/674 variables, 4/432 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-01 00:07:38] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 2 ms to minimize.
[2024-06-01 00:07:38] [INFO ] Deduced a trap composed of 19 places in 85 ms of which 2 ms to minimize.
[2024-06-01 00:07:38] [INFO ] Deduced a trap composed of 18 places in 82 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 674/674 variables, and 435 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 360/360 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/357 variables, 18/52 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (OVERLAPS) 2/359 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (OVERLAPS) 314/673 variables, 359/426 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/673 variables, 8/434 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/673 variables, 311/745 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 673/674 variables, and 745 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 359/360 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 8/8 constraints]
After SMT, in 60288ms problems are : Problem set: 0 solved, 311 unsolved
Search for dead transitions found 0 dead transitions in 60291ms
Starting structural reductions in SI_LTL mode, iteration 1 : 360/477 places, 314/419 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61226 ms. Remains : 360/477 places, 314/419 transitions.
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60b-LTLCardinality-05
Product exploration explored 100000 steps with 5570 reset in 241 ms.
Product exploration explored 100000 steps with 5603 reset in 249 ms.
Computed a total of 256 stabilizing places and 257 stable transitions
Computed a total of 256 stabilizing places and 257 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 3120 steps (181 resets) in 21 ms. (141 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 77 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 360 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 360/360 places, 314/314 transitions.
Applied a total of 0 rules in 15 ms. Remains 360 /360 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2024-06-01 00:08:10] [INFO ] Invariant cache hit.
[2024-06-01 00:08:10] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-06-01 00:08:10] [INFO ] Invariant cache hit.
[2024-06-01 00:08:10] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 00:08:10] [INFO ] Implicit Places using invariants and state equation in 535 ms returned []
Implicit Place search using SMT with State Equation took 763 ms to find 0 implicit places.
[2024-06-01 00:08:10] [INFO ] Redundant transitions in 3 ms returned []
Running 311 sub problems to find dead transitions.
[2024-06-01 00:08:10] [INFO ] Invariant cache hit.
[2024-06-01 00:08:10] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/357 variables, 18/52 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (OVERLAPS) 2/359 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (OVERLAPS) 314/673 variables, 359/418 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/673 variables, 8/426 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/673 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 8 (OVERLAPS) 1/674 variables, 1/427 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-01 00:08:27] [INFO ] Deduced a trap composed of 16 places in 88 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/674 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/674 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-01 00:08:36] [INFO ] Deduced a trap composed of 14 places in 86 ms of which 2 ms to minimize.
[2024-06-01 00:08:36] [INFO ] Deduced a trap composed of 12 places in 85 ms of which 2 ms to minimize.
[2024-06-01 00:08:37] [INFO ] Deduced a trap composed of 13 places in 72 ms of which 1 ms to minimize.
[2024-06-01 00:08:38] [INFO ] Deduced a trap composed of 10 places in 83 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/674 variables, 4/432 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-01 00:08:39] [INFO ] Deduced a trap composed of 22 places in 85 ms of which 2 ms to minimize.
[2024-06-01 00:08:39] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
[2024-06-01 00:08:39] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 674/674 variables, and 435 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 360/360 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/357 variables, 18/52 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (OVERLAPS) 2/359 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (OVERLAPS) 314/673 variables, 359/426 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/673 variables, 8/434 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/673 variables, 311/745 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 673/674 variables, and 745 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 359/360 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 8/8 constraints]
After SMT, in 60286ms problems are : Problem set: 0 solved, 311 unsolved
Search for dead transitions found 0 dead transitions in 60291ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61081 ms. Remains : 360/360 places, 314/314 transitions.
Computed a total of 256 stabilizing places and 257 stable transitions
Computed a total of 256 stabilizing places and 257 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 893 steps (46 resets) in 15 ms. (55 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5527 reset in 230 ms.
Product exploration explored 100000 steps with 5615 reset in 261 ms.
Support contains 2 out of 360 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 360/360 places, 314/314 transitions.
Applied a total of 0 rules in 7 ms. Remains 360 /360 variables (removed 0) and now considering 314/314 (removed 0) transitions.
[2024-06-01 00:09:12] [INFO ] Invariant cache hit.
[2024-06-01 00:09:12] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-06-01 00:09:12] [INFO ] Invariant cache hit.
[2024-06-01 00:09:12] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 00:09:13] [INFO ] Implicit Places using invariants and state equation in 543 ms returned []
Implicit Place search using SMT with State Equation took 804 ms to find 0 implicit places.
[2024-06-01 00:09:13] [INFO ] Redundant transitions in 3 ms returned []
Running 311 sub problems to find dead transitions.
[2024-06-01 00:09:13] [INFO ] Invariant cache hit.
[2024-06-01 00:09:13] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/357 variables, 18/52 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (OVERLAPS) 2/359 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (OVERLAPS) 314/673 variables, 359/418 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/673 variables, 8/426 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/673 variables, 0/426 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 8 (OVERLAPS) 1/674 variables, 1/427 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-01 00:09:29] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/674 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/674 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-01 00:09:39] [INFO ] Deduced a trap composed of 14 places in 98 ms of which 2 ms to minimize.
[2024-06-01 00:09:39] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 1 ms to minimize.
[2024-06-01 00:09:39] [INFO ] Deduced a trap composed of 13 places in 74 ms of which 1 ms to minimize.
[2024-06-01 00:09:40] [INFO ] Deduced a trap composed of 10 places in 76 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/674 variables, 4/432 constraints. Problems are: Problem set: 0 solved, 311 unsolved
[2024-06-01 00:09:42] [INFO ] Deduced a trap composed of 22 places in 87 ms of which 2 ms to minimize.
[2024-06-01 00:09:42] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 1 ms to minimize.
[2024-06-01 00:09:42] [INFO ] Deduced a trap composed of 18 places in 80 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 674/674 variables, and 435 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 360/360 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 311 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/357 variables, 18/52 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 8/60 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 4 (OVERLAPS) 2/359 variables, 7/67 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 6 (OVERLAPS) 314/673 variables, 359/426 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/673 variables, 8/434 constraints. Problems are: Problem set: 0 solved, 311 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/673 variables, 311/745 constraints. Problems are: Problem set: 0 solved, 311 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 673/674 variables, and 745 constraints, problems are : Problem set: 0 solved, 311 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 359/360 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 311/311 constraints, Known Traps: 8/8 constraints]
After SMT, in 60295ms problems are : Problem set: 0 solved, 311 unsolved
Search for dead transitions found 0 dead transitions in 60298ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61120 ms. Remains : 360/360 places, 314/314 transitions.
Treatment of property DES-PT-60b-LTLCardinality-05 finished in 185426 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G((F(p1)&&F(G(p0))))))'
Support contains 2 out of 477 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 477/477 places, 419/419 transitions.
Graph (complete) has 1133 edges and 477 vertex of which 471 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 470 transition count 400
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 455 transition count 400
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 31 place count 455 transition count 388
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 55 place count 443 transition count 388
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 154 rules applied. Total rules applied 209 place count 366 transition count 311
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 213 place count 364 transition count 316
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 217 place count 364 transition count 312
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 219 place count 362 transition count 310
Applied a total of 219 rules in 43 ms. Remains 362 /477 variables (removed 115) and now considering 310/419 (removed 109) transitions.
// Phase 1: matrix 310 rows 362 cols
[2024-06-01 00:10:13] [INFO ] Computed 59 invariants in 4 ms
[2024-06-01 00:10:13] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-06-01 00:10:13] [INFO ] Invariant cache hit.
[2024-06-01 00:10:13] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 00:10:14] [INFO ] Implicit Places using invariants and state equation in 627 ms returned []
Implicit Place search using SMT with State Equation took 901 ms to find 0 implicit places.
[2024-06-01 00:10:14] [INFO ] Redundant transitions in 3 ms returned []
Running 307 sub problems to find dead transitions.
[2024-06-01 00:10:14] [INFO ] Invariant cache hit.
[2024-06-01 00:10:14] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/359 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/359 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (OVERLAPS) 1/360 variables, 5/52 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (OVERLAPS) 1/361 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 307 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/361 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (OVERLAPS) 310/671 variables, 361/420 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/671 variables, 8/428 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-01 00:10:28] [INFO ] Deduced a trap composed of 22 places in 70 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/671 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-01 00:10:33] [INFO ] Deduced a trap composed of 17 places in 86 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/671 variables, 1/430 constraints. Problems are: Problem set: 0 solved, 307 unsolved
[2024-06-01 00:10:38] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 2 ms to minimize.
[2024-06-01 00:10:39] [INFO ] Deduced a trap composed of 13 places in 48 ms of which 0 ms to minimize.
[2024-06-01 00:10:39] [INFO ] Deduced a trap composed of 10 places in 100 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/671 variables, 3/433 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 671/672 variables, and 433 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 361/362 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 307 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/359 variables, 29/29 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/359 variables, 18/47 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/359 variables, 3/50 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/359 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 4 (OVERLAPS) 1/360 variables, 5/55 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 6 (OVERLAPS) 1/361 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/361 variables, 2/64 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/361 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 9 (OVERLAPS) 310/671 variables, 361/425 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/671 variables, 8/433 constraints. Problems are: Problem set: 0 solved, 307 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/671 variables, 307/740 constraints. Problems are: Problem set: 0 solved, 307 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 671/672 variables, and 740 constraints, problems are : Problem set: 0 solved, 307 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 361/362 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 307/307 constraints, Known Traps: 5/5 constraints]
After SMT, in 60277ms problems are : Problem set: 0 solved, 307 unsolved
Search for dead transitions found 0 dead transitions in 60280ms
Starting structural reductions in SI_LTL mode, iteration 1 : 362/477 places, 310/419 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61233 ms. Remains : 362/477 places, 310/419 transitions.
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p1), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-60b-LTLCardinality-08
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA DES-PT-60b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-LTLCardinality-08 finished in 61417 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 477 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 477/477 places, 419/419 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 474 transition count 416
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 474 transition count 416
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 474 transition count 415
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 473 transition count 414
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 473 transition count 414
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 473 transition count 413
Applied a total of 10 rules in 26 ms. Remains 473 /477 variables (removed 4) and now considering 413/419 (removed 6) transitions.
// Phase 1: matrix 413 rows 473 cols
[2024-06-01 00:11:14] [INFO ] Computed 62 invariants in 11 ms
[2024-06-01 00:11:15] [INFO ] Implicit Places using invariants in 269 ms returned []
[2024-06-01 00:11:15] [INFO ] Invariant cache hit.
[2024-06-01 00:11:15] [INFO ] Implicit Places using invariants and state equation in 624 ms returned []
Implicit Place search using SMT with State Equation took 907 ms to find 0 implicit places.
Running 412 sub problems to find dead transitions.
[2024-06-01 00:11:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/473 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 412 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 5 (OVERLAPS) 413/886 variables, 473/535 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-01 00:11:26] [INFO ] Deduced a trap composed of 30 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:11:27] [INFO ] Deduced a trap composed of 10 places in 116 ms of which 2 ms to minimize.
[2024-06-01 00:11:27] [INFO ] Deduced a trap composed of 15 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:11:27] [INFO ] Deduced a trap composed of 9 places in 88 ms of which 2 ms to minimize.
[2024-06-01 00:11:27] [INFO ] Deduced a trap composed of 10 places in 89 ms of which 2 ms to minimize.
[2024-06-01 00:11:27] [INFO ] Deduced a trap composed of 31 places in 84 ms of which 1 ms to minimize.
[2024-06-01 00:11:27] [INFO ] Deduced a trap composed of 31 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:11:28] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 2 ms to minimize.
[2024-06-01 00:11:28] [INFO ] Deduced a trap composed of 28 places in 53 ms of which 1 ms to minimize.
[2024-06-01 00:11:28] [INFO ] Deduced a trap composed of 20 places in 47 ms of which 1 ms to minimize.
[2024-06-01 00:11:28] [INFO ] Deduced a trap composed of 18 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:11:28] [INFO ] Deduced a trap composed of 17 places in 37 ms of which 0 ms to minimize.
[2024-06-01 00:11:29] [INFO ] Deduced a trap composed of 14 places in 92 ms of which 2 ms to minimize.
[2024-06-01 00:11:30] [INFO ] Deduced a trap composed of 34 places in 68 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/886 variables, 14/549 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/886 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-01 00:11:44] [INFO ] Deduced a trap composed of 33 places in 106 ms of which 2 ms to minimize.
[2024-06-01 00:11:44] [INFO ] Deduced a trap composed of 18 places in 106 ms of which 2 ms to minimize.
[2024-06-01 00:11:44] [INFO ] Deduced a trap composed of 30 places in 111 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 886/886 variables, and 552 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 412 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/472 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/472 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 2 (OVERLAPS) 1/473 variables, 33/49 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/473 variables, 13/62 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/473 variables, 17/79 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-01 00:11:49] [INFO ] Deduced a trap composed of 13 places in 57 ms of which 1 ms to minimize.
[2024-06-01 00:11:49] [INFO ] Deduced a trap composed of 22 places in 53 ms of which 2 ms to minimize.
[2024-06-01 00:11:49] [INFO ] Deduced a trap composed of 27 places in 88 ms of which 1 ms to minimize.
[2024-06-01 00:11:49] [INFO ] Deduced a trap composed of 23 places in 56 ms of which 1 ms to minimize.
[2024-06-01 00:11:50] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-06-01 00:11:50] [INFO ] Deduced a trap composed of 25 places in 78 ms of which 2 ms to minimize.
[2024-06-01 00:11:50] [INFO ] Deduced a trap composed of 20 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:11:50] [INFO ] Deduced a trap composed of 21 places in 23 ms of which 1 ms to minimize.
[2024-06-01 00:11:51] [INFO ] Deduced a trap composed of 12 places in 124 ms of which 2 ms to minimize.
[2024-06-01 00:11:51] [INFO ] Deduced a trap composed of 7 places in 76 ms of which 1 ms to minimize.
[2024-06-01 00:11:51] [INFO ] Deduced a trap composed of 11 places in 73 ms of which 1 ms to minimize.
[2024-06-01 00:11:51] [INFO ] Deduced a trap composed of 14 places in 44 ms of which 1 ms to minimize.
[2024-06-01 00:11:51] [INFO ] Deduced a trap composed of 12 places in 90 ms of which 2 ms to minimize.
[2024-06-01 00:11:51] [INFO ] Deduced a trap composed of 12 places in 98 ms of which 2 ms to minimize.
[2024-06-01 00:11:51] [INFO ] Deduced a trap composed of 21 places in 91 ms of which 2 ms to minimize.
[2024-06-01 00:11:51] [INFO ] Deduced a trap composed of 11 places in 66 ms of which 1 ms to minimize.
[2024-06-01 00:11:51] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 0 ms to minimize.
[2024-06-01 00:11:52] [INFO ] Deduced a trap composed of 10 places in 46 ms of which 1 ms to minimize.
[2024-06-01 00:11:52] [INFO ] Deduced a trap composed of 14 places in 42 ms of which 1 ms to minimize.
[2024-06-01 00:11:52] [INFO ] Deduced a trap composed of 14 places in 46 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 20/99 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-01 00:11:52] [INFO ] Deduced a trap composed of 19 places in 45 ms of which 1 ms to minimize.
[2024-06-01 00:11:52] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 1 ms to minimize.
[2024-06-01 00:11:52] [INFO ] Deduced a trap composed of 23 places in 34 ms of which 1 ms to minimize.
[2024-06-01 00:11:53] [INFO ] Deduced a trap composed of 24 places in 29 ms of which 0 ms to minimize.
[2024-06-01 00:11:53] [INFO ] Deduced a trap composed of 23 places in 60 ms of which 1 ms to minimize.
[2024-06-01 00:11:53] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 6/105 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-01 00:11:56] [INFO ] Deduced a trap composed of 12 places in 48 ms of which 1 ms to minimize.
[2024-06-01 00:11:56] [INFO ] Deduced a trap composed of 18 places in 73 ms of which 2 ms to minimize.
[2024-06-01 00:11:57] [INFO ] Deduced a trap composed of 15 places in 49 ms of which 0 ms to minimize.
[2024-06-01 00:11:57] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 0 ms to minimize.
[2024-06-01 00:11:57] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2024-06-01 00:12:00] [INFO ] Deduced a trap composed of 29 places in 42 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/473 variables, 6/111 constraints. Problems are: Problem set: 0 solved, 412 unsolved
[2024-06-01 00:12:02] [INFO ] Deduced a trap composed of 14 places in 32 ms of which 1 ms to minimize.
[2024-06-01 00:12:04] [INFO ] Deduced a trap composed of 34 places in 33 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/473 variables, 2/113 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/473 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 10 (OVERLAPS) 413/886 variables, 473/586 constraints. Problems are: Problem set: 0 solved, 412 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/886 variables, 412/998 constraints. Problems are: Problem set: 0 solved, 412 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 886/886 variables, and 998 constraints, problems are : Problem set: 0 solved, 412 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 29/29 constraints, State Equation: 473/473 constraints, PredecessorRefiner: 412/412 constraints, Known Traps: 51/51 constraints]
After SMT, in 60265ms problems are : Problem set: 0 solved, 412 unsolved
Search for dead transitions found 0 dead transitions in 60270ms
Starting structural reductions in LTL mode, iteration 1 : 473/477 places, 413/419 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61205 ms. Remains : 473/477 places, 413/419 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60b-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DES-PT-60b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-LTLCardinality-10 finished in 61307 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (G(p2)||G(p0)||p1)))))'
Support contains 3 out of 477 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 477/477 places, 419/419 transitions.
Graph (complete) has 1133 edges and 477 vertex of which 471 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 470 transition count 401
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 456 transition count 400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 31 place count 455 transition count 400
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 31 place count 455 transition count 389
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 53 place count 444 transition count 389
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 54 place count 443 transition count 388
Iterating global reduction 3 with 1 rules applied. Total rules applied 55 place count 443 transition count 388
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 57 place count 443 transition count 386
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 59 place count 442 transition count 385
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 5 with 152 rules applied. Total rules applied 211 place count 366 transition count 309
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 217 place count 363 transition count 317
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 219 place count 361 transition count 315
Applied a total of 219 rules in 51 ms. Remains 361 /477 variables (removed 116) and now considering 315/419 (removed 104) transitions.
// Phase 1: matrix 315 rows 361 cols
[2024-06-01 00:12:16] [INFO ] Computed 59 invariants in 5 ms
[2024-06-01 00:12:16] [INFO ] Implicit Places using invariants in 300 ms returned []
[2024-06-01 00:12:16] [INFO ] Invariant cache hit.
[2024-06-01 00:12:16] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 00:12:17] [INFO ] Implicit Places using invariants and state equation in 521 ms returned []
Implicit Place search using SMT with State Equation took 822 ms to find 0 implicit places.
[2024-06-01 00:12:17] [INFO ] Redundant transitions in 2 ms returned []
Running 312 sub problems to find dead transitions.
[2024-06-01 00:12:17] [INFO ] Invariant cache hit.
[2024-06-01 00:12:17] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 18/52 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (OVERLAPS) 2/360 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (OVERLAPS) 315/675 variables, 360/419 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/675 variables, 8/427 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/675 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 8 (OVERLAPS) 1/676 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-06-01 00:12:31] [INFO ] Deduced a trap composed of 13 places in 71 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/676 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/676 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-06-01 00:12:42] [INFO ] Deduced a trap composed of 14 places in 64 ms of which 1 ms to minimize.
[2024-06-01 00:12:42] [INFO ] Deduced a trap composed of 16 places in 61 ms of which 2 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/676 variables, 2/431 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 676/676 variables, and 431 constraints, problems are : Problem set: 0 solved, 312 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 361/361 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 312 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 18/52 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (OVERLAPS) 2/360 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (OVERLAPS) 315/675 variables, 360/422 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/675 variables, 8/430 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/675 variables, 312/742 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 675/676 variables, and 742 constraints, problems are : Problem set: 0 solved, 312 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 360/361 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 3/3 constraints]
After SMT, in 60286ms problems are : Problem set: 0 solved, 312 unsolved
Search for dead transitions found 0 dead transitions in 60290ms
Starting structural reductions in SI_LTL mode, iteration 1 : 361/477 places, 315/419 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61172 ms. Remains : 361/477 places, 315/419 transitions.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : DES-PT-60b-LTLCardinality-13
Product exploration explored 100000 steps with 5943 reset in 303 ms.
Product exploration explored 100000 steps with 5959 reset in 298 ms.
Computed a total of 256 stabilizing places and 257 stable transitions
Computed a total of 256 stabilizing places and 257 stable transitions
Detected a total of 256/361 stabilizing places and 257/315 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 153 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 40000 steps (2128 resets) in 503 ms. (79 steps per ms) remains 4/7 properties
BEST_FIRST walk for 40003 steps (410 resets) in 233 ms. (170 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (409 resets) in 195 ms. (204 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (403 resets) in 361 ms. (110 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (426 resets) in 255 ms. (156 steps per ms) remains 4/4 properties
[2024-06-01 00:13:18] [INFO ] Invariant cache hit.
[2024-06-01 00:13:18] [INFO ] State equation strengthened by 8 read => feed constraints.
Problem apf1 is UNSAT
Problem apf2 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/7 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 196/203 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 40/243 variables, 19/22 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 0/22 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 37/280 variables, 24/46 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 0/46 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9/289 variables, 9/55 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 0/55 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 253/542 variables, 289/344 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/542 variables, 8/352 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/542 variables, 0/352 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 76/618 variables, 14/366 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/618 variables, 4/370 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/618 variables, 0/370 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 58/676 variables, 58/428 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/676 variables, 0/428 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/676 variables, 0/428 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 676/676 variables, and 428 constraints, problems are : Problem set: 2 solved, 2 unsolved in 501 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 361/361 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/7 variables, 1/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 196/203 variables, 1/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/3 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 40/243 variables, 19/22 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 0/22 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 37/280 variables, 24/46 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 0/46 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9/289 variables, 9/55 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 0/55 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 253/542 variables, 289/344 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/542 variables, 8/352 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/542 variables, 0/352 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 76/618 variables, 14/366 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/618 variables, 4/370 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/618 variables, 2/372 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/618 variables, 0/372 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 58/676 variables, 58/430 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/676 variables, 0/430 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/676 variables, 0/430 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 676/676 variables, and 430 constraints, problems are : Problem set: 2 solved, 2 unsolved in 426 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 361/361 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 933ms problems are : Problem set: 2 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2227 ms.
Support contains 3 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 315/315 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 361 transition count 314
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 361 transition count 313
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 360 transition count 313
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 360 transition count 313
Applied a total of 4 rules in 21 ms. Remains 360 /361 variables (removed 1) and now considering 313/315 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 360/361 places, 313/315 transitions.
RANDOM walk for 40000 steps (2083 resets) in 816 ms. (48 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (389 resets) in 203 ms. (196 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (403 resets) in 210 ms. (189 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 725225 steps, run timeout after 3001 ms. (steps per millisecond=241 ) properties seen :0 out of 2
Probabilistic random walk after 725225 steps, saw 103599 distinct states, run finished after 3001 ms. (steps per millisecond=241 ) properties seen :0
// Phase 1: matrix 313 rows 360 cols
[2024-06-01 00:13:25] [INFO ] Computed 60 invariants in 5 ms
[2024-06-01 00:13:25] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/7 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 196/203 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 44/247 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 33/280 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9/289 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 251/540 variables, 289/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/540 variables, 8/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/540 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 75/615 variables, 13/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/615 variables, 4/370 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/615 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 58/673 variables, 58/428 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/673 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/673 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 673/673 variables, and 428 constraints, problems are : Problem set: 0 solved, 2 unsolved in 425 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 360/360 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/7 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 196/203 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 44/247 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 33/280 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9/289 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 251/540 variables, 289/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/540 variables, 8/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/540 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 75/615 variables, 13/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/615 variables, 4/370 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/615 variables, 2/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/615 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 58/673 variables, 58/430 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/673 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/673 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 673/673 variables, and 430 constraints, problems are : Problem set: 0 solved, 2 unsolved in 472 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 360/360 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 907ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1803 ms.
Support contains 3 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 313/313 transitions.
Applied a total of 0 rules in 22 ms. Remains 360 /360 variables (removed 0) and now considering 313/313 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 360/360 places, 313/313 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 313/313 transitions.
Applied a total of 0 rules in 9 ms. Remains 360 /360 variables (removed 0) and now considering 313/313 (removed 0) transitions.
[2024-06-01 00:13:28] [INFO ] Invariant cache hit.
[2024-06-01 00:13:28] [INFO ] Implicit Places using invariants in 217 ms returned []
[2024-06-01 00:13:28] [INFO ] Invariant cache hit.
[2024-06-01 00:13:28] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 00:13:28] [INFO ] Implicit Places using invariants and state equation in 449 ms returned []
Implicit Place search using SMT with State Equation took 668 ms to find 0 implicit places.
[2024-06-01 00:13:28] [INFO ] Redundant transitions in 2 ms returned []
Running 310 sub problems to find dead transitions.
[2024-06-01 00:13:28] [INFO ] Invariant cache hit.
[2024-06-01 00:13:28] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/357 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (OVERLAPS) 2/359 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (OVERLAPS) 313/672 variables, 359/419 constraints. Problems are: Problem set: 0 solved, 310 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/672 variables, 8/427 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/672 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 8 (OVERLAPS) 1/673 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 310 unsolved
[2024-06-01 00:13:44] [INFO ] Deduced a trap composed of 60 places in 47 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/673 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/673 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 11 (OVERLAPS) 0/673 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 310 unsolved
No progress, stopping.
After SMT solving in domain Real declared 673/673 variables, and 429 constraints, problems are : Problem set: 0 solved, 310 unsolved in 28245 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 360/360 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 310 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/357 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (OVERLAPS) 2/359 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (OVERLAPS) 313/672 variables, 359/420 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/672 variables, 8/428 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/672 variables, 310/738 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 672/673 variables, and 738 constraints, problems are : Problem set: 0 solved, 310 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 359/360 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 1/1 constraints]
After SMT, in 58540ms problems are : Problem set: 0 solved, 310 unsolved
Search for dead transitions found 0 dead transitions in 58544ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 59228 ms. Remains : 360/360 places, 313/313 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 1256 edges and 360 vertex of which 359 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 359 transition count 313
Applied a total of 2 rules in 12 ms. Remains 359 /360 variables (removed 1) and now considering 313/313 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 313 rows 359 cols
[2024-06-01 00:14:27] [INFO ] Computed 59 invariants in 8 ms
[2024-06-01 00:14:27] [INFO ] After 72ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 00:14:27] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-06-01 00:14:27] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 14 ms returned sat
[2024-06-01 00:14:27] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 00:14:27] [INFO ] After 227ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 00:14:27] [INFO ] After 361ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 458 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p1 p2 (NOT p0)), (X p2), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND (NOT p1) p2 p0))), (X (NOT (AND (NOT p1) p2 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT p0)), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (G (OR (NOT p2) p0 p1)), (G (OR (NOT p2) (NOT p0) p1))]
False Knowledge obtained : [(F (NOT (OR p2 p0 p1))), (F (NOT (AND (OR p2 p1) (OR p0 p1)))), (F (NOT p2)), (F (NOT p1))]
Knowledge based reduction with 18 factoid took 315 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 315/315 transitions.
Applied a total of 0 rules in 10 ms. Remains 361 /361 variables (removed 0) and now considering 315/315 (removed 0) transitions.
// Phase 1: matrix 315 rows 361 cols
[2024-06-01 00:14:28] [INFO ] Computed 59 invariants in 5 ms
[2024-06-01 00:14:28] [INFO ] Implicit Places using invariants in 206 ms returned []
[2024-06-01 00:14:28] [INFO ] Invariant cache hit.
[2024-06-01 00:14:28] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 00:14:28] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 744 ms to find 0 implicit places.
[2024-06-01 00:14:28] [INFO ] Redundant transitions in 3 ms returned []
Running 312 sub problems to find dead transitions.
[2024-06-01 00:14:28] [INFO ] Invariant cache hit.
[2024-06-01 00:14:28] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 18/52 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (OVERLAPS) 2/360 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (OVERLAPS) 315/675 variables, 360/419 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/675 variables, 8/427 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/675 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 8 (OVERLAPS) 1/676 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-06-01 00:14:43] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/676 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/676 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-06-01 00:14:54] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 1 ms to minimize.
[2024-06-01 00:14:54] [INFO ] Deduced a trap composed of 16 places in 60 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/676 variables, 2/431 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 676/676 variables, and 431 constraints, problems are : Problem set: 0 solved, 312 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 361/361 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 312 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 18/52 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (OVERLAPS) 2/360 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (OVERLAPS) 315/675 variables, 360/422 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/675 variables, 8/430 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/675 variables, 312/742 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 675/676 variables, and 742 constraints, problems are : Problem set: 0 solved, 312 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 360/361 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 3/3 constraints]
After SMT, in 60287ms problems are : Problem set: 0 solved, 312 unsolved
Search for dead transitions found 0 dead transitions in 60290ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61052 ms. Remains : 361/361 places, 315/315 transitions.
Computed a total of 256 stabilizing places and 257 stable transitions
Computed a total of 256 stabilizing places and 257 stable transitions
Detected a total of 256/361 stabilizing places and 257/315 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 133 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (2098 resets) in 472 ms. (84 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (420 resets) in 109 ms. (363 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (414 resets) in 117 ms. (339 steps per ms) remains 2/2 properties
[2024-06-01 00:15:29] [INFO ] Invariant cache hit.
[2024-06-01 00:15:29] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/7 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 196/203 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 40/243 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 37/280 variables, 24/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9/289 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 253/542 variables, 289/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/542 variables, 8/352 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/542 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 76/618 variables, 14/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/618 variables, 4/370 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/618 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 58/676 variables, 58/428 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/676 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/676 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 676/676 variables, and 428 constraints, problems are : Problem set: 0 solved, 2 unsolved in 463 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 361/361 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/7 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 196/203 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 40/243 variables, 19/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/243 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 37/280 variables, 24/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9/289 variables, 9/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 253/542 variables, 289/344 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/542 variables, 8/352 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/542 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 76/618 variables, 14/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/618 variables, 4/370 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/618 variables, 2/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/618 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 58/676 variables, 58/430 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/676 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/676 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 676/676 variables, and 430 constraints, problems are : Problem set: 0 solved, 2 unsolved in 377 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 361/361 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 856ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1093 ms.
Support contains 3 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 315/315 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 361 transition count 314
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 361 transition count 313
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 360 transition count 313
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 360 transition count 313
Applied a total of 4 rules in 19 ms. Remains 360 /361 variables (removed 1) and now considering 313/315 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 360/361 places, 313/315 transitions.
RANDOM walk for 40000 steps (2062 resets) in 370 ms. (107 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (391 resets) in 119 ms. (333 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (376 resets) in 115 ms. (344 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 764808 steps, run timeout after 3001 ms. (steps per millisecond=254 ) properties seen :0 out of 2
Probabilistic random walk after 764808 steps, saw 109150 distinct states, run finished after 3001 ms. (steps per millisecond=254 ) properties seen :0
// Phase 1: matrix 313 rows 360 cols
[2024-06-01 00:15:34] [INFO ] Computed 60 invariants in 4 ms
[2024-06-01 00:15:34] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/7 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 196/203 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 44/247 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 33/280 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9/289 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 251/540 variables, 289/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/540 variables, 8/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/540 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 75/615 variables, 13/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/615 variables, 4/370 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/615 variables, 0/370 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 58/673 variables, 58/428 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/673 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/673 variables, 0/428 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 673/673 variables, and 428 constraints, problems are : Problem set: 0 solved, 2 unsolved in 504 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 360/360 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 2/5 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 2/7 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 196/203 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/203 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 44/247 variables, 21/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/247 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 33/280 variables, 23/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/280 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9/289 variables, 9/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 251/540 variables, 289/345 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/540 variables, 8/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/540 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 75/615 variables, 13/366 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/615 variables, 4/370 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/615 variables, 2/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/615 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 58/673 variables, 58/430 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/673 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 22 (OVERLAPS) 0/673 variables, 0/430 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 673/673 variables, and 430 constraints, problems are : Problem set: 0 solved, 2 unsolved in 531 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 360/360 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1049ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 3770 ms.
Support contains 3 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 313/313 transitions.
Applied a total of 0 rules in 17 ms. Remains 360 /360 variables (removed 0) and now considering 313/313 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 360/360 places, 313/313 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 313/313 transitions.
Applied a total of 0 rules in 6 ms. Remains 360 /360 variables (removed 0) and now considering 313/313 (removed 0) transitions.
[2024-06-01 00:15:39] [INFO ] Invariant cache hit.
[2024-06-01 00:15:39] [INFO ] Implicit Places using invariants in 200 ms returned []
[2024-06-01 00:15:39] [INFO ] Invariant cache hit.
[2024-06-01 00:15:40] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 00:15:40] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 642 ms to find 0 implicit places.
[2024-06-01 00:15:40] [INFO ] Redundant transitions in 3 ms returned []
Running 310 sub problems to find dead transitions.
[2024-06-01 00:15:40] [INFO ] Invariant cache hit.
[2024-06-01 00:15:40] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/357 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (OVERLAPS) 2/359 variables, 7/60 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/359 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (OVERLAPS) 313/672 variables, 359/419 constraints. Problems are: Problem set: 0 solved, 310 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (INCLUDED_ONLY) 0/672 variables, 8/427 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/672 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 8 (OVERLAPS) 1/673 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 310 unsolved
[2024-06-01 00:15:56] [INFO ] Deduced a trap composed of 60 places in 48 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/673 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/673 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 11 (OVERLAPS) 0/673 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 310 unsolved
No progress, stopping.
After SMT solving in domain Real declared 673/673 variables, and 429 constraints, problems are : Problem set: 0 solved, 310 unsolved in 27491 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 360/360 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 310 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/357 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/357 variables, 17/53 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/357 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/357 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 4 (OVERLAPS) 2/359 variables, 7/61 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/359 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 6 (OVERLAPS) 313/672 variables, 359/420 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/672 variables, 8/428 constraints. Problems are: Problem set: 0 solved, 310 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/672 variables, 310/738 constraints. Problems are: Problem set: 0 solved, 310 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 672/673 variables, and 738 constraints, problems are : Problem set: 0 solved, 310 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 36/36 constraints, Generalized P Invariants (flows): 24/24 constraints, State Equation: 359/360 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 310/310 constraints, Known Traps: 1/1 constraints]
After SMT, in 57746ms problems are : Problem set: 0 solved, 310 unsolved
Search for dead transitions found 0 dead transitions in 57750ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58408 ms. Remains : 360/360 places, 313/313 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 1256 edges and 360 vertex of which 359 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 359 transition count 313
Applied a total of 2 rules in 22 ms. Remains 359 /360 variables (removed 1) and now considering 313/313 (removed 0) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 313 rows 359 cols
[2024-06-01 00:16:38] [INFO ] Computed 59 invariants in 3 ms
[2024-06-01 00:16:38] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-01 00:16:38] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-06-01 00:16:38] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 13 ms returned sat
[2024-06-01 00:16:38] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-01 00:16:38] [INFO ] After 219ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-01 00:16:38] [INFO ] After 326ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 425 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p1)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 10 factoid took 205 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 6012 reset in 239 ms.
Product exploration explored 100000 steps with 6005 reset in 256 ms.
Support contains 3 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 315/315 transitions.
Applied a total of 0 rules in 6 ms. Remains 361 /361 variables (removed 0) and now considering 315/315 (removed 0) transitions.
// Phase 1: matrix 315 rows 361 cols
[2024-06-01 00:16:39] [INFO ] Computed 59 invariants in 12 ms
[2024-06-01 00:16:39] [INFO ] Implicit Places using invariants in 220 ms returned []
[2024-06-01 00:16:39] [INFO ] Invariant cache hit.
[2024-06-01 00:16:39] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-06-01 00:16:40] [INFO ] Implicit Places using invariants and state equation in 531 ms returned []
Implicit Place search using SMT with State Equation took 753 ms to find 0 implicit places.
[2024-06-01 00:16:40] [INFO ] Redundant transitions in 1 ms returned []
Running 312 sub problems to find dead transitions.
[2024-06-01 00:16:40] [INFO ] Invariant cache hit.
[2024-06-01 00:16:40] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 18/52 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (OVERLAPS) 2/360 variables, 7/59 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/360 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (OVERLAPS) 315/675 variables, 360/419 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/675 variables, 8/427 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/675 variables, 0/427 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 8 (OVERLAPS) 1/676 variables, 1/428 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-06-01 00:16:54] [INFO ] Deduced a trap composed of 13 places in 77 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/676 variables, 1/429 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/676 variables, 0/429 constraints. Problems are: Problem set: 0 solved, 312 unsolved
[2024-06-01 00:17:04] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 2 ms to minimize.
[2024-06-01 00:17:04] [INFO ] Deduced a trap composed of 16 places in 67 ms of which 1 ms to minimize.
At refinement iteration 11 (OVERLAPS) 0/676 variables, 2/431 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/676 variables, 0/431 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 676/676 variables, and 431 constraints, problems are : Problem set: 0 solved, 312 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 361/361 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 312 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/358 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/358 variables, 18/52 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/358 variables, 3/55 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/358 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 4 (OVERLAPS) 2/360 variables, 7/62 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/360 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 6 (OVERLAPS) 315/675 variables, 360/422 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/675 variables, 8/430 constraints. Problems are: Problem set: 0 solved, 312 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/675 variables, 312/742 constraints. Problems are: Problem set: 0 solved, 312 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 675/676 variables, and 742 constraints, problems are : Problem set: 0 solved, 312 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 360/361 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 312/312 constraints, Known Traps: 3/3 constraints]
After SMT, in 60263ms problems are : Problem set: 0 solved, 312 unsolved
Search for dead transitions found 0 dead transitions in 60266ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61034 ms. Remains : 361/361 places, 315/315 transitions.
Treatment of property DES-PT-60b-LTLCardinality-13 finished in 324436 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0 U (G(p2)||G(p0)||p1)))))'
[2024-06-01 00:17:40] [INFO ] Flatten gal took : 23 ms
[2024-06-01 00:17:40] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-06-01 00:17:40] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 477 places, 419 transitions and 1491 arcs took 5 ms.
Total runtime 959782 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA DES-PT-60b-LTLCardinality-03 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
Could not compute solution for formula : DES-PT-60b-LTLCardinality-05
Could not compute solution for formula : DES-PT-60b-LTLCardinality-13

BK_STOP 1717201897904

--------------------
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 DES-PT-60b-LTLCardinality-03
ltl formula formula --ltl=/tmp/1578/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 477 places, 419 transitions and 1491 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.130 real 0.000 user 0.030 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1578/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1578/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1578/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1578/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 479 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 478, there are 428 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( 1/ 4): ~119 levels ~10000 states ~37708 transitions
pnml2lts-mc( 1/ 4): ~119 levels ~20000 states ~80476 transitions
pnml2lts-mc( 1/ 4): ~119 levels ~40000 states ~178892 transitions
pnml2lts-mc( 1/ 4): ~120 levels ~80000 states ~370488 transitions
pnml2lts-mc( 1/ 4): ~120 levels ~160000 states ~830340 transitions
pnml2lts-mc( 1/ 4): ~121 levels ~320000 states ~1668112 transitions
pnml2lts-mc( 1/ 4): ~135 levels ~640000 states ~3436312 transitions
pnml2lts-mc( 1/ 4): ~135 levels ~1280000 states ~7485196 transitions
pnml2lts-mc( 1/ 4): ~135 levels ~2560000 states ~16245052 transitions
pnml2lts-mc( 1/ 4): ~163 levels ~5120000 states ~32711464 transitions
pnml2lts-mc( 1/ 4): ~163 levels ~10240000 states ~68045904 transitions
pnml2lts-mc( 1/ 4): ~163 levels ~20480000 states ~142334720 transitions
pnml2lts-mc( 0/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33551456
pnml2lts-mc( 0/ 4): unique states count: 33552021
pnml2lts-mc( 0/ 4): unique transitions count: 266134772
pnml2lts-mc( 0/ 4): - self-loop count: 1095
pnml2lts-mc( 0/ 4): - claim dead count: 232579254
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 33552029
pnml2lts-mc( 0/ 4): - cum. max stack depth: 701
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33552029 states 266134790 transitions, fanout: 7.932
pnml2lts-mc( 0/ 4): Total exploration time 316.290 sec (316.270 sec minimum, 316.280 sec on average)
pnml2lts-mc( 0/ 4): States per second: 106080, Transitions per second: 841426
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 312.0MB, 9.7 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/87.0%
pnml2lts-mc( 0/ 4): Stored 422 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 312.0MB (~256.0MB paged-in)
ltl formula name DES-PT-60b-LTLCardinality-05
ltl formula formula --ltl=/tmp/1578/ltl_1_
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
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
pnml2lts-mc( 0/ 4): Petri net has 477 places, 419 transitions and 1491 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.050 real 0.010 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1578/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1578/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1578/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1578/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 479 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 478, there are 428 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( 2/ 4): ~120 levels ~10000 states ~46336 transitions
pnml2lts-mc( 2/ 4): ~120 levels ~20000 states ~96016 transitions
pnml2lts-mc( 2/ 4): ~125 levels ~40000 states ~201272 transitions
pnml2lts-mc( 2/ 4): ~128 levels ~80000 states ~410436 transitions
pnml2lts-mc( 2/ 4): ~128 levels ~160000 states ~886944 transitions
pnml2lts-mc( 2/ 4): ~135 levels ~320000 states ~1885968 transitions
pnml2lts-mc( 2/ 4): ~135 levels ~640000 states ~3928204 transitions
pnml2lts-mc( 2/ 4): ~135 levels ~1280000 states ~8204524 transitions
pnml2lts-mc( 2/ 4): ~189 levels ~2560000 states ~16680080 transitions
pnml2lts-mc( 2/ 4): ~189 levels ~5120000 states ~36063552 transitions
pnml2lts-mc( 2/ 4): ~189 levels ~10240000 states ~77654464 transitions
pnml2lts-mc( 2/ 4): ~189 levels ~20480000 states ~167185704 transitions
pnml2lts-mc( 3/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 25204916
pnml2lts-mc( 0/ 4): unique states count: 25211663
pnml2lts-mc( 0/ 4): unique transitions count: 189303315
pnml2lts-mc( 0/ 4): - self-loop count: 775
pnml2lts-mc( 0/ 4): - claim dead count: 164068259
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 25211672
pnml2lts-mc( 0/ 4): - cum. max stack depth: 6859
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 25211672 states 189303337 transitions, fanout: 7.509
pnml2lts-mc( 0/ 4): Total exploration time 259.440 sec (259.440 sec minimum, 259.440 sec on average)
pnml2lts-mc( 0/ 4): States per second: 97177, Transitions per second: 729661
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 256.5MB, 10.7 B/state, compr.: 0.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 75.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 422 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 256.5MB (~256.0MB paged-in)
ltl formula name DES-PT-60b-LTLCardinality-13
ltl formula formula --ltl=/tmp/1578/ltl_2_
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 477 places, 419 transitions and 1491 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( 3/ 4): LTL layer: formula: /tmp/1578/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1578/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1578/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1578/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 478 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 478, there are 452 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( 3/ 4): ~86 levels ~10000 states ~42216 transitions
pnml2lts-mc( 1/ 4): ~115 levels ~20000 states ~85876 transitions
pnml2lts-mc( 1/ 4): ~115 levels ~40000 states ~185144 transitions
pnml2lts-mc( 2/ 4): ~196 levels ~80000 states ~270056 transitions
pnml2lts-mc( 2/ 4): ~196 levels ~160000 states ~557972 transitions
pnml2lts-mc( 2/ 4): ~196 levels ~320000 states ~1173272 transitions
pnml2lts-mc( 2/ 4): ~196 levels ~640000 states ~2466800 transitions
pnml2lts-mc( 2/ 4): ~196 levels ~1280000 states ~5053264 transitions
pnml2lts-mc( 2/ 4): ~196 levels ~2560000 states ~10656976 transitions
pnml2lts-mc( 2/ 4): ~196 levels ~5120000 states ~22299676 transitions
pnml2lts-mc( 2/ 4): ~196 levels ~10240000 states ~46071092 transitions
pnml2lts-mc( 2/ 4): ~196 levels ~20480000 states ~95419456 transitions
pnml2lts-mc( 2/ 4): Error: tree leafs table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 32007995
pnml2lts-mc( 0/ 4): unique states count: 32009789
pnml2lts-mc( 0/ 4): unique transitions count: 212640830
pnml2lts-mc( 0/ 4): - self-loop count: 775
pnml2lts-mc( 0/ 4): - claim dead count: 180625465
pnml2lts-mc( 0/ 4): - claim found count: 456
pnml2lts-mc( 0/ 4): - claim success count: 32009800
pnml2lts-mc( 0/ 4): - cum. max stack depth: 1916
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 32009800 states 212640851 transitions, fanout: 6.643
pnml2lts-mc( 0/ 4): Total exploration time 259.350 sec (259.340 sec minimum, 259.342 sec on average)
pnml2lts-mc( 0/ 4): States per second: 123423, Transitions per second: 819899
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 308.2MB, 10.1 B/state, compr.: 0.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 95.0%/99.0%
pnml2lts-mc( 0/ 4): Stored 422 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 308.2MB (~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="DES-PT-60b"
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 DES-PT-60b, 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 r480-tall-171624189900755"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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