Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r553-tall-171734901000163.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is CO4-PT-21, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734901000163
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 740K
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 57K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 47K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 105K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 344K Jun 2 16:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717353126127

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-21
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 18:32:07] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 18:32:07] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 18:32:07] [INFO ] Load time of PNML (sax parser for PT used): 160 ms
[2024-06-02 18:32:07] [INFO ] Transformed 1400 places.
[2024-06-02 18:32:07] [INFO ] Transformed 1583 transitions.
[2024-06-02 18:32:07] [INFO ] Found NUPN structural information;
[2024-06-02 18:32:07] [INFO ] Parsed PT model containing 1400 places and 1583 transitions and 3434 arcs in 318 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 307 places in 28 ms
Reduce places removed 307 places and 347 transitions.
FORMULA CO4-PT-21-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 18 out of 1093 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1093/1093 places, 1236/1236 transitions.
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 1070 transition count 1231
Discarding 164 places :
Symmetric choice reduction at 1 with 164 rule applications. Total rules 192 place count 906 transition count 1067
Iterating global reduction 1 with 164 rules applied. Total rules applied 356 place count 906 transition count 1067
Discarding 149 places :
Symmetric choice reduction at 1 with 149 rule applications. Total rules 505 place count 757 transition count 917
Iterating global reduction 1 with 149 rules applied. Total rules applied 654 place count 757 transition count 917
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 657 place count 757 transition count 914
Discarding 70 places :
Symmetric choice reduction at 2 with 70 rule applications. Total rules 727 place count 687 transition count 844
Iterating global reduction 2 with 70 rules applied. Total rules applied 797 place count 687 transition count 844
Discarding 50 places :
Symmetric choice reduction at 2 with 50 rule applications. Total rules 847 place count 637 transition count 794
Iterating global reduction 2 with 50 rules applied. Total rules applied 897 place count 637 transition count 794
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 900 place count 637 transition count 791
Discarding 25 places :
Symmetric choice reduction at 3 with 25 rule applications. Total rules 925 place count 612 transition count 766
Iterating global reduction 3 with 25 rules applied. Total rules applied 950 place count 612 transition count 766
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 952 place count 612 transition count 764
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 960 place count 604 transition count 756
Iterating global reduction 4 with 8 rules applied. Total rules applied 968 place count 604 transition count 756
Applied a total of 968 rules in 367 ms. Remains 604 /1093 variables (removed 489) and now considering 756/1236 (removed 480) transitions.
// Phase 1: matrix 756 rows 604 cols
[2024-06-02 18:32:08] [INFO ] Computed 5 invariants in 23 ms
[2024-06-02 18:32:08] [INFO ] Implicit Places using invariants in 308 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 358 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 603/1093 places, 756/1236 transitions.
Applied a total of 0 rules in 12 ms. Remains 603 /603 variables (removed 0) and now considering 756/756 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 753 ms. Remains : 603/1093 places, 756/1236 transitions.
Support contains 18 out of 603 places after structural reductions.
[2024-06-02 18:32:09] [INFO ] Flatten gal took : 85 ms
[2024-06-02 18:32:09] [INFO ] Flatten gal took : 39 ms
[2024-06-02 18:32:09] [INFO ] Input system was already deterministic with 756 transitions.
RANDOM walk for 40000 steps (51 resets) in 1279 ms. (31 steps per ms) remains 8/11 properties
BEST_FIRST walk for 40000 steps (18 resets) in 213 ms. (186 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (69 resets) in 238 ms. (167 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40000 steps (34 resets) in 197 ms. (202 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (78 resets) in 348 ms. (114 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (152 resets) in 91 ms. (434 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (105 resets) in 94 ms. (421 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40000 steps (63 resets) in 114 ms. (347 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (56 resets) in 151 ms. (263 steps per ms) remains 7/7 properties
// Phase 1: matrix 756 rows 603 cols
[2024-06-02 18:32:10] [INFO ] Computed 4 invariants in 6 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 13/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 17/43 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 66/109 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 231/340 variables, 50/97 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 499/839 variables, 212/309 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/839 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 386/1225 variables, 214/523 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1225 variables, 0/523 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 99/1324 variables, 62/585 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1324 variables, 0/585 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 27/1351 variables, 16/601 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1351 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 7/1358 variables, 5/606 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1358 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 1/1359 variables, 1/607 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1359 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 0/1359 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1359/1359 variables, and 607 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1399 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 603/603 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 13/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 17/43 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 66/109 variables, 43/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/109 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 231/340 variables, 50/97 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 7/104 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/340 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 499/839 variables, 212/316 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/839 variables, 0/316 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 386/1225 variables, 214/530 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1225 variables, 0/530 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 99/1324 variables, 62/592 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1324 variables, 0/592 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (OVERLAPS) 27/1351 variables, 16/608 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1351 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp7 is UNSAT
At refinement iteration 18 (OVERLAPS) 7/1358 variables, 5/613 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1358 variables, 0/613 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 1/1359 variables, 1/614 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1359 variables, 0/614 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 0/1359 variables, 0/614 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1359/1359 variables, and 614 constraints, problems are : Problem set: 1 solved, 6 unsolved in 1570 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 603/603 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
After SMT, in 3030ms problems are : Problem set: 1 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Finished Parikh walk after 3992 steps, including 39 resets, run visited all 6 properties in 30 ms. (steps per millisecond=133 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 6 properties in 37 ms.
FORMULA CO4-PT-21-LTLCardinality-04 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
Computed a total of 15 stabilizing places and 18 stable transitions
Graph (complete) has 947 edges and 603 vertex of which 596 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.15 ms
FORMULA CO4-PT-21-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||(G(p1)&&F(p2)))))'
Support contains 6 out of 603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 603/603 places, 756/756 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 595 transition count 748
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 595 transition count 748
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 589 transition count 742
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 589 transition count 742
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 587 transition count 740
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 587 transition count 740
Applied a total of 32 rules in 36 ms. Remains 587 /603 variables (removed 16) and now considering 740/756 (removed 16) transitions.
// Phase 1: matrix 740 rows 587 cols
[2024-06-02 18:32:13] [INFO ] Computed 4 invariants in 10 ms
[2024-06-02 18:32:13] [INFO ] Implicit Places using invariants in 145 ms returned []
[2024-06-02 18:32:13] [INFO ] Invariant cache hit.
[2024-06-02 18:32:14] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
Running 739 sub problems to find dead transitions.
[2024-06-02 18:32:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/586 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 1 (OVERLAPS) 1/587 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/587 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 739 unsolved
At refinement iteration 3 (OVERLAPS) 740/1327 variables, 587/591 constraints. Problems are: Problem set: 0 solved, 739 unsolved
[2024-06-02 18:32:44] [INFO ] Deduced a trap composed of 16 places in 219 ms of which 32 ms to minimize.
[2024-06-02 18:32:44] [INFO ] Deduced a trap composed of 15 places in 186 ms of which 5 ms to minimize.
SMT process timed out in 30317ms, After SMT, problems are : Problem set: 0 solved, 739 unsolved
Search for dead transitions found 0 dead transitions in 30330ms
Starting structural reductions in LTL mode, iteration 1 : 587/603 places, 740/756 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30872 ms. Remains : 587/603 places, 740/756 transitions.
Stuttering acceptance computed with spot in 301 ms :[(AND (NOT p0) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p0)]
Running random walk in product with property : CO4-PT-21-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 291 ms.
Product exploration explored 100000 steps with 50000 reset in 226 ms.
Computed a total of 15 stabilizing places and 18 stable transitions
Graph (complete) has 931 edges and 587 vertex of which 582 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Computed a total of 15 stabilizing places and 18 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p1), (X (X (NOT (AND (NOT p0) p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 81 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CO4-PT-21-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-21-LTLCardinality-01 finished in 31862 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 603/603 places, 756/756 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 593 transition count 746
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 593 transition count 746
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 586 transition count 739
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 586 transition count 739
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 584 transition count 737
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 584 transition count 737
Applied a total of 38 rules in 34 ms. Remains 584 /603 variables (removed 19) and now considering 737/756 (removed 19) transitions.
// Phase 1: matrix 737 rows 584 cols
[2024-06-02 18:32:45] [INFO ] Computed 4 invariants in 7 ms
[2024-06-02 18:32:45] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-02 18:32:45] [INFO ] Invariant cache hit.
[2024-06-02 18:32:45] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 378 ms to find 0 implicit places.
Running 736 sub problems to find dead transitions.
[2024-06-02 18:32:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/583 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 736 unsolved
At refinement iteration 1 (OVERLAPS) 1/584 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 736 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/584 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 736 unsolved
At refinement iteration 3 (OVERLAPS) 737/1321 variables, 584/588 constraints. Problems are: Problem set: 0 solved, 736 unsolved
[2024-06-02 18:33:15] [INFO ] Deduced a trap composed of 15 places in 165 ms of which 12 ms to minimize.
[2024-06-02 18:33:15] [INFO ] Deduced a trap composed of 15 places in 149 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1321/1321 variables, and 590 constraints, problems are : Problem set: 0 solved, 736 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 584/584 constraints, PredecessorRefiner: 736/736 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 736 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/583 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 736 unsolved
At refinement iteration 1 (OVERLAPS) 1/584 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 736 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/584 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 736 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 736 unsolved
At refinement iteration 4 (OVERLAPS) 737/1321 variables, 584/590 constraints. Problems are: Problem set: 0 solved, 736 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1321 variables, 736/1326 constraints. Problems are: Problem set: 0 solved, 736 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1321/1321 variables, and 1326 constraints, problems are : Problem set: 0 solved, 736 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 584/584 constraints, PredecessorRefiner: 736/736 constraints, Known Traps: 2/2 constraints]
After SMT, in 60207ms problems are : Problem set: 0 solved, 736 unsolved
Search for dead transitions found 0 dead transitions in 60217ms
Starting structural reductions in LTL mode, iteration 1 : 584/603 places, 737/756 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60631 ms. Remains : 584/603 places, 737/756 transitions.
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-21-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA CO4-PT-21-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-21-LTLCardinality-05 finished in 60746 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 603/603 places, 756/756 transitions.
Graph (trivial) has 653 edges and 603 vertex of which 3 / 603 are part of one of the 1 SCC in 9 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 945 edges and 601 vertex of which 594 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.6 ms
Discarding 7 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 268 transitions
Trivial Post-agglo rules discarded 268 transitions
Performed 268 trivial Post agglomeration. Transition count delta: 268
Iterating post reduction 0 with 269 rules applied. Total rules applied 271 place count 593 transition count 476
Reduce places removed 268 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 270 rules applied. Total rules applied 541 place count 325 transition count 474
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 542 place count 324 transition count 474
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 542 place count 324 transition count 410
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 670 place count 260 transition count 410
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 673 place count 257 transition count 407
Iterating global reduction 3 with 3 rules applied. Total rules applied 676 place count 257 transition count 407
Performed 100 Post agglomeration using F-continuation condition with reduction of 26 identical transitions.
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 876 place count 157 transition count 281
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 882 place count 157 transition count 275
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 890 place count 149 transition count 267
Iterating global reduction 4 with 8 rules applied. Total rules applied 898 place count 149 transition count 267
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 904 place count 146 transition count 264
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 994 place count 101 transition count 267
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 4 with 30 rules applied. Total rules applied 1024 place count 101 transition count 237
Discarding 40 places :
Symmetric choice reduction at 5 with 40 rule applications. Total rules 1064 place count 61 transition count 157
Iterating global reduction 5 with 40 rules applied. Total rules applied 1104 place count 61 transition count 157
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 5 with 27 rules applied. Total rules applied 1131 place count 61 transition count 130
Discarding 10 places :
Symmetric choice reduction at 6 with 10 rule applications. Total rules 1141 place count 51 transition count 101
Iterating global reduction 6 with 10 rules applied. Total rules applied 1151 place count 51 transition count 101
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 6 with 7 rules applied. Total rules applied 1158 place count 51 transition count 94
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1160 place count 50 transition count 104
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 7 with 14 rules applied. Total rules applied 1174 place count 50 transition count 90
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 1176 place count 48 transition count 88
Applied a total of 1176 rules in 117 ms. Remains 48 /603 variables (removed 555) and now considering 88/756 (removed 668) transitions.
[2024-06-02 18:33:46] [INFO ] Flow matrix only has 80 transitions (discarded 8 similar events)
// Phase 1: matrix 80 rows 48 cols
[2024-06-02 18:33:46] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:33:46] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-02 18:33:46] [INFO ] Flow matrix only has 80 transitions (discarded 8 similar events)
[2024-06-02 18:33:46] [INFO ] Invariant cache hit.
[2024-06-02 18:33:46] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 18:33:46] [INFO ] Implicit Places using invariants and state equation in 57 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
[2024-06-02 18:33:46] [INFO ] Redundant transitions in 2 ms returned []
Running 75 sub problems to find dead transitions.
[2024-06-02 18:33:46] [INFO ] Flow matrix only has 80 transitions (discarded 8 similar events)
[2024-06-02 18:33:46] [INFO ] Invariant cache hit.
[2024-06-02 18:33:46] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 79/127 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (OVERLAPS) 1/128 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 54 constraints, problems are : Problem set: 0 solved, 75 unsolved in 872 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 48/48 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 79/127 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 75/128 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 1/128 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 129 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1224 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 48/48 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints]
After SMT, in 2128ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 2129ms
Starting structural reductions in SI_LTL mode, iteration 1 : 48/603 places, 88/756 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2347 ms. Remains : 48/603 places, 88/756 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-21-LTLCardinality-07
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 0 ms.
FORMULA CO4-PT-21-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-21-LTLCardinality-07 finished in 2399 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0)) U !p0)))'
Support contains 1 out of 603 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 603/603 places, 756/756 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 593 transition count 746
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 593 transition count 746
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 587 transition count 740
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 587 transition count 740
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 586 transition count 739
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 586 transition count 739
Applied a total of 34 rules in 45 ms. Remains 586 /603 variables (removed 17) and now considering 739/756 (removed 17) transitions.
// Phase 1: matrix 739 rows 586 cols
[2024-06-02 18:33:48] [INFO ] Computed 4 invariants in 9 ms
[2024-06-02 18:33:48] [INFO ] Implicit Places using invariants in 114 ms returned []
[2024-06-02 18:33:48] [INFO ] Invariant cache hit.
[2024-06-02 18:33:48] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 400 ms to find 0 implicit places.
Running 738 sub problems to find dead transitions.
[2024-06-02 18:33:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/585 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 1 (OVERLAPS) 1/586 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 3 (OVERLAPS) 739/1325 variables, 586/590 constraints. Problems are: Problem set: 0 solved, 738 unsolved
[2024-06-02 18:34:18] [INFO ] Deduced a trap composed of 16 places in 149 ms of which 4 ms to minimize.
[2024-06-02 18:34:18] [INFO ] Deduced a trap composed of 15 places in 147 ms of which 3 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 1.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 0.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)timeout

