fond
Model Checking Contest 2022
12th edition, Bergen, Norway, June 21, 2022
Execution of r060-tall-165254771700171
Last Updated
Jun 22, 2022

About the Execution of ITS-Tools for DLCround-PT-06b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
804.899 40642.00 69707.00 531.50 TFFFFFTTTTTFFTFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2022-input.r060-tall-165254771700171.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
Executing tool itstools
Input is DLCround-PT-06b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r060-tall-165254771700171
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 7.2K Apr 30 07:32 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K Apr 30 07:32 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Apr 30 07:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Apr 30 07:31 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 10 09:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 10 09:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 9 07:27 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 9 07:27 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 9 07:27 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 9 07:27 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 9 07:27 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 9 07:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:33 equiv_col
-rw-r--r-- 1 mcc users 4 May 10 09:33 instance
-rw-r--r-- 1 mcc users 6 May 10 09:33 iscolored
-rw-r--r-- 1 mcc users 813K May 10 09:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1652570908735

Running Version 202205111006
[2022-05-14 23:28:29] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-14 23:28:29] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-14 23:28:30] [INFO ] Load time of PNML (sax parser for PT used): 192 ms
[2022-05-14 23:28:30] [INFO ] Transformed 2340 places.
[2022-05-14 23:28:30] [INFO ] Transformed 3456 transitions.
[2022-05-14 23:28:30] [INFO ] Found NUPN structural information;
[2022-05-14 23:28:30] [INFO ] Parsed PT model containing 2340 places and 3456 transitions in 333 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA DLCround-PT-06b-LTLCardinality-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06b-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06b-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06b-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06b-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DLCround-PT-06b-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 24 out of 2340 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2340/2340 places, 3456/3456 transitions.
Discarding 405 places :
Symmetric choice reduction at 0 with 405 rule applications. Total rules 405 place count 1935 transition count 3051
Iterating global reduction 0 with 405 rules applied. Total rules applied 810 place count 1935 transition count 3051
Discarding 314 places :
Symmetric choice reduction at 0 with 314 rule applications. Total rules 1124 place count 1621 transition count 2737
Iterating global reduction 0 with 314 rules applied. Total rules applied 1438 place count 1621 transition count 2737
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 1445 place count 1621 transition count 2730
Discarding 54 places :
Symmetric choice reduction at 1 with 54 rule applications. Total rules 1499 place count 1567 transition count 2619
Iterating global reduction 1 with 54 rules applied. Total rules applied 1553 place count 1567 transition count 2619
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 1587 place count 1533 transition count 2585
Iterating global reduction 1 with 34 rules applied. Total rules applied 1621 place count 1533 transition count 2585
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 1624 place count 1533 transition count 2582
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 1643 place count 1514 transition count 2563
Iterating global reduction 2 with 19 rules applied. Total rules applied 1662 place count 1514 transition count 2563
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 1680 place count 1496 transition count 2545
Iterating global reduction 2 with 18 rules applied. Total rules applied 1698 place count 1496 transition count 2545
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 1716 place count 1478 transition count 2527
Iterating global reduction 2 with 18 rules applied. Total rules applied 1734 place count 1478 transition count 2527
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 1746 place count 1466 transition count 2515
Iterating global reduction 2 with 12 rules applied. Total rules applied 1758 place count 1466 transition count 2515
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1766 place count 1458 transition count 2507
Iterating global reduction 2 with 8 rules applied. Total rules applied 1774 place count 1458 transition count 2507
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 1782 place count 1450 transition count 2499
Iterating global reduction 2 with 8 rules applied. Total rules applied 1790 place count 1450 transition count 2499
Applied a total of 1790 rules in 1715 ms. Remains 1450 /2340 variables (removed 890) and now considering 2499/3456 (removed 957) transitions.
// Phase 1: matrix 2499 rows 1450 cols
[2022-05-14 23:28:32] [INFO ] Computed 109 place invariants in 32 ms
[2022-05-14 23:28:32] [INFO ] Implicit Places using invariants in 548 ms returned []
// Phase 1: matrix 2499 rows 1450 cols
[2022-05-14 23:28:32] [INFO ] Computed 109 place invariants in 9 ms
[2022-05-14 23:28:33] [INFO ] Implicit Places using invariants and state equation in 1109 ms returned []
Implicit Place search using SMT with State Equation took 1688 ms to find 0 implicit places.
// Phase 1: matrix 2499 rows 1450 cols
[2022-05-14 23:28:33] [INFO ] Computed 109 place invariants in 12 ms
[2022-05-14 23:28:34] [INFO ] Dead Transitions using invariants and state equation in 1008 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1450/2340 places, 2499/3456 transitions.
Finished structural reductions, in 1 iterations. Remains : 1450/2340 places, 2499/3456 transitions.
Support contains 24 out of 1450 places after structural reductions.
[2022-05-14 23:28:35] [INFO ] Flatten gal took : 178 ms
[2022-05-14 23:28:35] [INFO ] Initial state reduction rules for LTL removed 1 formulas.
FORMULA DLCround-PT-06b-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2022-05-14 23:28:35] [INFO ] Flatten gal took : 107 ms
[2022-05-14 23:28:35] [INFO ] Input system was already deterministic with 2499 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 304 ms. (steps per millisecond=32 ) properties (out of 13) seen :11
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2499 rows 1450 cols
[2022-05-14 23:28:36] [INFO ] Computed 109 place invariants in 8 ms
[2022-05-14 23:28:36] [INFO ] After 225ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-14 23:28:36] [INFO ] [Nat]Absence check using 109 positive place invariants in 57 ms returned sat
[2022-05-14 23:28:37] [INFO ] After 643ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :1
[2022-05-14 23:28:37] [INFO ] After 816ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :1
Attempting to minimize the solution found.
Minimization took 81 ms.
[2022-05-14 23:28:37] [INFO ] After 1262ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :1
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 7 ms.
Support contains 4 out of 1450 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 1450/1450 places, 2499/2499 transitions.
Graph (trivial) has 1310 edges and 1450 vertex of which 385 / 1450 are part of one of the 31 SCC in 6 ms
Free SCC test removed 354 places
Drop transitions removed 403 transitions
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 414 transitions.
Drop transitions removed 229 transitions
Trivial Post-agglo rules discarded 229 transitions
Performed 229 trivial Post agglomeration. Transition count delta: 229
Iterating post reduction 0 with 229 rules applied. Total rules applied 230 place count 1096 transition count 1856
Reduce places removed 229 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 1 with 264 rules applied. Total rules applied 494 place count 867 transition count 1821
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 25 rules applied. Total rules applied 519 place count 844 transition count 1819
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 520 place count 843 transition count 1819
Performed 108 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 108 Pre rules applied. Total rules applied 520 place count 843 transition count 1711
Deduced a syphon composed of 108 places in 4 ms
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 4 with 216 rules applied. Total rules applied 736 place count 735 transition count 1711
Discarding 57 places :
Symmetric choice reduction at 4 with 57 rule applications. Total rules 793 place count 678 transition count 1378
Iterating global reduction 4 with 57 rules applied. Total rules applied 850 place count 678 transition count 1378
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 854 place count 678 transition count 1374
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 7 Pre rules applied. Total rules applied 854 place count 678 transition count 1367
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 868 place count 671 transition count 1367
Performed 251 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 251 places in 1 ms
Reduce places removed 251 places and 0 transitions.
Iterating global reduction 5 with 502 rules applied. Total rules applied 1370 place count 420 transition count 1109
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1377 place count 420 transition count 1102
Discarding 18 places :
Symmetric choice reduction at 6 with 18 rule applications. Total rules 1395 place count 402 transition count 934
Iterating global reduction 6 with 18 rules applied. Total rules applied 1413 place count 402 transition count 934
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 1431 place count 402 transition count 916
Performed 40 Post agglomeration using F-continuation condition with reduction of 21 identical transitions.
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 7 with 80 rules applied. Total rules applied 1511 place count 362 transition count 1240
Drop transitions removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 7 with 29 rules applied. Total rules applied 1540 place count 362 transition count 1211
Discarding 16 places :
Symmetric choice reduction at 8 with 16 rule applications. Total rules 1556 place count 346 transition count 898
Iterating global reduction 8 with 16 rules applied. Total rules applied 1572 place count 346 transition count 898
Ensure Unique test removed 34 transitions
Reduce isomorphic transitions removed 34 transitions.
Iterating post reduction 8 with 34 rules applied. Total rules applied 1606 place count 346 transition count 864
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1608 place count 345 transition count 875
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 9 with 2 rules applied. Total rules applied 1610 place count 345 transition count 873
Drop transitions removed 96 transitions
Redundant transition composition rules discarded 96 transitions
Iterating global reduction 10 with 96 rules applied. Total rules applied 1706 place count 345 transition count 777
Discarding 7 places :
Symmetric choice reduction at 10 with 7 rule applications. Total rules 1713 place count 338 transition count 701
Iterating global reduction 10 with 7 rules applied. Total rules applied 1720 place count 338 transition count 701
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 1727 place count 338 transition count 694
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 8 rules applied. Total rules applied 1735 place count 334 transition count 713
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 1739 place count 334 transition count 709
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 12 with 19 rules applied. Total rules applied 1758 place count 334 transition count 690
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 12 with 8 rules applied. Total rules applied 1766 place count 330 transition count 709
Drop transitions removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 1770 place count 330 transition count 705
Drop transitions removed 19 transitions
Redundant transition composition rules discarded 19 transitions
Iterating global reduction 13 with 19 rules applied. Total rules applied 1789 place count 330 transition count 686
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 1791 place count 329 transition count 688
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 1792 place count 329 transition count 687
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 14 with 2 rules applied. Total rules applied 1794 place count 329 transition count 685
Free-agglomeration rule applied 186 times with reduction of 106 identical transitions.
Iterating global reduction 14 with 186 rules applied. Total rules applied 1980 place count 329 transition count 393
Reduce places removed 186 places and 0 transitions.
Drop transitions removed 221 transitions
Reduce isomorphic transitions removed 221 transitions.
Graph (complete) has 310 edges and 143 vertex of which 44 are kept as prefixes of interest. Removing 99 places using SCC suffix rule.4 ms
Discarding 99 places :
Also discarding 54 output transitions
Drop transitions removed 54 transitions
Iterating post reduction 14 with 408 rules applied. Total rules applied 2388 place count 44 transition count 118
Drop transitions removed 24 transitions
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 38 transitions.
Iterating post reduction 15 with 38 rules applied. Total rules applied 2426 place count 44 transition count 80
Discarding 15 places :
Symmetric choice reduction at 16 with 15 rule applications. Total rules 2441 place count 29 transition count 50
Iterating global reduction 16 with 15 rules applied. Total rules applied 2456 place count 29 transition count 50
Drop transitions removed 7 transitions
Redundant transition composition rules discarded 7 transitions
Iterating global reduction 16 with 7 rules applied. Total rules applied 2463 place count 29 transition count 43
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 16 with 1 rules applied. Total rules applied 2464 place count 29 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 16 with 1 rules applied. Total rules applied 2465 place count 28 transition count 42
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 16 with 3 rules applied. Total rules applied 2468 place count 25 transition count 42
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 17 with 6 rules applied. Total rules applied 2474 place count 22 transition count 39
Drop transitions removed 3 transitions
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 17 with 10 rules applied. Total rules applied 2484 place count 22 transition count 29
Discarding 2 places :
Symmetric choice reduction at 18 with 2 rule applications. Total rules 2486 place count 20 transition count 25
Iterating global reduction 18 with 2 rules applied. Total rules applied 2488 place count 20 transition count 25
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 18 with 3 rules applied. Total rules applied 2491 place count 18 transition count 24
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 3 edges and 18 vertex of which 2 / 18 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 18 with 2 rules applied. Total rules applied 2493 place count 17 transition count 23
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 27 edges and 17 vertex of which 16 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Iterating post reduction 19 with 6 rules applied. Total rules applied 2499 place count 16 transition count 18
Discarding 1 places :
Symmetric choice reduction at 20 with 1 rule applications. Total rules 2500 place count 15 transition count 16
Iterating global reduction 20 with 1 rules applied. Total rules applied 2501 place count 15 transition count 16
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 20 with 2 rules applied. Total rules applied 2503 place count 15 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 2504 place count 14 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 1 Pre rules applied. Total rules applied 2504 place count 14 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 21 with 2 rules applied. Total rules applied 2506 place count 13 transition count 13
Applied a total of 2506 rules in 551 ms. Remains 13 /1450 variables (removed 1437) and now considering 13/2499 (removed 2486) transitions.
Finished structural reductions, in 1 iterations. Remains : 13/1450 places, 13/2499 transitions.
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
Computed a total of 217 stabilizing places and 217 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((F(X(p1))&&p0))||X(p2))))'
Support contains 6 out of 1450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1450/1450 places, 2499/2499 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1441 transition count 2481
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1441 transition count 2481
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 1437 transition count 2477
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 1437 transition count 2477
Applied a total of 26 rules in 104 ms. Remains 1437 /1450 variables (removed 13) and now considering 2477/2499 (removed 22) transitions.
// Phase 1: matrix 2477 rows 1437 cols
[2022-05-14 23:28:38] [INFO ] Computed 109 place invariants in 6 ms
[2022-05-14 23:28:39] [INFO ] Implicit Places using invariants in 590 ms returned []
// Phase 1: matrix 2477 rows 1437 cols
[2022-05-14 23:28:39] [INFO ] Computed 109 place invariants in 6 ms
[2022-05-14 23:28:40] [INFO ] Implicit Places using invariants and state equation in 1116 ms returned []
Implicit Place search using SMT with State Equation took 1707 ms to find 0 implicit places.
// Phase 1: matrix 2477 rows 1437 cols
[2022-05-14 23:28:40] [INFO ] Computed 109 place invariants in 6 ms
[2022-05-14 23:28:41] [INFO ] Dead Transitions using invariants and state equation in 1000 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1437/1450 places, 2477/2499 transitions.
Finished structural reductions, in 1 iterations. Remains : 1437/1450 places, 2477/2499 transitions.
Stuttering acceptance computed with spot in 359 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (NOT p1), (OR (AND (NOT p1) p2) (AND (NOT p0) p2))]
Running random walk in product with property : DLCround-PT-06b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p0) p2), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=5 dest: 4}, { cond=(AND p0 p2), acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (OR (EQ s830 0) (EQ s97 1)) (EQ s589 0) (EQ s1212 1)), p2:(OR (EQ s594 0) (EQ s1092 1)), p1:(OR (EQ s1212 0) (EQ s589 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 63125 steps with 21105 reset in 669 ms.
FORMULA DLCround-PT-06b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLCardinality-01 finished in 3901 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(p0))))'
Support contains 2 out of 1450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1450/1450 places, 2499/2499 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1438 transition count 2478
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1438 transition count 2478
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 30 place count 1432 transition count 2472
Iterating global reduction 0 with 6 rules applied. Total rules applied 36 place count 1432 transition count 2472
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 1431 transition count 2470
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 1431 transition count 2470
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 1430 transition count 2469
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 1430 transition count 2469
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 41 place count 1430 transition count 2468
Applied a total of 41 rules in 160 ms. Remains 1430 /1450 variables (removed 20) and now considering 2468/2499 (removed 31) transitions.
// Phase 1: matrix 2468 rows 1430 cols
[2022-05-14 23:28:42] [INFO ] Computed 109 place invariants in 9 ms
[2022-05-14 23:28:42] [INFO ] Implicit Places using invariants in 366 ms returned []
// Phase 1: matrix 2468 rows 1430 cols
[2022-05-14 23:28:42] [INFO ] Computed 109 place invariants in 8 ms
[2022-05-14 23:28:43] [INFO ] Implicit Places using invariants and state equation in 1073 ms returned []
Implicit Place search using SMT with State Equation took 1441 ms to find 0 implicit places.
// Phase 1: matrix 2468 rows 1430 cols
[2022-05-14 23:28:43] [INFO ] Computed 109 place invariants in 12 ms
[2022-05-14 23:28:44] [INFO ] Dead Transitions using invariants and state equation in 934 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1430/1450 places, 2468/2499 transitions.
Finished structural reductions, in 1 iterations. Remains : 1430/1450 places, 2468/2499 transitions.
Stuttering acceptance computed with spot in 77 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-06b-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (EQ s1393 0) (EQ s656 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 102 steps with 0 reset in 1 ms.
FORMULA DLCround-PT-06b-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLCardinality-05 finished in 2661 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(X(X((G(!p0) U p1))))))'
Support contains 4 out of 1450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1450/1450 places, 2499/2499 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 1441 transition count 2490
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 1441 transition count 2490
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 23 place count 1436 transition count 2485
Iterating global reduction 0 with 5 rules applied. Total rules applied 28 place count 1436 transition count 2485
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 1435 transition count 2483
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 1435 transition count 2483
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1434 transition count 2482
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1434 transition count 2482
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 33 place count 1434 transition count 2481
Applied a total of 33 rules in 166 ms. Remains 1434 /1450 variables (removed 16) and now considering 2481/2499 (removed 18) transitions.
// Phase 1: matrix 2481 rows 1434 cols
[2022-05-14 23:28:45] [INFO ] Computed 109 place invariants in 19 ms
[2022-05-14 23:28:45] [INFO ] Implicit Places using invariants in 347 ms returned []
// Phase 1: matrix 2481 rows 1434 cols
[2022-05-14 23:28:45] [INFO ] Computed 109 place invariants in 7 ms
[2022-05-14 23:28:46] [INFO ] Implicit Places using invariants and state equation in 1093 ms returned []
Implicit Place search using SMT with State Equation took 1442 ms to find 0 implicit places.
// Phase 1: matrix 2481 rows 1434 cols
[2022-05-14 23:28:46] [INFO ] Computed 109 place invariants in 5 ms
[2022-05-14 23:28:47] [INFO ] Dead Transitions using invariants and state equation in 918 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1434/1450 places, 2481/2499 transitions.
Finished structural reductions, in 1 iterations. Remains : 1434/1450 places, 2481/2499 transitions.
Stuttering acceptance computed with spot in 238 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), true, p0, (NOT p1)]
Running random walk in product with property : DLCround-PT-06b-LTLCardinality-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(OR p1 (NOT p0)), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 4}, { cond=(NOT p0), acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p1) p0), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 5}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=6 dest: 6}]], initial=0, aps=[p1:(OR (EQ s961 0) (EQ s1033 1)), p0:(OR (EQ s1192 0) (EQ s408 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 6515 steps with 0 reset in 37 ms.
FORMULA DLCround-PT-06b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLCardinality-11 finished in 2837 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(X(p0))||G(F(p1)))))'
Support contains 3 out of 1450 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1450/1450 places, 2499/2499 transitions.
Graph (trivial) has 1314 edges and 1450 vertex of which 391 / 1450 are part of one of the 32 SCC in 2 ms
Free SCC test removed 359 places
Ensure Unique test removed 388 transitions
Reduce isomorphic transitions removed 388 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 229 transitions
Trivial Post-agglo rules discarded 229 transitions
Performed 229 trivial Post agglomeration. Transition count delta: 229
Iterating post reduction 0 with 229 rules applied. Total rules applied 230 place count 1090 transition count 1881
Reduce places removed 229 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Drop transitions removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 1 with 264 rules applied. Total rules applied 494 place count 861 transition count 1846
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 25 rules applied. Total rules applied 519 place count 838 transition count 1844
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 520 place count 837 transition count 1844
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 107 Pre rules applied. Total rules applied 520 place count 837 transition count 1737
Deduced a syphon composed of 107 places in 4 ms
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 4 with 214 rules applied. Total rules applied 734 place count 730 transition count 1737
Discarding 56 places :
Symmetric choice reduction at 4 with 56 rule applications. Total rules 790 place count 674 transition count 1405
Iterating global reduction 4 with 56 rules applied. Total rules applied 846 place count 674 transition count 1405
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 850 place count 674 transition count 1401
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 6 Pre rules applied. Total rules applied 850 place count 674 transition count 1395
Deduced a syphon composed of 6 places in 7 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 5 with 12 rules applied. Total rules applied 862 place count 668 transition count 1395
Performed 249 Post agglomeration using F-continuation condition with reduction of 7 identical transitions.
Deduced a syphon composed of 249 places in 0 ms
Reduce places removed 249 places and 0 transitions.
Iterating global reduction 5 with 498 rules applied. Total rules applied 1360 place count 419 transition count 1139
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 5 with 7 rules applied. Total rules applied 1367 place count 419 transition count 1132
Discarding 19 places :
Symmetric choice reduction at 6 with 19 rule applications. Total rules 1386 place count 400 transition count 954
Iterating global reduction 6 with 19 rules applied. Total rules applied 1405 place count 400 transition count 954
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 6 with 18 rules applied. Total rules applied 1423 place count 400 transition count 936
Performed 22 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 7 with 44 rules applied. Total rules applied 1467 place count 378 transition count 1112
Discarding 4 places :
Symmetric choice reduction at 7 with 4 rule applications. Total rules 1471 place count 374 transition count 1042
Iterating global reduction 7 with 4 rules applied. Total rules applied 1475 place count 374 transition count 1042
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 7 with 31 rules applied. Total rules applied 1506 place count 374 transition count 1011
Drop transitions removed 44 transitions
Redundant transition composition rules discarded 44 transitions
Iterating global reduction 8 with 44 rules applied. Total rules applied 1550 place count 374 transition count 967
Discarding 14 places :
Symmetric choice reduction at 8 with 14 rule applications. Total rules 1564 place count 360 transition count 939
Iterating global reduction 8 with 14 rules applied. Total rules applied 1578 place count 360 transition count 939
Discarding 14 places :
Symmetric choice reduction at 8 with 14 rule applications. Total rules 1592 place count 346 transition count 793
Iterating global reduction 8 with 14 rules applied. Total rules applied 1606 place count 346 transition count 793
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 8 with 14 rules applied. Total rules applied 1620 place count 346 transition count 779
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 9 with 1 rules applied. Total rules applied 1621 place count 345 transition count 778
Applied a total of 1621 rules in 284 ms. Remains 345 /1450 variables (removed 1105) and now considering 778/2499 (removed 1721) transitions.
[2022-05-14 23:28:48] [INFO ] Flow matrix only has 738 transitions (discarded 40 similar events)
// Phase 1: matrix 738 rows 345 cols
[2022-05-14 23:28:48] [INFO ] Computed 109 place invariants in 2 ms
[2022-05-14 23:28:48] [INFO ] Implicit Places using invariants in 197 ms returned []
[2022-05-14 23:28:48] [INFO ] Flow matrix only has 738 transitions (discarded 40 similar events)
// Phase 1: matrix 738 rows 345 cols
[2022-05-14 23:28:48] [INFO ] Computed 109 place invariants in 2 ms
[2022-05-14 23:28:48] [INFO ] State equation strengthened by 48 read => feed constraints.
[2022-05-14 23:28:48] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 547 ms to find 0 implicit places.
[2022-05-14 23:28:48] [INFO ] Redundant transitions in 41 ms returned []
[2022-05-14 23:28:48] [INFO ] Flow matrix only has 738 transitions (discarded 40 similar events)
// Phase 1: matrix 738 rows 345 cols
[2022-05-14 23:28:48] [INFO ] Computed 109 place invariants in 1 ms
[2022-05-14 23:28:48] [INFO ] Dead Transitions using invariants and state equation in 257 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 345/1450 places, 778/2499 transitions.
Finished structural reductions, in 1 iterations. Remains : 345/1450 places, 778/2499 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DLCround-PT-06b-LTLCardinality-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s209 0) (EQ s57 1)), p1:(EQ s240 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 152 steps with 0 reset in 5 ms.
FORMULA DLCround-PT-06b-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLCardinality-12 finished in 1234 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((X((F(p0)||p1))&&G(X(p2)))))))'
Support contains 5 out of 1450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1450/1450 places, 2499/2499 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1440 transition count 2480
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1440 transition count 2480
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 1435 transition count 2475
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 1435 transition count 2475
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1434 transition count 2473
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1434 transition count 2473
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 1433 transition count 2472
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 1433 transition count 2472
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 1433 transition count 2471
Applied a total of 35 rules in 162 ms. Remains 1433 /1450 variables (removed 17) and now considering 2471/2499 (removed 28) transitions.
// Phase 1: matrix 2471 rows 1433 cols
[2022-05-14 23:28:49] [INFO ] Computed 109 place invariants in 9 ms
[2022-05-14 23:28:49] [INFO ] Implicit Places using invariants in 337 ms returned []
// Phase 1: matrix 2471 rows 1433 cols
[2022-05-14 23:28:49] [INFO ] Computed 109 place invariants in 4 ms
[2022-05-14 23:28:50] [INFO ] Implicit Places using invariants and state equation in 1059 ms returned []
Implicit Place search using SMT with State Equation took 1396 ms to find 0 implicit places.
// Phase 1: matrix 2471 rows 1433 cols
[2022-05-14 23:28:50] [INFO ] Computed 109 place invariants in 8 ms
[2022-05-14 23:28:51] [INFO ] Dead Transitions using invariants and state equation in 944 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1433/1450 places, 2471/2499 transitions.
Finished structural reductions, in 1 iterations. Remains : 1433/1450 places, 2471/2499 transitions.
Stuttering acceptance computed with spot in 251 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DLCround-PT-06b-LTLCardinality-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0) p2), acceptance={} source=3 dest: 4}, { cond=p2, acceptance={} source=3 dest: 5}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p0) (NOT p2))), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p0) p2), acceptance={} source=4 dest: 6}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 3}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0} source=6 dest: 4}, { cond=(AND (NOT p0) p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p2:(OR (EQ s1006 0) (EQ s959 1)), p1:(EQ s1309 1), p0:(OR (EQ s1396 0) (EQ s913 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 426 ms.
Product exploration explored 100000 steps with 0 reset in 584 ms.
Computed a total of 213 stabilizing places and 213 stable transitions
Computed a total of 213 stabilizing places and 213 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 7 states, 12 edges and 3 AP to 7 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 306 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 236 ms. (steps per millisecond=42 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2471 rows 1433 cols
[2022-05-14 23:28:53] [INFO ] Computed 109 place invariants in 10 ms
[2022-05-14 23:28:53] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-14 23:28:53] [INFO ] [Nat]Absence check using 109 positive place invariants in 62 ms returned sat
[2022-05-14 23:28:54] [INFO ] After 752ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-14 23:28:54] [INFO ] After 997ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 165 ms.
[2022-05-14 23:28:55] [INFO ] After 1463ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 382 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=127 )
Parikh walk visited 2 properties in 13 ms.
Knowledge obtained : [(AND p2 (NOT p1) p0), true]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0))), (F (AND p2 (NOT p0) p1)), (F (AND p2 (NOT p0))), (F (NOT p2)), (F (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1)))), (F (AND p2 (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 209 ms. Reduced automaton from 7 states, 12 edges and 3 AP to 7 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 280 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 305 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 1433 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1433/1433 places, 2471/2471 transitions.
Applied a total of 0 rules in 32 ms. Remains 1433 /1433 variables (removed 0) and now considering 2471/2471 (removed 0) transitions.
// Phase 1: matrix 2471 rows 1433 cols
[2022-05-14 23:28:56] [INFO ] Computed 109 place invariants in 11 ms
[2022-05-14 23:28:56] [INFO ] Implicit Places using invariants in 368 ms returned []
// Phase 1: matrix 2471 rows 1433 cols
[2022-05-14 23:28:56] [INFO ] Computed 109 place invariants in 6 ms
[2022-05-14 23:28:57] [INFO ] Implicit Places using invariants and state equation in 1123 ms returned []
Implicit Place search using SMT with State Equation took 1493 ms to find 0 implicit places.
// Phase 1: matrix 2471 rows 1433 cols
[2022-05-14 23:28:57] [INFO ] Computed 109 place invariants in 6 ms
[2022-05-14 23:28:58] [INFO ] Dead Transitions using invariants and state equation in 998 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 1433/1433 places, 2471/2471 transitions.
Computed a total of 213 stabilizing places and 213 stable transitions
Computed a total of 213 stabilizing places and 213 stable transitions
Knowledge obtained : [(AND p2 p0 (NOT p1)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 7 states, 12 edges and 3 AP to 7 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 292 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 166 ms. (steps per millisecond=60 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 2471 rows 1433 cols
[2022-05-14 23:28:59] [INFO ] Computed 109 place invariants in 12 ms
[2022-05-14 23:28:59] [INFO ] After 200ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2022-05-14 23:28:59] [INFO ] [Nat]Absence check using 109 positive place invariants in 56 ms returned sat
[2022-05-14 23:29:00] [INFO ] After 752ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2022-05-14 23:29:00] [INFO ] After 1005ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 130 ms.
[2022-05-14 23:29:00] [INFO ] After 1419ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Finished Parikh walk after 367 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=122 )
Parikh walk visited 2 properties in 10 ms.
Knowledge obtained : [(AND p2 p0 (NOT p1)), true]
False Knowledge obtained : [(F (AND (NOT p2) (NOT p0))), (F (AND p2 (NOT p0) p1)), (F (AND p2 (NOT p0))), (F (NOT p2)), (F (OR (AND (NOT p2) (NOT p0)) (AND (NOT p0) (NOT p1)))), (F (AND p2 (NOT p0) (NOT p1)))]
Knowledge based reduction with 2 factoid took 180 ms. Reduced automaton from 7 states, 12 edges and 3 AP to 7 states, 12 edges and 3 AP.
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 431 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 429 ms.
Product exploration explored 100000 steps with 0 reset in 552 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (NOT p2) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 1433 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1433/1433 places, 2471/2471 transitions.
Graph (trivial) has 1289 edges and 1433 vertex of which 389 / 1433 are part of one of the 32 SCC in 2 ms
Free SCC test removed 357 places
Ensure Unique test removed 386 transitions
Reduce isomorphic transitions removed 386 transitions.
Performed 224 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 224 rules applied. Total rules applied 225 place count 1076 transition count 2085
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 1 with 22 rules applied. Total rules applied 247 place count 1076 transition count 2074
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 247 place count 1076 transition count 2079
Deduced a syphon composed of 246 places in 5 ms
Iterating global reduction 2 with 11 rules applied. Total rules applied 258 place count 1076 transition count 2079
Discarding 121 places :
Symmetric choice reduction at 2 with 121 rule applications. Total rules 379 place count 955 transition count 1682
Deduced a syphon composed of 175 places in 4 ms
Iterating global reduction 2 with 121 rules applied. Total rules applied 500 place count 955 transition count 1682
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 504 place count 955 transition count 1678
Performed 349 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 524 places in 1 ms
Iterating global reduction 3 with 349 rules applied. Total rules applied 853 place count 955 transition count 1685
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 860 place count 955 transition count 1678
Renaming transitions due to excessive name length > 1024 char.
Discarding 258 places :
Symmetric choice reduction at 4 with 258 rule applications. Total rules 1118 place count 697 transition count 1270
Deduced a syphon composed of 284 places in 0 ms
Iterating global reduction 4 with 258 rules applied. Total rules applied 1376 place count 697 transition count 1270
Ensure Unique test removed 18 transitions
Reduce isomorphic transitions removed 18 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 1394 place count 697 transition count 1252
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 1401 place count 690 transition count 1245
Deduced a syphon composed of 277 places in 0 ms
Iterating global reduction 5 with 7 rules applied. Total rules applied 1408 place count 690 transition count 1245
Performed 29 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 306 places in 0 ms
Iterating global reduction 5 with 29 rules applied. Total rules applied 1437 place count 690 transition count 1467
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 5 with 15 rules applied. Total rules applied 1452 place count 690 transition count 1452
Discarding 40 places :
Symmetric choice reduction at 6 with 40 rule applications. Total rules 1492 place count 650 transition count 1313
Deduced a syphon composed of 270 places in 1 ms
Iterating global reduction 6 with 40 rules applied. Total rules applied 1532 place count 650 transition count 1313
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 6 with 32 rules applied. Total rules applied 1564 place count 650 transition count 1281
Discarding 8 places :
Symmetric choice reduction at 7 with 8 rule applications. Total rules 1572 place count 642 transition count 1265
Deduced a syphon composed of 262 places in 1 ms
Iterating global reduction 7 with 8 rules applied. Total rules applied 1580 place count 642 transition count 1265
Deduced a syphon composed of 262 places in 1 ms
Drop transitions removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 7 with 34 rules applied. Total rules applied 1614 place count 642 transition count 1231
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 1628 place count 628 transition count 1203
Deduced a syphon composed of 262 places in 0 ms
Iterating global reduction 7 with 14 rules applied. Total rules applied 1642 place count 628 transition count 1203
Discarding 14 places :
Symmetric choice reduction at 7 with 14 rule applications. Total rules 1656 place count 614 transition count 1057
Deduced a syphon composed of 262 places in 0 ms
Iterating global reduction 7 with 14 rules applied. Total rules applied 1670 place count 614 transition count 1057
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 7 with 21 rules applied. Total rules applied 1691 place count 614 transition count 1036
Discarding 14 places :
Symmetric choice reduction at 8 with 14 rule applications. Total rules 1705 place count 600 transition count 1015
Deduced a syphon composed of 248 places in 0 ms
Iterating global reduction 8 with 14 rules applied. Total rules applied 1719 place count 600 transition count 1015
Deduced a syphon composed of 248 places in 0 ms
Applied a total of 1719 rules in 544 ms. Remains 600 /1433 variables (removed 833) and now considering 1015/2471 (removed 1456) transitions.
[2022-05-14 23:29:03] [INFO ] Redundant transitions in 11 ms returned []
[2022-05-14 23:29:03] [INFO ] Flow matrix only has 994 transitions (discarded 21 similar events)
// Phase 1: matrix 994 rows 600 cols
[2022-05-14 23:29:04] [INFO ] Computed 109 place invariants in 25 ms
[2022-05-14 23:29:04] [INFO ] Dead Transitions using invariants and state equation in 694 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 600/1433 places, 1015/2471 transitions.
Finished structural reductions, in 1 iterations. Remains : 600/1433 places, 1015/2471 transitions.
Stuttering criterion allowed to conclude after 1085 steps with 0 reset in 13 ms.
FORMULA DLCround-PT-06b-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DLCround-PT-06b-LTLCardinality-14 finished in 15762 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 4 out of 1450 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1450/1450 places, 2499/2499 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 1440 transition count 2480
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 1440 transition count 2480
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 1435 transition count 2475
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 1435 transition count 2475
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 1434 transition count 2473
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 1434 transition count 2473
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 1433 transition count 2472
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 1433 transition count 2472
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 35 place count 1433 transition count 2471
Applied a total of 35 rules in 183 ms. Remains 1433 /1450 variables (removed 17) and now considering 2471/2499 (removed 28) transitions.
// Phase 1: matrix 2471 rows 1433 cols
[2022-05-14 23:29:04] [INFO ] Computed 109 place invariants in 14 ms
[2022-05-14 23:29:05] [INFO ] Implicit Places using invariants in 473 ms returned []
// Phase 1: matrix 2471 rows 1433 cols
[2022-05-14 23:29:05] [INFO ] Computed 109 place invariants in 5 ms
[2022-05-14 23:29:06] [INFO ] Implicit Places using invariants and state equation in 1075 ms returned []
Implicit Place search using SMT with State Equation took 1554 ms to find 0 implicit places.
// Phase 1: matrix 2471 rows 1433 cols
[2022-05-14 23:29:06] [INFO ] Computed 109 place invariants in 11 ms
[2022-05-14 23:29:07] [INFO ] Dead Transitions using invariants and state equation in 929 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1433/1450 places, 2471/2499 transitions.
Finished structural reductions, in 1 iterations. Remains : 1433/1450 places, 2471/2499 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DLCround-PT-06b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (EQ s855 0) (EQ s760 1) (EQ s530 0) (EQ s29 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 838 ms.
Product exploration explored 100000 steps with 33333 reset in 865 ms.
Computed a total of 215 stabilizing places and 215 stable transitions
Computed a total of 215 stabilizing places and 215 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 65 ms. Reduced automaton from 3 states, 3 edges and 1 AP to 1 states, 0 edges and 0 AP.
FORMULA DLCround-PT-06b-LTLCardinality-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DLCround-PT-06b-LTLCardinality-15 finished in 4588 ms.
All properties solved by simple procedures.
Total runtime 39427 ms.

BK_STOP 1652570949377

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLCardinality -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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="DLCround-PT-06b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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-4028"
echo " Executing tool itstools"
echo " Input is DLCround-PT-06b, 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 r060-tall-165254771700171"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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