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.r579-smll-171734921300107.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 MedleyA-PT-14, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r579-smll-171734921300107
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 580K
-rw-r--r-- 1 mcc users 6.0K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 65K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.1K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 21K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 17K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 190K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 46K Jun 2 16:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717357514250

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-14
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:45:16] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 19:45:16] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:45:17] [INFO ] Load time of PNML (sax parser for PT used): 149 ms
[2024-06-02 19:45:17] [INFO ] Transformed 184 places.
[2024-06-02 19:45:17] [INFO ] Transformed 178 transitions.
[2024-06-02 19:45:17] [INFO ] Found NUPN structural information;
[2024-06-02 19:45:17] [INFO ] Parsed PT model containing 184 places and 178 transitions and 492 arcs in 436 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA MedleyA-PT-14-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-14-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 184 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 184/184 places, 178/178 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 154 transition count 148
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 154 transition count 148
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 66 place count 148 transition count 142
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 148 transition count 142
Applied a total of 72 rules in 97 ms. Remains 148 /184 variables (removed 36) and now considering 142/178 (removed 36) transitions.
// Phase 1: matrix 142 rows 148 cols
[2024-06-02 19:45:17] [INFO ] Computed 24 invariants in 36 ms
[2024-06-02 19:45:18] [INFO ] Implicit Places using invariants in 537 ms returned [39, 80]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 602 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 146/184 places, 142/178 transitions.
Applied a total of 0 rules in 15 ms. Remains 146 /146 variables (removed 0) and now considering 142/142 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 756 ms. Remains : 146/184 places, 142/178 transitions.
Support contains 23 out of 146 places after structural reductions.
[2024-06-02 19:45:18] [INFO ] Flatten gal took : 82 ms
[2024-06-02 19:45:18] [INFO ] Flatten gal took : 39 ms
[2024-06-02 19:45:18] [INFO ] Input system was already deterministic with 142 transitions.
RANDOM walk for 40000 steps (8 resets) in 2737 ms. (14 steps per ms) remains 5/15 properties
BEST_FIRST walk for 40002 steps (8 resets) in 526 ms. (75 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40001 steps (8 resets) in 397 ms. (100 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 279 ms. (142 steps per ms) remains 2/2 properties
// Phase 1: matrix 142 rows 146 cols
[2024-06-02 19:45:20] [INFO ] Computed 22 invariants in 8 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 38/40 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 19:45:20] [INFO ] Deduced a trap composed of 16 places in 75 ms of which 12 ms to minimize.
[2024-06-02 19:45:20] [INFO ] Deduced a trap composed of 22 places in 57 ms of which 3 ms to minimize.
Problem AtomicPropp1 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 2/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 78/118 variables, 12/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 28/146 variables, 7/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/146 variables, 0/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 142/288 variables, 146/170 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/288 variables, 0/170 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/288 variables, 0/170 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 288/288 variables, and 170 constraints, problems are : Problem set: 1 solved, 1 unsolved in 473 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 146/146 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 38/40 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
Problem AtomicPropp12 is UNSAT
After SMT solving in domain Int declared 40/288 variables, and 5 constraints, problems are : Problem set: 2 solved, 0 unsolved in 50 ms.
Refiners :[Positive P Invariants (semi-flows): 3/15 constraints, Generalized P Invariants (flows): 0/7 constraints, State Equation: 0/146 constraints, PredecessorRefiner: 0/2 constraints, Known Traps: 2/2 constraints]
After SMT, in 564ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 8 simplifications.
FORMULA MedleyA-PT-14-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 24 stabilizing places and 24 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 142/142 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 137 transition count 133
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 137 transition count 133
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 136 transition count 132
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 136 transition count 132
Applied a total of 20 rules in 29 ms. Remains 136 /146 variables (removed 10) and now considering 132/142 (removed 10) transitions.
// Phase 1: matrix 132 rows 136 cols
[2024-06-02 19:45:21] [INFO ] Computed 22 invariants in 4 ms
[2024-06-02 19:45:21] [INFO ] Implicit Places using invariants in 223 ms returned [107]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 230 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 135/146 places, 132/142 transitions.
Applied a total of 0 rules in 5 ms. Remains 135 /135 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 265 ms. Remains : 135/146 places, 132/142 transitions.
Stuttering acceptance computed with spot in 329 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-14-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 444 ms.
Product exploration explored 100000 steps with 50000 reset in 282 ms.
Computed a total of 19 stabilizing places and 19 stable transitions
Computed a total of 19 stabilizing places and 19 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 31 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-14-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-14-LTLCardinality-00 finished in 1480 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U X(p1)) U p0)))'
Support contains 3 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 142/142 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 137 transition count 133
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 137 transition count 133
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 136 transition count 132
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 136 transition count 132
Applied a total of 20 rules in 16 ms. Remains 136 /146 variables (removed 10) and now considering 132/142 (removed 10) transitions.
[2024-06-02 19:45:22] [INFO ] Invariant cache hit.
[2024-06-02 19:45:22] [INFO ] Implicit Places using invariants in 155 ms returned []
[2024-06-02 19:45:22] [INFO ] Invariant cache hit.
[2024-06-02 19:45:23] [INFO ] Implicit Places using invariants and state equation in 294 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
Running 131 sub problems to find dead transitions.
[2024-06-02 19:45:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/135 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/135 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/136 variables, 16/19 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 19:45:25] [INFO ] Deduced a trap composed of 20 places in 51 ms of which 3 ms to minimize.
[2024-06-02 19:45:25] [INFO ] Deduced a trap composed of 19 places in 44 ms of which 2 ms to minimize.
[2024-06-02 19:45:25] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 2 ms to minimize.
[2024-06-02 19:45:25] [INFO ] Deduced a trap composed of 6 places in 89 ms of which 2 ms to minimize.
[2024-06-02 19:45:26] [INFO ] Deduced a trap composed of 12 places in 110 ms of which 3 ms to minimize.
[2024-06-02 19:45:26] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 3 ms to minimize.
[2024-06-02 19:45:26] [INFO ] Deduced a trap composed of 31 places in 105 ms of which 2 ms to minimize.
[2024-06-02 19:45:26] [INFO ] Deduced a trap composed of 6 places in 79 ms of which 2 ms to minimize.
[2024-06-02 19:45:26] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
Problem TDEAD101 is UNSAT
[2024-06-02 19:45:26] [INFO ] Deduced a trap composed of 15 places in 44 ms of which 1 ms to minimize.
Problem TDEAD113 is UNSAT
[2024-06-02 19:45:27] [INFO ] Deduced a trap composed of 15 places in 47 ms of which 1 ms to minimize.
Problem TDEAD125 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 11/33 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/33 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 132/268 variables, 136/169 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/169 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 8 (OVERLAPS) 0/268 variables, 0/169 constraints. Problems are: Problem set: 3 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 268/268 variables, and 169 constraints, problems are : Problem set: 3 solved, 128 unsolved in 7544 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 3 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 3/3 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/3 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 4/136 variables, 16/19 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/136 variables, 3/22 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 11/33 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/136 variables, 0/33 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 132/268 variables, 136/169 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 128/297 constraints. Problems are: Problem set: 3 solved, 128 unsolved
[2024-06-02 19:45:33] [INFO ] Deduced a trap composed of 25 places in 86 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/268 variables, 1/298 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/268 variables, 0/298 constraints. Problems are: Problem set: 3 solved, 128 unsolved
At refinement iteration 10 (OVERLAPS) 0/268 variables, 0/298 constraints. Problems are: Problem set: 3 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 268/268 variables, and 298 constraints, problems are : Problem set: 3 solved, 128 unsolved in 9582 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 136/136 constraints, PredecessorRefiner: 128/131 constraints, Known Traps: 12/12 constraints]
After SMT, in 17211ms problems are : Problem set: 3 solved, 128 unsolved
Search for dead transitions found 3 dead transitions in 17219ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in LTL mode, iteration 1 : 136/146 places, 129/142 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 133 transition count 129
Applied a total of 3 rules in 12 ms. Remains 133 /136 variables (removed 3) and now considering 129/129 (removed 0) transitions.
// Phase 1: matrix 129 rows 133 cols
[2024-06-02 19:45:40] [INFO ] Computed 19 invariants in 4 ms
[2024-06-02 19:45:40] [INFO ] Implicit Places using invariants in 191 ms returned []
[2024-06-02 19:45:40] [INFO ] Invariant cache hit.
[2024-06-02 19:45:40] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 133/146 places, 129/142 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 18146 ms. Remains : 133/146 places, 129/142 transitions.
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true]
Running random walk in product with property : MedleyA-PT-14-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 142 ms.
Product exploration explored 100000 steps with 0 reset in 461 ms.
Computed a total of 19 stabilizing places and 19 stable transitions
Computed a total of 19 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 158 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true]
RANDOM walk for 40000 steps (8 resets) in 231 ms. (172 steps per ms) remains 1/3 properties
BEST_FIRST walk for 30441 steps (6 resets) in 148 ms. (204 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 274 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true]
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true]
Support contains 3 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 129/129 transitions.
Applied a total of 0 rules in 5 ms. Remains 133 /133 variables (removed 0) and now considering 129/129 (removed 0) transitions.
[2024-06-02 19:45:42] [INFO ] Invariant cache hit.
[2024-06-02 19:45:42] [INFO ] Implicit Places using invariants in 170 ms returned []
[2024-06-02 19:45:42] [INFO ] Invariant cache hit.
[2024-06-02 19:45:43] [INFO ] Implicit Places using invariants and state equation in 271 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2024-06-02 19:45:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-06-02 19:45:45] [INFO ] Deduced a trap composed of 6 places in 112 ms of which 3 ms to minimize.
[2024-06-02 19:45:45] [INFO ] Deduced a trap composed of 9 places in 81 ms of which 2 ms to minimize.
[2024-06-02 19:45:45] [INFO ] Deduced a trap composed of 12 places in 94 ms of which 2 ms to minimize.
[2024-06-02 19:45:46] [INFO ] Deduced a trap composed of 19 places in 74 ms of which 2 ms to minimize.
[2024-06-02 19:45:46] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-06-02 19:45:46] [INFO ] Deduced a trap composed of 18 places in 72 ms of which 3 ms to minimize.
[2024-06-02 19:45:47] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 129/262 variables, 133/159 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-06-02 19:45:49] [INFO ] Deduced a trap composed of 20 places in 44 ms of which 1 ms to minimize.
[2024-06-02 19:45:49] [INFO ] Deduced a trap composed of 20 places in 38 ms of which 1 ms to minimize.
[2024-06-02 19:45:49] [INFO ] Deduced a trap composed of 19 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 10 (OVERLAPS) 0/262 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 162 constraints, problems are : Problem set: 0 solved, 128 unsolved in 9509 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 10/29 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 129/262 variables, 133/162 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 128/290 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-06-02 19:45:56] [INFO ] Deduced a trap composed of 21 places in 71 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 10 (OVERLAPS) 0/262 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 291 constraints, problems are : Problem set: 0 solved, 128 unsolved in 9774 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 11/11 constraints]
After SMT, in 19329ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 19335ms
Finished structural reductions in LTL mode , in 1 iterations and 19787 ms. Remains : 133/133 places, 129/129 transitions.
Computed a total of 19 stabilizing places and 19 stable transitions
Computed a total of 19 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 95 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true]
RANDOM walk for 30077 steps (6 resets) in 236 ms. (126 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 220 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true]
Stuttering acceptance computed with spot in 108 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true]
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true]
Product exploration explored 100000 steps with 0 reset in 162 ms.
Product exploration explored 100000 steps with 0 reset in 522 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true]
Support contains 3 out of 133 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 133/133 places, 129/129 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 133 transition count 129
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 22 Pre rules applied. Total rules applied 6 place count 133 transition count 146
Deduced a syphon composed of 28 places in 1 ms
Iterating global reduction 1 with 22 rules applied. Total rules applied 28 place count 133 transition count 146
Performed 21 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 49 places in 0 ms
Iterating global reduction 1 with 21 rules applied. Total rules applied 49 place count 133 transition count 146
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 52 place count 130 transition count 143
Deduced a syphon composed of 46 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 55 place count 130 transition count 143
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -56
Deduced a syphon composed of 58 places in 0 ms
Iterating global reduction 1 with 12 rules applied. Total rules applied 67 place count 130 transition count 199
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 78 place count 119 transition count 177
Deduced a syphon composed of 47 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 89 place count 119 transition count 177
Deduced a syphon composed of 47 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 90 place count 119 transition count 176
Deduced a syphon composed of 47 places in 1 ms
Applied a total of 90 rules in 93 ms. Remains 119 /133 variables (removed 14) and now considering 176/129 (removed -47) transitions.
[2024-06-02 19:46:04] [INFO ] Redundant transitions in 12 ms returned []
Running 172 sub problems to find dead transitions.
// Phase 1: matrix 176 rows 119 cols
[2024-06-02 19:46:04] [INFO ] Computed 19 invariants in 5 ms
[2024-06-02 19:46:04] [INFO ] State equation strengthened by 17 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/118 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/118 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 2 (OVERLAPS) 1/119 variables, 12/15 constraints. Problems are: Problem set: 0 solved, 172 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/119 variables, 4/19 constraints. Problems are: Problem set: 0 solved, 172 unsolved
[2024-06-02 19:46:07] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 3 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
[2024-06-02 19:46:07] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
[2024-06-02 19:46:07] [INFO ] Deduced a trap composed of 3 places in 36 ms of which 0 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-06-02 19:46:07] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
[2024-06-02 19:46:07] [INFO ] Deduced a trap composed of 7 places in 42 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
[2024-06-02 19:46:07] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
[2024-06-02 19:46:07] [INFO ] Deduced a trap composed of 5 places in 40 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-06-02 19:46:07] [INFO ] Deduced a trap composed of 6 places in 43 ms of which 2 ms to minimize.
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
[2024-06-02 19:46:07] [INFO ] Deduced a trap composed of 5 places in 45 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
[2024-06-02 19:46:08] [INFO ] Deduced a trap composed of 10 places in 41 ms of which 1 ms to minimize.
Problem TDEAD20 is UNSAT
[2024-06-02 19:46:08] [INFO ] Deduced a trap composed of 7 places in 38 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
[2024-06-02 19:46:08] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 1 ms to minimize.
Problem TDEAD22 is UNSAT
[2024-06-02 19:46:08] [INFO ] Deduced a trap composed of 2 places in 74 ms of which 2 ms to minimize.
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
[2024-06-02 19:46:08] [INFO ] Deduced a trap composed of 10 places in 68 ms of which 2 ms to minimize.
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
[2024-06-02 19:46:08] [INFO ] Deduced a trap composed of 5 places in 68 ms of which 3 ms to minimize.
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/119 variables, 15/34 constraints. Problems are: Problem set: 81 solved, 91 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/119 variables, 0/34 constraints. Problems are: Problem set: 81 solved, 91 unsolved
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
At refinement iteration 6 (OVERLAPS) 175/294 variables, 119/153 constraints. Problems are: Problem set: 87 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/294 variables, 16/169 constraints. Problems are: Problem set: 87 solved, 85 unsolved
[2024-06-02 19:46:10] [INFO ] Deduced a trap composed of 8 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/294 variables, 1/170 constraints. Problems are: Problem set: 87 solved, 85 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/294 variables, 0/170 constraints. Problems are: Problem set: 87 solved, 85 unsolved
At refinement iteration 10 (OVERLAPS) 1/295 variables, 1/171 constraints. Problems are: Problem set: 87 solved, 85 unsolved
[2024-06-02 19:46:13] [INFO ] Deduced a trap composed of 10 places in 34 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/295 variables, 1/172 constraints. Problems are: Problem set: 87 solved, 85 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/295 variables, 0/172 constraints. Problems are: Problem set: 87 solved, 85 unsolved
At refinement iteration 13 (OVERLAPS) 0/295 variables, 0/172 constraints. Problems are: Problem set: 87 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Real declared 295/295 variables, and 172 constraints, problems are : Problem set: 87 solved, 85 unsolved in 9917 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 119/119 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 172/172 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 87 solved, 85 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/71 variables, 0/0 constraints. Problems are: Problem set: 87 solved, 85 unsolved
At refinement iteration 1 (OVERLAPS) 38/109 variables, 12/12 constraints. Problems are: Problem set: 87 solved, 85 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 17/29 constraints. Problems are: Problem set: 87 solved, 85 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/109 variables, 0/29 constraints. Problems are: Problem set: 87 solved, 85 unsolved
At refinement iteration 4 (OVERLAPS) 7/116 variables, 7/36 constraints. Problems are: Problem set: 87 solved, 85 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/116 variables, 0/36 constraints. Problems are: Problem set: 87 solved, 85 unsolved
At refinement iteration 6 (OVERLAPS) 175/291 variables, 116/152 constraints. Problems are: Problem set: 87 solved, 85 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/291 variables, 16/168 constraints. Problems are: Problem set: 87 solved, 85 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/291 variables, 85/253 constraints. Problems are: Problem set: 87 solved, 85 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/291 variables, 0/253 constraints. Problems are: Problem set: 87 solved, 85 unsolved
At refinement iteration 10 (OVERLAPS) 3/294 variables, 3/256 constraints. Problems are: Problem set: 87 solved, 85 unsolved
[2024-06-02 19:46:19] [INFO ] Deduced a trap composed of 10 places in 38 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/294 variables, 1/257 constraints. Problems are: Problem set: 87 solved, 85 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/294 variables, 0/257 constraints. Problems are: Problem set: 87 solved, 85 unsolved
At refinement iteration 13 (OVERLAPS) 1/295 variables, 1/258 constraints. Problems are: Problem set: 87 solved, 85 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/295 variables, 0/258 constraints. Problems are: Problem set: 87 solved, 85 unsolved
At refinement iteration 15 (OVERLAPS) 0/295 variables, 0/258 constraints. Problems are: Problem set: 87 solved, 85 unsolved
No progress, stopping.
After SMT solving in domain Int declared 295/295 variables, and 258 constraints, problems are : Problem set: 87 solved, 85 unsolved in 11231 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 119/119 constraints, ReadFeed: 17/17 constraints, PredecessorRefiner: 85/172 constraints, Known Traps: 18/18 constraints]
After SMT, in 21277ms problems are : Problem set: 87 solved, 85 unsolved
Search for dead transitions found 87 dead transitions in 21283ms
Found 87 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 87 transitions
Dead transitions reduction (with SMT) removed 87 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 119/133 places, 89/129 transitions.
Graph (complete) has 234 edges and 119 vertex of which 72 are kept as prefixes of interest. Removing 47 places using SCC suffix rule.3 ms
Discarding 47 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -7
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 72 transition count 96
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 2 rules in 31 ms. Remains 72 /119 variables (removed 47) and now considering 96/89 (removed -7) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 72/133 places, 96/129 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 21431 ms. Remains : 72/133 places, 96/129 transitions.
Support contains 3 out of 133 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 133/133 places, 129/129 transitions.
Applied a total of 0 rules in 7 ms. Remains 133 /133 variables (removed 0) and now considering 129/129 (removed 0) transitions.
// Phase 1: matrix 129 rows 133 cols
[2024-06-02 19:46:26] [INFO ] Computed 19 invariants in 2 ms
[2024-06-02 19:46:26] [INFO ] Implicit Places using invariants in 125 ms returned []
[2024-06-02 19:46:26] [INFO ] Invariant cache hit.
[2024-06-02 19:46:26] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Running 128 sub problems to find dead transitions.
[2024-06-02 19:46:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-06-02 19:46:28] [INFO ] Deduced a trap composed of 6 places in 91 ms of which 3 ms to minimize.
[2024-06-02 19:46:28] [INFO ] Deduced a trap composed of 9 places in 103 ms of which 2 ms to minimize.
[2024-06-02 19:46:28] [INFO ] Deduced a trap composed of 12 places in 88 ms of which 2 ms to minimize.
[2024-06-02 19:46:29] [INFO ] Deduced a trap composed of 19 places in 78 ms of which 3 ms to minimize.
[2024-06-02 19:46:29] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 5/24 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-06-02 19:46:29] [INFO ] Deduced a trap composed of 18 places in 69 ms of which 2 ms to minimize.
[2024-06-02 19:46:30] [INFO ] Deduced a trap composed of 19 places in 82 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/133 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (OVERLAPS) 129/262 variables, 133/159 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-06-02 19:46:32] [INFO ] Deduced a trap composed of 20 places in 71 ms of which 4 ms to minimize.
[2024-06-02 19:46:32] [INFO ] Deduced a trap composed of 20 places in 49 ms of which 1 ms to minimize.
[2024-06-02 19:46:32] [INFO ] Deduced a trap composed of 19 places in 36 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 3/162 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 10 (OVERLAPS) 0/262 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Real declared 262/262 variables, and 162 constraints, problems are : Problem set: 0 solved, 128 unsolved in 9788 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 128 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/132 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/132 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 2 (OVERLAPS) 1/133 variables, 13/16 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/133 variables, 3/19 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/133 variables, 10/29 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/133 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 6 (OVERLAPS) 129/262 variables, 133/162 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/262 variables, 128/290 constraints. Problems are: Problem set: 0 solved, 128 unsolved
[2024-06-02 19:46:39] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/262 variables, 1/291 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/262 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 128 unsolved
At refinement iteration 10 (OVERLAPS) 0/262 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 128 unsolved
No progress, stopping.
After SMT solving in domain Int declared 262/262 variables, and 291 constraints, problems are : Problem set: 0 solved, 128 unsolved in 10255 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 133/133 constraints, PredecessorRefiner: 128/128 constraints, Known Traps: 11/11 constraints]
After SMT, in 20075ms problems are : Problem set: 0 solved, 128 unsolved
Search for dead transitions found 0 dead transitions in 20078ms
Finished structural reductions in LTL mode , in 1 iterations and 20393 ms. Remains : 133/133 places, 129/129 transitions.
Treatment of property MedleyA-PT-14-LTLCardinality-04 finished in 83763 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&&X((G(p1) U X(p0))))))'
Support contains 3 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 142/142 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 138 transition count 134
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 138 transition count 134
Applied a total of 16 rules in 9 ms. Remains 138 /146 variables (removed 8) and now considering 134/142 (removed 8) transitions.
// Phase 1: matrix 134 rows 138 cols
[2024-06-02 19:46:46] [INFO ] Computed 22 invariants in 2 ms
[2024-06-02 19:46:46] [INFO ] Implicit Places using invariants in 132 ms returned [109]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 133 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 137/146 places, 134/142 transitions.
Applied a total of 0 rules in 12 ms. Remains 137 /137 variables (removed 0) and now considering 134/134 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 155 ms. Remains : 137/146 places, 134/142 transitions.
Stuttering acceptance computed with spot in 320 ms :[(NOT p0), (NOT p0), true, (NOT p0), (NOT p0), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-14-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-14-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-14-LTLCardinality-06 finished in 503 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)||((G(!p0)||(!p0&&G(F(!p1))))&&X(!p2)))))'
Support contains 6 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 142/142 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 140 transition count 136
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 140 transition count 136
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 139 transition count 135
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 139 transition count 135
Applied a total of 14 rules in 12 ms. Remains 139 /146 variables (removed 7) and now considering 135/142 (removed 7) transitions.
// Phase 1: matrix 135 rows 139 cols
[2024-06-02 19:46:47] [INFO ] Computed 22 invariants in 2 ms
[2024-06-02 19:46:47] [INFO ] Implicit Places using invariants in 134 ms returned [110]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 137 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 138/146 places, 135/142 transitions.
Applied a total of 0 rules in 5 ms. Remains 138 /138 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 155 ms. Remains : 138/146 places, 135/142 transitions.
Stuttering acceptance computed with spot in 264 ms :[p0, (AND p0 p2), (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : MedleyA-PT-14-LTLCardinality-08
Product exploration explored 100000 steps with 0 reset in 182 ms.
Stack based approach found an accepted trace after 80 steps with 0 reset with depth 81 and stack size 81 in 2 ms.
FORMULA MedleyA-PT-14-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-14-LTLCardinality-08 finished in 635 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)&&F(G(p1))))'
Support contains 3 out of 146 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 146/146 places, 142/142 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 145 transition count 135
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 139 transition count 135
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 12 place count 139 transition count 117
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 48 place count 121 transition count 117
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 55 place count 114 transition count 110
Iterating global reduction 2 with 7 rules applied. Total rules applied 62 place count 114 transition count 110
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 62 place count 114 transition count 107
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 68 place count 111 transition count 107
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 69 place count 110 transition count 106
Iterating global reduction 2 with 1 rules applied. Total rules applied 70 place count 110 transition count 106
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 110 place count 90 transition count 86
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -22
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 136 place count 77 transition count 108
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 137 place count 76 transition count 107
Applied a total of 137 rules in 37 ms. Remains 76 /146 variables (removed 70) and now considering 107/142 (removed 35) transitions.
// Phase 1: matrix 107 rows 76 cols
[2024-06-02 19:46:47] [INFO ] Computed 22 invariants in 2 ms
[2024-06-02 19:46:47] [INFO ] Implicit Places using invariants in 107 ms returned [6, 10, 27, 47, 51, 60]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 108 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 70/146 places, 107/142 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 70 transition count 103
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 66 transition count 103
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 14 place count 63 transition count 100
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 61 transition count 104
Applied a total of 18 rules in 10 ms. Remains 61 /70 variables (removed 9) and now considering 104/107 (removed 3) transitions.
// Phase 1: matrix 104 rows 61 cols
[2024-06-02 19:46:47] [INFO ] Computed 16 invariants in 1 ms
[2024-06-02 19:46:47] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 19:46:47] [INFO ] Invariant cache hit.
[2024-06-02 19:46:47] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 19:46:48] [INFO ] Implicit Places using invariants and state equation in 169 ms returned [11, 45]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 251 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 59/146 places, 104/142 transitions.
Applied a total of 0 rules in 6 ms. Remains 59 /59 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 412 ms. Remains : 59/146 places, 104/142 transitions.
Stuttering acceptance computed with spot in 155 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-14-LTLCardinality-09
Stuttering criterion allowed to conclude after 56 steps with 2 reset in 0 ms.
FORMULA MedleyA-PT-14-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-14-LTLCardinality-09 finished in 588 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 142/142 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 137 transition count 133
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 137 transition count 133
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 136 transition count 132
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 136 transition count 132
Applied a total of 20 rules in 10 ms. Remains 136 /146 variables (removed 10) and now considering 132/142 (removed 10) transitions.
// Phase 1: matrix 132 rows 136 cols
[2024-06-02 19:46:48] [INFO ] Computed 22 invariants in 2 ms
[2024-06-02 19:46:48] [INFO ] Implicit Places using invariants in 125 ms returned [107]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 126 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 135/146 places, 132/142 transitions.
Applied a total of 0 rules in 3 ms. Remains 135 /135 variables (removed 0) and now considering 132/132 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 139 ms. Remains : 135/146 places, 132/142 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-14-LTLCardinality-11
Product exploration explored 100000 steps with 0 reset in 175 ms.
Product exploration explored 100000 steps with 0 reset in 201 ms.
Computed a total of 19 stabilizing places and 19 stable transitions
Computed a total of 19 stabilizing places and 19 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[true, (NOT p0)]
RANDOM walk for 30115 steps (7 resets) in 121 ms. (246 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-14-LTLCardinality-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-14-LTLCardinality-11 finished in 931 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 (X(G(p0))||(F(!p0)&&X(p1)))))'
Support contains 4 out of 146 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 146/146 places, 142/142 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 139 transition count 135
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 139 transition count 135
Applied a total of 14 rules in 3 ms. Remains 139 /146 variables (removed 7) and now considering 135/142 (removed 7) transitions.
// Phase 1: matrix 135 rows 139 cols
[2024-06-02 19:46:49] [INFO ] Computed 22 invariants in 1 ms
[2024-06-02 19:46:49] [INFO ] Implicit Places using invariants in 155 ms returned [110]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 162 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 138/146 places, 135/142 transitions.
Applied a total of 0 rules in 2 ms. Remains 138 /138 variables (removed 0) and now considering 135/135 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 167 ms. Remains : 138/146 places, 135/142 transitions.
Stuttering acceptance computed with spot in 124 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-14-LTLCardinality-15
Product exploration explored 100000 steps with 0 reset in 216 ms.
Product exploration explored 100000 steps with 0 reset in 237 ms.
Computed a total of 20 stabilizing places and 20 stable transitions
Computed a total of 20 stabilizing places and 20 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 175 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 211 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (8 resets) in 367 ms. (108 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 291 ms. (136 steps per ms) remains 1/1 properties
// Phase 1: matrix 135 rows 138 cols
[2024-06-02 19:46:50] [INFO ] Computed 21 invariants in 2 ms
Problem apf1 is UNSAT
After SMT solving in domain Real declared 4/273 variables, and 0 constraints, problems are : Problem set: 1 solved, 0 unsolved in 24 ms.
Refiners :[Positive P Invariants (semi-flows): 0/15 constraints, Generalized P Invariants (flows): 0/6 constraints, State Equation: 0/138 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 32ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (G (OR p0 (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 p1))), (F (NOT p0)), (F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 10 factoid took 386 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p0), (NOT p0)]
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 135/135 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 137 transition count 127
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 14 place count 130 transition count 127
Performed 21 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 21 Pre rules applied. Total rules applied 14 place count 130 transition count 106
Deduced a syphon composed of 21 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 42 rules applied. Total rules applied 56 place count 109 transition count 106
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 100 place count 87 transition count 84
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: -27
Deduced a syphon composed of 13 places in 0 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 126 place count 74 transition count 111
Applied a total of 126 rules in 31 ms. Remains 74 /138 variables (removed 64) and now considering 111/135 (removed 24) transitions.
// Phase 1: matrix 111 rows 74 cols
[2024-06-02 19:46:51] [INFO ] Computed 21 invariants in 2 ms
[2024-06-02 19:46:51] [INFO ] Implicit Places using invariants in 145 ms returned [6, 10, 27, 48, 52]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 147 ms to find 5 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 69/138 places, 111/135 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 69 transition count 108
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 66 transition count 108
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 63 transition count 105
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 61 transition count 109
Applied a total of 16 rules in 17 ms. Remains 61 /69 variables (removed 8) and now considering 109/111 (removed 2) transitions.
// Phase 1: matrix 109 rows 61 cols
[2024-06-02 19:46:51] [INFO ] Computed 16 invariants in 3 ms
[2024-06-02 19:46:51] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-02 19:46:51] [INFO ] Invariant cache hit.
[2024-06-02 19:46:51] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-02 19:46:51] [INFO ] Implicit Places using invariants and state equation in 187 ms returned [11, 30, 45]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 297 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 58/138 places, 109/135 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 57 transition count 108
Applied a total of 2 rules in 8 ms. Remains 57 /58 variables (removed 1) and now considering 108/109 (removed 1) transitions.
// Phase 1: matrix 108 rows 57 cols
[2024-06-02 19:46:51] [INFO ] Computed 13 invariants in 1 ms
[2024-06-02 19:46:51] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-06-02 19:46:51] [INFO ] Invariant cache hit.
[2024-06-02 19:46:51] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-06-02 19:46:52] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 263 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 57/138 places, 108/135 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 766 ms. Remains : 57/138 places, 108/135 transitions.
Computed a total of 2 stabilizing places and 8 stable transitions
Computed a total of 2 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 157 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 202 ms :[true, (NOT p0), (NOT p0)]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 26705 steps (6 resets) in 266 ms. (100 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (AND p0 p1))), (X p0), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 332 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 272 ms.
Product exploration explored 100000 steps with 0 reset in 199 ms.
Support contains 4 out of 57 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 57/57 places, 108/108 transitions.
Applied a total of 0 rules in 6 ms. Remains 57 /57 variables (removed 0) and now considering 108/108 (removed 0) transitions.
[2024-06-02 19:46:53] [INFO ] Invariant cache hit.
[2024-06-02 19:46:53] [INFO ] Implicit Places using invariants in 105 ms returned []
[2024-06-02 19:46:53] [INFO ] Invariant cache hit.
[2024-06-02 19:46:53] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-06-02 19:46:53] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 244 ms to find 0 implicit places.
[2024-06-02 19:46:53] [INFO ] Redundant transitions in 4 ms returned []
Running 100 sub problems to find dead transitions.
[2024-06-02 19:46:53] [INFO ] Invariant cache hit.
[2024-06-02 19:46:53] [INFO ] State equation strengthened by 28 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 100 unsolved
At refinement iteration 3 (OVERLAPS) 1/57 variables, 8/13 constraints. Problems are: Problem set: 0 solved, 100 unsolved
[2024-06-02 19:46:55] [INFO ] Deduced a trap composed of 15 places in 55 ms of which 2 ms to minimize.
[2024-06-02 19:46:55] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
[2024-06-02 19:46:55] [INFO ] Deduced a trap composed of 10 places in 29 ms of which 3 ms to minimize.
[2024-06-02 19:46:55] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-06-02 19:46:55] [INFO ] Deduced a trap composed of 25 places in 53 ms of which 1 ms to minimize.
[2024-06-02 19:46:55] [INFO ] Deduced a trap composed of 8 places in 45 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
[2024-06-02 19:46:55] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 1 ms to minimize.
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 7/20 constraints. Problems are: Problem set: 16 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/20 constraints. Problems are: Problem set: 16 solved, 84 unsolved
At refinement iteration 6 (OVERLAPS) 107/164 variables, 57/77 constraints. Problems are: Problem set: 16 solved, 84 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/164 variables, 27/104 constraints. Problems are: Problem set: 16 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 0/104 constraints. Problems are: Problem set: 16 solved, 84 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 1/165 variables, 1/105 constraints. Problems are: Problem set: 16 solved, 84 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/165 variables, 0/105 constraints. Problems are: Problem set: 16 solved, 84 unsolved
At refinement iteration 11 (OVERLAPS) 0/165 variables, 0/105 constraints. Problems are: Problem set: 16 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Real declared 165/165 variables, and 105 constraints, problems are : Problem set: 16 solved, 84 unsolved in 3480 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 100/100 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 16 solved, 84 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/51 variables, 3/3 constraints. Problems are: Problem set: 16 solved, 84 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/51 variables, 2/5 constraints. Problems are: Problem set: 16 solved, 84 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 1/6 constraints. Problems are: Problem set: 16 solved, 84 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 0/6 constraints. Problems are: Problem set: 16 solved, 84 unsolved
At refinement iteration 4 (OVERLAPS) 6/57 variables, 8/14 constraints. Problems are: Problem set: 16 solved, 84 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 6/20 constraints. Problems are: Problem set: 16 solved, 84 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/20 constraints. Problems are: Problem set: 16 solved, 84 unsolved
At refinement iteration 7 (OVERLAPS) 107/164 variables, 57/77 constraints. Problems are: Problem set: 16 solved, 84 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/164 variables, 27/104 constraints. Problems are: Problem set: 16 solved, 84 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/164 variables, 84/188 constraints. Problems are: Problem set: 16 solved, 84 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/164 variables, 0/188 constraints. Problems are: Problem set: 16 solved, 84 unsolved
At refinement iteration 11 (OVERLAPS) 1/165 variables, 1/189 constraints. Problems are: Problem set: 16 solved, 84 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/165 variables, 0/189 constraints. Problems are: Problem set: 16 solved, 84 unsolved
At refinement iteration 13 (OVERLAPS) 0/165 variables, 0/189 constraints. Problems are: Problem set: 16 solved, 84 unsolved
No progress, stopping.
After SMT solving in domain Int declared 165/165 variables, and 189 constraints, problems are : Problem set: 16 solved, 84 unsolved in 4227 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 57/57 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 84/100 constraints, Known Traps: 7/7 constraints]
After SMT, in 7778ms problems are : Problem set: 16 solved, 84 unsolved
Search for dead transitions found 16 dead transitions in 7781ms
Found 16 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 16 transitions
Dead transitions reduction (with SMT) removed 16 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 57/57 places, 92/108 transitions.
Graph (complete) has 206 edges and 57 vertex of which 53 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 9 ms. Remains 53 /57 variables (removed 4) and now considering 92/92 (removed 0) transitions.
// Phase 1: matrix 92 rows 53 cols
[2024-06-02 19:47:01] [INFO ] Computed 11 invariants in 1 ms
[2024-06-02 19:47:01] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-02 19:47:01] [INFO ] Invariant cache hit.
[2024-06-02 19:47:01] [INFO ] State equation strengthened by 28 read => feed constraints.
[2024-06-02 19:47:02] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 53/57 places, 92/108 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 8345 ms. Remains : 53/57 places, 92/108 transitions.
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Treatment of property MedleyA-PT-14-LTLCardinality-15 finished in 12965 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U X(p1)) U p0)))'
Found a Lengthening insensitive property : MedleyA-PT-14-LTLCardinality-04
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true]
Support contains 3 out of 146 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 146/146 places, 142/142 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 145 transition count 135
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 139 transition count 135
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 12 place count 139 transition count 117
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 48 place count 121 transition count 117
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 57 place count 112 transition count 108
Iterating global reduction 2 with 9 rules applied. Total rules applied 66 place count 112 transition count 108
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 66 place count 112 transition count 103
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 76 place count 107 transition count 103
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 77 place count 106 transition count 102
Iterating global reduction 2 with 1 rules applied. Total rules applied 78 place count 106 transition count 102
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 2 with 40 rules applied. Total rules applied 118 place count 86 transition count 82
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: -22
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 142 place count 74 transition count 104
Applied a total of 142 rules in 33 ms. Remains 74 /146 variables (removed 72) and now considering 104/142 (removed 38) transitions.
// Phase 1: matrix 104 rows 74 cols
[2024-06-02 19:47:02] [INFO ] Computed 22 invariants in 1 ms
[2024-06-02 19:47:02] [INFO ] Implicit Places using invariants in 130 ms returned [6, 10, 27, 31, 46, 50]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 133 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 68/146 places, 104/142 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 68 transition count 101
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 65 transition count 101
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 0 with 8 rules applied. Total rules applied 14 place count 61 transition count 97
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 60 transition count 99
Applied a total of 16 rules in 8 ms. Remains 60 /68 variables (removed 8) and now considering 99/104 (removed 5) transitions.
// Phase 1: matrix 99 rows 60 cols
[2024-06-02 19:47:02] [INFO ] Computed 16 invariants in 1 ms
[2024-06-02 19:47:02] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-02 19:47:02] [INFO ] Invariant cache hit.
[2024-06-02 19:47:02] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-02 19:47:02] [INFO ] Implicit Places using invariants and state equation in 212 ms returned [13, 27, 42]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 322 ms to find 3 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 57/146 places, 99/142 transitions.
Applied a total of 0 rules in 3 ms. Remains 57 /57 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 3 iterations and 501 ms. Remains : 57/146 places, 99/142 transitions.
Running random walk in product with property : MedleyA-PT-14-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 164 ms.
Product exploration explored 100000 steps with 0 reset in 182 ms.
Computed a total of 2 stabilizing places and 8 stable transitions
Computed a total of 2 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 134 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true]
RANDOM walk for 40000 steps (8 resets) in 103 ms. (384 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 35 ms. (1111 steps per ms) remains 1/1 properties
// Phase 1: matrix 99 rows 57 cols
[2024-06-02 19:47:03] [INFO ] Computed 13 invariants in 1 ms
[2024-06-02 19:47:03] [INFO ] State equation strengthened by 13 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/25 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/34 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 86/120 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 29/149 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 5/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/150 variables, 5/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/150 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/150 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 3/153 variables, 2/72 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/153 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/153 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 2/155 variables, 2/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/155 variables, 7/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/155 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/156 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/156 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/156 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 156/156 variables, and 83 constraints, problems are : Problem set: 0 solved, 1 unsolved in 151 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 57/57 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 22/25 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/34 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/34 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 86/120 variables, 34/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 29/149 variables, 19/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/149 variables, 5/64 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/149 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/149 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 1/150 variables, 5/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/150 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/150 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 3/153 variables, 2/73 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/153 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/153 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/155 variables, 2/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/155 variables, 7/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/155 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/156 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/156 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/156 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 156/156 variables, and 84 constraints, problems are : Problem set: 0 solved, 1 unsolved in 201 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 57/57 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 361ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 4 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=4 )
Parikh walk visited 1 properties in 10 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 257 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true]
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true]
Support contains 3 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 99/99 transitions.
Applied a total of 0 rules in 1 ms. Remains 57 /57 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-06-02 19:47:04] [INFO ] Invariant cache hit.
[2024-06-02 19:47:04] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-02 19:47:04] [INFO ] Invariant cache hit.
[2024-06-02 19:47:04] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-02 19:47:04] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
Running 91 sub problems to find dead transitions.
[2024-06-02 19:47:04] [INFO ] Invariant cache hit.
[2024-06-02 19:47:04] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/56 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/56 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/56 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 91 unsolved
At refinement iteration 3 (OVERLAPS) 1/57 variables, 7/13 constraints. Problems are: Problem set: 0 solved, 91 unsolved
[2024-06-02 19:47:05] [INFO ] Deduced a trap composed of 6 places in 22 ms of which 1 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
[2024-06-02 19:47:05] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
[2024-06-02 19:47:05] [INFO ] Deduced a trap composed of 16 places in 41 ms of which 5 ms to minimize.
[2024-06-02 19:47:05] [INFO ] Deduced a trap composed of 6 places in 20 ms of which 0 ms to minimize.
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/57 variables, 4/17 constraints. Problems are: Problem set: 10 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 0/17 constraints. Problems are: Problem set: 10 solved, 81 unsolved
At refinement iteration 6 (OVERLAPS) 98/155 variables, 57/74 constraints. Problems are: Problem set: 10 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/155 variables, 12/86 constraints. Problems are: Problem set: 10 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/86 constraints. Problems are: Problem set: 10 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 1/156 variables, 1/87 constraints. Problems are: Problem set: 10 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/156 variables, 0/87 constraints. Problems are: Problem set: 10 solved, 81 unsolved
At refinement iteration 11 (OVERLAPS) 0/156 variables, 0/87 constraints. Problems are: Problem set: 10 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 156/156 variables, and 87 constraints, problems are : Problem set: 10 solved, 81 unsolved in 3410 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 57/57 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 91/91 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 10 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 3/3 constraints. Problems are: Problem set: 10 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 3/6 constraints. Problems are: Problem set: 10 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 1/7 constraints. Problems are: Problem set: 10 solved, 81 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 0/7 constraints. Problems are: Problem set: 10 solved, 81 unsolved
At refinement iteration 4 (OVERLAPS) 4/57 variables, 7/14 constraints. Problems are: Problem set: 10 solved, 81 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/57 variables, 3/17 constraints. Problems are: Problem set: 10 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/57 variables, 0/17 constraints. Problems are: Problem set: 10 solved, 81 unsolved
At refinement iteration 7 (OVERLAPS) 98/155 variables, 57/74 constraints. Problems are: Problem set: 10 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 12/86 constraints. Problems are: Problem set: 10 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/155 variables, 81/167 constraints. Problems are: Problem set: 10 solved, 81 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/155 variables, 0/167 constraints. Problems are: Problem set: 10 solved, 81 unsolved
At refinement iteration 11 (OVERLAPS) 1/156 variables, 1/168 constraints. Problems are: Problem set: 10 solved, 81 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/156 variables, 0/168 constraints. Problems are: Problem set: 10 solved, 81 unsolved
At refinement iteration 13 (OVERLAPS) 0/156 variables, 0/168 constraints. Problems are: Problem set: 10 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 156/156 variables, and 168 constraints, problems are : Problem set: 10 solved, 81 unsolved in 3860 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 57/57 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 81/91 constraints, Known Traps: 4/4 constraints]
After SMT, in 7306ms problems are : Problem set: 10 solved, 81 unsolved
Search for dead transitions found 10 dead transitions in 7309ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in LTL mode, iteration 1 : 57/57 places, 89/99 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 54 transition count 89
Applied a total of 3 rules in 1 ms. Remains 54 /57 variables (removed 3) and now considering 89/89 (removed 0) transitions.
// Phase 1: matrix 89 rows 54 cols
[2024-06-02 19:47:12] [INFO ] Computed 10 invariants in 1 ms
[2024-06-02 19:47:12] [INFO ] Implicit Places using invariants in 77 ms returned []
[2024-06-02 19:47:12] [INFO ] Invariant cache hit.
[2024-06-02 19:47:12] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-02 19:47:12] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 245 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 54/57 places, 89/99 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 7844 ms. Remains : 54/57 places, 89/99 transitions.
Computed a total of 2 stabilizing places and 8 stable transitions
Computed a total of 2 stabilizing places and 8 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 138 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true]
RANDOM walk for 40000 steps (8 resets) in 100 ms. (396 steps per ms) remains 1/3 properties
BEST_FIRST walk for 20113 steps (4 resets) in 18 ms. (1058 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 240 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true]
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true]
Product exploration explored 100000 steps with 0 reset in 147 ms.
Product exploration explored 100000 steps with 0 reset in 158 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 119 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), true]
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 54/54 places, 89/89 transitions.
Applied a total of 0 rules in 3 ms. Remains 54 /54 variables (removed 0) and now considering 89/89 (removed 0) transitions.
[2024-06-02 19:47:13] [INFO ] Redundant transitions in 3 ms returned []
Running 81 sub problems to find dead transitions.
[2024-06-02 19:47:13] [INFO ] Invariant cache hit.
[2024-06-02 19:47:13] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 1/54 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 88/142 variables, 54/64 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 12/76 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 1/143 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (OVERLAPS) 0/143 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 77 constraints, problems are : Problem set: 0 solved, 81 unsolved in 2787 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 1/54 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 88/142 variables, 54/64 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 12/76 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 81/157 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 1/143 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-02 19:47:18] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/143 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 12 (OVERLAPS) 0/143 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 159 constraints, problems are : Problem set: 0 solved, 81 unsolved in 3911 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 1/1 constraints]
After SMT, in 6737ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 6739ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 6754 ms. Remains : 54/54 places, 89/89 transitions.
Support contains 3 out of 54 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 54/54 places, 89/89 transitions.
Applied a total of 0 rules in 1 ms. Remains 54 /54 variables (removed 0) and now considering 89/89 (removed 0) transitions.
[2024-06-02 19:47:20] [INFO ] Invariant cache hit.
[2024-06-02 19:47:20] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-06-02 19:47:20] [INFO ] Invariant cache hit.
[2024-06-02 19:47:20] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-02 19:47:20] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 260 ms to find 0 implicit places.
Running 81 sub problems to find dead transitions.
[2024-06-02 19:47:20] [INFO ] Invariant cache hit.
[2024-06-02 19:47:20] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 1/54 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 88/142 variables, 54/64 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 12/76 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (OVERLAPS) 1/143 variables, 1/77 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/143 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 10 (OVERLAPS) 0/143 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Real declared 143/143 variables, and 77 constraints, problems are : Problem set: 0 solved, 81 unsolved in 2451 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 81 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/53 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/53 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/53 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 3 (OVERLAPS) 1/54 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 5 (OVERLAPS) 88/142 variables, 54/64 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 12/76 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/142 variables, 81/157 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/142 variables, 0/157 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 9 (OVERLAPS) 1/143 variables, 1/158 constraints. Problems are: Problem set: 0 solved, 81 unsolved
[2024-06-02 19:47:25] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/143 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/143 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 81 unsolved
At refinement iteration 12 (OVERLAPS) 0/143 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 81 unsolved
No progress, stopping.
After SMT solving in domain Int declared 143/143 variables, and 159 constraints, problems are : Problem set: 0 solved, 81 unsolved in 2996 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 54/54 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 81/81 constraints, Known Traps: 1/1 constraints]
After SMT, in 5484ms problems are : Problem set: 0 solved, 81 unsolved
Search for dead transitions found 0 dead transitions in 5486ms
Finished structural reductions in LTL mode , in 1 iterations and 5748 ms. Remains : 54/54 places, 89/89 transitions.
Treatment of property MedleyA-PT-14-LTLCardinality-04 finished in 24383 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 (X(G(p0))||(F(!p0)&&X(p1)))))'
[2024-06-02 19:47:26] [INFO ] Flatten gal took : 13 ms
[2024-06-02 19:47:26] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 3 ms.
[2024-06-02 19:47:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 146 places, 142 transitions and 404 arcs took 7 ms.
Total runtime 129782 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA MedleyA-PT-14-LTLCardinality-04 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA MedleyA-PT-14-LTLCardinality-15 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717357647232

--------------------
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 MedleyA-PT-14-LTLCardinality-04
ltl formula formula --ltl=/tmp/1428/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 146 places, 142 transitions and 404 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1428/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1428/ltl_0_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.010 user 0.000 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1428/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1428/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 148 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 147, there are 154 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( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~242!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 84
pnml2lts-mc( 0/ 4): unique states count: 1318
pnml2lts-mc( 0/ 4): unique transitions count: 4902
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 732
pnml2lts-mc( 0/ 4): - claim found count: 538
pnml2lts-mc( 0/ 4): - claim success count: 1328
pnml2lts-mc( 0/ 4): - cum. max stack depth: 836
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 1328 states 4924 transitions, fanout: 3.708
pnml2lts-mc( 0/ 4): Total exploration time 0.030 sec (0.030 sec minimum, 0.030 sec on average)
pnml2lts-mc( 0/ 4): States per second: 44267, Transitions per second: 164133
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, 17.4 B/state, compr.: 3.0%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 142 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 MedleyA-PT-14-LTLCardinality-15
ltl formula formula --ltl=/tmp/1428/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 146 places, 142 transitions and 404 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1428/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1428/ltl_1_
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.010 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1428/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1428/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 148 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 147, there are 152 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 ~58!
pnml2lts-mc( 3/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 907
pnml2lts-mc( 0/ 4): unique states count: 6287
pnml2lts-mc( 0/ 4): unique transitions count: 26477
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 15055
pnml2lts-mc( 0/ 4): - claim found count: 3487
pnml2lts-mc( 0/ 4): - claim success count: 6301
pnml2lts-mc( 0/ 4): - cum. max stack depth: 611
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 6301 states 26519 transitions, fanout: 4.209
pnml2lts-mc( 0/ 4): Total exploration time 0.080 sec (0.080 sec minimum, 0.080 sec on average)
pnml2lts-mc( 0/ 4): States per second: 78762, Transitions per second: 331488
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, 13.6 B/state, compr.: 2.3%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 142 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="MedleyA-PT-14"
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 MedleyA-PT-14, 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 r579-smll-171734921300107"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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