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.r544-smll-171701111000195.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 UtilityControlRoom-PT-Z2T4N06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r544-smll-171701111000195
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 33K Apr 13 05:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 187K Apr 13 05:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 24K Apr 13 05:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 120K Apr 13 05:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 7.8K Apr 23 08:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 37K Apr 23 08:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 23 08:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 42K Apr 23 08:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 60K Apr 13 05:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 341K Apr 13 05:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 67K Apr 13 05:35 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 300K Apr 13 05:35 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.8K Apr 23 08:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 5.9K Apr 23 08:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 8 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 70K May 18 16:43 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 UtilityControlRoom-PT-Z2T4N06-LTLCardinality-00
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-LTLCardinality-01
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-LTLCardinality-02
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-LTLCardinality-03
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-LTLCardinality-04
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-LTLCardinality-05
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-LTLCardinality-06
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-LTLCardinality-07
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-LTLCardinality-08
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-LTLCardinality-09
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-LTLCardinality-10
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-LTLCardinality-11
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-LTLCardinality-12
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-LTLCardinality-13
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-LTLCardinality-14
FORMULA_NAME UtilityControlRoom-PT-Z2T4N06-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717273599177

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=UtilityControlRoom-PT-Z2T4N06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 20:26:41] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 20:26:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 20:26:41] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2024-06-01 20:26:41] [INFO ] Transformed 106 places.
[2024-06-01 20:26:41] [INFO ] Transformed 162 transitions.
[2024-06-01 20:26:41] [INFO ] Parsed PT model containing 106 places and 162 transitions and 510 arcs in 263 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Ensure Unique test removed 24 transitions
Reduce redundant transitions removed 24 transitions.
FORMULA UtilityControlRoom-PT-Z2T4N06-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA UtilityControlRoom-PT-Z2T4N06-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 79 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 138/138 transitions.
Applied a total of 0 rules in 14 ms. Remains 106 /106 variables (removed 0) and now considering 138/138 (removed 0) transitions.
// Phase 1: matrix 138 rows 106 cols
[2024-06-01 20:26:41] [INFO ] Computed 15 invariants in 21 ms
[2024-06-01 20:26:42] [INFO ] Implicit Places using invariants in 511 ms returned []
[2024-06-01 20:26:42] [INFO ] Invariant cache hit.
[2024-06-01 20:26:42] [INFO ] Implicit Places using invariants and state equation in 207 ms returned []
Implicit Place search using SMT with State Equation took 769 ms to find 0 implicit places.
Running 132 sub problems to find dead transitions.
[2024-06-01 20:26:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 6/106 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 138/244 variables, 106/121 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (OVERLAPS) 0/244 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Real declared 244/244 variables, and 121 constraints, problems are : Problem set: 0 solved, 132 unsolved in 4552 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 132 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/100 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/100 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 2 (OVERLAPS) 6/106 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/106 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 4 (OVERLAPS) 138/244 variables, 106/121 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/244 variables, 132/253 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/244 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 132 unsolved
At refinement iteration 7 (OVERLAPS) 0/244 variables, 0/253 constraints. Problems are: Problem set: 0 solved, 132 unsolved
No progress, stopping.
After SMT solving in domain Int declared 244/244 variables, and 253 constraints, problems are : Problem set: 0 solved, 132 unsolved in 4630 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 106/106 constraints, PredecessorRefiner: 132/132 constraints, Known Traps: 0/0 constraints]
After SMT, in 9377ms problems are : Problem set: 0 solved, 132 unsolved
Search for dead transitions found 0 dead transitions in 9400ms
Finished structural reductions in LTL mode , in 1 iterations and 10216 ms. Remains : 106/106 places, 138/138 transitions.
Support contains 79 out of 106 places after structural reductions.
[2024-06-01 20:26:52] [INFO ] Flatten gal took : 52 ms
[2024-06-01 20:26:52] [INFO ] Flatten gal took : 21 ms
[2024-06-01 20:26:52] [INFO ] Input system was already deterministic with 138 transitions.
RANDOM walk for 40000 steps (8 resets) in 2257 ms. (17 steps per ms) remains 5/24 properties
BEST_FIRST walk for 40004 steps (8 resets) in 534 ms. (74 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 220 ms. (181 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 429 ms. (93 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 344 ms. (115 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 275 ms. (144 steps per ms) remains 5/5 properties
[2024-06-01 20:26:53] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp22 is UNSAT
After SMT solving in domain Real declared 94/244 variables, and 9 constraints, problems are : Problem set: 5 solved, 0 unsolved in 69 ms.
Refiners :[Positive P Invariants (semi-flows): 9/15 constraints, State Equation: 0/106 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 80ms problems are : Problem set: 5 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
FORMULA UtilityControlRoom-PT-Z2T4N06-LTLCardinality-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 5 atomic propositions for a total of 13 simplifications.
FORMULA UtilityControlRoom-PT-Z2T4N06-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
FORMULA UtilityControlRoom-PT-Z2T4N06-LTLCardinality-10 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' '!((X(X(X(G(p0))))&&F(p1)))'
Support contains 13 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 94 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 94 transition count 126
Applied a total of 24 rules in 16 ms. Remains 94 /106 variables (removed 12) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 94 cols
[2024-06-01 20:26:53] [INFO ] Computed 15 invariants in 3 ms
[2024-06-01 20:26:54] [INFO ] Implicit Places using invariants in 121 ms returned [63]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 125 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 93/106 places, 126/138 transitions.
Applied a total of 0 rules in 5 ms. Remains 93 /93 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 148 ms. Remains : 93/106 places, 126/138 transitions.
Stuttering acceptance computed with spot in 424 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), true]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N06-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 23 steps with 1 reset in 3 ms.
FORMULA UtilityControlRoom-PT-Z2T4N06-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N06-LTLCardinality-00 finished in 666 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((p0 U (p1||G(p0)))))'
Support contains 18 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 94 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 94 transition count 126
Applied a total of 24 rules in 7 ms. Remains 94 /106 variables (removed 12) and now considering 126/138 (removed 12) transitions.
[2024-06-01 20:26:54] [INFO ] Invariant cache hit.
[2024-06-01 20:26:54] [INFO ] Implicit Places using invariants in 141 ms returned [63]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 143 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 93/106 places, 126/138 transitions.
Applied a total of 0 rules in 3 ms. Remains 93 /93 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 153 ms. Remains : 93/106 places, 126/138 transitions.
Stuttering acceptance computed with spot in 91 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N06-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA UtilityControlRoom-PT-Z2T4N06-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N06-LTLCardinality-01 finished in 277 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(p0)&&X(F((!p0 U (G(!p0)||(!p0&&(p1 U (p2||G(p1)))))))))))'
Support contains 1 out of 106 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 138/138 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 100 transition count 132
Applied a total of 12 rules in 27 ms. Remains 100 /106 variables (removed 6) and now considering 132/138 (removed 6) transitions.
// Phase 1: matrix 132 rows 100 cols
[2024-06-01 20:26:54] [INFO ] Computed 15 invariants in 2 ms
[2024-06-01 20:26:54] [INFO ] Implicit Places using invariants in 86 ms returned [69]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 88 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 99/106 places, 132/138 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 24 place count 87 transition count 120
Applied a total of 24 rules in 10 ms. Remains 87 /99 variables (removed 12) and now considering 120/132 (removed 12) transitions.
// Phase 1: matrix 120 rows 87 cols
[2024-06-01 20:26:54] [INFO ] Computed 14 invariants in 2 ms
[2024-06-01 20:26:54] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-06-01 20:26:54] [INFO ] Invariant cache hit.
[2024-06-01 20:26:55] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 87/106 places, 120/138 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 304 ms. Remains : 87/106 places, 120/138 transitions.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N06-LTLCardinality-02
Initial state of product has no viable successors after 0 steps with 0 reset in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T4N06-LTLCardinality-02 TRUE TECHNIQUES STUTTER_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N06-LTLCardinality-02 finished in 370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0||X(p1)))||G(F(p1)))))'
Support contains 25 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 138/138 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 106 transition count 114
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 60 place count 82 transition count 102
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 61 place count 81 transition count 90
Iterating global reduction 2 with 1 rules applied. Total rules applied 62 place count 81 transition count 90
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 68 place count 75 transition count 84
Iterating global reduction 2 with 6 rules applied. Total rules applied 74 place count 75 transition count 84
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 86 place count 69 transition count 78
Applied a total of 86 rules in 24 ms. Remains 69 /106 variables (removed 37) and now considering 78/138 (removed 60) transitions.
// Phase 1: matrix 78 rows 69 cols
[2024-06-01 20:26:55] [INFO ] Computed 15 invariants in 2 ms
[2024-06-01 20:26:55] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-06-01 20:26:55] [INFO ] Invariant cache hit.
[2024-06-01 20:26:55] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2024-06-01 20:26:55] [INFO ] Redundant transitions in 2 ms returned []
Running 66 sub problems to find dead transitions.
[2024-06-01 20:26:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 6/69 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 78/147 variables, 69/84 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 0/147 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 84 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1467 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 6/69 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 78/147 variables, 69/84 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 66/150 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 0/147 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 150 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1516 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
After SMT, in 3017ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 3019ms
Starting structural reductions in SI_LTL mode, iteration 1 : 69/106 places, 78/138 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3221 ms. Remains : 69/106 places, 78/138 transitions.
Stuttering acceptance computed with spot in 138 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N06-LTLCardinality-03
Product exploration explored 100000 steps with 3928 reset in 623 ms.
Product exploration explored 100000 steps with 3890 reset in 450 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 8 factoid took 188 ms. Reduced automaton from 3 states, 7 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 36976 steps (8 resets) in 231 ms. (159 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 8 factoid took 299 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 87 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 25 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 78/78 transitions.
Applied a total of 0 rules in 5 ms. Remains 69 /69 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2024-06-01 20:27:00] [INFO ] Invariant cache hit.
[2024-06-01 20:27:00] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-06-01 20:27:00] [INFO ] Invariant cache hit.
[2024-06-01 20:27:00] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2024-06-01 20:27:00] [INFO ] Redundant transitions in 1 ms returned []
Running 66 sub problems to find dead transitions.
[2024-06-01 20:27:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 6/69 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 78/147 variables, 69/84 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 0/147 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 84 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1421 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 6/69 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 78/147 variables, 69/84 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 66/150 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 0/147 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 150 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1619 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
After SMT, in 3067ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 3069ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3271 ms. Remains : 69/69 places, 78/78 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 8 factoid took 170 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (8 resets) in 124 ms. (320 steps per ms) remains 1/4 properties
BEST_FIRST walk for 9740 steps (1 resets) in 25 ms. (374 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p0)), (X p1), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F p0), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 8 factoid took 294 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 2 reset in 189 ms.
Product exploration explored 100000 steps with 0 reset in 327 ms.
Support contains 25 out of 69 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 69/69 places, 78/78 transitions.
Applied a total of 0 rules in 4 ms. Remains 69 /69 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2024-06-01 20:27:05] [INFO ] Invariant cache hit.
[2024-06-01 20:27:05] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-06-01 20:27:05] [INFO ] Invariant cache hit.
[2024-06-01 20:27:05] [INFO ] Implicit Places using invariants and state equation in 95 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2024-06-01 20:27:05] [INFO ] Redundant transitions in 2 ms returned []
Running 66 sub problems to find dead transitions.
[2024-06-01 20:27:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 6/69 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 78/147 variables, 69/84 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (OVERLAPS) 0/147 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Real declared 147/147 variables, and 84 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1641 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 66 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/63 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/63 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 2 (OVERLAPS) 6/69 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/69 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 4 (OVERLAPS) 78/147 variables, 69/84 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/147 variables, 66/150 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 66 unsolved
At refinement iteration 7 (OVERLAPS) 0/147 variables, 0/150 constraints. Problems are: Problem set: 0 solved, 66 unsolved
No progress, stopping.
After SMT solving in domain Int declared 147/147 variables, and 150 constraints, problems are : Problem set: 0 solved, 66 unsolved in 1603 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 69/69 constraints, PredecessorRefiner: 66/66 constraints, Known Traps: 0/0 constraints]
After SMT, in 3265ms problems are : Problem set: 0 solved, 66 unsolved
Search for dead transitions found 0 dead transitions in 3267ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3436 ms. Remains : 69/69 places, 78/78 transitions.
Treatment of property UtilityControlRoom-PT-Z2T4N06-LTLCardinality-03 finished in 13615 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0 U (p1||G(p0)))))))'
Support contains 19 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 94 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 94 transition count 126
Applied a total of 24 rules in 7 ms. Remains 94 /106 variables (removed 12) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 94 cols
[2024-06-01 20:27:08] [INFO ] Computed 15 invariants in 2 ms
[2024-06-01 20:27:08] [INFO ] Implicit Places using invariants in 90 ms returned []
[2024-06-01 20:27:08] [INFO ] Invariant cache hit.
[2024-06-01 20:27:08] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-06-01 20:27:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/94 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/220 variables, 94/109 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 0/220 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 109 constraints, problems are : Problem set: 0 solved, 120 unsolved in 3456 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/94 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/220 variables, 94/109 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 120/229 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/220 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 229 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4428 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 7943ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 7947ms
Starting structural reductions in LTL mode, iteration 1 : 94/106 places, 126/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8193 ms. Remains : 94/106 places, 126/138 transitions.
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N06-LTLCardinality-04
Product exploration explored 100000 steps with 1855 reset in 294 ms.
Stack based approach found an accepted trace after 1409 steps with 55 reset with depth 1208 and stack size 1208 in 6 ms.
FORMULA UtilityControlRoom-PT-Z2T4N06-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N06-LTLCardinality-04 finished in 8664 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 94 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 94 transition count 126
Applied a total of 24 rules in 14 ms. Remains 94 /106 variables (removed 12) and now considering 126/138 (removed 12) transitions.
[2024-06-01 20:27:17] [INFO ] Invariant cache hit.
[2024-06-01 20:27:17] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-01 20:27:17] [INFO ] Invariant cache hit.
[2024-06-01 20:27:17] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 213 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-06-01 20:27:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/94 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/220 variables, 94/109 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 0/220 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 220/220 variables, and 109 constraints, problems are : Problem set: 0 solved, 120 unsolved in 3434 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/88 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/88 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/94 variables, 13/15 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/94 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/220 variables, 94/109 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/220 variables, 120/229 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/220 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/220 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 220/220 variables, and 229 constraints, problems are : Problem set: 0 solved, 120 unsolved in 4392 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 94/94 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 7875ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 7877ms
Starting structural reductions in LTL mode, iteration 1 : 94/106 places, 126/138 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8106 ms. Remains : 94/106 places, 126/138 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N06-LTLCardinality-06
Product exploration explored 100000 steps with 50000 reset in 134 ms.
Product exploration explored 100000 steps with 50000 reset in 137 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA UtilityControlRoom-PT-Z2T4N06-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property UtilityControlRoom-PT-Z2T4N06-LTLCardinality-06 finished in 8492 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)||F(!p1))))'
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 94 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 94 transition count 126
Applied a total of 24 rules in 5 ms. Remains 94 /106 variables (removed 12) and now considering 126/138 (removed 12) transitions.
[2024-06-01 20:27:25] [INFO ] Invariant cache hit.
[2024-06-01 20:27:26] [INFO ] Implicit Places using invariants in 97 ms returned [63]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 99 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 93/106 places, 126/138 transitions.
Applied a total of 0 rules in 2 ms. Remains 93 /93 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 106 ms. Remains : 93/106 places, 126/138 transitions.
Stuttering acceptance computed with spot in 124 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N06-LTLCardinality-07
Product exploration explored 100000 steps with 1384 reset in 169 ms.
Stack based approach found an accepted trace after 12302 steps with 183 reset with depth 108 and stack size 108 in 22 ms.
FORMULA UtilityControlRoom-PT-Z2T4N06-LTLCardinality-07 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N06-LTLCardinality-07 finished in 437 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 U (p1||G(p0)))))'
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 138/138 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 106 transition count 114
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 60 place count 82 transition count 102
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 60 place count 82 transition count 91
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 82 place count 71 transition count 91
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 70 transition count 79
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 70 transition count 79
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 89 place count 65 transition count 74
Iterating global reduction 2 with 5 rules applied. Total rules applied 94 place count 65 transition count 74
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 98 place count 61 transition count 66
Iterating global reduction 2 with 4 rules applied. Total rules applied 102 place count 61 transition count 66
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 106 place count 57 transition count 62
Iterating global reduction 2 with 4 rules applied. Total rules applied 110 place count 57 transition count 62
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 114 place count 57 transition count 58
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 114 place count 57 transition count 54
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 122 place count 53 transition count 54
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 17 rules applied. Total rules applied 139 place count 44 transition count 46
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 147 place count 40 transition count 42
Applied a total of 147 rules in 24 ms. Remains 40 /106 variables (removed 66) and now considering 42/138 (removed 96) transitions.
// Phase 1: matrix 42 rows 40 cols
[2024-06-01 20:27:26] [INFO ] Computed 14 invariants in 0 ms
[2024-06-01 20:27:26] [INFO ] Implicit Places using invariants in 57 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 59 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 39/106 places, 42/138 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 33 transition count 36
Applied a total of 12 rules in 5 ms. Remains 33 /39 variables (removed 6) and now considering 36/42 (removed 6) transitions.
// Phase 1: matrix 36 rows 33 cols
[2024-06-01 20:27:26] [INFO ] Computed 13 invariants in 1 ms
[2024-06-01 20:27:26] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-06-01 20:27:26] [INFO ] Invariant cache hit.
[2024-06-01 20:27:26] [INFO ] Implicit Places using invariants and state equation in 60 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 33/106 places, 36/138 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 195 ms. Remains : 33/106 places, 36/138 transitions.
Stuttering acceptance computed with spot in 42 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N06-LTLCardinality-08
Product exploration explored 100000 steps with 723 reset in 203 ms.
Stack based approach found an accepted trace after 10 steps with 0 reset with depth 11 and stack size 11 in 0 ms.
FORMULA UtilityControlRoom-PT-Z2T4N06-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N06-LTLCardinality-08 finished in 458 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 X(!p1)))))'
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 94 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 94 transition count 126
Applied a total of 24 rules in 4 ms. Remains 94 /106 variables (removed 12) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 94 cols
[2024-06-01 20:27:26] [INFO ] Computed 15 invariants in 1 ms
[2024-06-01 20:27:26] [INFO ] Implicit Places using invariants in 93 ms returned [63]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 95 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 93/106 places, 126/138 transitions.
Applied a total of 0 rules in 1 ms. Remains 93 /93 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 100 ms. Remains : 93/106 places, 126/138 transitions.
Stuttering acceptance computed with spot in 208 ms :[p1, p1, (AND (NOT p0) p1), p1, (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N06-LTLCardinality-09
Product exploration explored 100000 steps with 27874 reset in 148 ms.
Product exploration explored 100000 steps with 27836 reset in 171 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 218 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 214 ms :[p1, p1, (AND (NOT p0) p1), p1, (NOT p0)]
RANDOM walk for 112 steps (0 resets) in 5 ms. (18 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0), (F p1), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 3 factoid took 316 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[p1, p1, (AND (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 205 ms :[p1, p1, (AND (NOT p0) p1), p1, (NOT p0)]
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 126/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 93 /93 variables (removed 0) and now considering 126/126 (removed 0) transitions.
// Phase 1: matrix 126 rows 93 cols
[2024-06-01 20:27:28] [INFO ] Computed 14 invariants in 1 ms
[2024-06-01 20:27:28] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-01 20:27:28] [INFO ] Invariant cache hit.
[2024-06-01 20:27:28] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-06-01 20:27:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 107 constraints, problems are : Problem set: 0 solved, 120 unsolved in 3422 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 120/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 227 constraints, problems are : Problem set: 0 solved, 120 unsolved in 3954 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 7440ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 7442ms
Finished structural reductions in LTL mode , in 1 iterations and 7657 ms. Remains : 93/93 places, 126/126 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 3 factoid took 196 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[p1, p1, (AND (NOT p0) p1), p1, (NOT p0)]
RANDOM walk for 127 steps (0 resets) in 5 ms. (21 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0), (F p1), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 3 factoid took 279 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[p1, p1, (AND (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 218 ms :[p1, p1, (AND (NOT p0) p1), p1, (NOT p0)]
Stuttering acceptance computed with spot in 194 ms :[p1, p1, (AND (NOT p0) p1), p1, (NOT p0)]
Product exploration explored 100000 steps with 27866 reset in 157 ms.
Product exploration explored 100000 steps with 27848 reset in 173 ms.
Applying partial POR strategy [false, false, true, false, true]
Stuttering acceptance computed with spot in 200 ms :[p1, p1, (AND (NOT p0) p1), p1, (NOT p0)]
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 93/93 places, 126/126 transitions.
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 12 Pre rules applied. Total rules applied 0 place count 93 transition count 138
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 93 transition count 138
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 0 with 29 rules applied. Total rules applied 41 place count 93 transition count 143
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 53 place count 93 transition count 131
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 92 transition count 119
Deduced a syphon composed of 41 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 92 transition count 119
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 73 place count 74 transition count 89
Deduced a syphon composed of 29 places in 0 ms
Iterating global reduction 1 with 18 rules applied. Total rules applied 91 place count 74 transition count 89
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 103 place count 62 transition count 77
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 115 place count 62 transition count 77
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 126 place count 62 transition count 66
Deduced a syphon composed of 23 places in 0 ms
Applied a total of 126 rules in 20 ms. Remains 62 /93 variables (removed 31) and now considering 66/126 (removed 60) transitions.
[2024-06-01 20:27:38] [INFO ] Redundant transitions in 1 ms returned []
Running 60 sub problems to find dead transitions.
// Phase 1: matrix 66 rows 62 cols
[2024-06-01 20:27:38] [INFO ] Computed 14 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 60 unsolved
At refinement iteration 2 (OVERLAPS) 6/62 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 60 unsolved
[2024-06-01 20:27:38] [INFO ] Deduced a trap composed of 4 places in 66 ms of which 15 ms to minimize.
[2024-06-01 20:27:39] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 2 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
[2024-06-01 20:27:39] [INFO ] Deduced a trap composed of 4 places in 27 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-01 20:27:39] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-06-01 20:27:39] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
[2024-06-01 20:27:39] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD18 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 6/20 constraints. Problems are: Problem set: 29 solved, 31 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/62 variables, 0/20 constraints. Problems are: Problem set: 29 solved, 31 unsolved
At refinement iteration 5 (OVERLAPS) 66/128 variables, 62/82 constraints. Problems are: Problem set: 29 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/82 constraints. Problems are: Problem set: 29 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/82 constraints. Problems are: Problem set: 29 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 82 constraints, problems are : Problem set: 29 solved, 31 unsolved in 1162 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 60/60 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 29 solved, 31 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 0/0 constraints. Problems are: Problem set: 29 solved, 31 unsolved
At refinement iteration 1 (OVERLAPS) 29/62 variables, 14/14 constraints. Problems are: Problem set: 29 solved, 31 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 6/20 constraints. Problems are: Problem set: 29 solved, 31 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/20 constraints. Problems are: Problem set: 29 solved, 31 unsolved
At refinement iteration 4 (OVERLAPS) 66/128 variables, 62/82 constraints. Problems are: Problem set: 29 solved, 31 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 31/113 constraints. Problems are: Problem set: 29 solved, 31 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/113 constraints. Problems are: Problem set: 29 solved, 31 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/113 constraints. Problems are: Problem set: 29 solved, 31 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 113 constraints, problems are : Problem set: 29 solved, 31 unsolved in 641 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 62/62 constraints, PredecessorRefiner: 31/60 constraints, Known Traps: 6/6 constraints]
After SMT, in 1818ms problems are : Problem set: 29 solved, 31 unsolved
Search for dead transitions found 29 dead transitions in 1819ms
Found 29 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 29 transitions
Dead transitions reduction (with SMT) removed 29 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 62/93 places, 37/126 transitions.
Graph (complete) has 85 edges and 62 vertex of which 39 are kept as prefixes of interest. Removing 23 places using SCC suffix rule.2 ms
Discarding 23 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 39 /62 variables (removed 23) and now considering 37/37 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 39/93 places, 37/126 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1853 ms. Remains : 39/93 places, 37/126 transitions.
Support contains 2 out of 93 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 93/93 places, 126/126 transitions.
Applied a total of 0 rules in 0 ms. Remains 93 /93 variables (removed 0) and now considering 126/126 (removed 0) transitions.
// Phase 1: matrix 126 rows 93 cols
[2024-06-01 20:27:40] [INFO ] Computed 14 invariants in 1 ms
[2024-06-01 20:27:40] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-01 20:27:40] [INFO ] Invariant cache hit.
[2024-06-01 20:27:40] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Running 120 sub problems to find dead transitions.
[2024-06-01 20:27:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (OVERLAPS) 0/219 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Real declared 219/219 variables, and 107 constraints, problems are : Problem set: 0 solved, 120 unsolved in 3294 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 120 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/87 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/87 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 2 (OVERLAPS) 6/93 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/93 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 4 (OVERLAPS) 126/219 variables, 93/107 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/219 variables, 120/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
At refinement iteration 7 (OVERLAPS) 0/219 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 120 unsolved
No progress, stopping.
After SMT solving in domain Int declared 219/219 variables, and 227 constraints, problems are : Problem set: 0 solved, 120 unsolved in 3958 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, State Equation: 93/93 constraints, PredecessorRefiner: 120/120 constraints, Known Traps: 0/0 constraints]
After SMT, in 7302ms problems are : Problem set: 0 solved, 120 unsolved
Search for dead transitions found 0 dead transitions in 7304ms
Finished structural reductions in LTL mode , in 1 iterations and 7540 ms. Remains : 93/93 places, 126/126 transitions.
Treatment of property UtilityControlRoom-PT-Z2T4N06-LTLCardinality-09 finished in 21158 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&G(p1)))))'
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 138/138 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 94 transition count 126
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 94 transition count 126
Applied a total of 24 rules in 2 ms. Remains 94 /106 variables (removed 12) and now considering 126/138 (removed 12) transitions.
// Phase 1: matrix 126 rows 94 cols
[2024-06-01 20:27:47] [INFO ] Computed 15 invariants in 1 ms
[2024-06-01 20:27:48] [INFO ] Implicit Places using invariants in 96 ms returned [63]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 98 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 93/106 places, 126/138 transitions.
Applied a total of 0 rules in 1 ms. Remains 93 /93 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 101 ms. Remains : 93/106 places, 126/138 transitions.
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N06-LTLCardinality-11
Product exploration explored 100000 steps with 0 reset in 210 ms.
Stack based approach found an accepted trace after 1147 steps with 0 reset with depth 1148 and stack size 1148 in 4 ms.
FORMULA UtilityControlRoom-PT-Z2T4N06-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N06-LTLCardinality-11 finished in 533 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 138/138 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 106 transition count 114
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 60 place count 82 transition count 102
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 60 place count 82 transition count 91
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 82 place count 71 transition count 91
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 83 place count 70 transition count 79
Iterating global reduction 2 with 1 rules applied. Total rules applied 84 place count 70 transition count 79
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 90 place count 64 transition count 73
Iterating global reduction 2 with 6 rules applied. Total rules applied 96 place count 64 transition count 73
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 101 place count 59 transition count 63
Iterating global reduction 2 with 5 rules applied. Total rules applied 106 place count 59 transition count 63
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 111 place count 54 transition count 58
Iterating global reduction 2 with 5 rules applied. Total rules applied 116 place count 54 transition count 58
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 2 with 5 rules applied. Total rules applied 121 place count 54 transition count 53
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 121 place count 54 transition count 48
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 131 place count 49 transition count 48
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 15 rules applied. Total rules applied 146 place count 41 transition count 41
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 156 place count 36 transition count 36
Applied a total of 156 rules in 13 ms. Remains 36 /106 variables (removed 70) and now considering 36/138 (removed 102) transitions.
// Phase 1: matrix 36 rows 36 cols
[2024-06-01 20:27:48] [INFO ] Computed 14 invariants in 1 ms
[2024-06-01 20:27:48] [INFO ] Implicit Places using invariants in 53 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 54 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 35/106 places, 36/138 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 29 transition count 30
Applied a total of 12 rules in 3 ms. Remains 29 /35 variables (removed 6) and now considering 30/36 (removed 6) transitions.
// Phase 1: matrix 30 rows 29 cols
[2024-06-01 20:27:48] [INFO ] Computed 13 invariants in 0 ms
[2024-06-01 20:27:48] [INFO ] Implicit Places using invariants in 38 ms returned []
[2024-06-01 20:27:48] [INFO ] Invariant cache hit.
[2024-06-01 20:27:48] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 95 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 29/106 places, 30/138 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 167 ms. Remains : 29/106 places, 30/138 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N06-LTLCardinality-15
Product exploration explored 100000 steps with 1589 reset in 163 ms.
Stack based approach found an accepted trace after 1052 steps with 18 reset with depth 44 and stack size 42 in 3 ms.
FORMULA UtilityControlRoom-PT-Z2T4N06-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property UtilityControlRoom-PT-Z2T4N06-LTLCardinality-15 finished in 420 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G((p0||X(p1)))||G(F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0) U X(!p1)))))'
Found a Lengthening insensitive property : UtilityControlRoom-PT-Z2T4N06-LTLCardinality-09
Stuttering acceptance computed with spot in 241 ms :[p1, p1, (AND (NOT p0) p1), p1, (NOT p0)]
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 106/106 places, 138/138 transitions.
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 106 transition count 114
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 1 with 36 rules applied. Total rules applied 60 place count 82 transition count 102
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 60 place count 82 transition count 90
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 84 place count 70 transition count 90
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 85 place count 69 transition count 78
Iterating global reduction 2 with 1 rules applied. Total rules applied 86 place count 69 transition count 78
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 92 place count 63 transition count 72
Iterating global reduction 2 with 6 rules applied. Total rules applied 98 place count 63 transition count 72
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 104 place count 57 transition count 60
Iterating global reduction 2 with 6 rules applied. Total rules applied 110 place count 57 transition count 60
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 116 place count 51 transition count 54
Iterating global reduction 2 with 6 rules applied. Total rules applied 122 place count 51 transition count 54
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 128 place count 51 transition count 48
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 128 place count 51 transition count 43
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 138 place count 46 transition count 43
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 148 place count 41 transition count 38
Applied a total of 148 rules in 15 ms. Remains 41 /106 variables (removed 65) and now considering 38/138 (removed 100) transitions.
// Phase 1: matrix 38 rows 41 cols
[2024-06-01 20:27:49] [INFO ] Computed 15 invariants in 0 ms
[2024-06-01 20:27:49] [INFO ] Implicit Places using invariants in 62 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 71 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 40/106 places, 38/138 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 34 transition count 32
Applied a total of 12 rules in 2 ms. Remains 34 /40 variables (removed 6) and now considering 32/38 (removed 6) transitions.
// Phase 1: matrix 32 rows 34 cols
[2024-06-01 20:27:49] [INFO ] Computed 14 invariants in 1 ms
[2024-06-01 20:27:49] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-01 20:27:49] [INFO ] Invariant cache hit.
[2024-06-01 20:27:49] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 34/106 places, 32/138 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 297 ms. Remains : 34/106 places, 32/138 transitions.
Running random walk in product with property : UtilityControlRoom-PT-Z2T4N06-LTLCardinality-09
Product exploration explored 100000 steps with 27630 reset in 223 ms.
Stack based approach found an accepted trace after 4480 steps with 1229 reset with depth 33 and stack size 33 in 12 ms.
Treatment of property UtilityControlRoom-PT-Z2T4N06-LTLCardinality-09 finished in 916 ms.
FORMULA UtilityControlRoom-PT-Z2T4N06-LTLCardinality-09 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-06-01 20:27:49] [INFO ] Flatten gal took : 14 ms
[2024-06-01 20:27:49] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 15 ms.
[2024-06-01 20:27:50] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 106 places, 138 transitions and 414 arcs took 14 ms.
Total runtime 69012 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA UtilityControlRoom-PT-Z2T4N06-LTLCardinality-03 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA UtilityControlRoom-PT-Z2T4N06-LTLCardinality-09 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717273670494

