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.r464-smll-171620117700027.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 ASLink-PT-02a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r464-smll-171620117700027
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 700K
-rw-r--r-- 1 mcc users 6.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K 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.0K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.3K May 19 07:05 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:22 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:11 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K May 19 17:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Apr 11 18:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Apr 11 18:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Apr 11 18:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Apr 11 18:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:26 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 279K 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 ASLink-PT-02a-LTLCardinality-00
FORMULA_NAME ASLink-PT-02a-LTLCardinality-01
FORMULA_NAME ASLink-PT-02a-LTLCardinality-02
FORMULA_NAME ASLink-PT-02a-LTLCardinality-03
FORMULA_NAME ASLink-PT-02a-LTLCardinality-04
FORMULA_NAME ASLink-PT-02a-LTLCardinality-05
FORMULA_NAME ASLink-PT-02a-LTLCardinality-06
FORMULA_NAME ASLink-PT-02a-LTLCardinality-07
FORMULA_NAME ASLink-PT-02a-LTLCardinality-08
FORMULA_NAME ASLink-PT-02a-LTLCardinality-09
FORMULA_NAME ASLink-PT-02a-LTLCardinality-10
FORMULA_NAME ASLink-PT-02a-LTLCardinality-11
FORMULA_NAME ASLink-PT-02a-LTLCardinality-12
FORMULA_NAME ASLink-PT-02a-LTLCardinality-13
FORMULA_NAME ASLink-PT-02a-LTLCardinality-14
FORMULA_NAME ASLink-PT-02a-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717179918406

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-02a
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 18:25:20] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 18:25:20] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 18:25:20] [INFO ] Load time of PNML (sax parser for PT used): 198 ms
[2024-05-31 18:25:20] [INFO ] Transformed 626 places.
[2024-05-31 18:25:20] [INFO ] Transformed 1008 transitions.
[2024-05-31 18:25:20] [INFO ] Found NUPN structural information;
[2024-05-31 18:25:20] [INFO ] Parsed PT model containing 626 places and 1008 transitions and 3820 arcs in 378 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 26 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
FORMULA ASLink-PT-02a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-02a-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 998/998 transitions.
Ensure Unique test removed 8 places
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 614 transition count 998
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 19 place count 607 transition count 973
Ensure Unique test removed 1 places
Iterating global reduction 1 with 8 rules applied. Total rules applied 27 place count 606 transition count 973
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 29 place count 606 transition count 971
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 30 place count 605 transition count 963
Iterating global reduction 2 with 1 rules applied. Total rules applied 31 place count 605 transition count 963
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 32 place count 604 transition count 955
Iterating global reduction 2 with 1 rules applied. Total rules applied 33 place count 604 transition count 955
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 34 place count 603 transition count 947
Iterating global reduction 2 with 1 rules applied. Total rules applied 35 place count 603 transition count 947
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 36 place count 602 transition count 939
Iterating global reduction 2 with 1 rules applied. Total rules applied 37 place count 602 transition count 939
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 601 transition count 931
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 601 transition count 931
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 40 place count 600 transition count 923
Iterating global reduction 2 with 1 rules applied. Total rules applied 41 place count 600 transition count 923
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 42 place count 599 transition count 915
Iterating global reduction 2 with 1 rules applied. Total rules applied 43 place count 599 transition count 915
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 598 transition count 907
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 598 transition count 907
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 597 transition count 899
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 597 transition count 899
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 48 place count 596 transition count 891
Iterating global reduction 2 with 1 rules applied. Total rules applied 49 place count 596 transition count 891
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 595 transition count 883
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 595 transition count 883
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 52 place count 594 transition count 875
Iterating global reduction 2 with 1 rules applied. Total rules applied 53 place count 594 transition count 875
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 54 place count 593 transition count 867
Iterating global reduction 2 with 1 rules applied. Total rules applied 55 place count 593 transition count 867
Applied a total of 55 rules in 572 ms. Remains 593 /626 variables (removed 33) and now considering 867/998 (removed 131) transitions.
// Phase 1: matrix 867 rows 593 cols
[2024-05-31 18:25:21] [INFO ] Computed 105 invariants in 70 ms
[2024-05-31 18:25:22] [INFO ] Implicit Places using invariants in 1248 ms returned [1, 19, 20, 23, 33, 51, 198, 214, 219, 220, 221, 239, 386, 391, 403, 408, 409, 410, 431, 433, 436, 454, 455, 456, 457, 474, 482, 490, 496, 502, 508, 514, 522, 528, 534, 542]
Discarding 36 places :
Implicit Place search using SMT only with invariants took 1360 ms to find 36 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 557/626 places, 867/998 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 544 transition count 854
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 544 transition count 854
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 534 transition count 844
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 534 transition count 844
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 50 place count 530 transition count 840
Iterating global reduction 0 with 4 rules applied. Total rules applied 54 place count 530 transition count 840
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 529 transition count 839
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 529 transition count 839
Applied a total of 56 rules in 140 ms. Remains 529 /557 variables (removed 28) and now considering 839/867 (removed 28) transitions.
// Phase 1: matrix 839 rows 529 cols
[2024-05-31 18:25:22] [INFO ] Computed 69 invariants in 16 ms
[2024-05-31 18:25:23] [INFO ] Implicit Places using invariants in 498 ms returned []
[2024-05-31 18:25:23] [INFO ] Invariant cache hit.
[2024-05-31 18:25:24] [INFO ] Implicit Places using invariants and state equation in 1300 ms returned []
Implicit Place search using SMT with State Equation took 1801 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 529/626 places, 839/998 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3902 ms. Remains : 529/626 places, 839/998 transitions.
Support contains 26 out of 529 places after structural reductions.
[2024-05-31 18:25:25] [INFO ] Flatten gal took : 144 ms
[2024-05-31 18:25:25] [INFO ] Flatten gal took : 82 ms
[2024-05-31 18:25:25] [INFO ] Input system was already deterministic with 839 transitions.
RANDOM walk for 40000 steps (479 resets) in 1576 ms. (25 steps per ms) remains 3/15 properties
BEST_FIRST walk for 40004 steps (123 resets) in 227 ms. (175 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (127 resets) in 284 ms. (140 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40003 steps (136 resets) in 242 ms. (164 steps per ms) remains 2/2 properties
[2024-05-31 18:25:26] [INFO ] Invariant cache hit.
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) 19/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 239/261 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 268/529 variables, 52/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/529 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 839/1368 variables, 529/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1368 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1368 variables, 0/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1368/1368 variables, and 598 constraints, problems are : Problem set: 0 solved, 2 unsolved in 786 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 529/529 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) 19/22 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/22 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 239/261 variables, 14/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/261 variables, 1/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/261 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp4 is UNSAT
At refinement iteration 6 (OVERLAPS) 268/529 variables, 52/69 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/529 variables, 0/69 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 839/1368 variables, 529/598 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1368 variables, 1/599 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1368 variables, 0/599 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1368 variables, 0/599 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1368/1368 variables, and 599 constraints, problems are : Problem set: 1 solved, 1 unsolved in 670 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 53/53 constraints, State Equation: 529/529 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 1497ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 74 ms.
Support contains 1 out of 529 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 529/529 places, 839/839 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 100 transitions
Trivial Post-agglo rules discarded 100 transitions
Performed 100 trivial Post agglomeration. Transition count delta: 100
Iterating post reduction 0 with 100 rules applied. Total rules applied 100 place count 529 transition count 739
Reduce places removed 100 places and 0 transitions.
Iterating post reduction 1 with 100 rules applied. Total rules applied 200 place count 429 transition count 739
Performed 65 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 65 Pre rules applied. Total rules applied 200 place count 429 transition count 674
Deduced a syphon composed of 65 places in 1 ms
Ensure Unique test removed 21 places
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 2 with 151 rules applied. Total rules applied 351 place count 343 transition count 674
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 2 with 15 rules applied. Total rules applied 366 place count 337 transition count 665
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 375 place count 328 transition count 665
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 375 place count 328 transition count 657
Deduced a syphon composed of 8 places in 2 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 391 place count 320 transition count 657
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 398 place count 313 transition count 643
Iterating global reduction 4 with 7 rules applied. Total rules applied 405 place count 313 transition count 643
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 with 4 rules applied. Total rules applied 409 place count 313 transition count 639
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 410 place count 312 transition count 639
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 410 place count 312 transition count 638
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 412 place count 311 transition count 638
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 415 place count 308 transition count 628
Iterating global reduction 6 with 3 rules applied. Total rules applied 418 place count 308 transition count 628
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 6 with 1 rules applied. Total rules applied 419 place count 308 transition count 627
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 420 place count 307 transition count 627
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 421 place count 306 transition count 619
Iterating global reduction 8 with 1 rules applied. Total rules applied 422 place count 306 transition count 619
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 6 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 8 with 54 rules applied. Total rules applied 476 place count 279 transition count 592
Free-agglomeration rule applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 478 place count 279 transition count 590
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 480 place count 277 transition count 590
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 9 with 6 rules applied. Total rules applied 486 place count 277 transition count 584
Ensure Unique test removed 1 places
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 493 place count 270 transition count 584
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 10 with 7 rules applied. Total rules applied 500 place count 270 transition count 584
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 10 with 1 rules applied. Total rules applied 501 place count 269 transition count 583
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 10 with 2 rules applied. Total rules applied 503 place count 267 transition count 583
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 4 Pre rules applied. Total rules applied 503 place count 267 transition count 579
Deduced a syphon composed of 4 places in 5 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 511 place count 263 transition count 579
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 11 with 2 rules applied. Total rules applied 513 place count 261 transition count 579
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 5 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 12 with 4 rules applied. Total rules applied 517 place count 259 transition count 577
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 519 place count 257 transition count 575
Iterating global reduction 12 with 2 rules applied. Total rules applied 521 place count 257 transition count 575
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 12 with 2 rules applied. Total rules applied 523 place count 257 transition count 573
Free-agglomeration rule applied 2 times.
Iterating global reduction 12 with 2 rules applied. Total rules applied 525 place count 257 transition count 571
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 529 place count 255 transition count 569
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 13 with 2 rules applied. Total rules applied 531 place count 255 transition count 567
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 13 with 2 rules applied. Total rules applied 533 place count 253 transition count 567
Applied a total of 533 rules in 567 ms. Remains 253 /529 variables (removed 276) and now considering 567/839 (removed 272) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 573 ms. Remains : 253/529 places, 567/839 transitions.
RANDOM walk for 40000 steps (925 resets) in 212 ms. (187 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (358 resets) in 93 ms. (425 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 758 steps, run visited all 1 properties in 27 ms. (steps per millisecond=28 )
Probabilistic random walk after 758 steps, saw 632 distinct states, run finished after 33 ms. (steps per millisecond=22 ) properties seen :1
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 529 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 529/529 places, 839/839 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 528 transition count 737
Reduce places removed 103 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 105 rules applied. Total rules applied 206 place count 425 transition count 735
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 208 place count 423 transition count 735
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 69 Pre rules applied. Total rules applied 208 place count 423 transition count 666
Deduced a syphon composed of 69 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 159 rules applied. Total rules applied 367 place count 333 transition count 666
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 17 rules applied. Total rules applied 384 place count 324 transition count 658
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 392 place count 316 transition count 658
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 392 place count 316 transition count 649
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 410 place count 307 transition count 649
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 417 place count 300 transition count 635
Iterating global reduction 5 with 7 rules applied. Total rules applied 424 place count 300 transition count 635
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 5 with 3 rules applied. Total rules applied 427 place count 300 transition count 632
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 428 place count 299 transition count 632
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 428 place count 299 transition count 631
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 430 place count 298 transition count 631
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 433 place count 295 transition count 621
Iterating global reduction 7 with 3 rules applied. Total rules applied 436 place count 295 transition count 621
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 7 with 1 rules applied. Total rules applied 437 place count 295 transition count 620
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 438 place count 294 transition count 620
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 439 place count 293 transition count 612
Iterating global reduction 9 with 1 rules applied. Total rules applied 440 place count 293 transition count 612
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 9 with 56 rules applied. Total rules applied 496 place count 265 transition count 584
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 498 place count 263 transition count 582
Iterating global reduction 9 with 2 rules applied. Total rules applied 500 place count 263 transition count 582
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 502 place count 263 transition count 582
Applied a total of 502 rules in 125 ms. Remains 263 /529 variables (removed 266) and now considering 582/839 (removed 257) transitions.
// Phase 1: matrix 582 rows 263 cols
[2024-05-31 18:25:28] [INFO ] Computed 37 invariants in 5 ms
[2024-05-31 18:25:29] [INFO ] Implicit Places using invariants in 315 ms returned [55, 73, 91, 97, 102, 145, 163, 181, 187, 192, 195, 259]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 323 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 251/529 places, 582/839 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 251 transition count 579
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 8 place count 248 transition count 577
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 12 place count 244 transition count 573
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 244 transition count 573
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 20 place count 240 transition count 569
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 240 transition count 569
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 238 transition count 567
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 238 transition count 567
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 40 place count 232 transition count 561
Applied a total of 40 rules in 56 ms. Remains 232 /251 variables (removed 19) and now considering 561/582 (removed 21) transitions.
// Phase 1: matrix 561 rows 232 cols
[2024-05-31 18:25:29] [INFO ] Computed 25 invariants in 6 ms
[2024-05-31 18:25:29] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-05-31 18:25:29] [INFO ] Invariant cache hit.
[2024-05-31 18:25:30] [INFO ] Implicit Places using invariants and state equation in 581 ms returned []
Implicit Place search using SMT with State Equation took 854 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 232/529 places, 561/839 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1359 ms. Remains : 232/529 places, 561/839 transitions.
Stuttering acceptance computed with spot in 243 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-02a-LTLCardinality-04
Stuttering criterion allowed to conclude after 82 steps with 1 reset in 4 ms.
FORMULA ASLink-PT-02a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02a-LTLCardinality-04 finished in 1680 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 1 out of 529 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 529/529 places, 839/839 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 528 transition count 739
Reduce places removed 101 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 103 rules applied. Total rules applied 202 place count 427 transition count 737
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 205 place count 425 transition count 736
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 206 place count 424 transition count 736
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 69 Pre rules applied. Total rules applied 206 place count 424 transition count 667
Deduced a syphon composed of 69 places in 1 ms
Ensure Unique test removed 21 places
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 4 with 159 rules applied. Total rules applied 365 place count 334 transition count 667
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 4 with 18 rules applied. Total rules applied 383 place count 325 transition count 658
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 392 place count 316 transition count 658
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 9 Pre rules applied. Total rules applied 392 place count 316 transition count 649
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 410 place count 307 transition count 649
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 416 place count 301 transition count 636
Iterating global reduction 6 with 6 rules applied. Total rules applied 422 place count 301 transition count 636
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 6 with 4 rules applied. Total rules applied 426 place count 301 transition count 632
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 427 place count 300 transition count 632
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 430 place count 297 transition count 622
Iterating global reduction 8 with 3 rules applied. Total rules applied 433 place count 297 transition count 622
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 8 with 1 rules applied. Total rules applied 434 place count 297 transition count 621
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 435 place count 296 transition count 621
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 436 place count 295 transition count 613
Iterating global reduction 10 with 1 rules applied. Total rules applied 437 place count 295 transition count 613
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 10 with 58 rules applied. Total rules applied 495 place count 266 transition count 584
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 497 place count 264 transition count 582
Iterating global reduction 10 with 2 rules applied. Total rules applied 499 place count 264 transition count 582
Applied a total of 499 rules in 87 ms. Remains 264 /529 variables (removed 265) and now considering 582/839 (removed 257) transitions.
// Phase 1: matrix 582 rows 264 cols
[2024-05-31 18:25:30] [INFO ] Computed 37 invariants in 6 ms
[2024-05-31 18:25:30] [INFO ] Implicit Places using invariants in 289 ms returned [55, 73, 91, 97, 102, 145, 163, 181, 187, 192, 195, 261]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 292 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 252/529 places, 582/839 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 252 transition count 579
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 8 place count 249 transition count 577
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 12 place count 245 transition count 573
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 245 transition count 573
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 20 place count 241 transition count 569
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 241 transition count 569
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 239 transition count 567
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 239 transition count 567
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 40 place count 233 transition count 561
Applied a total of 40 rules in 43 ms. Remains 233 /252 variables (removed 19) and now considering 561/582 (removed 21) transitions.
// Phase 1: matrix 561 rows 233 cols
[2024-05-31 18:25:30] [INFO ] Computed 25 invariants in 5 ms
[2024-05-31 18:25:30] [INFO ] Implicit Places using invariants in 253 ms returned []
[2024-05-31 18:25:30] [INFO ] Invariant cache hit.
[2024-05-31 18:25:31] [INFO ] Implicit Places using invariants and state equation in 575 ms returned []
Implicit Place search using SMT with State Equation took 831 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 233/529 places, 561/839 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1253 ms. Remains : 233/529 places, 561/839 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-02a-LTLCardinality-05
Stuttering criterion allowed to conclude after 74 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-02a-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02a-LTLCardinality-05 finished in 1341 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 4 out of 529 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 529/529 places, 839/839 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 528 transition count 739
Reduce places removed 101 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 103 rules applied. Total rules applied 202 place count 427 transition count 737
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 204 place count 425 transition count 737
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 204 place count 425 transition count 670
Deduced a syphon composed of 67 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 3 with 153 rules applied. Total rules applied 357 place count 339 transition count 670
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 18 rules applied. Total rules applied 375 place count 330 transition count 661
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 384 place count 321 transition count 661
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 384 place count 321 transition count 653
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 400 place count 313 transition count 653
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 407 place count 306 transition count 639
Iterating global reduction 5 with 7 rules applied. Total rules applied 414 place count 306 transition count 639
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 5 with 4 rules applied. Total rules applied 418 place count 306 transition count 635
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 419 place count 305 transition count 635
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 419 place count 305 transition count 634
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 421 place count 304 transition count 634
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 424 place count 301 transition count 624
Iterating global reduction 7 with 3 rules applied. Total rules applied 427 place count 301 transition count 624
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 7 with 1 rules applied. Total rules applied 428 place count 301 transition count 623
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 429 place count 300 transition count 623
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 430 place count 299 transition count 615
Iterating global reduction 9 with 1 rules applied. Total rules applied 431 place count 299 transition count 615
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 9 with 60 rules applied. Total rules applied 491 place count 269 transition count 585
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 493 place count 267 transition count 583
Iterating global reduction 9 with 2 rules applied. Total rules applied 495 place count 267 transition count 583
Applied a total of 495 rules in 83 ms. Remains 267 /529 variables (removed 262) and now considering 583/839 (removed 256) transitions.
// Phase 1: matrix 583 rows 267 cols
[2024-05-31 18:25:31] [INFO ] Computed 39 invariants in 5 ms
[2024-05-31 18:25:32] [INFO ] Implicit Places using invariants in 290 ms returned [55, 73, 91, 97, 102, 145, 163, 185, 193, 198, 201, 264]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 303 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 255/529 places, 583/839 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 255 transition count 580
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 8 place count 252 transition count 578
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 11 place count 249 transition count 575
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 249 transition count 575
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 246 transition count 572
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 246 transition count 572
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 245 transition count 571
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 245 transition count 571
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 34 place count 239 transition count 565
Applied a total of 34 rules in 34 ms. Remains 239 /255 variables (removed 16) and now considering 565/583 (removed 18) transitions.
// Phase 1: matrix 565 rows 239 cols
[2024-05-31 18:25:32] [INFO ] Computed 27 invariants in 5 ms
[2024-05-31 18:25:32] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-05-31 18:25:32] [INFO ] Invariant cache hit.
[2024-05-31 18:25:32] [INFO ] Implicit Places using invariants and state equation in 614 ms returned []
Implicit Place search using SMT with State Equation took 874 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 239/529 places, 565/839 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1295 ms. Remains : 239/529 places, 565/839 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ASLink-PT-02a-LTLCardinality-07
Product exploration explored 100000 steps with 2787 reset in 477 ms.
Product exploration explored 100000 steps with 2845 reset in 352 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 174 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 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 5159 steps (120 resets) in 49 ms. (103 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 8 factoid took 290 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 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 565/565 transitions.
Applied a total of 0 rules in 10 ms. Remains 239 /239 variables (removed 0) and now considering 565/565 (removed 0) transitions.
[2024-05-31 18:25:34] [INFO ] Invariant cache hit.
[2024-05-31 18:25:34] [INFO ] Implicit Places using invariants in 245 ms returned []
[2024-05-31 18:25:34] [INFO ] Invariant cache hit.
[2024-05-31 18:25:35] [INFO ] Implicit Places using invariants and state equation in 684 ms returned []
Implicit Place search using SMT with State Equation took 937 ms to find 0 implicit places.
[2024-05-31 18:25:35] [INFO ] Redundant transitions in 35 ms returned []
Running 549 sub problems to find dead transitions.
[2024-05-31 18:25:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 3 (OVERLAPS) 1/239 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 549 unsolved
[2024-05-31 18:25:47] [INFO ] Deduced a trap composed of 83 places in 256 ms of which 27 ms to minimize.
[2024-05-31 18:25:47] [INFO ] Deduced a trap composed of 78 places in 229 ms of which 4 ms to minimize.
[2024-05-31 18:25:48] [INFO ] Deduced a trap composed of 103 places in 228 ms of which 3 ms to minimize.
[2024-05-31 18:25:49] [INFO ] Deduced a trap composed of 91 places in 186 ms of which 3 ms to minimize.
[2024-05-31 18:25:51] [INFO ] Deduced a trap composed of 13 places in 127 ms of which 4 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 7 (OVERLAPS) 565/804 variables, 239/271 constraints. Problems are: Problem set: 0 solved, 549 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 804/804 variables, and 271 constraints, problems are : Problem set: 0 solved, 549 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 549/549 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 549 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/238 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/238 variables, 17/21 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 3 (OVERLAPS) 1/239 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/239 variables, 3/27 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/239 variables, 5/32 constraints. Problems are: Problem set: 0 solved, 549 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/239 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 549 unsolved
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
At refinement iteration 7 (OVERLAPS) 565/804 variables, 239/271 constraints. Problems are: Problem set: 14 solved, 535 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 804/804 variables, and 806 constraints, problems are : Problem set: 14 solved, 535 unsolved in 30104 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 239/239 constraints, PredecessorRefiner: 535/549 constraints, Known Traps: 5/5 constraints]
After SMT, in 60682ms problems are : Problem set: 14 solved, 535 unsolved
Search for dead transitions found 14 dead transitions in 60699ms
Found 14 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 14 transitions
Dead transitions reduction (with SMT) removed 14 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 239/239 places, 551/565 transitions.
Applied a total of 0 rules in 9 ms. Remains 239 /239 variables (removed 0) and now considering 551/551 (removed 0) transitions.
[2024-05-31 18:26:36] [INFO ] Redundant transitions in 14 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 61727 ms. Remains : 239/239 places, 551/565 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 163 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 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 4837 steps (105 resets) in 30 ms. (156 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (OR p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 8 factoid took 276 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 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2889 reset in 171 ms.
Product exploration explored 100000 steps with 2881 reset in 192 ms.
Support contains 4 out of 239 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 239/239 places, 551/551 transitions.
Applied a total of 0 rules in 7 ms. Remains 239 /239 variables (removed 0) and now considering 551/551 (removed 0) transitions.
// Phase 1: matrix 551 rows 239 cols
[2024-05-31 18:26:37] [INFO ] Computed 27 invariants in 4 ms
[2024-05-31 18:26:37] [INFO ] Implicit Places using invariants in 303 ms returned []
[2024-05-31 18:26:37] [INFO ] Invariant cache hit.
[2024-05-31 18:26:38] [INFO ] Implicit Places using invariants and state equation in 669 ms returned [145]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 990 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 238/239 places, 551/551 transitions.
Applied a total of 0 rules in 7 ms. Remains 238 /238 variables (removed 0) and now considering 551/551 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1004 ms. Remains : 238/239 places, 551/551 transitions.
Treatment of property ASLink-PT-02a-LTLCardinality-07 finished in 66978 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(!p0))))'
Support contains 2 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 839/839 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 526 transition count 829
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 526 transition count 829
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 523 transition count 819
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 523 transition count 819
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 520 transition count 809
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 520 transition count 809
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 519 transition count 808
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 519 transition count 808
Applied a total of 20 rules in 40 ms. Remains 519 /529 variables (removed 10) and now considering 808/839 (removed 31) transitions.
// Phase 1: matrix 808 rows 519 cols
[2024-05-31 18:26:38] [INFO ] Computed 69 invariants in 7 ms
[2024-05-31 18:26:39] [INFO ] Implicit Places using invariants in 409 ms returned [63, 245]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 411 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 517/529 places, 808/839 transitions.
Applied a total of 0 rules in 8 ms. Remains 517 /517 variables (removed 0) and now considering 808/808 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 460 ms. Remains : 517/529 places, 808/839 transitions.
Stuttering acceptance computed with spot in 99 ms :[p0, p0, p0]
Running random walk in product with property : ASLink-PT-02a-LTLCardinality-09
Stuttering criterion allowed to conclude after 171 steps with 1 reset in 1 ms.
FORMULA ASLink-PT-02a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02a-LTLCardinality-09 finished in 579 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&X((!p0||X(F((!p0&&F(p1))))))))))'
Support contains 1 out of 529 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 839/839 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 527 transition count 830
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 527 transition count 830
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 525 transition count 821
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 525 transition count 821
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 523 transition count 812
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 523 transition count 812
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 522 transition count 811
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 522 transition count 811
Applied a total of 14 rules in 41 ms. Remains 522 /529 variables (removed 7) and now considering 811/839 (removed 28) transitions.
// Phase 1: matrix 811 rows 522 cols
[2024-05-31 18:26:39] [INFO ] Computed 69 invariants in 7 ms
[2024-05-31 18:26:39] [INFO ] Implicit Places using invariants in 470 ms returned [63, 245]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 472 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 520/529 places, 811/839 transitions.
Applied a total of 0 rules in 8 ms. Remains 520 /520 variables (removed 0) and now considering 811/811 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 521 ms. Remains : 520/529 places, 811/839 transitions.
Stuttering acceptance computed with spot in 98 ms :[p0, true, true]
Running random walk in product with property : ASLink-PT-02a-LTLCardinality-10
Stuttering criterion allowed to conclude after 42 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-02a-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02a-LTLCardinality-10 finished in 639 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 529 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 529/529 places, 839/839 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 101 transitions
Trivial Post-agglo rules discarded 101 transitions
Performed 101 trivial Post agglomeration. Transition count delta: 101
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 528 transition count 737
Reduce places removed 103 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 105 rules applied. Total rules applied 206 place count 425 transition count 735
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 208 place count 423 transition count 735
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 68 Pre rules applied. Total rules applied 208 place count 423 transition count 667
Deduced a syphon composed of 68 places in 0 ms
Ensure Unique test removed 21 places
Reduce places removed 89 places and 0 transitions.
Iterating global reduction 3 with 157 rules applied. Total rules applied 365 place count 334 transition count 667
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 18 rules applied. Total rules applied 383 place count 325 transition count 658
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 392 place count 316 transition count 658
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 9 Pre rules applied. Total rules applied 392 place count 316 transition count 649
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 5 with 18 rules applied. Total rules applied 410 place count 307 transition count 649
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 417 place count 300 transition count 635
Iterating global reduction 5 with 7 rules applied. Total rules applied 424 place count 300 transition count 635
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 5 with 4 rules applied. Total rules applied 428 place count 300 transition count 631
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 429 place count 299 transition count 631
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 429 place count 299 transition count 630
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 431 place count 298 transition count 630
Discarding 3 places :
Symmetric choice reduction at 7 with 3 rule applications. Total rules 434 place count 295 transition count 620
Iterating global reduction 7 with 3 rules applied. Total rules applied 437 place count 295 transition count 620
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 7 with 1 rules applied. Total rules applied 438 place count 295 transition count 619
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 439 place count 294 transition count 619
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 440 place count 293 transition count 611
Iterating global reduction 9 with 1 rules applied. Total rules applied 441 place count 293 transition count 611
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 9 with 58 rules applied. Total rules applied 499 place count 264 transition count 582
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 501 place count 262 transition count 580
Iterating global reduction 9 with 2 rules applied. Total rules applied 503 place count 262 transition count 580
Applied a total of 503 rules in 73 ms. Remains 262 /529 variables (removed 267) and now considering 580/839 (removed 259) transitions.
// Phase 1: matrix 580 rows 262 cols
[2024-05-31 18:26:39] [INFO ] Computed 37 invariants in 4 ms
[2024-05-31 18:26:40] [INFO ] Implicit Places using invariants in 298 ms returned [55, 73, 92, 98, 103, 146, 164, 182, 188, 193, 196, 259]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 300 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 250/529 places, 580/839 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 250 transition count 577
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 8 place count 247 transition count 575
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 11 place count 244 transition count 572
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 244 transition count 572
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 241 transition count 569
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 241 transition count 569
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 240 transition count 568
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 240 transition count 568
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 34 place count 234 transition count 562
Applied a total of 34 rules in 26 ms. Remains 234 /250 variables (removed 16) and now considering 562/580 (removed 18) transitions.
// Phase 1: matrix 562 rows 234 cols
[2024-05-31 18:26:40] [INFO ] Computed 25 invariants in 5 ms
[2024-05-31 18:26:40] [INFO ] Implicit Places using invariants in 248 ms returned []
[2024-05-31 18:26:40] [INFO ] Invariant cache hit.
[2024-05-31 18:26:41] [INFO ] Implicit Places using invariants and state equation in 582 ms returned []
Implicit Place search using SMT with State Equation took 834 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 234/529 places, 562/839 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1235 ms. Remains : 234/529 places, 562/839 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : ASLink-PT-02a-LTLCardinality-12
Product exploration explored 100000 steps with 2277 reset in 337 ms.
Product exploration explored 100000 steps with 2224 reset in 448 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 1757 steps (42 resets) in 9 ms. (175 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 98 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Support contains 2 out of 234 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 234/234 places, 562/562 transitions.
Applied a total of 0 rules in 7 ms. Remains 234 /234 variables (removed 0) and now considering 562/562 (removed 0) transitions.
[2024-05-31 18:26:42] [INFO ] Invariant cache hit.
[2024-05-31 18:26:42] [INFO ] Implicit Places using invariants in 270 ms returned []
[2024-05-31 18:26:42] [INFO ] Invariant cache hit.
[2024-05-31 18:26:43] [INFO ] Implicit Places using invariants and state equation in 589 ms returned []
Implicit Place search using SMT with State Equation took 865 ms to find 0 implicit places.
[2024-05-31 18:26:43] [INFO ] Redundant transitions in 7 ms returned []
Running 546 sub problems to find dead transitions.
[2024-05-31 18:26:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/233 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 3 (OVERLAPS) 1/234 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 546 unsolved
[2024-05-31 18:26:57] [INFO ] Deduced a trap composed of 13 places in 131 ms of which 4 ms to minimize.
[2024-05-31 18:26:58] [INFO ] Deduced a trap composed of 83 places in 200 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 546 unsolved
[2024-05-31 18:27:00] [INFO ] Deduced a trap composed of 95 places in 204 ms of which 3 ms to minimize.
[2024-05-31 18:27:00] [INFO ] Deduced a trap composed of 97 places in 194 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 2/29 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/234 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 8 (OVERLAPS) 562/796 variables, 234/263 constraints. Problems are: Problem set: 0 solved, 546 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 796/796 variables, and 263 constraints, problems are : Problem set: 0 solved, 546 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 546/546 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 546 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/233 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/233 variables, 15/19 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/233 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 3 (OVERLAPS) 1/234 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/234 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/234 variables, 4/29 constraints. Problems are: Problem set: 0 solved, 546 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/234 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 546 unsolved
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
At refinement iteration 7 (OVERLAPS) 562/796 variables, 234/263 constraints. Problems are: Problem set: 80 solved, 466 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 796/796 variables, and 729 constraints, problems are : Problem set: 80 solved, 466 unsolved in 30076 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 234/234 constraints, PredecessorRefiner: 466/546 constraints, Known Traps: 4/4 constraints]
After SMT, in 60407ms problems are : Problem set: 80 solved, 466 unsolved
Search for dead transitions found 80 dead transitions in 60415ms
Found 80 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 80 transitions
Dead transitions reduction (with SMT) removed 80 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 234/234 places, 482/562 transitions.
Applied a total of 0 rules in 6 ms. Remains 234 /234 variables (removed 0) and now considering 482/482 (removed 0) transitions.
[2024-05-31 18:27:43] [INFO ] Redundant transitions in 5 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 61322 ms. Remains : 234/234 places, 482/562 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 4030 steps (90 resets) in 16 ms. (237 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 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2186 reset in 171 ms.
Stack based approach found an accepted trace after 63557 steps with 1354 reset with depth 13 and stack size 13 in 121 ms.
FORMULA ASLink-PT-02a-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ASLink-PT-02a-LTLCardinality-12 finished in 64353 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)||(!p0&&F(!p1))) U (p2&&X(!p0))))'
Support contains 5 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 839/839 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 527 transition count 837
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 527 transition count 837
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 525 transition count 835
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 525 transition count 835
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 523 transition count 833
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 523 transition count 833
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 522 transition count 832
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 522 transition count 832
Applied a total of 14 rules in 38 ms. Remains 522 /529 variables (removed 7) and now considering 832/839 (removed 7) transitions.
// Phase 1: matrix 832 rows 522 cols
[2024-05-31 18:27:44] [INFO ] Computed 69 invariants in 7 ms
[2024-05-31 18:27:44] [INFO ] Implicit Places using invariants in 484 ms returned [63]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 486 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 521/529 places, 832/839 transitions.
Applied a total of 0 rules in 7 ms. Remains 521 /521 variables (removed 0) and now considering 832/832 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 533 ms. Remains : 521/529 places, 832/839 transitions.
Stuttering acceptance computed with spot in 279 ms :[(OR (NOT p2) p0), true, p0, (AND p1 p0), p0, (AND p1 p0), p1]
Running random walk in product with property : ASLink-PT-02a-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-02a-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-02a-LTLCardinality-13 finished in 836 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 529 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 529/529 places, 839/839 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 528 transition count 739
Reduce places removed 101 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 103 rules applied. Total rules applied 202 place count 427 transition count 737
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 206 place count 425 transition count 735
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 208 place count 423 transition count 735
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 67 Pre rules applied. Total rules applied 208 place count 423 transition count 668
Deduced a syphon composed of 67 places in 1 ms
Ensure Unique test removed 19 places
Reduce places removed 86 places and 0 transitions.
Iterating global reduction 4 with 153 rules applied. Total rules applied 361 place count 337 transition count 668
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 4 with 18 rules applied. Total rules applied 379 place count 328 transition count 659
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 388 place count 319 transition count 659
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 7 Pre rules applied. Total rules applied 388 place count 319 transition count 652
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 402 place count 312 transition count 652
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 409 place count 305 transition count 638
Iterating global reduction 6 with 7 rules applied. Total rules applied 416 place count 305 transition count 638
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 6 with 4 rules applied. Total rules applied 420 place count 305 transition count 634
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 421 place count 304 transition count 634
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 421 place count 304 transition count 633
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 423 place count 303 transition count 633
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 426 place count 300 transition count 623
Iterating global reduction 8 with 3 rules applied. Total rules applied 429 place count 300 transition count 623
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 8 with 1 rules applied. Total rules applied 430 place count 300 transition count 622
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 431 place count 299 transition count 622
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 432 place count 298 transition count 614
Iterating global reduction 10 with 1 rules applied. Total rules applied 433 place count 298 transition count 614
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 10 with 58 rules applied. Total rules applied 491 place count 269 transition count 585
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 493 place count 267 transition count 583
Iterating global reduction 10 with 2 rules applied. Total rules applied 495 place count 267 transition count 583
Applied a total of 495 rules in 68 ms. Remains 267 /529 variables (removed 262) and now considering 583/839 (removed 256) transitions.
// Phase 1: matrix 583 rows 267 cols
[2024-05-31 18:27:45] [INFO ] Computed 39 invariants in 5 ms
[2024-05-31 18:27:45] [INFO ] Implicit Places using invariants in 282 ms returned [55, 73, 91, 97, 102, 145, 163, 174, 184, 190, 198, 201, 264]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 284 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 254/529 places, 583/839 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 254 transition count 580
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 8 place count 251 transition count 578
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 11 place count 248 transition count 575
Iterating global reduction 2 with 3 rules applied. Total rules applied 14 place count 248 transition count 575
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 245 transition count 572
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 245 transition count 572
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 22 place count 243 transition count 570
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 243 transition count 570
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 36 place count 237 transition count 564
Applied a total of 36 rules in 24 ms. Remains 237 /254 variables (removed 17) and now considering 564/583 (removed 19) transitions.
// Phase 1: matrix 564 rows 237 cols
[2024-05-31 18:27:45] [INFO ] Computed 26 invariants in 4 ms
[2024-05-31 18:27:45] [INFO ] Implicit Places using invariants in 318 ms returned []
[2024-05-31 18:27:45] [INFO ] Invariant cache hit.
[2024-05-31 18:27:46] [INFO ] Implicit Places using invariants and state equation in 662 ms returned []
Implicit Place search using SMT with State Equation took 982 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 237/529 places, 564/839 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1359 ms. Remains : 237/529 places, 564/839 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-02a-LTLCardinality-14
Product exploration explored 100000 steps with 2520 reset in 244 ms.
Product exploration explored 100000 steps with 2467 reset in 339 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 116 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 482 steps (9 resets) in 5 ms. (80 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 137 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 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 237 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 237/237 places, 564/564 transitions.
Applied a total of 0 rules in 7 ms. Remains 237 /237 variables (removed 0) and now considering 564/564 (removed 0) transitions.
[2024-05-31 18:27:47] [INFO ] Invariant cache hit.
[2024-05-31 18:27:47] [INFO ] Implicit Places using invariants in 297 ms returned []
[2024-05-31 18:27:47] [INFO ] Invariant cache hit.
[2024-05-31 18:27:48] [INFO ] Implicit Places using invariants and state equation in 643 ms returned []
Implicit Place search using SMT with State Equation took 950 ms to find 0 implicit places.
[2024-05-31 18:27:48] [INFO ] Redundant transitions in 5 ms returned []
Running 548 sub problems to find dead transitions.
[2024-05-31 18:27:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (OVERLAPS) 1/237 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 548 unsolved
[2024-05-31 18:28:00] [INFO ] Deduced a trap composed of 80 places in 200 ms of which 3 ms to minimize.
[2024-05-31 18:28:00] [INFO ] Deduced a trap composed of 77 places in 185 ms of which 3 ms to minimize.
[2024-05-31 18:28:02] [INFO ] Deduced a trap composed of 13 places in 80 ms of which 2 ms to minimize.
[2024-05-31 18:28:05] [INFO ] Deduced a trap composed of 97 places in 175 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 4/30 constraints. Problems are: Problem set: 0 solved, 548 unsolved
[2024-05-31 18:28:06] [INFO ] Deduced a trap composed of 91 places in 223 ms of which 2 ms to minimize.
[2024-05-31 18:28:07] [INFO ] Deduced a trap composed of 105 places in 190 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 2/32 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/237 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 801/801 variables, and 269 constraints, problems are : Problem set: 0 solved, 548 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 548/548 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 548 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 16/20 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 3 (OVERLAPS) 1/237 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/237 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/237 variables, 6/32 constraints. Problems are: Problem set: 0 solved, 548 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/237 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 548 unsolved
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD391 is UNSAT
At refinement iteration 7 (OVERLAPS) 564/801 variables, 237/269 constraints. Problems are: Problem set: 296 solved, 252 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 801/801 variables, and 521 constraints, problems are : Problem set: 296 solved, 252 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 19/19 constraints, State Equation: 237/237 constraints, PredecessorRefiner: 252/548 constraints, Known Traps: 6/6 constraints]
After SMT, in 60371ms problems are : Problem set: 296 solved, 252 unsolved
Search for dead transitions found 296 dead transitions in 60379ms
Found 296 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 296 transitions
Dead transitions reduction (with SMT) removed 296 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 237/237 places, 268/564 transitions.
Discarding 16 places :
Implicit places reduction removed 16 places
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 221 transition count 268
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 16 Pre rules applied. Total rules applied 16 place count 221 transition count 252
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 1 with 32 rules applied. Total rules applied 48 place count 205 transition count 252
Applied a total of 48 rules in 12 ms. Remains 205 /237 variables (removed 32) and now considering 252/268 (removed 16) transitions.
// Phase 1: matrix 252 rows 205 cols
[2024-05-31 18:28:48] [INFO ] Computed 24 invariants in 2 ms
[2024-05-31 18:28:49] [INFO ] Implicit Places using invariants in 259 ms returned []
[2024-05-31 18:28:49] [INFO ] Invariant cache hit.
[2024-05-31 18:28:49] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 18:28:49] [INFO ] Implicit Places using invariants and state equation in 568 ms returned [75, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168]
Discarding 12 places :
Implicit Place search using SMT with State Equation took 829 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 193/237 places, 252/564 transitions.
Applied a total of 0 rules in 4 ms. Remains 193 /193 variables (removed 0) and now considering 252/252 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 62194 ms. Remains : 193/237 places, 252/564 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 119 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 70 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 188 steps (7 resets) in 4 ms. (37 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 133 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 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2437 reset in 146 ms.
Product exploration explored 100000 steps with 2499 reset in 166 ms.
Support contains 2 out of 193 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 193/193 places, 252/252 transitions.
Applied a total of 0 rules in 3 ms. Remains 193 /193 variables (removed 0) and now considering 252/252 (removed 0) transitions.
// Phase 1: matrix 252 rows 193 cols
[2024-05-31 18:28:50] [INFO ] Computed 21 invariants in 2 ms
[2024-05-31 18:28:50] [INFO ] Implicit Places using invariants in 221 ms returned []
[2024-05-31 18:28:50] [INFO ] Invariant cache hit.
[2024-05-31 18:28:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 18:28:51] [INFO ] Implicit Places using invariants and state equation in 528 ms returned []
Implicit Place search using SMT with State Equation took 751 ms to find 0 implicit places.
[2024-05-31 18:28:51] [INFO ] Redundant transitions in 1 ms returned []
Running 236 sub problems to find dead transitions.
[2024-05-31 18:28:51] [INFO ] Invariant cache hit.
[2024-05-31 18:28:51] [INFO ] State equation strengthened by 2 read => feed constraints.
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 4/4 constraints. Problems are: Problem set: 14 solved, 222 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 11/15 constraints. Problems are: Problem set: 14 solved, 222 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 0/15 constraints. Problems are: Problem set: 14 solved, 222 unsolved
At refinement iteration 3 (OVERLAPS) 1/193 variables, 3/18 constraints. Problems are: Problem set: 14 solved, 222 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 3/21 constraints. Problems are: Problem set: 14 solved, 222 unsolved
[2024-05-31 18:28:55] [INFO ] Deduced a trap composed of 13 places in 26 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 1/22 constraints. Problems are: Problem set: 14 solved, 222 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/22 constraints. Problems are: Problem set: 14 solved, 222 unsolved
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
At refinement iteration 7 (OVERLAPS) 252/445 variables, 193/215 constraints. Problems are: Problem set: 32 solved, 204 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/445 variables, 2/217 constraints. Problems are: Problem set: 32 solved, 204 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/445 variables, 0/217 constraints. Problems are: Problem set: 32 solved, 204 unsolved
At refinement iteration 10 (OVERLAPS) 0/445 variables, 0/217 constraints. Problems are: Problem set: 32 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Real declared 445/445 variables, and 217 constraints, problems are : Problem set: 32 solved, 204 unsolved in 11774 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 193/193 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 236/236 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 32 solved, 204 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/192 variables, 4/4 constraints. Problems are: Problem set: 32 solved, 204 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/192 variables, 11/15 constraints. Problems are: Problem set: 32 solved, 204 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/192 variables, 0/15 constraints. Problems are: Problem set: 32 solved, 204 unsolved
At refinement iteration 3 (OVERLAPS) 1/193 variables, 3/18 constraints. Problems are: Problem set: 32 solved, 204 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 3/21 constraints. Problems are: Problem set: 32 solved, 204 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/193 variables, 1/22 constraints. Problems are: Problem set: 32 solved, 204 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/193 variables, 0/22 constraints. Problems are: Problem set: 32 solved, 204 unsolved
At refinement iteration 7 (OVERLAPS) 252/445 variables, 193/215 constraints. Problems are: Problem set: 32 solved, 204 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/445 variables, 2/217 constraints. Problems are: Problem set: 32 solved, 204 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/445 variables, 204/421 constraints. Problems are: Problem set: 32 solved, 204 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/445 variables, 0/421 constraints. Problems are: Problem set: 32 solved, 204 unsolved
At refinement iteration 11 (OVERLAPS) 0/445 variables, 0/421 constraints. Problems are: Problem set: 32 solved, 204 unsolved
No progress, stopping.
After SMT solving in domain Int declared 445/445 variables, and 421 constraints, problems are : Problem set: 32 solved, 204 unsolved in 16615 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 193/193 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 204/236 constraints, Known Traps: 1/1 constraints]
After SMT, in 28478ms problems are : Problem set: 32 solved, 204 unsolved
Search for dead transitions found 32 dead transitions in 28481ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 193/193 places, 220/252 transitions.
Ensure Unique test removed 14 places
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 14 place count 179 transition count 206
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 165 transition count 206
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 28 place count 165 transition count 200
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 40 place count 159 transition count 200
Applied a total of 40 rules in 6 ms. Remains 159 /193 variables (removed 34) and now considering 200/220 (removed 20) transitions.
// Phase 1: matrix 200 rows 159 cols
[2024-05-31 18:29:19] [INFO ] Computed 22 invariants in 2 ms
[2024-05-31 18:29:19] [INFO ] Implicit Places using invariants in 172 ms returned []
[2024-05-31 18:29:19] [INFO ] Invariant cache hit.
[2024-05-31 18:29:20] [INFO ] Implicit Places using invariants and state equation in 324 ms returned [53, 121, 122]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 498 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 156/193 places, 200/252 transitions.
Applied a total of 0 rules in 3 ms. Remains 156 /156 variables (removed 0) and now considering 200/200 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 29748 ms. Remains : 156/193 places, 200/252 transitions.
Treatment of property ASLink-PT-02a-LTLCardinality-14 finished in 95364 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0&&X(p0)))||G(p1))))'
Support contains 3 out of 529 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 529/529 places, 839/839 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 99 rules applied. Total rules applied 99 place count 528 transition count 739
Reduce places removed 101 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 103 rules applied. Total rules applied 202 place count 427 transition count 737
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 205 place count 425 transition count 736
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 206 place count 424 transition count 736
Performed 69 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 69 Pre rules applied. Total rules applied 206 place count 424 transition count 667
Deduced a syphon composed of 69 places in 1 ms
Ensure Unique test removed 21 places
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 4 with 159 rules applied. Total rules applied 365 place count 334 transition count 667
Discarding 9 places :
Implicit places reduction removed 9 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 4 with 18 rules applied. Total rules applied 383 place count 325 transition count 658
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 5 with 9 rules applied. Total rules applied 392 place count 316 transition count 658
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 9 Pre rules applied. Total rules applied 392 place count 316 transition count 649
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 6 with 18 rules applied. Total rules applied 410 place count 307 transition count 649
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 416 place count 301 transition count 636
Iterating global reduction 6 with 6 rules applied. Total rules applied 422 place count 301 transition count 636
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 6 with 4 rules applied. Total rules applied 426 place count 301 transition count 632
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 427 place count 300 transition count 632
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 427 place count 300 transition count 631
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 429 place count 299 transition count 631
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 431 place count 297 transition count 622
Iterating global reduction 8 with 2 rules applied. Total rules applied 433 place count 297 transition count 622
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 8 with 1 rules applied. Total rules applied 434 place count 297 transition count 621
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 435 place count 296 transition count 621
Discarding 1 places :
Symmetric choice reduction at 10 with 1 rule applications. Total rules 436 place count 295 transition count 613
Iterating global reduction 10 with 1 rules applied. Total rules applied 437 place count 295 transition count 613
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 10 with 58 rules applied. Total rules applied 495 place count 266 transition count 584
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 497 place count 264 transition count 582
Iterating global reduction 10 with 2 rules applied. Total rules applied 499 place count 264 transition count 582
Applied a total of 499 rules in 67 ms. Remains 264 /529 variables (removed 265) and now considering 582/839 (removed 257) transitions.
// Phase 1: matrix 582 rows 264 cols
[2024-05-31 18:29:20] [INFO ] Computed 37 invariants in 8 ms
[2024-05-31 18:29:20] [INFO ] Implicit Places using invariants in 435 ms returned [55, 73, 91, 97, 102, 145, 163, 181, 188, 193, 196, 261]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 436 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 252/529 places, 582/839 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 252 transition count 579
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 8 place count 249 transition count 577
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 12 place count 245 transition count 573
Iterating global reduction 2 with 4 rules applied. Total rules applied 16 place count 245 transition count 573
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 20 place count 241 transition count 569
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 241 transition count 569
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 26 place count 239 transition count 567
Iterating global reduction 2 with 2 rules applied. Total rules applied 28 place count 239 transition count 567
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 40 place count 233 transition count 561
Applied a total of 40 rules in 25 ms. Remains 233 /252 variables (removed 19) and now considering 561/582 (removed 21) transitions.
// Phase 1: matrix 561 rows 233 cols
[2024-05-31 18:29:20] [INFO ] Computed 25 invariants in 4 ms
[2024-05-31 18:29:21] [INFO ] Implicit Places using invariants in 310 ms returned []
[2024-05-31 18:29:21] [INFO ] Invariant cache hit.
[2024-05-31 18:29:21] [INFO ] Implicit Places using invariants and state equation in 552 ms returned []
Implicit Place search using SMT with State Equation took 864 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 233/529 places, 561/839 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1393 ms. Remains : 233/529 places, 561/839 transitions.
Stuttering acceptance computed with spot in 38 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-02a-LTLCardinality-15
Product exploration explored 100000 steps with 2233 reset in 202 ms.
Stack based approach found an accepted trace after 12861 steps with 290 reset with depth 32 and stack size 32 in 27 ms.
FORMULA ASLink-PT-02a-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ASLink-PT-02a-LTLCardinality-15 finished in 1690 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
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)))'
[2024-05-31 18:29:22] [INFO ] Flatten gal took : 57 ms
[2024-05-31 18:29:22] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-05-31 18:29:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 529 places, 839 transitions and 2944 arcs took 15 ms.
Total runtime 242436 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA ASLink-PT-02a-LTLCardinality-07 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ASLink-PT-02a-LTLCardinality-14 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717181982867

