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.r504-tall-171649612700395.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 LeafsetExtension-PT-S64C3, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r504-tall-171649612700395
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 14M
-rw-r--r-- 1 mcc users 15K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 98K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Apr 22 14:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 33K Apr 22 14:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.8K May 19 07:22 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 19 18:35 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 13:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 103K Apr 12 13:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 13:46 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K Apr 12 13:46 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.3K Apr 22 14:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.3K Apr 22 14:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 14M May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717228977227

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=LeafsetExtension-PT-S64C3
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:02:58] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 08:02:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:02:59] [INFO ] Load time of PNML (sax parser for PT used): 692 ms
[2024-06-01 08:02:59] [INFO ] Transformed 21462 places.
[2024-06-01 08:02:59] [INFO ] Transformed 21129 transitions.
[2024-06-01 08:02:59] [INFO ] Parsed PT model containing 21462 places and 21129 transitions and 67740 arcs in 891 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 44 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 6 formulas.
FORMULA LeafsetExtension-PT-S64C3-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S64C3-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S64C3-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S64C3-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S64C3-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S64C3-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 21462 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21462/21462 places, 21129/21129 transitions.
Reduce places removed 4223 places and 0 transitions.
Iterating post reduction 0 with 4223 rules applied. Total rules applied 4223 place count 17239 transition count 21129
Applied a total of 4223 rules in 317 ms. Remains 17239 /21462 variables (removed 4223) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17239 cols
[2024-06-01 08:03:01] [INFO ] Computed 198 invariants in 1915 ms
[2024-06-01 08:03:16] [INFO ] Implicit Places using invariants in 16736 ms returned [264, 527, 790, 1053, 1316, 1579, 1842, 2105, 2368, 2631, 2894, 3157, 3420, 3683, 3947, 4210, 4473, 4736, 4999, 5262, 5525, 5789, 6052, 6316, 6579, 6842, 7105, 7368, 7631, 7894, 8157, 8420, 8422, 8684, 8947, 9210, 9473, 9736, 9999, 10262, 10525, 10788, 11051, 11314, 11577, 11840, 12103, 12366, 12629, 12893, 13156, 13419, 13682, 13945, 14208, 14471, 14734, 14997, 15261, 15524, 15787, 16050, 16313, 16576, 16839, 17102]
Discarding 66 places :
Implicit Place search using SMT only with invariants took 16800 ms to find 66 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 17173/21462 places, 21129/21129 transitions.
Applied a total of 0 rules in 140 ms. Remains 17173 /17173 variables (removed 0) and now considering 21129/21129 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 17279 ms. Remains : 17173/21462 places, 21129/21129 transitions.
Support contains 47 out of 17173 places after structural reductions.
[2024-06-01 08:03:17] [INFO ] Flatten gal took : 741 ms
[2024-06-01 08:03:18] [INFO ] Flatten gal took : 508 ms
[2024-06-01 08:03:19] [INFO ] Input system was already deterministic with 21129 transitions.
RANDOM walk for 40000 steps (1551 resets) in 2960 ms. (13 steps per ms) remains 12/25 properties
BEST_FIRST walk for 40003 steps (53 resets) in 261 ms. (152 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40004 steps (55 resets) in 133 ms. (298 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (57 resets) in 118 ms. (336 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (57 resets) in 131 ms. (303 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (55 resets) in 107 ms. (370 steps per ms) remains 10/11 properties
BEST_FIRST walk for 40003 steps (55 resets) in 76 ms. (519 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40004 steps (56 resets) in 155 ms. (256 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (56 resets) in 117 ms. (339 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (56 resets) in 114 ms. (347 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (53 resets) in 108 ms. (367 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (58 resets) in 102 ms. (388 steps per ms) remains 9/9 properties
// Phase 1: matrix 21129 rows 17173 cols
[2024-06-01 08:03:22] [INFO ] Computed 132 invariants in 1633 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, 9 unsolved
At refinement iteration 1 (OVERLAPS) 13154/13167 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13167 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 4001/17168 variables, 126/132 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 17168/38302 variables, and 132 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5016 ms.
Refiners :[Generalized P Invariants (flows): 132/132 constraints, State Equation: 0/17173 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 13154/13167 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 9 unsolved
[2024-06-01 08:03:29] [INFO ] Deduced a trap composed of 130 places in 444 ms of which 13 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/13167 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 13167/38302 variables, and 7 constraints, problems are : Problem set: 0 solved, 9 unsolved in 5034 ms.
Refiners :[Generalized P Invariants (flows): 6/132 constraints, State Equation: 0/17173 constraints, PredecessorRefiner: 0/9 constraints, Known Traps: 1/1 constraints]
After SMT, in 11847ms problems are : Problem set: 0 solved, 9 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 13 out of 17173 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 17173/17173 places, 21129/21129 transitions.
Graph (complete) has 33870 edges and 17173 vertex of which 826 are kept as prefixes of interest. Removing 16347 places using SCC suffix rule.29 ms
Discarding 16347 places :
Also discarding 15792 output transitions
Drop transitions (Output transitions of discarded places.) removed 15792 transitions
Drop transitions (Empty/Sink Transition effects.) removed 432 transitions
Reduce isomorphic transitions removed 432 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 316 transitions
Trivial Post-agglo rules discarded 316 transitions
Performed 316 trivial Post agglomeration. Transition count delta: 316
Iterating post reduction 0 with 748 rules applied. Total rules applied 749 place count 826 transition count 4589
Reduce places removed 318 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 1 with 328 rules applied. Total rules applied 1077 place count 508 transition count 4579
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 1087 place count 498 transition count 4579
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 17 Pre rules applied. Total rules applied 1087 place count 498 transition count 4562
Deduced a syphon composed of 17 places in 2 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 1121 place count 481 transition count 4562
Discarding 300 places :
Symmetric choice reduction at 3 with 300 rule applications. Total rules 1421 place count 181 transition count 4262
Iterating global reduction 3 with 300 rules applied. Total rules applied 1721 place count 181 transition count 4262
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 16
Deduced a syphon composed of 16 places in 1 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 1753 place count 165 transition count 4246
Free-agglomeration rule (complex) applied 65 times.
Iterating global reduction 3 with 65 rules applied. Total rules applied 1818 place count 165 transition count 4181
Reduce places removed 65 places and 0 transitions.
Iterating post reduction 3 with 65 rules applied. Total rules applied 1883 place count 100 transition count 4181
Applied a total of 1883 rules in 673 ms. Remains 100 /17173 variables (removed 17073) and now considering 4181/21129 (removed 16948) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 675 ms. Remains : 100/17173 places, 4181/21129 transitions.
RANDOM walk for 40000 steps (9587 resets) in 2575 ms. (15 steps per ms) remains 8/9 properties
BEST_FIRST walk for 40004 steps (32 resets) in 74 ms. (533 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (32 resets) in 79 ms. (500 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (32 resets) in 85 ms. (465 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (32 resets) in 83 ms. (476 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (32 resets) in 80 ms. (493 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (36 resets) in 79 ms. (500 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (32 resets) in 82 ms. (481 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (36 resets) in 75 ms. (526 steps per ms) remains 8/8 properties
[2024-06-01 08:03:34] [INFO ] Flow matrix only has 409 transitions (discarded 3772 similar events)
// Phase 1: matrix 409 rows 100 cols
[2024-06-01 08:03:34] [INFO ] Computed 1 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 20/31 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp19 is UNSAT
At refinement iteration 3 (OVERLAPS) 406/437 variables, 20/31 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/437 variables, 0/31 constraints. Problems are: Problem set: 2 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 63/500 variables, 1/32 constraints. Problems are: Problem set: 2 solved, 6 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
After SMT solving in domain Real declared 500/509 variables, and 95 constraints, problems are : Problem set: 8 solved, 0 unsolved in 177 ms.
Refiners :[Generalized P Invariants (flows): 1/1 constraints, State Equation: 94/100 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints]
After SMT, in 203ms problems are : Problem set: 8 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 8 atomic propositions for a total of 10 simplifications.
FORMULA LeafsetExtension-PT-S64C3-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S64C3-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S64C3-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 17173 stabilizing places and 21129 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17173 transition count 21129
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA LeafsetExtension-PT-S64C3-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA LeafsetExtension-PT-S64C3-LTLCardinality-08 FALSE 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' '!(((p0 U p1) U X((p2||X((X((p3 U !p1)) U (p2&&X((p3 U !p1)))))))))'
Support contains 8 out of 17173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17173/17173 places, 21129/21129 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 17168 transition count 21129
Applied a total of 5 rules in 78 ms. Remains 17168 /17173 variables (removed 5) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17168 cols
[2024-06-01 08:03:36] [INFO ] Computed 132 invariants in 1611 ms
[2024-06-01 08:03:43] [INFO ] Implicit Places using invariants in 8549 ms returned []
Implicit Place search using SMT only with invariants took 8550 ms to find 0 implicit places.
Running 21064 sub problems to find dead transitions.
[2024-06-01 08:03:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/17166 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 21064 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 17166/38297 variables, and 131 constraints, problems are : Problem set: 0 solved, 21064 unsolved in 30308 ms.
Refiners :[Generalized P Invariants (flows): 131/132 constraints, State Equation: 0/17168 constraints, PredecessorRefiner: 21064/21062 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21064 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17166 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 21064 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 17166/38297 variables, and 131 constraints, problems are : Problem set: 0 solved, 21064 unsolved in 30318 ms.
Refiners :[Generalized P Invariants (flows): 131/132 constraints, State Equation: 0/17168 constraints, PredecessorRefiner: 2/21062 constraints, Known Traps: 0/0 constraints]
After SMT, in 103139ms problems are : Problem set: 0 solved, 21064 unsolved
Search for dead transitions found 0 dead transitions in 103367ms
Starting structural reductions in LTL mode, iteration 1 : 17168/17173 places, 21129/21129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 112065 ms. Remains : 17168/17173 places, 21129/21129 transitions.
Stuttering acceptance computed with spot in 554 ms :[(NOT p2), (NOT p2), (AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (OR (NOT p2) p1), p1, true, false]
Running random walk in product with property : LeafsetExtension-PT-S64C3-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 5575 ms.
Product exploration explored 100000 steps with 50000 reset in 4743 ms.
Computed a total of 17168 stabilizing places and 21129 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 17168 transition count 21129
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Knowledge obtained : [(AND p1 p0 p2 p3), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X p2), (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (G p0)), (F (G p2)), (F (G p3))]
False Knowledge obtained : [(X (X (NOT p2))), (X (X p2)), (X (X (OR (AND p1 (NOT p2)) (AND p0 (NOT p2))))), (X (X (NOT (OR (AND p1 (NOT p2)) (AND p0 (NOT p2)))))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 15 factoid took 27 ms. Reduced automaton from 8 states, 15 edges and 4 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA LeafsetExtension-PT-S64C3-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property LeafsetExtension-PT-S64C3-LTLCardinality-01 finished in 136006 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((X(G(p0)) U (p1 U G(p0))))))))'
Support contains 3 out of 17173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17173/17173 places, 21129/21129 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 17168 transition count 21129
Applied a total of 5 rules in 85 ms. Remains 17168 /17173 variables (removed 5) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17168 cols
[2024-06-01 08:05:52] [INFO ] Computed 132 invariants in 1594 ms
[2024-06-01 08:05:59] [INFO ] Implicit Places using invariants in 8239 ms returned []
Implicit Place search using SMT only with invariants took 8241 ms to find 0 implicit places.
Running 21064 sub problems to find dead transitions.
[2024-06-01 08:05:59] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/17166 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 21064 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 17166/38297 variables, and 131 constraints, problems are : Problem set: 0 solved, 21064 unsolved in 30313 ms.
Refiners :[Generalized P Invariants (flows): 131/132 constraints, State Equation: 0/17168 constraints, PredecessorRefiner: 21064/21062 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21064 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17166 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 21064 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 17166/38297 variables, and 131 constraints, problems are : Problem set: 0 solved, 21064 unsolved in 30330 ms.
Refiners :[Generalized P Invariants (flows): 131/132 constraints, State Equation: 0/17168 constraints, PredecessorRefiner: 2/21062 constraints, Known Traps: 0/0 constraints]
After SMT, in 100918ms problems are : Problem set: 0 solved, 21064 unsolved
Search for dead transitions found 0 dead transitions in 101095ms
Starting structural reductions in LTL mode, iteration 1 : 17168/17173 places, 21129/21129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 109472 ms. Remains : 17168/17173 places, 21129/21129 transitions.
Stuttering acceptance computed with spot in 313 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : LeafsetExtension-PT-S64C3-LTLCardinality-02
Stuttering criterion allowed to conclude after 130 steps with 4 reset in 3 ms.
FORMULA LeafsetExtension-PT-S64C3-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C3-LTLCardinality-02 finished in 109848 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(p1)&&p0)))'
Support contains 6 out of 17173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17173/17173 places, 21129/21129 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 17168 transition count 21129
Applied a total of 5 rules in 73 ms. Remains 17168 /17173 variables (removed 5) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17168 cols
[2024-06-01 08:07:42] [INFO ] Computed 132 invariants in 1598 ms
[2024-06-01 08:07:49] [INFO ] Implicit Places using invariants in 8452 ms returned []
Implicit Place search using SMT only with invariants took 8455 ms to find 0 implicit places.
Running 21064 sub problems to find dead transitions.
[2024-06-01 08:07:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/17166 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 21064 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 17166/38297 variables, and 131 constraints, problems are : Problem set: 0 solved, 21064 unsolved in 30322 ms.
Refiners :[Generalized P Invariants (flows): 131/132 constraints, State Equation: 0/17168 constraints, PredecessorRefiner: 21064/21062 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21064 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17166 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 21064 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 17166/38297 variables, and 131 constraints, problems are : Problem set: 0 solved, 21064 unsolved in 30320 ms.
Refiners :[Generalized P Invariants (flows): 131/132 constraints, State Equation: 0/17168 constraints, PredecessorRefiner: 2/21062 constraints, Known Traps: 0/0 constraints]
After SMT, in 101432ms problems are : Problem set: 0 solved, 21064 unsolved
Search for dead transitions found 0 dead transitions in 101604ms
Starting structural reductions in LTL mode, iteration 1 : 17168/17173 places, 21129/21129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110162 ms. Remains : 17168/17173 places, 21129/21129 transitions.
Stuttering acceptance computed with spot in 134 ms :[true, (OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : LeafsetExtension-PT-S64C3-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA LeafsetExtension-PT-S64C3-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C3-LTLCardinality-06 finished in 110361 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)&&X(G((F(G(p1)) U (p2||F(!p0)))))))'
Support contains 6 out of 17173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 17173/17173 places, 21129/21129 transitions.
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 17167 transition count 21129
Applied a total of 6 rules in 75 ms. Remains 17167 /17173 variables (removed 6) and now considering 21129/21129 (removed 0) transitions.
// Phase 1: matrix 21129 rows 17167 cols
[2024-06-01 08:09:32] [INFO ] Computed 132 invariants in 1631 ms
[2024-06-01 08:09:39] [INFO ] Implicit Places using invariants in 8616 ms returned []
Implicit Place search using SMT only with invariants took 8621 ms to find 0 implicit places.
Running 21064 sub problems to find dead transitions.
[2024-06-01 08:09:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/17166 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 21064 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 17166/38296 variables, and 131 constraints, problems are : Problem set: 0 solved, 21064 unsolved in 30293 ms.
Refiners :[Generalized P Invariants (flows): 131/132 constraints, State Equation: 0/17167 constraints, PredecessorRefiner: 21064/21062 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21064 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17166 variables, 131/131 constraints. Problems are: Problem set: 0 solved, 21064 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 17166/38296 variables, and 131 constraints, problems are : Problem set: 0 solved, 21064 unsolved in 30434 ms.
Refiners :[Generalized P Invariants (flows): 131/132 constraints, State Equation: 0/17167 constraints, PredecessorRefiner: 2/21062 constraints, Known Traps: 0/0 constraints]
After SMT, in 101446ms problems are : Problem set: 0 solved, 21064 unsolved
Search for dead transitions found 0 dead transitions in 101610ms
Starting structural reductions in LTL mode, iteration 1 : 17167/17173 places, 21129/21129 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 110333 ms. Remains : 17167/17173 places, 21129/21129 transitions.
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (AND p0 (NOT p2)), (AND p0 (NOT p1)), (AND p0 (NOT p2))]
Running random walk in product with property : LeafsetExtension-PT-S64C3-LTLCardinality-14
Stuttering criterion allowed to conclude after 53 steps with 1 reset in 3 ms.
FORMULA LeafsetExtension-PT-S64C3-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C3-LTLCardinality-14 finished in 110630 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(p1))))'
Support contains 4 out of 17173 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 17173/17173 places, 21129/21129 transitions.
Graph (complete) has 38227 edges and 17173 vertex of which 17165 are kept as prefixes of interest. Removing 8 places using SCC suffix rule.58 ms
Discarding 8 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 8315 transitions
Trivial Post-agglo rules discarded 8315 transitions
Performed 8315 trivial Post agglomeration. Transition count delta: 8315
Iterating post reduction 0 with 8315 rules applied. Total rules applied 8316 place count 17165 transition count 12812
Reduce places removed 8315 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 8316 rules applied. Total rules applied 16632 place count 8850 transition count 12811
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 16633 place count 8849 transition count 12811
Performed 131 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 131 Pre rules applied. Total rules applied 16633 place count 8849 transition count 12680
Deduced a syphon composed of 131 places in 40 ms
Reduce places removed 131 places and 0 transitions.
Iterating global reduction 3 with 262 rules applied. Total rules applied 16895 place count 8718 transition count 12680
Discarding 4028 places :
Symmetric choice reduction at 3 with 4028 rule applications. Total rules 20923 place count 4690 transition count 8652
Iterating global reduction 3 with 4028 rules applied. Total rules applied 24951 place count 4690 transition count 8652
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 24951 place count 4690 transition count 8651
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 24953 place count 4689 transition count 8651
Discarding 4026 places :
Symmetric choice reduction at 3 with 4026 rule applications. Total rules 28979 place count 663 transition count 4625
Iterating global reduction 3 with 4026 rules applied. Total rules applied 33005 place count 663 transition count 4625
Discarding 62 places :
Implicit places reduction removed 62 places
Iterating post reduction 3 with 62 rules applied. Total rules applied 33067 place count 601 transition count 4625
Performed 62 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 62 Pre rules applied. Total rules applied 33067 place count 601 transition count 4563
Deduced a syphon composed of 62 places in 1 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 4 with 124 rules applied. Total rules applied 33191 place count 539 transition count 4563
Discarding 61 places :
Symmetric choice reduction at 4 with 61 rule applications. Total rules 33252 place count 478 transition count 4502
Iterating global reduction 4 with 61 rules applied. Total rules applied 33313 place count 478 transition count 4502
Discarding 61 places :
Symmetric choice reduction at 4 with 61 rule applications. Total rules 33374 place count 417 transition count 4441
Iterating global reduction 4 with 61 rules applied. Total rules applied 33435 place count 417 transition count 4441
Performed 70 Post agglomeration using F-continuation condition.Transition count delta: 70
Deduced a syphon composed of 70 places in 1 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 4 with 140 rules applied. Total rules applied 33575 place count 347 transition count 4371
Applied a total of 33575 rules in 2354 ms. Remains 347 /17173 variables (removed 16826) and now considering 4371/21129 (removed 16758) transitions.
[2024-06-01 08:11:24] [INFO ] Flow matrix only has 2420 transitions (discarded 1951 similar events)
// Phase 1: matrix 2420 rows 347 cols
[2024-06-01 08:11:24] [INFO ] Computed 70 invariants in 15 ms
[2024-06-01 08:11:24] [INFO ] Implicit Places using invariants in 364 ms returned [3, 7, 11, 15, 19, 23, 27, 31, 35, 39, 43, 47, 51, 55, 59, 63, 70, 75, 79, 83, 87, 91, 95, 99, 106, 111, 115, 119, 122, 127, 131, 135, 139, 143, 147, 151, 155, 159, 163, 169, 173, 177, 181, 185, 189, 193, 197, 201, 205, 209, 213, 217, 221, 225, 229, 233, 237, 241, 245, 249, 253, 257, 261, 265, 269, 273]
Discarding 66 places :
Implicit Place search using SMT only with invariants took 367 ms to find 66 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 281/17173 places, 4371/21129 transitions.
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 64 place count 217 transition count 4307
Iterating global reduction 0 with 64 rules applied. Total rules applied 128 place count 217 transition count 4307
Discarding 64 places :
Symmetric choice reduction at 0 with 64 rule applications. Total rules 192 place count 153 transition count 4243
Iterating global reduction 0 with 64 rules applied. Total rules applied 256 place count 153 transition count 4243
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 258 place count 152 transition count 4242
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 259 place count 151 transition count 4241
Iterating global reduction 0 with 1 rules applied. Total rules applied 260 place count 151 transition count 4241
Applied a total of 260 rules in 343 ms. Remains 151 /281 variables (removed 130) and now considering 4241/4371 (removed 130) transitions.
[2024-06-01 08:11:24] [INFO ] Flow matrix only has 213 transitions (discarded 4028 similar events)
// Phase 1: matrix 213 rows 151 cols
[2024-06-01 08:11:24] [INFO ] Computed 4 invariants in 2 ms
[2024-06-01 08:11:24] [INFO ] Implicit Places using invariants in 268 ms returned []
[2024-06-01 08:11:24] [INFO ] Flow matrix only has 213 transitions (discarded 4028 similar events)
[2024-06-01 08:11:24] [INFO ] Invariant cache hit.
[2024-06-01 08:11:25] [INFO ] Implicit Places using invariants and state equation in 493 ms returned []
Implicit Place search using SMT with State Equation took 764 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 151/17173 places, 4241/21129 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3829 ms. Remains : 151/17173 places, 4241/21129 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : LeafsetExtension-PT-S64C3-LTLCardinality-15
Stuttering criterion allowed to conclude after 2743 steps with 227 reset in 23 ms.
FORMULA LeafsetExtension-PT-S64C3-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property LeafsetExtension-PT-S64C3-LTLCardinality-15 finished in 4012 ms.
All properties solved by simple procedures.
Total runtime 507247 ms.
ITS solved all properties within timeout

BK_STOP 1717229486027

--------------------
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

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="LeafsetExtension-PT-S64C3"
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 LeafsetExtension-PT-S64C3, 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 r504-tall-171649612700395"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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