(s225 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1325/1325 variables, and 592 constraints, problems are : Problem set: 0 solved, 738 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 738/738 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 738 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/585 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 1 (OVERLAPS) 1/586 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/586 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 4 (OVERLAPS) 739/1325 variables, 586/592 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1325 variables, 738/1330 constraints. Problems are: Problem set: 0 solved, 738 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 1330 constraints, problems are : Problem set: 0 solved, 738 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 738/738 constraints, Known Traps: 2/2 constraints]
After SMT, in 60220ms problems are : Problem set: 0 solved, 738 unsolved
Search for dead transitions found 0 dead transitions in 60227ms
Starting structural reductions in LTL mode, iteration 1 : 586/603 places, 739/756 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60674 ms. Remains : 586/603 places, 739/756 transitions.
Stuttering acceptance computed with spot in 171 ms :[p0, p0, (NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-21-LTLCardinality-10
Product exploration explored 100000 steps with 11 reset in 108 ms.
Product exploration explored 100000 steps with 24 reset in 175 ms.
Computed a total of 15 stabilizing places and 18 stable transitions
Graph (complete) has 930 edges and 586 vertex of which 581 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.4 ms
Computed a total of 15 stabilizing places and 18 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 4 states, 6 edges and 1 AP (stutter sensitive) to 5 states, 11 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 207 ms :[true, p0, (NOT p0), (NOT p0), false]
RANDOM walk for 40000 steps (62 resets) in 213 ms. (186 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (55 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1161202 steps, run timeout after 3001 ms. (steps per millisecond=386 ) properties seen :0 out of 1
Probabilistic random walk after 1161202 steps, saw 222564 distinct states, run finished after 3004 ms. (steps per millisecond=386 ) properties seen :0
[2024-06-02 18:34:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/16 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 76/92 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/92 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 248/340 variables, 83/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/340 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 11/351 variables, 1/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/351 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 18/369 variables, 3/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/369 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 443/812 variables, 214/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/812 variables, 0/317 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 329/1141 variables, 161/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1141 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 140/1281 variables, 82/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1281 variables, 0/560 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 32/1313 variables, 22/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1313 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 10/1323 variables, 6/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1323 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 2/1325 variables, 2/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/1325 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 0/1325 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1325/1325 variables, and 590 constraints, problems are : Problem set: 0 solved, 1 unsolved in 440 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 2/3 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/3 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 13/16 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/16 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 76/92 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/92 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 248/340 variables, 83/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/340 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 11/351 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/351 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 18/369 variables, 3/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/369 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 443/812 variables, 214/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/812 variables, 0/318 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 329/1141 variables, 161/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1141 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 140/1281 variables, 82/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1281 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 32/1313 variables, 22/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1313 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 10/1323 variables, 6/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1323 variables, 0/589 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (OVERLAPS) 2/1325 variables, 2/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/1325 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/1325 variables, 0/591 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 591 constraints, problems are : Problem set: 0 solved, 1 unsolved in 556 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 1004ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 8 ms.
Support contains 1 out of 586 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 586/586 places, 739/739 transitions.
Graph (trivial) has 638 edges and 586 vertex of which 3 / 586 are part of one of the 1 SCC in 7 ms
Free SCC test removed 2 places
Drop transitions (Empty/Sink Transition effects.) removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 927 edges and 584 vertex of which 568 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 7 output transitions
Drop transitions (Output transitions of discarded places.) removed 7 transitions
Drop transitions (Empty/Sink Transition effects.) removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 266 transitions
Trivial Post-agglo rules discarded 266 transitions
Performed 266 trivial Post agglomeration. Transition count delta: 266
Iterating post reduction 0 with 291 rules applied. Total rules applied 293 place count 568 transition count 434
Reduce places removed 266 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 268 rules applied. Total rules applied 561 place count 302 transition count 432
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 562 place count 301 transition count 432
Performed 66 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 66 Pre rules applied. Total rules applied 562 place count 301 transition count 366
Deduced a syphon composed of 66 places in 0 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 694 place count 235 transition count 366
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 695 place count 234 transition count 365
Iterating global reduction 3 with 1 rules applied. Total rules applied 696 place count 234 transition count 365
Performed 90 Post agglomeration using F-continuation condition with reduction of 20 identical transitions.
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 876 place count 144 transition count 255
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 882 place count 144 transition count 249
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 891 place count 135 transition count 240
Iterating global reduction 4 with 9 rules applied. Total rules applied 900 place count 135 transition count 240
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 901 place count 135 transition count 239
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 909 place count 131 transition count 235
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 913 place count 131 transition count 231
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 917 place count 127 transition count 227
Iterating global reduction 6 with 4 rules applied. Total rules applied 921 place count 127 transition count 227
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 922 place count 127 transition count 226
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 7 with 6 rules applied. Total rules applied 928 place count 124 transition count 223
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 931 place count 124 transition count 220
Discarding 3 places :
Symmetric choice reduction at 8 with 3 rule applications. Total rules 934 place count 121 transition count 217
Iterating global reduction 8 with 3 rules applied. Total rules applied 937 place count 121 transition count 217
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 939 place count 121 transition count 215
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 940 place count 120 transition count 214
Iterating global reduction 9 with 1 rules applied. Total rules applied 941 place count 120 transition count 214
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 942 place count 120 transition count 213
Performed 40 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 10 with 80 rules applied. Total rules applied 1022 place count 80 transition count 216
Drop transitions (Empty/Sink Transition effects.) removed 16 transitions
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 44 transitions.
Iterating post reduction 10 with 44 rules applied. Total rules applied 1066 place count 80 transition count 172
Discarding 35 places :
Symmetric choice reduction at 11 with 35 rule applications. Total rules 1101 place count 45 transition count 115
Iterating global reduction 11 with 35 rules applied. Total rules applied 1136 place count 45 transition count 115
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 11 with 28 rules applied. Total rules applied 1164 place count 45 transition count 87
Discarding 6 places :
Symmetric choice reduction at 12 with 6 rule applications. Total rules 1170 place count 39 transition count 69
Iterating global reduction 12 with 6 rules applied. Total rules applied 1176 place count 39 transition count 69
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 1180 place count 39 transition count 65
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 13 with 1 rules applied. Total rules applied 1181 place count 39 transition count 64
Discarding 1 places :
Symmetric choice reduction at 13 with 1 rule applications. Total rules 1182 place count 38 transition count 63
Iterating global reduction 13 with 1 rules applied. Total rules applied 1183 place count 38 transition count 63
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 1184 place count 38 transition count 62
Free-agglomeration rule applied 5 times.
Iterating global reduction 14 with 5 rules applied. Total rules applied 1189 place count 38 transition count 57
Reduce places removed 5 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 14 with 8 rules applied. Total rules applied 1197 place count 33 transition count 54
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 15 with 2 rules applied. Total rules applied 1199 place count 33 transition count 54
Graph (complete) has 105 edges and 33 vertex of which 32 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 15 with 1 rules applied. Total rules applied 1200 place count 32 transition count 54
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 16 with 1 rules applied. Total rules applied 1201 place count 32 transition count 53
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 17 with 1 rules applied. Total rules applied 1202 place count 32 transition count 52
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 1 places and 0 transitions.
Iterating global reduction 17 with 2 rules applied. Total rules applied 1204 place count 31 transition count 51
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 90 edges and 31 vertex of which 18 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 0 output transitions
Iterating post reduction 17 with 6 rules applied. Total rules applied 1210 place count 18 transition count 46
Drop transitions (Empty/Sink Transition effects.) removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 18 with 24 rules applied. Total rules applied 1234 place count 18 transition count 22
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 19 with 1 rules applied. Total rules applied 1235 place count 18 transition count 22
Graph (complete) has 44 edges and 18 vertex of which 17 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 1 rules applied. Total rules applied 1236 place count 17 transition count 22
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 20 with 1 rules applied. Total rules applied 1237 place count 17 transition count 21
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 21 with 1 rules applied. Total rules applied 1238 place count 17 transition count 21
Graph (complete) has 41 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 21 with 1 rules applied. Total rules applied 1239 place count 16 transition count 21
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 22 with 1 rules applied. Total rules applied 1240 place count 16 transition count 20
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 23 with 1 rules applied. Total rules applied 1241 place count 15 transition count 19
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t62.t66.t664.t725 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 11 edges and 11 vertex of which 3 / 11 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 23 with 3 rules applied. Total rules applied 1244 place count 9 transition count 17
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Remove reverse transitions (loop back) rule discarded transition t59.t650.t42.t43.t44.t45.t46.t47.t48.t49.t58.t31.t725.t159.t160.t161.t734.t15.t164 and 1 places that fell out of Prefix Of Interest.
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 8 edges and 7 vertex of which 3 / 7 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 24 with 9 rules applied. Total rules applied 1253 place count 5 transition count 9
Reduce places removed 1 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 4 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 5 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 25 with 7 rules applied. Total rules applied 1260 place count 4 transition count 3
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 26 with 1 rules applied. Total rules applied 1261 place count 3 transition count 3
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 27 with 1 Pre rules applied. Total rules applied 1261 place count 3 transition count 2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 27 with 2 rules applied. Total rules applied 1263 place count 2 transition count 2
Applied a total of 1263 rules in 100 ms. Remains 2 /586 variables (removed 584) and now considering 2/739 (removed 737) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 100 ms. Remains : 2/586 places, 2/739 transitions.
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 5 states, 11 edges and 1 AP (stutter insensitive) to 5 states, 11 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 182 ms :[true, p0, (NOT p0), (NOT p0), false]
Stuttering acceptance computed with spot in 189 ms :[true, p0, (NOT p0), (NOT p0), false]
[2024-06-02 18:34:54] [INFO ] Invariant cache hit.
Proved EG true
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), true]
Knowledge based reduction with 3 factoid took 115 ms. Reduced automaton from 5 states, 11 edges and 1 AP (stutter insensitive) to 5 states, 11 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 219 ms :[true, p0, (NOT p0), (NOT p0), false]
Support contains 1 out of 586 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 586/586 places, 739/739 transitions.
Graph (trivial) has 638 edges and 586 vertex of which 3 / 586 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 928 edges and 584 vertex of which 579 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 255 transitions
Trivial Post-agglo rules discarded 255 transitions
Performed 255 trivial Post agglomeration. Transition count delta: 255
Iterating post reduction 0 with 256 rules applied. Total rules applied 258 place count 578 transition count 474
Reduce places removed 255 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 257 rules applied. Total rules applied 515 place count 323 transition count 472
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 516 place count 322 transition count 472
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 67 Pre rules applied. Total rules applied 516 place count 322 transition count 405
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 134 rules applied. Total rules applied 650 place count 255 transition count 405
Performed 98 Post agglomeration using F-continuation condition with reduction of 27 identical transitions.
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 3 with 196 rules applied. Total rules applied 846 place count 157 transition count 280
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 852 place count 157 transition count 274
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 861 place count 148 transition count 265
Iterating global reduction 4 with 9 rules applied. Total rules applied 870 place count 148 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 871 place count 148 transition count 264
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 5 with 6 rules applied. Total rules applied 877 place count 145 transition count 261
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 5 with 90 rules applied. Total rules applied 967 place count 100 transition count 264
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 5 with 30 rules applied. Total rules applied 997 place count 100 transition count 234
Discarding 39 places :
Symmetric choice reduction at 6 with 39 rule applications. Total rules 1036 place count 61 transition count 156
Iterating global reduction 6 with 39 rules applied. Total rules applied 1075 place count 61 transition count 156
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 6 with 27 rules applied. Total rules applied 1102 place count 61 transition count 129
Discarding 9 places :
Symmetric choice reduction at 7 with 9 rule applications. Total rules 1111 place count 52 transition count 102
Iterating global reduction 7 with 9 rules applied. Total rules applied 1120 place count 52 transition count 102
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 7 with 6 rules applied. Total rules applied 1126 place count 52 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1128 place count 51 transition count 106
Drop transitions (Redundant composition of simpler transitions.) removed 14 transitions
Redundant transition composition rules discarded 14 transitions
Iterating global reduction 8 with 14 rules applied. Total rules applied 1142 place count 51 transition count 92
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1144 place count 49 transition count 90
Applied a total of 1144 rules in 44 ms. Remains 49 /586 variables (removed 537) and now considering 90/739 (removed 649) transitions.
[2024-06-02 18:34:55] [INFO ] Flow matrix only has 81 transitions (discarded 9 similar events)
// Phase 1: matrix 81 rows 49 cols
[2024-06-02 18:34:55] [INFO ] Computed 4 invariants in 1 ms
[2024-06-02 18:34:55] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-02 18:34:55] [INFO ] Flow matrix only has 81 transitions (discarded 9 similar events)
[2024-06-02 18:34:55] [INFO ] Invariant cache hit.
[2024-06-02 18:34:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 18:34:55] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 96 ms to find 0 implicit places.
[2024-06-02 18:34:55] [INFO ] Redundant transitions in 2 ms returned []
Running 77 sub problems to find dead transitions.
[2024-06-02 18:34:55] [INFO ] Flow matrix only has 81 transitions (discarded 9 similar events)
[2024-06-02 18:34:55] [INFO ] Invariant cache hit.
[2024-06-02 18:34:55] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (OVERLAPS) 80/129 variables, 49/53 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 1/130 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 55 constraints, problems are : Problem set: 0 solved, 77 unsolved in 899 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 49/49 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (OVERLAPS) 80/129 variables, 49/53 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 77/131 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 1/130 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 132 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1267 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 49/49 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
After SMT, in 2219ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 2221ms
Starting structural reductions in SI_LTL mode, iteration 1 : 49/586 places, 90/739 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2366 ms. Remains : 49/586 places, 90/739 transitions.
Computed a total of 7 stabilizing places and 14 stable transitions
Computed a total of 7 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 5 states, 11 edges and 1 AP (stutter insensitive) to 5 states, 11 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 193 ms :[true, p0, (NOT p0), (NOT p0), false]
RANDOM walk for 10754 steps (1013 resets) in 96 ms. (110 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 5 states, 11 edges and 1 AP (stutter insensitive) to 5 states, 11 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 271 ms :[true, p0, (NOT p0), (NOT p0), false]
Stuttering acceptance computed with spot in 188 ms :[true, p0, (NOT p0), (NOT p0), false]
[2024-06-02 18:34:58] [INFO ] Flow matrix only has 81 transitions (discarded 9 similar events)
[2024-06-02 18:34:58] [INFO ] Invariant cache hit.
Proved EG true
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0)), true]
Knowledge based reduction with 3 factoid took 138 ms. Reduced automaton from 5 states, 11 edges and 1 AP (stutter insensitive) to 5 states, 11 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 180 ms :[true, p0, (NOT p0), (NOT p0), false]
Stuttering acceptance computed with spot in 216 ms :[true, p0, (NOT p0), (NOT p0), false]
Product exploration explored 100000 steps with 20 reset in 29 ms.
Product exploration explored 100000 steps with 21 reset in 92 ms.
Support contains 1 out of 49 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 49/49 places, 90/90 transitions.
Applied a total of 0 rules in 2 ms. Remains 49 /49 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2024-06-02 18:34:59] [INFO ] Flow matrix only has 81 transitions (discarded 9 similar events)
[2024-06-02 18:34:59] [INFO ] Invariant cache hit.
[2024-06-02 18:34:59] [INFO ] Implicit Places using invariants in 37 ms returned []
[2024-06-02 18:34:59] [INFO ] Flow matrix only has 81 transitions (discarded 9 similar events)
[2024-06-02 18:34:59] [INFO ] Invariant cache hit.
[2024-06-02 18:34:59] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 18:34:59] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2024-06-02 18:34:59] [INFO ] Redundant transitions in 2 ms returned []
Running 77 sub problems to find dead transitions.
[2024-06-02 18:34:59] [INFO ] Flow matrix only has 81 transitions (discarded 9 similar events)
[2024-06-02 18:34:59] [INFO ] Invariant cache hit.
[2024-06-02 18:34:59] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (OVERLAPS) 80/129 variables, 49/53 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (OVERLAPS) 1/130 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (OVERLAPS) 0/130 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Real declared 130/130 variables, and 55 constraints, problems are : Problem set: 0 solved, 77 unsolved in 920 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 49/49 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 77 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 2 (OVERLAPS) 80/129 variables, 49/53 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 77/131 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/129 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 6 (OVERLAPS) 1/130 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/130 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 77 unsolved
At refinement iteration 8 (OVERLAPS) 0/130 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 77 unsolved
No progress, stopping.
After SMT solving in domain Int declared 130/130 variables, and 132 constraints, problems are : Problem set: 0 solved, 77 unsolved in 1292 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 49/49 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 77/77 constraints, Known Traps: 0/0 constraints]
After SMT, in 2239ms problems are : Problem set: 0 solved, 77 unsolved
Search for dead transitions found 0 dead transitions in 2240ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2338 ms. Remains : 49/49 places, 90/90 transitions.
Treatment of property CO4-PT-21-LTLCardinality-10 finished in 73136 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 603 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 603/603 places, 756/756 transitions.
Graph (trivial) has 654 edges and 603 vertex of which 3 / 603 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 945 edges and 601 vertex of which 594 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 8 output transitions
Drop transitions (Output transitions of discarded places.) removed 8 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 270 transitions
Trivial Post-agglo rules discarded 270 transitions
Performed 270 trivial Post agglomeration. Transition count delta: 270
Iterating post reduction 0 with 271 rules applied. Total rules applied 273 place count 593 transition count 474
Reduce places removed 270 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 272 rules applied. Total rules applied 545 place count 323 transition count 472
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 546 place count 322 transition count 472
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 546 place count 322 transition count 408
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 674 place count 258 transition count 408
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 677 place count 255 transition count 405
Iterating global reduction 3 with 3 rules applied. Total rules applied 680 place count 255 transition count 405
Performed 99 Post agglomeration using F-continuation condition with reduction of 26 identical transitions.
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 3 with 198 rules applied. Total rules applied 878 place count 156 transition count 280
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 884 place count 156 transition count 274
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 892 place count 148 transition count 266
Iterating global reduction 4 with 8 rules applied. Total rules applied 900 place count 148 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 901 place count 148 transition count 265
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 905 place count 146 transition count 263
Performed 46 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 46 places in 0 ms
Reduce places removed 46 places and 0 transitions.
Iterating global reduction 5 with 92 rules applied. Total rules applied 997 place count 100 transition count 267
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 5 with 29 rules applied. Total rules applied 1026 place count 100 transition count 238
Discarding 40 places :
Symmetric choice reduction at 6 with 40 rule applications. Total rules 1066 place count 60 transition count 158
Iterating global reduction 6 with 40 rules applied. Total rules applied 1106 place count 60 transition count 158
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 6 with 26 rules applied. Total rules applied 1132 place count 60 transition count 132
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1142 place count 50 transition count 103
Iterating global reduction 7 with 10 rules applied. Total rules applied 1152 place count 50 transition count 103
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 7 with 5 rules applied. Total rules applied 1157 place count 50 transition count 98
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1159 place count 49 transition count 106
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 8 with 16 rules applied. Total rules applied 1175 place count 49 transition count 90
Partial Post-agglomeration rule applied 6 times.
Drop transitions (Partial Post agglomeration) removed 6 transitions
Iterating global reduction 8 with 6 rules applied. Total rules applied 1181 place count 49 transition count 90
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1183 place count 47 transition count 88
Applied a total of 1183 rules in 39 ms. Remains 47 /603 variables (removed 556) and now considering 88/756 (removed 668) transitions.
[2024-06-02 18:35:01] [INFO ] Flow matrix only has 80 transitions (discarded 8 similar events)
// Phase 1: matrix 80 rows 47 cols
[2024-06-02 18:35:01] [INFO ] Computed 4 invariants in 0 ms
[2024-06-02 18:35:01] [INFO ] Implicit Places using invariants in 36 ms returned []
[2024-06-02 18:35:01] [INFO ] Flow matrix only has 80 transitions (discarded 8 similar events)
[2024-06-02 18:35:01] [INFO ] Invariant cache hit.
[2024-06-02 18:35:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 18:35:01] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2024-06-02 18:35:01] [INFO ] Redundant transitions in 2 ms returned []
Running 75 sub problems to find dead transitions.
[2024-06-02 18:35:01] [INFO ] Flow matrix only has 80 transitions (discarded 8 similar events)
[2024-06-02 18:35:01] [INFO ] Invariant cache hit.
[2024-06-02 18:35:01] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 79/126 variables, 47/51 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (OVERLAPS) 1/127 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (OVERLAPS) 0/127 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 53 constraints, problems are : Problem set: 0 solved, 75 unsolved in 836 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 47/47 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 79/126 variables, 47/51 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 75/127 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 1/127 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 0/127 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 128 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1286 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 47/47 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints]
After SMT, in 2154ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 2155ms
Starting structural reductions in SI_LTL mode, iteration 1 : 47/603 places, 88/756 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2288 ms. Remains : 47/603 places, 88/756 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-21-LTLCardinality-13
Product exploration explored 100000 steps with 0 reset in 71 ms.
Product exploration explored 100000 steps with 0 reset in 148 ms.
Computed a total of 7 stabilizing places and 14 stable transitions
Computed a total of 7 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
RANDOM walk for 985 steps (91 resets) in 6 ms. (140 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Support contains 1 out of 47 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 47/47 places, 88/88 transitions.
Applied a total of 0 rules in 9 ms. Remains 47 /47 variables (removed 0) and now considering 88/88 (removed 0) transitions.
[2024-06-02 18:35:04] [INFO ] Flow matrix only has 80 transitions (discarded 8 similar events)
[2024-06-02 18:35:04] [INFO ] Invariant cache hit.
[2024-06-02 18:35:04] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-06-02 18:35:04] [INFO ] Flow matrix only has 80 transitions (discarded 8 similar events)
[2024-06-02 18:35:04] [INFO ] Invariant cache hit.
[2024-06-02 18:35:04] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-06-02 18:35:04] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 82 ms to find 0 implicit places.
[2024-06-02 18:35:04] [INFO ] Redundant transitions in 1 ms returned []
Running 75 sub problems to find dead transitions.
[2024-06-02 18:35:04] [INFO ] Flow matrix only has 80 transitions (discarded 8 similar events)
[2024-06-02 18:35:04] [INFO ] Invariant cache hit.
[2024-06-02 18:35:04] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 79/126 variables, 47/51 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (OVERLAPS) 1/127 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/127 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (OVERLAPS) 0/127 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Real declared 127/127 variables, and 53 constraints, problems are : Problem set: 0 solved, 75 unsolved in 879 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 47/47 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 75 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 2 (OVERLAPS) 79/126 variables, 47/51 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/126 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/126 variables, 75/127 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/126 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 6 (OVERLAPS) 1/127 variables, 1/128 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/127 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 75 unsolved
At refinement iteration 8 (OVERLAPS) 0/127 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 75 unsolved
No progress, stopping.
After SMT solving in domain Int declared 127/127 variables, and 128 constraints, problems are : Problem set: 0 solved, 75 unsolved in 1317 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 47/47 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 75/75 constraints, Known Traps: 0/0 constraints]
After SMT, in 2227ms problems are : Problem set: 0 solved, 75 unsolved
Search for dead transitions found 0 dead transitions in 2228ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2325 ms. Remains : 47/47 places, 88/88 transitions.
Computed a total of 7 stabilizing places and 14 stable transitions
Computed a total of 7 stabilizing places and 14 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
RANDOM walk for 1691 steps (154 resets) in 6 ms. (241 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering criterion allowed to conclude after 143 steps with 13 reset in 1 ms.
FORMULA CO4-PT-21-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-21-LTLCardinality-13 finished in 5615 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0)) U !p0)))'
[2024-06-02 18:35:07] [INFO ] Flatten gal took : 32 ms
[2024-06-02 18:35:07] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 1 ms.
[2024-06-02 18:35:07] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 603 places, 756 transitions and 1695 arcs took 7 ms.
Total runtime 180049 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA CO4-PT-21-LTLCardinality-10 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717353322169

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
mcc2024
ltl formula name CO4-PT-21-LTLCardinality-10
ltl formula formula --ltl=/tmp/1041/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 603 places, 756 transitions and 1695 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.070 real 0.020 user 0.030 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1041/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1041/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1041/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1041/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 605 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 604, there are 764 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~81 levels ~10000 states ~26068 transitions
pnml2lts-mc( 2/ 4): ~82 levels ~20000 states ~48912 transitions
pnml2lts-mc( 2/ 4): ~82 levels ~40000 states ~118452 transitions
pnml2lts-mc( 2/ 4): ~82 levels ~80000 states ~283924 transitions
pnml2lts-mc( 3/ 4): ~260 levels ~160000 states ~567428 transitions
pnml2lts-mc( 3/ 4): ~1257 levels ~320000 states ~1055568 transitions
pnml2lts-mc( 1/ 4): ~1773 levels ~640000 states ~2198892 transitions
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~3902!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 326350
pnml2lts-mc( 0/ 4): unique states count: 797348
pnml2lts-mc( 0/ 4): unique transitions count: 3055495
pnml2lts-mc( 0/ 4): - self-loop count: 2670
pnml2lts-mc( 0/ 4): - claim dead count: 1616190
pnml2lts-mc( 0/ 4): - claim found count: 631550
pnml2lts-mc( 0/ 4): - claim success count: 797459
pnml2lts-mc( 0/ 4): - cum. max stack depth: 8233
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 797526 states 3056183 transitions, fanout: 3.832
pnml2lts-mc( 0/ 4): Total exploration time 13.970 sec (13.970 sec minimum, 13.970 sec on average)
pnml2lts-mc( 0/ 4): States per second: 57088, Transitions per second: 218768
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 6.8MB, 8.8 B/state, compr.: 0.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 2.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 768 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 6.8MB (~256.0MB paged-in)

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CO4-PT-21"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is CO4-PT-21, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r553-tall-171734901000163"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/CO4-PT-21.tgz
mv CO4-PT-21 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;