--------------------
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 ASLink-PT-02a-LTLCardinality-07
ltl formula formula --ltl=/tmp/1170/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 529 places, 839 transitions and 2944 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.100 real 0.030 user 0.030 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1170/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1170/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1170/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1170/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 530 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 530, there are 896 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): ~187 levels ~10000 states ~23712 transitions
pnml2lts-mc( 0/ 4): ~168 levels ~20000 states ~39684 transitions
pnml2lts-mc( 3/ 4): ~187 levels ~40000 states ~121008 transitions
pnml2lts-mc( 1/ 4): ~186 levels ~80000 states ~172684 transitions
pnml2lts-mc( 1/ 4): ~186 levels ~160000 states ~362708 transitions
pnml2lts-mc( 1/ 4): ~186 levels ~320000 states ~790412 transitions
pnml2lts-mc( 1/ 4): ~186 levels ~640000 states ~1665408 transitions
pnml2lts-mc( 1/ 4): ~1445 levels ~1280000 states ~3500340 transitions
pnml2lts-mc( 1/ 4): ~1445 levels ~2560000 states ~7491556 transitions
pnml2lts-mc( 0/ 4): ~56726 levels ~5120000 states ~14709624 transitions
pnml2lts-mc( 0/ 4): ~63326 levels ~10240000 states ~31079576 transitions
pnml2lts-mc( 0/ 4): ~68182 levels ~20480000 states ~69665396 transitions
pnml2lts-mc( 2/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33310579
pnml2lts-mc( 0/ 4): unique states count: 33468749
pnml2lts-mc( 0/ 4): unique transitions count: 135599978
pnml2lts-mc( 0/ 4): - self-loop count: 3580
pnml2lts-mc( 0/ 4): - claim dead count: 101920271
pnml2lts-mc( 0/ 4): - claim found count: 114052
pnml2lts-mc( 0/ 4): - claim success count: 33468980
pnml2lts-mc( 0/ 4): - cum. max stack depth: 105050
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33468997 states 135600930 transitions, fanout: 4.052
pnml2lts-mc( 0/ 4): Total exploration time 996.220 sec (996.180 sec minimum, 996.202 sec on average)
pnml2lts-mc( 0/ 4): States per second: 33596, Transitions per second: 136115
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 270.3MB, 8.4 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/22.0%
pnml2lts-mc( 0/ 4): Stored 851 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 270.3MB (~256.0MB paged-in)
ltl formula name ASLink-PT-02a-LTLCardinality-14
ltl formula formula --ltl=/tmp/1170/ltl_1_
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 529 places, 839 transitions and 2944 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.370 real 0.040 user 0.070 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1170/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1170/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1170/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1170/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 531 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 530, there are 848 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): ~208 levels ~10000 states ~36952 transitions
pnml2lts-mc( 2/ 4): ~208 levels ~20000 states ~74496 transitions
pnml2lts-mc( 2/ 4): ~208 levels ~40000 states ~152568 transitions
pnml2lts-mc( 2/ 4): ~208 levels ~80000 states ~305708 transitions
pnml2lts-mc( 2/ 4): ~208 levels ~160000 states ~631248 transitions
pnml2lts-mc( 3/ 4): ~546 levels ~320000 states ~1567900 transitions
pnml2lts-mc( 3/ 4): ~546 levels ~640000 states ~3355440 transitions
pnml2lts-mc( 3/ 4): ~546 levels ~1280000 states ~6822128 transitions
pnml2lts-mc( 3/ 4): ~546 levels ~2560000 states ~14250420 transitions
pnml2lts-mc( 0/ 4): ~23083 levels ~5120000 states ~20253332 transitions
pnml2lts-mc( 2/ 4): ~219 levels ~10240000 states ~59363760 transitions
pnml2lts-mc( 2/ 4): ~219 levels ~20480000 states ~120259192 transitions
pnml2lts-mc( 1/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 33437780
pnml2lts-mc( 0/ 4): unique states count: 33491041
pnml2lts-mc( 0/ 4): unique transitions count: 200686645
pnml2lts-mc( 0/ 4): - self-loop count: 1766
pnml2lts-mc( 0/ 4): - claim dead count: 167096107
pnml2lts-mc( 0/ 4): - claim found count: 32075
pnml2lts-mc( 0/ 4): - claim success count: 33491393
pnml2lts-mc( 0/ 4): - cum. max stack depth: 41655
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33491393 states 200688486 transitions, fanout: 5.992
pnml2lts-mc( 0/ 4): Total exploration time 822.360 sec (822.330 sec minimum, 822.343 sec on average)
pnml2lts-mc( 0/ 4): States per second: 40726, Transitions per second: 244040
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 258.8MB, 8.1 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/4.0%
pnml2lts-mc( 0/ 4): Stored 851 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 258.8MB (~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="ASLink-PT-02a"
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 ASLink-PT-02a, 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 r464-smll-171620117700027"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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