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.r575-smll-171734919600091.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 greatspnxred
Input is MedleyA-PT-12, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r575-smll-171734919600091
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 536K
-rw-r--r-- 1 mcc users 8.0K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 90K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K 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 15K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 164K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 61K 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 43K 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-12-LTLCardinality-00
FORMULA_NAME MedleyA-PT-12-LTLCardinality-01
FORMULA_NAME MedleyA-PT-12-LTLCardinality-02
FORMULA_NAME MedleyA-PT-12-LTLCardinality-03
FORMULA_NAME MedleyA-PT-12-LTLCardinality-04
FORMULA_NAME MedleyA-PT-12-LTLCardinality-05
FORMULA_NAME MedleyA-PT-12-LTLCardinality-06
FORMULA_NAME MedleyA-PT-12-LTLCardinality-07
FORMULA_NAME MedleyA-PT-12-LTLCardinality-08
FORMULA_NAME MedleyA-PT-12-LTLCardinality-09
FORMULA_NAME MedleyA-PT-12-LTLCardinality-10
FORMULA_NAME MedleyA-PT-12-LTLCardinality-11
FORMULA_NAME MedleyA-PT-12-LTLCardinality-12
FORMULA_NAME MedleyA-PT-12-LTLCardinality-13
FORMULA_NAME MedleyA-PT-12-LTLCardinality-14
FORMULA_NAME MedleyA-PT-12-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717363672259

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-12
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-06-02 21:27:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-02 21:27:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 21:27:54] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2024-06-02 21:27:54] [INFO ] Transformed 172 places.
[2024-06-02 21:27:54] [INFO ] Transformed 166 transitions.
[2024-06-02 21:27:54] [INFO ] Found NUPN structural information;
[2024-06-02 21:27:54] [INFO ] Parsed PT model containing 172 places and 166 transitions and 466 arcs in 283 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 19 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-12-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-12-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-12-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-12-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-12-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-12-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 172 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 172/172 places, 166/166 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 168 transition count 166
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 18 place count 154 transition count 145
Iterating global reduction 1 with 14 rules applied. Total rules applied 32 place count 154 transition count 145
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 153 transition count 144
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 153 transition count 144
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 35 place count 152 transition count 143
Iterating global reduction 1 with 1 rules applied. Total rules applied 36 place count 152 transition count 143
Applied a total of 36 rules in 73 ms. Remains 152 /172 variables (removed 20) and now considering 143/166 (removed 23) transitions.
// Phase 1: matrix 143 rows 152 cols
[2024-06-02 21:27:54] [INFO ] Computed 20 invariants in 14 ms
[2024-06-02 21:27:55] [INFO ] Implicit Places using invariants in 513 ms returned [31, 37]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 578 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 150/172 places, 143/166 transitions.
Applied a total of 0 rules in 8 ms. Remains 150 /150 variables (removed 0) and now considering 143/143 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 685 ms. Remains : 150/172 places, 143/166 transitions.
Support contains 32 out of 150 places after structural reductions.
[2024-06-02 21:27:55] [INFO ] Flatten gal took : 56 ms
[2024-06-02 21:27:55] [INFO ] Flatten gal took : 26 ms
[2024-06-02 21:27:55] [INFO ] Input system was already deterministic with 143 transitions.
RANDOM walk for 13312 steps (269 resets) in 580 ms. (22 steps per ms) remains 0/17 properties
FORMULA MedleyA-PT-12-LTLCardinality-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 10 stabilizing places and 10 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' '!((F(p0)&&F(G(p1))))'
Support contains 4 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 143/143 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 148 transition count 115
Reduce places removed 27 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 29 rules applied. Total rules applied 57 place count 121 transition count 113
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 120 transition count 113
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 23 Pre rules applied. Total rules applied 58 place count 120 transition count 90
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 104 place count 97 transition count 90
Discarding 2 places :
Implicit places reduction removed 2 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 3 rules applied. Total rules applied 107 place count 95 transition count 89
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 108 place count 94 transition count 89
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 108 place count 94 transition count 88
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 110 place count 93 transition count 88
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 115 place count 88 transition count 79
Iterating global reduction 5 with 5 rules applied. Total rules applied 120 place count 88 transition count 79
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 120 place count 88 transition count 78
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 122 place count 87 transition count 78
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 174 place count 61 transition count 52
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -23
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 188 place count 54 transition count 75
Applied a total of 188 rules in 70 ms. Remains 54 /150 variables (removed 96) and now considering 75/143 (removed 68) transitions.
// Phase 1: matrix 75 rows 54 cols
[2024-06-02 21:27:56] [INFO ] Computed 15 invariants in 7 ms
[2024-06-02 21:27:56] [INFO ] Implicit Places using invariants in 124 ms returned [16, 25, 29, 32]
[2024-06-02 21:27:56] [INFO ] Actually due to overlaps returned [16, 29, 32]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 127 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 51/150 places, 75/143 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 51 transition count 74
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 50 transition count 74
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 4 place count 49 transition count 74
Applied a total of 4 rules in 17 ms. Remains 49 /51 variables (removed 2) and now considering 74/75 (removed 1) transitions.
// Phase 1: matrix 74 rows 49 cols
[2024-06-02 21:27:56] [INFO ] Computed 12 invariants in 2 ms
[2024-06-02 21:27:56] [INFO ] Implicit Places using invariants in 92 ms returned [23]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 94 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/150 places, 74/143 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 47 transition count 84
Applied a total of 2 rules in 10 ms. Remains 47 /48 variables (removed 1) and now considering 84/74 (removed -10) transitions.
// Phase 1: matrix 84 rows 47 cols
[2024-06-02 21:27:56] [INFO ] Computed 11 invariants in 1 ms
[2024-06-02 21:27:56] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 21:27:56] [INFO ] Invariant cache hit.
[2024-06-02 21:27:56] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-02 21:27:56] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 47/150 places, 84/143 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 545 ms. Remains : 47/150 places, 84/143 transitions.
Stuttering acceptance computed with spot in 300 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : MedleyA-PT-12-LTLCardinality-00
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 2 ms.
FORMULA MedleyA-PT-12-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLCardinality-00 finished in 922 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(X(((p0 U p1)&&(X(p2) U !p0)))))'
Support contains 8 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 143/143 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 149 transition count 143
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 143 transition count 133
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 143 transition count 133
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 142 transition count 132
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 142 transition count 132
Applied a total of 15 rules in 9 ms. Remains 142 /150 variables (removed 8) and now considering 132/143 (removed 11) transitions.
// Phase 1: matrix 132 rows 142 cols
[2024-06-02 21:27:57] [INFO ] Computed 17 invariants in 2 ms
[2024-06-02 21:27:57] [INFO ] Implicit Places using invariants in 181 ms returned []
[2024-06-02 21:27:57] [INFO ] Invariant cache hit.
[2024-06-02 21:27:57] [INFO ] Implicit Places using invariants and state equation in 273 ms returned []
Implicit Place search using SMT with State Equation took 458 ms to find 0 implicit places.
Running 131 sub problems to find dead transitions.
[2024-06-02 21:27:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/142 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 21:27:59] [INFO ] Deduced a trap composed of 23 places in 130 ms of which 19 ms to minimize.
[2024-06-02 21:28:00] [INFO ] Deduced a trap composed of 28 places in 122 ms of which 3 ms to minimize.
[2024-06-02 21:28:00] [INFO ] Deduced a trap composed of 33 places in 142 ms of which 2 ms to minimize.
[2024-06-02 21:28:00] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-06-02 21:28:00] [INFO ] Deduced a trap composed of 22 places in 78 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 5/22 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/274 variables, 142/164 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 21:28:02] [INFO ] Deduced a trap composed of 38 places in 47 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 9 (OVERLAPS) 0/274 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 165 constraints, problems are : Problem set: 0 solved, 131 unsolved in 8210 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/142 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 6/23 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 21:28:07] [INFO ] Deduced a trap composed of 26 places in 34 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 132/274 variables, 142/166 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 131/297 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 21:28:08] [INFO ] Deduced a trap composed of 30 places in 72 ms of which 2 ms to minimize.
[2024-06-02 21:28:08] [INFO ] Deduced a trap composed of 33 places in 70 ms of which 2 ms to minimize.
[2024-06-02 21:28:09] [INFO ] Deduced a trap composed of 41 places in 60 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 3/300 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (OVERLAPS) 0/274 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 274/274 variables, and 300 constraints, problems are : Problem set: 0 solved, 131 unsolved in 8311 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 10/10 constraints]
After SMT, in 16620ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 16639ms
Starting structural reductions in LTL mode, iteration 1 : 142/150 places, 132/143 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 17110 ms. Remains : 142/150 places, 132/143 transitions.
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p1) p0), (OR p0 (AND (NOT p1) (NOT p2))), (OR (NOT p1) p0)]
Running random walk in product with property : MedleyA-PT-12-LTLCardinality-03
Stuttering criterion allowed to conclude after 72 steps with 1 reset in 2 ms.
FORMULA MedleyA-PT-12-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLCardinality-03 finished in 17282 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))'
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 143/143 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 149 transition count 143
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 143 transition count 133
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 143 transition count 133
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 142 transition count 132
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 142 transition count 132
Applied a total of 15 rules in 10 ms. Remains 142 /150 variables (removed 8) and now considering 132/143 (removed 11) transitions.
// Phase 1: matrix 132 rows 142 cols
[2024-06-02 21:28:14] [INFO ] Computed 17 invariants in 3 ms
[2024-06-02 21:28:14] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-06-02 21:28:14] [INFO ] Invariant cache hit.
[2024-06-02 21:28:14] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
Running 131 sub problems to find dead transitions.
[2024-06-02 21:28:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/142 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 21:28:16] [INFO ] Deduced a trap composed of 33 places in 59 ms of which 2 ms to minimize.
[2024-06-02 21:28:16] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
[2024-06-02 21:28:16] [INFO ] Deduced a trap composed of 22 places in 44 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/274 variables, 142/162 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 0/274 variables, 0/162 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 162 constraints, problems are : Problem set: 0 solved, 131 unsolved in 5057 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/142 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 21:28:20] [INFO ] Deduced a trap composed of 24 places in 69 ms of which 2 ms to minimize.
[2024-06-02 21:28:21] [INFO ] Deduced a trap composed of 29 places in 69 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 132/274 variables, 142/164 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 131/295 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 21:28:22] [INFO ] Deduced a trap composed of 36 places in 67 ms of which 2 ms to minimize.
[2024-06-02 21:28:22] [INFO ] Deduced a trap composed of 24 places in 64 ms of which 3 ms to minimize.
[2024-06-02 21:28:22] [INFO ] Deduced a trap composed of 48 places in 59 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 3/298 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (OVERLAPS) 0/274 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 274/274 variables, and 298 constraints, problems are : Problem set: 0 solved, 131 unsolved in 7441 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 8/8 constraints]
After SMT, in 12538ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 12541ms
Starting structural reductions in LTL mode, iteration 1 : 142/150 places, 132/143 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 12967 ms. Remains : 142/150 places, 132/143 transitions.
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : MedleyA-PT-12-LTLCardinality-04
Product exploration explored 100000 steps with 50000 reset in 312 ms.
Product exploration explored 100000 steps with 50000 reset in 186 ms.
Computed a total of 9 stabilizing places and 9 stable transitions
Computed a total of 9 stabilizing places and 9 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA MedleyA-PT-12-LTLCardinality-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property MedleyA-PT-12-LTLCardinality-04 finished in 13665 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 p1) U (p1&&F(G(p2))))))'
Support contains 5 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 143/143 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 149 transition count 118
Reduce places removed 25 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 27 rules applied. Total rules applied 53 place count 124 transition count 116
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 55 place count 123 transition count 115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 56 place count 122 transition count 115
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 24 Pre rules applied. Total rules applied 56 place count 122 transition count 91
Deduced a syphon composed of 24 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 49 rules applied. Total rules applied 105 place count 97 transition count 91
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 107 place count 96 transition count 90
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 108 place count 95 transition count 90
Discarding 6 places :
Symmetric choice reduction at 6 with 6 rule applications. Total rules 114 place count 89 transition count 80
Iterating global reduction 6 with 6 rules applied. Total rules applied 120 place count 89 transition count 80
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 120 place count 89 transition count 78
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 124 place count 87 transition count 78
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 125 place count 86 transition count 77
Iterating global reduction 6 with 1 rules applied. Total rules applied 126 place count 86 transition count 77
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 174 place count 62 transition count 53
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -11
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 6 with 12 rules applied. Total rules applied 186 place count 56 transition count 64
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 187 place count 56 transition count 63
Applied a total of 187 rules in 29 ms. Remains 56 /150 variables (removed 94) and now considering 63/143 (removed 80) transitions.
// Phase 1: matrix 63 rows 56 cols
[2024-06-02 21:28:28] [INFO ] Computed 15 invariants in 1 ms
[2024-06-02 21:28:28] [INFO ] Implicit Places using invariants in 63 ms returned [17, 24, 33]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 64 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 53/150 places, 63/143 transitions.
Applied a total of 0 rules in 3 ms. Remains 53 /53 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 96 ms. Remains : 53/150 places, 63/143 transitions.
Stuttering acceptance computed with spot in 169 ms :[(OR (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : MedleyA-PT-12-LTLCardinality-05
Stuttering criterion allowed to conclude after 16 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-12-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLCardinality-05 finished in 287 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 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 143/143 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 149 transition count 143
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 142 transition count 132
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 142 transition count 132
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 141 transition count 131
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 141 transition count 131
Applied a total of 17 rules in 5 ms. Remains 141 /150 variables (removed 9) and now considering 131/143 (removed 12) transitions.
// Phase 1: matrix 131 rows 141 cols
[2024-06-02 21:28:28] [INFO ] Computed 17 invariants in 13 ms
[2024-06-02 21:28:28] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-02 21:28:28] [INFO ] Invariant cache hit.
[2024-06-02 21:28:28] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 270 ms to find 0 implicit places.
Running 130 sub problems to find dead transitions.
[2024-06-02 21:28:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/141 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-02 21:28:30] [INFO ] Deduced a trap composed of 33 places in 51 ms of which 2 ms to minimize.
[2024-06-02 21:28:30] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 1 ms to minimize.
[2024-06-02 21:28:30] [INFO ] Deduced a trap composed of 22 places in 62 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/272 variables, 141/161 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 8 (OVERLAPS) 0/272 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Real declared 272/272 variables, and 161 constraints, problems are : Problem set: 0 solved, 130 unsolved in 5090 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 130 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 2 (OVERLAPS) 1/141 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 6 (OVERLAPS) 131/272 variables, 141/161 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/272 variables, 130/291 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-02 21:28:35] [INFO ] Deduced a trap composed of 26 places in 38 ms of which 2 ms to minimize.
[2024-06-02 21:28:35] [INFO ] Deduced a trap composed of 20 places in 69 ms of which 1 ms to minimize.
[2024-06-02 21:28:36] [INFO ] Deduced a trap composed of 51 places in 59 ms of which 2 ms to minimize.
[2024-06-02 21:28:36] [INFO ] Deduced a trap composed of 36 places in 59 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/272 variables, 4/295 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-02 21:28:37] [INFO ] Deduced a trap composed of 35 places in 74 ms of which 2 ms to minimize.
[2024-06-02 21:28:38] [INFO ] Deduced a trap composed of 41 places in 56 ms of which 2 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/272 variables, 2/297 constraints. Problems are: Problem set: 0 solved, 130 unsolved
[2024-06-02 21:28:39] [INFO ] Deduced a trap composed of 29 places in 66 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/272 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/272 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 130 unsolved
At refinement iteration 12 (OVERLAPS) 0/272 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 130 unsolved
No progress, stopping.
After SMT solving in domain Int declared 272/272 variables, and 298 constraints, problems are : Problem set: 0 solved, 130 unsolved in 9977 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 130/130 constraints, Known Traps: 10/10 constraints]
After SMT, in 15091ms problems are : Problem set: 0 solved, 130 unsolved
Search for dead transitions found 0 dead transitions in 15094ms
Starting structural reductions in LTL mode, iteration 1 : 141/150 places, 131/143 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 15370 ms. Remains : 141/150 places, 131/143 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-12-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-12-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLCardinality-06 finished in 15483 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 3 out of 150 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 150/150 places, 143/143 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 149 transition count 143
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 143 transition count 133
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 143 transition count 133
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 142 transition count 132
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 142 transition count 132
Applied a total of 15 rules in 6 ms. Remains 142 /150 variables (removed 8) and now considering 132/143 (removed 11) transitions.
// Phase 1: matrix 132 rows 142 cols
[2024-06-02 21:28:43] [INFO ] Computed 17 invariants in 2 ms
[2024-06-02 21:28:44] [INFO ] Implicit Places using invariants in 109 ms returned []
[2024-06-02 21:28:44] [INFO ] Invariant cache hit.
[2024-06-02 21:28:44] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
Running 131 sub problems to find dead transitions.
[2024-06-02 21:28:44] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/142 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 21:28:45] [INFO ] Deduced a trap composed of 26 places in 32 ms of which 1 ms to minimize.
[2024-06-02 21:28:46] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-06-02 21:28:46] [INFO ] Deduced a trap composed of 15 places in 27 ms of which 0 ms to minimize.
[2024-06-02 21:28:46] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/274 variables, 142/163 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/274 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 0/274 variables, 0/163 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 274/274 variables, and 163 constraints, problems are : Problem set: 0 solved, 131 unsolved in 5245 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 131 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/141 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/141 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/142 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/142 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/142 variables, 4/21 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 21:28:50] [INFO ] Deduced a trap composed of 23 places in 57 ms of which 2 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/142 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/142 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (OVERLAPS) 132/274 variables, 142/164 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/274 variables, 131/295 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 21:28:51] [INFO ] Deduced a trap composed of 22 places in 68 ms of which 2 ms to minimize.
[2024-06-02 21:28:52] [INFO ] Deduced a trap composed of 49 places in 63 ms of which 7 ms to minimize.
[2024-06-02 21:28:52] [INFO ] Deduced a trap composed of 34 places in 57 ms of which 2 ms to minimize.
[2024-06-02 21:28:52] [INFO ] Deduced a trap composed of 45 places in 60 ms of which 2 ms to minimize.
[2024-06-02 21:28:52] [INFO ] Deduced a trap composed of 52 places in 49 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 5/300 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 21:28:53] [INFO ] Deduced a trap composed of 29 places in 62 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 21:28:58] [INFO ] Deduced a trap composed of 35 places in 57 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/274 variables, 1/302 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/274 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 14 (OVERLAPS) 0/274 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 274/274 variables, and 302 constraints, problems are : Problem set: 0 solved, 131 unsolved in 14264 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 142/142 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 12/12 constraints]
After SMT, in 19534ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 19537ms
Starting structural reductions in LTL mode, iteration 1 : 142/150 places, 132/143 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 19837 ms. Remains : 142/150 places, 132/143 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-12-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-12-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLCardinality-08 finished in 19940 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 143/143 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 148 transition count 114
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 30 rules applied. Total rules applied 59 place count 120 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 119 transition count 112
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 25 Pre rules applied. Total rules applied 60 place count 119 transition count 87
Deduced a syphon composed of 25 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 3 with 51 rules applied. Total rules applied 111 place count 93 transition count 87
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 113 place count 92 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 114 place count 91 transition count 86
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 120 place count 85 transition count 76
Iterating global reduction 5 with 6 rules applied. Total rules applied 126 place count 85 transition count 76
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 126 place count 85 transition count 74
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 130 place count 83 transition count 74
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 131 place count 82 transition count 73
Iterating global reduction 5 with 1 rules applied. Total rules applied 132 place count 82 transition count 73
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 5 with 50 rules applied. Total rules applied 182 place count 57 transition count 48
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -21
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 196 place count 50 transition count 69
Applied a total of 196 rules in 26 ms. Remains 50 /150 variables (removed 100) and now considering 69/143 (removed 74) transitions.
// Phase 1: matrix 69 rows 50 cols
[2024-06-02 21:29:03] [INFO ] Computed 15 invariants in 1 ms
[2024-06-02 21:29:03] [INFO ] Implicit Places using invariants in 65 ms returned [14, 22, 26, 29]
[2024-06-02 21:29:03] [INFO ] Actually due to overlaps returned [14, 26, 29]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 78 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/150 places, 69/143 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 47 transition count 68
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 46 transition count 68
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 4 place count 45 transition count 68
Applied a total of 4 rules in 9 ms. Remains 45 /47 variables (removed 2) and now considering 68/69 (removed 1) transitions.
// Phase 1: matrix 68 rows 45 cols
[2024-06-02 21:29:03] [INFO ] Computed 12 invariants in 1 ms
[2024-06-02 21:29:04] [INFO ] Implicit Places using invariants in 66 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 76 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/150 places, 68/143 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 43 transition count 78
Applied a total of 2 rules in 18 ms. Remains 43 /44 variables (removed 1) and now considering 78/68 (removed -10) transitions.
// Phase 1: matrix 78 rows 43 cols
[2024-06-02 21:29:04] [INFO ] Computed 11 invariants in 1 ms
[2024-06-02 21:29:04] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-06-02 21:29:04] [INFO ] Invariant cache hit.
[2024-06-02 21:29:04] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-02 21:29:04] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 43/150 places, 78/143 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 380 ms. Remains : 43/150 places, 78/143 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-12-LTLCardinality-09
Stuttering criterion allowed to conclude after 197 steps with 22 reset in 2 ms.
FORMULA MedleyA-PT-12-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-12-LTLCardinality-09 finished in 434 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(F(p1)))))'
Support contains 4 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 143/143 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 149 transition count 118
Reduce places removed 24 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 26 rules applied. Total rules applied 50 place count 125 transition count 116
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 53 place count 124 transition count 114
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 55 place count 122 transition count 114
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 25 Pre rules applied. Total rules applied 55 place count 122 transition count 89
Deduced a syphon composed of 25 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 4 with 51 rules applied. Total rules applied 106 place count 96 transition count 89
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 2 rules applied. Total rules applied 108 place count 95 transition count 88
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 109 place count 94 transition count 88
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 116 place count 87 transition count 77
Iterating global reduction 6 with 7 rules applied. Total rules applied 123 place count 87 transition count 77
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 123 place count 87 transition count 75
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 127 place count 85 transition count 75
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 128 place count 84 transition count 74
Iterating global reduction 6 with 1 rules applied. Total rules applied 129 place count 84 transition count 74
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 6 with 44 rules applied. Total rules applied 173 place count 62 transition count 52
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -13
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 187 place count 55 transition count 65
Applied a total of 187 rules in 16 ms. Remains 55 /150 variables (removed 95) and now considering 65/143 (removed 78) transitions.
// Phase 1: matrix 65 rows 55 cols
[2024-06-02 21:29:04] [INFO ] Computed 16 invariants in 0 ms
[2024-06-02 21:29:04] [INFO ] Implicit Places using invariants in 74 ms returned [28, 33, 36]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 75 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/150 places, 65/143 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 52 transition count 64
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 51 transition count 64
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 3 rules applied. Total rules applied 5 place count 49 transition count 63
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 7 place count 48 transition count 63
Applied a total of 7 rules in 8 ms. Remains 48 /52 variables (removed 4) and now considering 63/65 (removed 2) transitions.
// Phase 1: matrix 63 rows 48 cols
[2024-06-02 21:29:04] [INFO ] Computed 12 invariants in 1 ms
[2024-06-02 21:29:04] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-02 21:29:04] [INFO ] Invariant cache hit.
[2024-06-02 21:29:04] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-02 21:29:04] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 135 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 48/150 places, 63/143 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 234 ms. Remains : 48/150 places, 63/143 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : MedleyA-PT-12-LTLCardinality-10
Product exploration explored 100000 steps with 10539 reset in 291 ms.
Product exploration explored 100000 steps with 10468 reset in 259 ms.
Computed a total of 2 stabilizing places and 7 stable transitions
Computed a total of 2 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 252 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 126 steps (10 resets) in 7 ms. (15 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 372 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 63/63 transitions.
Applied a total of 0 rules in 3 ms. Remains 48 /48 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-06-02 21:29:06] [INFO ] Invariant cache hit.
[2024-06-02 21:29:06] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-06-02 21:29:06] [INFO ] Invariant cache hit.
[2024-06-02 21:29:06] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-02 21:29:06] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 171 ms to find 0 implicit places.
[2024-06-02 21:29:06] [INFO ] Redundant transitions in 1 ms returned []
Running 57 sub problems to find dead transitions.
[2024-06-02 21:29:06] [INFO ] Invariant cache hit.
[2024-06-02 21:29:06] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (OVERLAPS) 1/48 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 63/111 variables, 48/60 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (OVERLAPS) 0/111 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/111 variables, and 66 constraints, problems are : Problem set: 0 solved, 57 unsolved in 993 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 48/48 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (OVERLAPS) 1/48 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 63/111 variables, 48/60 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 57/123 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (OVERLAPS) 0/111 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/111 variables, and 123 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1273 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 48/48 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
After SMT, in 2290ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 2291ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2473 ms. Remains : 48/48 places, 63/63 transitions.
Computed a total of 2 stabilizing places and 7 stable transitions
Computed a total of 2 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 246 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 90 steps (8 resets) in 8 ms. (10 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 6 factoid took 350 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 10514 reset in 139 ms.
Product exploration explored 100000 steps with 10485 reset in 284 ms.
Support contains 4 out of 48 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 48/48 places, 63/63 transitions.
Applied a total of 0 rules in 2 ms. Remains 48 /48 variables (removed 0) and now considering 63/63 (removed 0) transitions.
[2024-06-02 21:29:09] [INFO ] Invariant cache hit.
[2024-06-02 21:29:09] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-06-02 21:29:09] [INFO ] Invariant cache hit.
[2024-06-02 21:29:09] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-02 21:29:09] [INFO ] Implicit Places using invariants and state equation in 94 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2024-06-02 21:29:09] [INFO ] Redundant transitions in 1 ms returned []
Running 57 sub problems to find dead transitions.
[2024-06-02 21:29:10] [INFO ] Invariant cache hit.
[2024-06-02 21:29:10] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (OVERLAPS) 1/48 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 63/111 variables, 48/60 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (OVERLAPS) 0/111 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 111/111 variables, and 66 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1045 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 48/48 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/47 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (OVERLAPS) 1/48 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (OVERLAPS) 63/111 variables, 48/60 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/111 variables, 6/66 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/111 variables, 57/123 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/111 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 9 (OVERLAPS) 0/111 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 111/111 variables, and 123 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1163 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 48/48 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints]
After SMT, in 2229ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 2230ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2406 ms. Remains : 48/48 places, 63/63 transitions.
Treatment of property MedleyA-PT-12-LTLCardinality-10 finished in 8019 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 143/143 transitions.
Reduce places removed 1 places and 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 148 transition count 114
Reduce places removed 28 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 30 rules applied. Total rules applied 59 place count 120 transition count 112
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 60 place count 119 transition count 112
Performed 26 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 26 Pre rules applied. Total rules applied 60 place count 119 transition count 86
Deduced a syphon composed of 26 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 53 rules applied. Total rules applied 113 place count 92 transition count 86
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 3 with 2 rules applied. Total rules applied 115 place count 91 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 116 place count 90 transition count 85
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 122 place count 84 transition count 75
Iterating global reduction 5 with 6 rules applied. Total rules applied 128 place count 84 transition count 75
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 128 place count 84 transition count 73
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 132 place count 82 transition count 73
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 133 place count 81 transition count 72
Iterating global reduction 5 with 1 rules applied. Total rules applied 134 place count 81 transition count 72
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 182 place count 57 transition count 48
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 5 with 14 rules applied. Total rules applied 196 place count 50 transition count 67
Applied a total of 196 rules in 14 ms. Remains 50 /150 variables (removed 100) and now considering 67/143 (removed 76) transitions.
// Phase 1: matrix 67 rows 50 cols
[2024-06-02 21:29:12] [INFO ] Computed 15 invariants in 5 ms
[2024-06-02 21:29:12] [INFO ] Implicit Places using invariants in 76 ms returned [14, 23, 27, 30]
[2024-06-02 21:29:12] [INFO ] Actually due to overlaps returned [14, 27, 30]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 84 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 47/150 places, 67/143 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 47 transition count 66
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 46 transition count 66
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 4 place count 45 transition count 66
Applied a total of 4 rules in 5 ms. Remains 45 /47 variables (removed 2) and now considering 66/67 (removed 1) transitions.
// Phase 1: matrix 66 rows 45 cols
[2024-06-02 21:29:12] [INFO ] Computed 12 invariants in 5 ms
[2024-06-02 21:29:12] [INFO ] Implicit Places using invariants in 63 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 64 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 44/150 places, 66/143 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -10
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 43 transition count 76
Applied a total of 2 rules in 4 ms. Remains 43 /44 variables (removed 1) and now considering 76/66 (removed -10) transitions.
// Phase 1: matrix 76 rows 43 cols
[2024-06-02 21:29:12] [INFO ] Computed 11 invariants in 1 ms
[2024-06-02 21:29:12] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-06-02 21:29:12] [INFO ] Invariant cache hit.
[2024-06-02 21:29:12] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 21:29:12] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 151 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 43/150 places, 76/143 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 322 ms. Remains : 43/150 places, 76/143 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-12-LTLCardinality-12
Product exploration explored 100000 steps with 12531 reset in 169 ms.
Product exploration explored 100000 steps with 12535 reset in 193 ms.
Computed a total of 1 stabilizing places and 24 stable transitions
Computed a total of 1 stabilizing places and 24 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 563 steps (68 resets) in 7 ms. (70 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 150 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 2 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 76/76 transitions.
Applied a total of 0 rules in 3 ms. Remains 43 /43 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2024-06-02 21:29:13] [INFO ] Invariant cache hit.
[2024-06-02 21:29:13] [INFO ] Implicit Places using invariants in 107 ms returned []
[2024-06-02 21:29:13] [INFO ] Invariant cache hit.
[2024-06-02 21:29:13] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 21:29:13] [INFO ] Implicit Places using invariants and state equation in 79 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2024-06-02 21:29:13] [INFO ] Redundant transitions in 1 ms returned []
Running 52 sub problems to find dead transitions.
[2024-06-02 21:29:13] [INFO ] Invariant cache hit.
[2024-06-02 21:29:13] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (OVERLAPS) 1/43 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-02 21:29:14] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 76/119 variables, 43/55 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (OVERLAPS) 0/119 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 58 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1325 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 43/43 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (OVERLAPS) 1/43 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 76/119 variables, 43/55 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 52/110 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (OVERLAPS) 0/119 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 110 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1814 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 43/43 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 1/1 constraints]
After SMT, in 3170ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 3171ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3369 ms. Remains : 43/43 places, 76/76 transitions.
Computed a total of 1 stabilizing places and 24 stable transitions
Computed a total of 1 stabilizing places and 24 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 105 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
RANDOM walk for 438 steps (53 resets) in 8 ms. (48 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 137 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 112 ms :[(NOT p0)]
Product exploration explored 100000 steps with 12603 reset in 275 ms.
Product exploration explored 100000 steps with 12569 reset in 304 ms.
Support contains 2 out of 43 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 43/43 places, 76/76 transitions.
Applied a total of 0 rules in 4 ms. Remains 43 /43 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2024-06-02 21:29:17] [INFO ] Invariant cache hit.
[2024-06-02 21:29:18] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-06-02 21:29:18] [INFO ] Invariant cache hit.
[2024-06-02 21:29:18] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-06-02 21:29:18] [INFO ] Implicit Places using invariants and state equation in 121 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2024-06-02 21:29:18] [INFO ] Redundant transitions in 2 ms returned []
Running 52 sub problems to find dead transitions.
[2024-06-02 21:29:18] [INFO ] Invariant cache hit.
[2024-06-02 21:29:18] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (OVERLAPS) 1/43 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 52 unsolved
[2024-06-02 21:29:18] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 76/119 variables, 43/55 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (OVERLAPS) 0/119 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Real declared 119/119 variables, and 58 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1817 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 43/43 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 52 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/42 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 3 (OVERLAPS) 1/43 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 6 (OVERLAPS) 76/119 variables, 43/55 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/119 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/119 variables, 52/110 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/119 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 52 unsolved
At refinement iteration 10 (OVERLAPS) 0/119 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 52 unsolved
No progress, stopping.
After SMT solving in domain Int declared 119/119 variables, and 110 constraints, problems are : Problem set: 0 solved, 52 unsolved in 1939 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 43/43 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 52/52 constraints, Known Traps: 1/1 constraints]
After SMT, in 3801ms problems are : Problem set: 0 solved, 52 unsolved
Search for dead transitions found 0 dead transitions in 3805ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4039 ms. Remains : 43/43 places, 76/76 transitions.
Treatment of property MedleyA-PT-12-LTLCardinality-12 finished in 9694 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(F(p1)))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
[2024-06-02 21:29:22] [INFO ] Flatten gal took : 25 ms
[2024-06-02 21:29:22] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 4 ms.
[2024-06-02 21:29:22] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 150 places, 143 transitions and 380 arcs took 10 ms.
Total runtime 88698 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running MedleyA-PT-12

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/412/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 150
TRANSITIONS: 143
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.006s, Sys 0.000s]


SAVING FILE /home/mcc/execution/412/model (.net / .def) ...
EXPORT TIME: [User 0.001s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 1189
MODEL NAME: /home/mcc/execution/412/model
150 places, 143 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA MedleyA-PT-12-LTLCardinality-12 FALSE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA MedleyA-PT-12-LTLCardinality-10 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1717364061618

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="MedleyA-PT-12"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is MedleyA-PT-12, 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 r575-smll-171734919600091"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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