--------------------
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 UtilityControlRoom-PT-Z2T4N06-LTLCardinality-03
ltl formula formula --ltl=/tmp/1267/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 106 places, 138 transitions and 414 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.020 real 0.000 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1267/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1267/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1267/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1267/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 107 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 107, there are 144 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 1/ 4): Accepting cycle FOUND at depth ~131!
pnml2lts-mc( 1/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 0
pnml2lts-mc( 0/ 4): unique states count: 652
pnml2lts-mc( 0/ 4): unique transitions count: 4331
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 211
pnml2lts-mc( 0/ 4): - claim success count: 657
pnml2lts-mc( 0/ 4): - cum. max stack depth: 657
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 657 states 4369 transitions, fanout: 6.650
pnml2lts-mc( 0/ 4): Total exploration time 0.040 sec (0.040 sec minimum, 0.040 sec on average)
pnml2lts-mc( 0/ 4): States per second: 16425, Transitions per second: 109225
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 24.6 B/state, compr.: 5.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 138 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)
ltl formula name UtilityControlRoom-PT-Z2T4N06-LTLCardinality-09
ltl formula formula --ltl=/tmp/1267/ltl_1_
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 106 places, 138 transitions and 414 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1267/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1267/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1267/ltl_1_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.000 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1267/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 5 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 108 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 107, there are 146 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 3/ 4): Accepting cycle FOUND at depth ~45!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 211
pnml2lts-mc( 0/ 4): unique states count: 368
pnml2lts-mc( 0/ 4): unique transitions count: 2710
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 6
pnml2lts-mc( 0/ 4): - claim found count: 3
pnml2lts-mc( 0/ 4): - claim success count: 371
pnml2lts-mc( 0/ 4): - cum. max stack depth: 160
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 371 states 2732 transitions, fanout: 7.364
pnml2lts-mc( 0/ 4): Total exploration time 0.020 sec (0.020 sec minimum, 0.020 sec on average)
pnml2lts-mc( 0/ 4): States per second: 18550, Transitions per second: 136600
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 24.0 B/state, compr.: 5.6%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 138 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~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="UtilityControlRoom-PT-Z2T4N06"
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 UtilityControlRoom-PT-Z2T4N06, 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 r544-smll-171701111000195"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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