About the Execution of ITS-Tools for MedleyA-PT-13
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 456.180 | 57904.00 | 90208.00 | 428.80 | FFTFFTFTFTTFFFFF | normal |
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.r576-smll-171734920000099.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 itstools
Input is MedleyA-PT-13, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r576-smll-171734920000099
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 6.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 67K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K 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 26K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 120K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 44K 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 39K 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-13-LTLCardinality-00
FORMULA_NAME MedleyA-PT-13-LTLCardinality-01
FORMULA_NAME MedleyA-PT-13-LTLCardinality-02
FORMULA_NAME MedleyA-PT-13-LTLCardinality-03
FORMULA_NAME MedleyA-PT-13-LTLCardinality-04
FORMULA_NAME MedleyA-PT-13-LTLCardinality-05
FORMULA_NAME MedleyA-PT-13-LTLCardinality-06
FORMULA_NAME MedleyA-PT-13-LTLCardinality-07
FORMULA_NAME MedleyA-PT-13-LTLCardinality-08
FORMULA_NAME MedleyA-PT-13-LTLCardinality-09
FORMULA_NAME MedleyA-PT-13-LTLCardinality-10
FORMULA_NAME MedleyA-PT-13-LTLCardinality-11
FORMULA_NAME MedleyA-PT-13-LTLCardinality-12
FORMULA_NAME MedleyA-PT-13-LTLCardinality-13
FORMULA_NAME MedleyA-PT-13-LTLCardinality-14
FORMULA_NAME MedleyA-PT-13-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717368661371
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=MedleyA-PT-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-06-02 22:51:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 22:51:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 22:51:03] [INFO ] Load time of PNML (sax parser for PT used): 99 ms
[2024-06-02 22:51:03] [INFO ] Transformed 173 places.
[2024-06-02 22:51:03] [INFO ] Transformed 159 transitions.
[2024-06-02 22:51:03] [INFO ] Found NUPN structural information;
[2024-06-02 22:51:03] [INFO ] Parsed PT model containing 173 places and 159 transitions and 401 arcs in 269 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA MedleyA-PT-13-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-13-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-13-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-13-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-13-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-13-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-13-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA MedleyA-PT-13-LTLCardinality-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 out of 173 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 173/173 places, 159/159 transitions.
Discarding 5 places :
Implicit places reduction removed 5 places
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 168 transition count 159
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 22 place count 151 transition count 142
Iterating global reduction 1 with 17 rules applied. Total rules applied 39 place count 151 transition count 142
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 41 place count 149 transition count 140
Iterating global reduction 1 with 2 rules applied. Total rules applied 43 place count 149 transition count 140
Applied a total of 43 rules in 69 ms. Remains 149 /173 variables (removed 24) and now considering 140/159 (removed 19) transitions.
// Phase 1: matrix 140 rows 149 cols
[2024-06-02 22:51:04] [INFO ] Computed 16 invariants in 34 ms
[2024-06-02 22:51:04] [INFO ] Implicit Places using invariants in 372 ms returned [33, 38]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 417 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 147/173 places, 140/159 transitions.
Applied a total of 0 rules in 9 ms. Remains 147 /147 variables (removed 0) and now considering 140/140 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 524 ms. Remains : 147/173 places, 140/159 transitions.
Support contains 20 out of 147 places after structural reductions.
[2024-06-02 22:51:04] [INFO ] Flatten gal took : 73 ms
[2024-06-02 22:51:05] [INFO ] Flatten gal took : 32 ms
[2024-06-02 22:51:05] [INFO ] Input system was already deterministic with 140 transitions.
RANDOM walk for 40000 steps (1129 resets) in 1370 ms. (29 steps per ms) remains 2/11 properties
BEST_FIRST walk for 40004 steps (276 resets) in 465 ms. (85 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (283 resets) in 478 ms. (83 steps per ms) remains 2/2 properties
// Phase 1: matrix 140 rows 147 cols
[2024-06-02 22:51:05] [INFO ] Computed 14 invariants in 10 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 31/37 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 57/94 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/94 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp8 is UNSAT
At refinement iteration 5 (OVERLAPS) 53/147 variables, 5/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 140/287 variables, 147/161 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/287 variables, 0/161 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/287 variables, 0/161 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 287/287 variables, and 161 constraints, problems are : Problem set: 1 solved, 1 unsolved in 251 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 32/34 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 57/91 variables, 6/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/91 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 56/147 variables, 5/14 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-06-02 22:51:06] [INFO ] Deduced a trap composed of 17 places in 93 ms of which 16 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/147 variables, 1/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/147 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 140/287 variables, 147/162 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/287 variables, 1/163 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/287 variables, 0/163 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/287 variables, 0/163 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 287/287 variables, and 163 constraints, problems are : Problem set: 1 solved, 1 unsolved in 356 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 147/147 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 660ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 30 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=30 )
Parikh walk visited 1 properties in 18 ms.
Successfully simplified 1 atomic propositions for a total of 8 simplifications.
FORMULA MedleyA-PT-13-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 9 stabilizing places and 9 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' '!((G(p0)||G(p1)))'
Support contains 3 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 140/140 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 146 transition count 107
Reduce places removed 32 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 34 rules applied. Total rules applied 66 place count 114 transition count 105
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 68 place count 113 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 69 place count 112 transition count 104
Performed 28 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 28 Pre rules applied. Total rules applied 69 place count 112 transition count 76
Deduced a syphon composed of 28 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 4 with 57 rules applied. Total rules applied 126 place count 83 transition count 76
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 128 place count 82 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 129 place count 81 transition count 75
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 177 place count 57 transition count 51
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -12
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 191 place count 50 transition count 63
Applied a total of 191 rules in 65 ms. Remains 50 /147 variables (removed 97) and now considering 63/140 (removed 77) transitions.
// Phase 1: matrix 63 rows 50 cols
[2024-06-02 22:51:06] [INFO ] Computed 12 invariants in 1 ms
[2024-06-02 22:51:07] [INFO ] Implicit Places using invariants in 92 ms returned [0, 12, 23, 27, 30]
[2024-06-02 22:51:07] [INFO ] Actually due to overlaps returned [27, 0, 30, 12]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 95 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/147 places, 63/140 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 46 transition count 59
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 42 transition count 59
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 41 transition count 59
Applied a total of 10 rules in 10 ms. Remains 41 /46 variables (removed 5) and now considering 59/63 (removed 4) transitions.
// Phase 1: matrix 59 rows 41 cols
[2024-06-02 22:51:07] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 22:51:07] [INFO ] Implicit Places using invariants in 70 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 73 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 40/147 places, 59/140 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 39 transition count 61
Applied a total of 2 rules in 7 ms. Remains 39 /40 variables (removed 1) and now considering 61/59 (removed -2) transitions.
// Phase 1: matrix 61 rows 39 cols
[2024-06-02 22:51:07] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 22:51:07] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 22:51:07] [INFO ] Invariant cache hit.
[2024-06-02 22:51:07] [INFO ] State equation strengthened by 7 read => feed constraints.
[2024-06-02 22:51:07] [INFO ] Implicit Places using invariants and state equation in 98 ms returned []
Implicit Place search using SMT with State Equation took 176 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 39/147 places, 61/140 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 430 ms. Remains : 39/147 places, 61/140 transitions.
Stuttering acceptance computed with spot in 334 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : MedleyA-PT-13-LTLCardinality-00
Entered a terminal (fully accepting) state of product in 610 steps with 115 reset in 15 ms.
FORMULA MedleyA-PT-13-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-13-LTLCardinality-00 finished in 865 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((F((p0&&G(F(p0))))&&G(p1))))'
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 140/140 transitions.
Reduce places removed 1 places and 1 transitions.
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 28 rules applied. Total rules applied 28 place count 146 transition count 111
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 58 place count 118 transition count 109
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 61 place count 117 transition count 107
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 63 place count 115 transition count 107
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 30 Pre rules applied. Total rules applied 63 place count 115 transition count 77
Deduced a syphon composed of 30 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 4 with 61 rules applied. Total rules applied 124 place count 84 transition count 77
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 126 place count 83 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 127 place count 82 transition count 76
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 128 place count 81 transition count 75
Iterating global reduction 6 with 1 rules applied. Total rules applied 129 place count 81 transition count 75
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 130 place count 80 transition count 74
Iterating global reduction 6 with 1 rules applied. Total rules applied 131 place count 80 transition count 74
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 6 with 46 rules applied. Total rules applied 177 place count 57 transition count 51
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 191 place count 50 transition count 64
Applied a total of 191 rules in 38 ms. Remains 50 /147 variables (removed 97) and now considering 64/140 (removed 76) transitions.
// Phase 1: matrix 64 rows 50 cols
[2024-06-02 22:51:07] [INFO ] Computed 12 invariants in 1 ms
[2024-06-02 22:51:07] [INFO ] Implicit Places using invariants in 82 ms returned [0, 14, 23, 27, 30]
[2024-06-02 22:51:07] [INFO ] Actually due to overlaps returned [27, 0, 14, 30]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 86 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 46/147 places, 64/140 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 0 with 1 rules applied. Total rules applied 1 place count 46 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 45 transition count 63
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 45 transition count 59
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 41 transition count 59
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 2 with 2 rules applied. Total rules applied 12 place count 40 transition count 59
Applied a total of 12 rules in 7 ms. Remains 40 /46 variables (removed 6) and now considering 59/64 (removed 5) transitions.
// Phase 1: matrix 59 rows 40 cols
[2024-06-02 22:51:07] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:51:07] [INFO ] Implicit Places using invariants in 53 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 54 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 39/147 places, 59/140 transitions.
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 2 place count 38 transition count 59
Applied a total of 2 rules in 5 ms. Remains 38 /39 variables (removed 1) and now considering 59/59 (removed 0) transitions.
// Phase 1: matrix 59 rows 38 cols
[2024-06-02 22:51:07] [INFO ] Computed 7 invariants in 0 ms
[2024-06-02 22:51:07] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-06-02 22:51:07] [INFO ] Invariant cache hit.
[2024-06-02 22:51:07] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-02 22:51:08] [INFO ] Implicit Places using invariants and state equation in 90 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 38/147 places, 59/140 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 344 ms. Remains : 38/147 places, 59/140 transitions.
Stuttering acceptance computed with spot in 110 ms :[(OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : MedleyA-PT-13-LTLCardinality-01
Product exploration explored 100000 steps with 16855 reset in 370 ms.
Stack based approach found an accepted trace after 49160 steps with 8266 reset with depth 8 and stack size 8 in 123 ms.
FORMULA MedleyA-PT-13-LTLCardinality-01 FALSE TECHNIQUES STACK_TEST
Treatment of property MedleyA-PT-13-LTLCardinality-01 finished in 971 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 140/140 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 31 rules applied. Total rules applied 31 place count 146 transition count 108
Reduce places removed 31 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 33 rules applied. Total rules applied 64 place count 115 transition count 106
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 65 place count 114 transition count 106
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 65 place count 114 transition count 76
Deduced a syphon composed of 30 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 61 rules applied. Total rules applied 126 place count 83 transition count 76
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 128 place count 82 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 129 place count 81 transition count 75
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 130 place count 80 transition count 74
Iterating global reduction 5 with 1 rules applied. Total rules applied 131 place count 80 transition count 74
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 132 place count 79 transition count 73
Iterating global reduction 5 with 1 rules applied. Total rules applied 133 place count 79 transition count 73
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 181 place count 55 transition count 49
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 197 place count 47 transition count 65
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 198 place count 47 transition count 64
Applied a total of 198 rules in 28 ms. Remains 47 /147 variables (removed 100) and now considering 64/140 (removed 76) transitions.
// Phase 1: matrix 64 rows 47 cols
[2024-06-02 22:51:08] [INFO ] Computed 12 invariants in 1 ms
[2024-06-02 22:51:08] [INFO ] Implicit Places using invariants in 64 ms returned [0, 12, 20, 24, 27]
[2024-06-02 22:51:08] [INFO ] Actually due to overlaps returned [12, 24, 0, 27]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 67 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 43/147 places, 64/140 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 43 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 42 transition count 63
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 2 place count 42 transition count 59
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 10 place count 38 transition count 59
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 2 with 2 rules applied. Total rules applied 12 place count 37 transition count 59
Applied a total of 12 rules in 7 ms. Remains 37 /43 variables (removed 6) and now considering 59/64 (removed 5) transitions.
// Phase 1: matrix 59 rows 37 cols
[2024-06-02 22:51:08] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:51:08] [INFO ] Implicit Places using invariants in 48 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 36/147 places, 59/140 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 35 transition count 61
Applied a total of 2 rules in 4 ms. Remains 35 /36 variables (removed 1) and now considering 61/59 (removed -2) transitions.
// Phase 1: matrix 61 rows 35 cols
[2024-06-02 22:51:08] [INFO ] Computed 7 invariants in 0 ms
[2024-06-02 22:51:08] [INFO ] Implicit Places using invariants in 45 ms returned []
[2024-06-02 22:51:08] [INFO ] Invariant cache hit.
[2024-06-02 22:51:08] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 22:51:08] [INFO ] Implicit Places using invariants and state equation in 71 ms returned []
Implicit Place search using SMT with State Equation took 119 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 35/147 places, 61/140 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 276 ms. Remains : 35/147 places, 61/140 transitions.
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-13-LTLCardinality-03
Stuttering criterion allowed to conclude after 37 steps with 7 reset in 0 ms.
FORMULA MedleyA-PT-13-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-13-LTLCardinality-03 finished in 447 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(X((G(p0)||(p0&&F(!p1))))) U (X(X(G((G(p0)||(p0&&F(!p1))))))||(!p1&&X(X((G(p0)||(p0&&F(!p1)))))))))))'
Support contains 4 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 140/140 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 144 transition count 137
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 144 transition count 137
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 142 transition count 135
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 142 transition count 135
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 141 transition count 134
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 141 transition count 134
Applied a total of 12 rules in 11 ms. Remains 141 /147 variables (removed 6) and now considering 134/140 (removed 6) transitions.
// Phase 1: matrix 134 rows 141 cols
[2024-06-02 22:51:09] [INFO ] Computed 14 invariants in 2 ms
[2024-06-02 22:51:09] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-02 22:51:09] [INFO ] Invariant cache hit.
[2024-06-02 22:51:09] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 133 sub problems to find dead transitions.
[2024-06-02 22:51:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 1/141 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-06-02 22:51:11] [INFO ] Deduced a trap composed of 33 places in 65 ms of which 4 ms to minimize.
[2024-06-02 22:51:11] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2024-06-02 22:51:12] [INFO ] Deduced a trap composed of 22 places in 86 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 134/275 variables, 141/158 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-06-02 22:51:13] [INFO ] Deduced a trap composed of 26 places in 41 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 1/159 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (OVERLAPS) 0/275 variables, 0/159 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Real declared 275/275 variables, and 159 constraints, problems are : Problem set: 0 solved, 133 unsolved in 8556 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 133 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/140 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/140 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 2 (OVERLAPS) 1/141 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/141 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 4/18 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/141 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 6 (OVERLAPS) 134/275 variables, 141/159 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/275 variables, 133/292 constraints. Problems are: Problem set: 0 solved, 133 unsolved
[2024-06-02 22:51:20] [INFO ] Deduced a trap composed of 24 places in 100 ms of which 3 ms to minimize.
[2024-06-02 22:51:20] [INFO ] Deduced a trap composed of 76 places in 93 ms of which 7 ms to minimize.
[2024-06-02 22:51:21] [INFO ] Deduced a trap composed of 42 places in 97 ms of which 3 ms to minimize.
[2024-06-02 22:51:21] [INFO ] Deduced a trap composed of 67 places in 107 ms of which 3 ms to minimize.
[2024-06-02 22:51:21] [INFO ] Deduced a trap composed of 44 places in 94 ms of which 2 ms to minimize.
[2024-06-02 22:51:21] [INFO ] Deduced a trap composed of 77 places in 98 ms of which 4 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/275 variables, 6/298 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/275 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 133 unsolved
At refinement iteration 10 (OVERLAPS) 0/275 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 133 unsolved
No progress, stopping.
After SMT solving in domain Int declared 275/275 variables, and 298 constraints, problems are : Problem set: 0 solved, 133 unsolved in 9324 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 141/141 constraints, PredecessorRefiner: 133/133 constraints, Known Traps: 10/10 constraints]
After SMT, in 17920ms problems are : Problem set: 0 solved, 133 unsolved
Search for dead transitions found 0 dead transitions in 17925ms
Starting structural reductions in LTL mode, iteration 1 : 141/147 places, 134/140 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 18195 ms. Remains : 141/147 places, 134/140 transitions.
Stuttering acceptance computed with spot in 465 ms :[true, p1, (AND p1 (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-13-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 42 steps with 3 reset in 1 ms.
FORMULA MedleyA-PT-13-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-13-LTLCardinality-08 finished in 18692 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 140/140 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 146 transition count 107
Reduce places removed 32 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 34 rules applied. Total rules applied 66 place count 114 transition count 105
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 67 place count 113 transition count 105
Performed 29 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 29 Pre rules applied. Total rules applied 67 place count 113 transition count 76
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 125 place count 84 transition count 76
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 128 place count 82 transition count 75
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 129 place count 81 transition count 75
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 129 place count 81 transition count 74
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 131 place count 80 transition count 74
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 132 place count 79 transition count 73
Iterating global reduction 5 with 1 rules applied. Total rules applied 133 place count 79 transition count 73
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 134 place count 78 transition count 72
Iterating global reduction 5 with 1 rules applied. Total rules applied 135 place count 78 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 183 place count 54 transition count 48
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 199 place count 46 transition count 64
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 200 place count 46 transition count 63
Applied a total of 200 rules in 31 ms. Remains 46 /147 variables (removed 101) and now considering 63/140 (removed 77) transitions.
// Phase 1: matrix 63 rows 46 cols
[2024-06-02 22:51:27] [INFO ] Computed 12 invariants in 3 ms
[2024-06-02 22:51:27] [INFO ] Implicit Places using invariants in 89 ms returned [0, 10, 17, 21, 24]
[2024-06-02 22:51:27] [INFO ] Actually due to overlaps returned [10, 21, 0, 24]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 90 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 42/147 places, 63/140 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 42 transition count 59
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 38 transition count 59
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 10 place count 37 transition count 59
Applied a total of 10 rules in 7 ms. Remains 37 /42 variables (removed 5) and now considering 59/63 (removed 4) transitions.
// Phase 1: matrix 59 rows 37 cols
[2024-06-02 22:51:27] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:51:27] [INFO ] Implicit Places using invariants in 66 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 69 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 36/147 places, 59/140 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 35 transition count 61
Applied a total of 2 rules in 5 ms. Remains 35 /36 variables (removed 1) and now considering 61/59 (removed -2) transitions.
// Phase 1: matrix 61 rows 35 cols
[2024-06-02 22:51:27] [INFO ] Computed 7 invariants in 10 ms
[2024-06-02 22:51:28] [INFO ] Implicit Places using invariants in 96 ms returned []
[2024-06-02 22:51:28] [INFO ] Invariant cache hit.
[2024-06-02 22:51:28] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 22:51:28] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 35/147 places, 61/140 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 399 ms. Remains : 35/147 places, 61/140 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-13-LTLCardinality-10
Product exploration explored 100000 steps with 19714 reset in 359 ms.
Product exploration explored 100000 steps with 19706 reset in 250 ms.
Computed a total of 1 stabilizing places and 12 stable transitions
Computed a total of 1 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 481 steps (94 resets) in 6 ms. (68 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 138 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 236 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 35 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 35/35 places, 61/61 transitions.
Applied a total of 0 rules in 3 ms. Remains 35 /35 variables (removed 0) and now considering 61/61 (removed 0) transitions.
[2024-06-02 22:51:29] [INFO ] Invariant cache hit.
[2024-06-02 22:51:29] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-06-02 22:51:29] [INFO ] Invariant cache hit.
[2024-06-02 22:51:29] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-06-02 22:51:29] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 132 ms to find 0 implicit places.
[2024-06-02 22:51:29] [INFO ] Redundant transitions in 2 ms returned []
Running 49 sub problems to find dead transitions.
[2024-06-02 22:51:29] [INFO ] Invariant cache hit.
[2024-06-02 22:51:29] [INFO ] State equation strengthened by 5 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 1/35 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-06-02 22:51:30] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 61/96 variables, 35/43 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 48 constraints, problems are : Problem set: 0 solved, 49 unsolved in 874 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 35/35 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (OVERLAPS) 1/35 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/35 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/35 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 61/96 variables, 35/43 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/96 variables, 5/48 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 49/97 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 97 constraints, problems are : Problem set: 0 solved, 49 unsolved in 1110 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 35/35 constraints, ReadFeed: 5/5 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 1/1 constraints]
After SMT, in 2022ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 2024ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2169 ms. Remains : 35/35 places, 61/61 transitions.
Computed a total of 1 stabilizing places and 12 stable transitions
Computed a total of 1 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 108 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1618 steps (313 resets) in 11 ms. (134 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 130 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 19701 reset in 213 ms.
Product exploration explored 100000 steps with 19617 reset in 233 ms.
Built C files in :
/tmp/ltsmin11181883766449966060
[2024-06-02 22:51:32] [INFO ] Computing symmetric may disable matrix : 61 transitions.
[2024-06-02 22:51:32] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:51:32] [INFO ] Computing symmetric may enable matrix : 61 transitions.
[2024-06-02 22:51:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:51:32] [INFO ] Computing Do-Not-Accords matrix : 61 transitions.
[2024-06-02 22:51:32] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 22:51:32] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11181883766449966060
Running compilation step : cd /tmp/ltsmin11181883766449966060;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 690 ms.
Running link step : cd /tmp/ltsmin11181883766449966060;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 74 ms.
Running LTSmin : cd /tmp/ltsmin11181883766449966060;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4281445932803840949.hoa' '--buchi-type=spotba'
LTSmin run took 446 ms.
FORMULA MedleyA-PT-13-LTLCardinality-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property MedleyA-PT-13-LTLCardinality-10 finished in 6392 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(X(X(G(p0)))))))))'
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 147/147 places, 140/140 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 143 transition count 136
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 143 transition count 136
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 11 place count 140 transition count 133
Iterating global reduction 0 with 3 rules applied. Total rules applied 14 place count 140 transition count 133
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 139 transition count 132
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 139 transition count 132
Applied a total of 16 rules in 17 ms. Remains 139 /147 variables (removed 8) and now considering 132/140 (removed 8) transitions.
// Phase 1: matrix 132 rows 139 cols
[2024-06-02 22:51:34] [INFO ] Computed 14 invariants in 2 ms
[2024-06-02 22:51:34] [INFO ] Implicit Places using invariants in 118 ms returned []
[2024-06-02 22:51:34] [INFO ] Invariant cache hit.
[2024-06-02 22:51:34] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
Running 131 sub problems to find dead transitions.
[2024-06-02 22:51:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/138 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 22:51:37] [INFO ] Deduced a trap composed of 33 places in 73 ms of which 3 ms to minimize.
[2024-06-02 22:51:37] [INFO ] Deduced a trap composed of 15 places in 43 ms of which 2 ms to minimize.
[2024-06-02 22:51:37] [INFO ] Deduced a trap composed of 22 places in 100 ms of which 4 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/271 variables, 139/156 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 8 (OVERLAPS) 0/271 variables, 0/156 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 156 constraints, problems are : Problem set: 0 solved, 131 unsolved in 7973 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 139/139 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/138 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/138 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 2 (OVERLAPS) 1/139 variables, 9/11 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/139 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/139 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/139 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 6 (OVERLAPS) 132/271 variables, 139/156 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 131/287 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 22:51:45] [INFO ] Deduced a trap composed of 22 places in 101 ms of which 3 ms to minimize.
[2024-06-02 22:51:45] [INFO ] Deduced a trap composed of 75 places in 119 ms of which 2 ms to minimize.
[2024-06-02 22:51:46] [INFO ] Deduced a trap composed of 30 places in 65 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/271 variables, 3/290 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 22:51:48] [INFO ] Deduced a trap composed of 71 places in 90 ms of which 3 ms to minimize.
[2024-06-02 22:51:48] [INFO ] Deduced a trap composed of 44 places in 89 ms of which 3 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/271 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 22:51:50] [INFO ] Deduced a trap composed of 75 places in 59 ms of which 1 ms to minimize.
[2024-06-02 22:51:50] [INFO ] Deduced a trap composed of 43 places in 62 ms of which 1 ms to minimize.
[2024-06-02 22:51:51] [INFO ] Deduced a trap composed of 69 places in 89 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/271 variables, 3/295 constraints. Problems are: Problem set: 0 solved, 131 unsolved
[2024-06-02 22:51:53] [INFO ] Deduced a trap composed of 77 places in 76 ms of which 2 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/271 variables, 1/296 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/271 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 131 unsolved
At refinement iteration 13 (OVERLAPS) 0/271 variables, 0/296 constraints. Problems are: Problem set: 0 solved, 131 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 296 constraints, problems are : Problem set: 0 solved, 131 unsolved in 15929 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 139/139 constraints, PredecessorRefiner: 131/131 constraints, Known Traps: 12/12 constraints]
After SMT, in 23943ms problems are : Problem set: 0 solved, 131 unsolved
Search for dead transitions found 0 dead transitions in 23948ms
Starting structural reductions in LTL mode, iteration 1 : 139/147 places, 132/140 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 24324 ms. Remains : 139/147 places, 132/140 transitions.
Stuttering acceptance computed with spot in 366 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : MedleyA-PT-13-LTLCardinality-13
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 1 ms.
FORMULA MedleyA-PT-13-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-13-LTLCardinality-13 finished in 24712 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 147 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 147/147 places, 140/140 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 33 transitions
Trivial Post-agglo rules discarded 33 transitions
Performed 33 trivial Post agglomeration. Transition count delta: 33
Iterating post reduction 0 with 33 rules applied. Total rules applied 33 place count 146 transition count 106
Reduce places removed 33 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 35 rules applied. Total rules applied 68 place count 113 transition count 104
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 69 place count 112 transition count 104
Performed 30 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 30 Pre rules applied. Total rules applied 69 place count 112 transition count 74
Deduced a syphon composed of 30 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 31 places and 0 transitions.
Iterating global reduction 3 with 61 rules applied. Total rules applied 130 place count 81 transition count 74
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 132 place count 80 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 133 place count 79 transition count 73
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 134 place count 78 transition count 72
Iterating global reduction 5 with 1 rules applied. Total rules applied 135 place count 78 transition count 72
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 136 place count 77 transition count 71
Iterating global reduction 5 with 1 rules applied. Total rules applied 137 place count 77 transition count 71
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 185 place count 53 transition count 47
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 201 place count 45 transition count 63
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 202 place count 45 transition count 62
Applied a total of 202 rules in 23 ms. Remains 45 /147 variables (removed 102) and now considering 62/140 (removed 78) transitions.
// Phase 1: matrix 62 rows 45 cols
[2024-06-02 22:51:58] [INFO ] Computed 12 invariants in 2 ms
[2024-06-02 22:51:59] [INFO ] Implicit Places using invariants in 99 ms returned [0, 10, 17, 25]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 101 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 41/147 places, 62/140 transitions.
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 4 Pre rules applied. Total rules applied 0 place count 41 transition count 58
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 37 transition count 58
Applied a total of 8 rules in 3 ms. Remains 37 /41 variables (removed 4) and now considering 58/62 (removed 4) transitions.
// Phase 1: matrix 58 rows 37 cols
[2024-06-02 22:51:59] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 22:51:59] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-06-02 22:51:59] [INFO ] Invariant cache hit.
[2024-06-02 22:51:59] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-06-02 22:51:59] [INFO ] Implicit Places using invariants and state equation in 68 ms returned []
Implicit Place search using SMT with State Equation took 128 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 37/147 places, 58/140 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 255 ms. Remains : 37/147 places, 58/140 transitions.
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Running random walk in product with property : MedleyA-PT-13-LTLCardinality-15
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA MedleyA-PT-13-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property MedleyA-PT-13-LTLCardinality-15 finished in 324 ms.
All properties solved by simple procedures.
Total runtime 55897 ms.
BK_STOP 1717368719275
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
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-13"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
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 itstools"
echo " Input is MedleyA-PT-13, 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 r576-smll-171734920000099"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/MedleyA-PT-13.tgz
mv MedleyA-PT-13 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 '
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 ;