About the Execution of LTSMin+red for PolyORBLF-COL-S06J06T06
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
5608.327 | 1300112.00 | 1522046.00 | 355.30 | FFTFFFFTFFTFFTFF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/mnt/tpsp/fkordon/mcc2024-input.r516-tajo-171654446600203.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2024-input.qcow2' backing_fmt='qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
.......................
=====================================================================
Generated by BenchKit 2-5568
Executing tool ltsminxred
Input is PolyORBLF-COL-S06J06T06, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r516-tajo-171654446600203
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 544K
-rw-r--r-- 1 mcc users 6.5K Apr 11 17:20 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Apr 11 17:20 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Apr 11 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Apr 11 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:43 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 18 16:43 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Apr 23 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 22K Apr 23 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Apr 23 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Apr 11 17:52 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K Apr 11 17:52 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 11 17:48 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 86K Apr 11 17:48 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 18 16:43 equiv_pt
-rw-r--r-- 1 mcc users 10 May 18 16:43 instance
-rw-r--r-- 1 mcc users 5 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 154K May 18 16:43 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLCardinality-00
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLCardinality-01
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLCardinality-02
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLCardinality-03
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLCardinality-04
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLCardinality-05
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLCardinality-06
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLCardinality-07
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLCardinality-08
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLCardinality-09
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLCardinality-10
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLCardinality-11
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLCardinality-12
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLCardinality-13
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLCardinality-14
FORMULA_NAME PolyORBLF-COL-S06J06T06-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1717251409786
Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=PolyORBLF-COL-S06J06T06
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 14:16:51] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-06-01 14:16:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 14:16:51] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2024-06-01 14:16:51] [WARNING] Using fallBack plugin, rng conformance not checked
[2024-06-01 14:16:51] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 673 ms
[2024-06-01 14:16:51] [INFO ] Imported 81 HL places and 65 HL transitions for a total of 700 PT places and 10800.0 transition bindings in 25 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2024-06-01 14:16:52] [INFO ] Built PT skeleton of HLPN with 81 places and 65 transitions 254 arcs in 12 ms.
[2024-06-01 14:16:52] [INFO ] Skeletonized 16 HLPN properties in 3 ms.
Initial state reduction rules removed 1 formulas.
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Remains 15 properties that can be checked using skeleton over-approximation.
Computed a total of 0 stabilizing places and 0 stable transitions
RANDOM walk for 40001 steps (3869 resets) in 1861 ms. (21 steps per ms) remains 10/24 properties
BEST_FIRST walk for 40000 steps (77 resets) in 631 ms. (63 steps per ms) remains 7/10 properties
BEST_FIRST walk for 40003 steps (126 resets) in 347 ms. (114 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (70 resets) in 175 ms. (227 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (72 resets) in 273 ms. (145 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (71 resets) in 166 ms. (239 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (78 resets) in 178 ms. (223 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (85 resets) in 198 ms. (201 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (34 resets) in 179 ms. (222 steps per ms) remains 7/7 properties
[2024-06-01 14:16:53] [INFO ] Flow matrix only has 64 transitions (discarded 1 similar events)
// Phase 1: matrix 64 rows 81 cols
[2024-06-01 14:16:53] [INFO ] Computed 26 invariants in 13 ms
[2024-06-01 14:16:53] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp21 is UNSAT
At refinement iteration 1 (OVERLAPS) 40/50 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 4/54 variables, 3/10 constraints. Problems are: Problem set: 2 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 2 solved, 5 unsolved
Problem AtomicPropp4 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp18 is UNSAT
At refinement iteration 5 (OVERLAPS) 21/75 variables, 12/22 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/75 variables, 0/22 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 5/80 variables, 3/25 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 0/25 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/81 variables, 1/26 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/81 variables, 0/26 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 64/145 variables, 81/107 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/145 variables, 8/115 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/145 variables, 0/115 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/145 variables, 0/115 constraints. Problems are: Problem set: 6 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 145/145 variables, and 115 constraints, problems are : Problem set: 6 solved, 1 unsolved in 263 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 13/15 variables, 2/2 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/2 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 9/24 variables, 2/4 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 23/47 variables, 3/7 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/7 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/50 variables, 2/9 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 23/73 variables, 12/21 constraints. Problems are: Problem set: 6 solved, 1 unsolved
[2024-06-01 14:16:53] [INFO ] Deduced a trap composed of 29 places in 56 ms of which 9 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 1/22 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/73 variables, 0/22 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 5/78 variables, 3/25 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/78 variables, 0/25 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/79 variables, 1/26 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/79 variables, 0/26 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 64/143 variables, 79/105 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/143 variables, 8/113 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/143 variables, 1/114 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/143 variables, 0/114 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/145 variables, 2/116 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/145 variables, 1/117 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/145 variables, 0/117 constraints. Problems are: Problem set: 6 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/145 variables, 0/117 constraints. Problems are: Problem set: 6 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 145/145 variables, and 117 constraints, problems are : Problem set: 6 solved, 1 unsolved in 324 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 81/81 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/7 constraints, Known Traps: 1/1 constraints]
After SMT, in 634ms problems are : Problem set: 6 solved, 1 unsolved
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 65/65 transitions.
Ensure Unique test removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 80 transition count 56
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 19 place count 71 transition count 56
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 19 place count 71 transition count 53
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 25 place count 68 transition count 53
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 39 place count 61 transition count 46
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 41 place count 61 transition count 44
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 43 place count 59 transition count 44
Applied a total of 43 rules in 52 ms. Remains 59 /81 variables (removed 22) and now considering 44/65 (removed 21) transitions.
Running 43 sub problems to find dead transitions.
[2024-06-01 14:16:54] [INFO ] Flow matrix only has 43 transitions (discarded 1 similar events)
// Phase 1: matrix 43 rows 59 cols
[2024-06-01 14:16:54] [INFO ] Computed 25 invariants in 3 ms
[2024-06-01 14:16:54] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-06-01 14:16:54] [INFO ] Deduced a trap composed of 17 places in 30 ms of which 2 ms to minimize.
[2024-06-01 14:16:54] [INFO ] Deduced a trap composed of 13 places in 27 ms of which 0 ms to minimize.
[2024-06-01 14:16:54] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 1 ms to minimize.
[2024-06-01 14:16:54] [INFO ] Deduced a trap composed of 15 places in 24 ms of which 1 ms to minimize.
[2024-06-01 14:16:54] [INFO ] Deduced a trap composed of 15 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 1/59 variables, 1/30 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-06-01 14:16:54] [INFO ] Deduced a trap composed of 19 places in 34 ms of which 1 ms to minimize.
[2024-06-01 14:16:54] [INFO ] Deduced a trap composed of 18 places in 32 ms of which 1 ms to minimize.
[2024-06-01 14:16:54] [INFO ] Deduced a trap composed of 9 places in 20 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/59 variables, 3/33 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-06-01 14:16:55] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 1 ms to minimize.
[2024-06-01 14:16:55] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 43/102 variables, 59/94 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 8/102 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 11 (OVERLAPS) 0/102 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 102 constraints, problems are : Problem set: 0 solved, 43 unsolved in 1266 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 59/59 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/58 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/58 variables, 15/24 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 8/32 constraints. Problems are: Problem set: 0 solved, 43 unsolved
[2024-06-01 14:16:55] [INFO ] Deduced a trap composed of 14 places in 31 ms of which 1 ms to minimize.
[2024-06-01 14:16:55] [INFO ] Deduced a trap composed of 18 places in 39 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/58 variables, 2/34 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (OVERLAPS) 1/59 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/59 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/59 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 43/102 variables, 59/96 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 8/104 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/102 variables, 43/147 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/102 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 12 (OVERLAPS) 0/102 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 147 constraints, problems are : Problem set: 0 solved, 43 unsolved in 1758 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 59/59 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 12/12 constraints]
After SMT, in 3058ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 3060ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3136 ms. Remains : 59/81 places, 44/65 transitions.
RANDOM walk for 40007 steps (4359 resets) in 403 ms. (99 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (168 resets) in 90 ms. (439 steps per ms) remains 1/1 properties
Probably explored full state space saw : 314096 states, properties seen :0
Probabilistic random walk after 982379 steps, saw 314096 distinct states, run finished after 1631 ms. (steps per millisecond=602 ) properties seen :0
Explored full state space saw : 314118 states, properties seen :0
Exhaustive walk after 982446 steps, saw 314118 distinct states, run finished after 1450 ms. (steps per millisecond=677 ) properties seen :0
Successfully simplified 7 atomic propositions for a total of 15 simplifications.
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:17:00] [INFO ] Initial state reduction rules for LTL removed 3 formulas.
[2024-06-01 14:17:00] [INFO ] Flatten gal took : 79 ms
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2024-06-01 14:17:00] [INFO ] Flatten gal took : 23 ms
Transition GoPerformWork forces synchronizations/join behavior on parameter j of sort Jobs
Transition T_2315 forces synchronizations/join behavior on parameter t of sort Threads
Transition T_0376 forces synchronizations/join behavior on parameter s of sort Sources
[2024-06-01 14:17:01] [INFO ] Unfolded HLPN to a Petri net with 700 places and 10740 transitions 89778 arcs in 459 ms.
[2024-06-01 14:17:01] [INFO ] Unfolded 9 HLPN properties in 0 ms.
Ensure Unique test removed 8070 transitions
Reduce redundant transitions removed 8070 transitions.
Support contains 148 out of 700 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 700/700 places, 2670/2670 transitions.
Ensure Unique test removed 6 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 694 transition count 2670
Applied a total of 6 rules in 87 ms. Remains 694 /700 variables (removed 6) and now considering 2670/2670 (removed 0) transitions.
Running 2664 sub problems to find dead transitions.
[2024-06-01 14:17:01] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
// Phase 1: matrix 2634 rows 694 cols
[2024-06-01 14:17:01] [INFO ] Computed 52 invariants in 215 ms
[2024-06-01 14:17:01] [INFO ] State equation strengthened by 168 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/688 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2664 unsolved
SMT process timed out in 44611ms, After SMT, problems are : Problem set: 0 solved, 2664 unsolved
Search for dead transitions found 0 dead transitions in 44655ms
[2024-06-01 14:17:46] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
[2024-06-01 14:17:46] [INFO ] Invariant cache hit.
[2024-06-01 14:17:46] [INFO ] Implicit Places using invariants in 523 ms returned [546, 547, 548, 549, 550, 551]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 535 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 688/700 places, 2670/2670 transitions.
Applied a total of 0 rules in 25 ms. Remains 688 /688 variables (removed 0) and now considering 2670/2670 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 45319 ms. Remains : 688/700 places, 2670/2670 transitions.
Support contains 148 out of 688 places after structural reductions.
[2024-06-01 14:17:46] [INFO ] Flatten gal took : 220 ms
[2024-06-01 14:17:47] [INFO ] Flatten gal took : 161 ms
[2024-06-01 14:17:47] [INFO ] Input system was already deterministic with 2670 transitions.
RANDOM walk for 2738 steps (13 resets) in 116 ms. (23 steps per ms) remains 0/11 properties
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 7 out of 688 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 688 transition count 2616
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 634 transition count 2616
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 108 place count 634 transition count 2532
Deduced a syphon composed of 84 places in 3 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 276 place count 550 transition count 2532
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 282 place count 544 transition count 2526
Iterating global reduction 2 with 6 rules applied. Total rules applied 288 place count 544 transition count 2526
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 2 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 432 place count 472 transition count 2454
Applied a total of 432 rules in 186 ms. Remains 472 /688 variables (removed 216) and now considering 2454/2670 (removed 216) transitions.
Running 2448 sub problems to find dead transitions.
[2024-06-01 14:17:47] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
// Phase 1: matrix 2418 rows 472 cols
[2024-06-01 14:17:48] [INFO ] Computed 46 invariants in 83 ms
[2024-06-01 14:17:48] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-06-01 14:18:27] [INFO ] Deduced a trap composed of 58 places in 137 ms of which 3 ms to minimize.
[2024-06-01 14:18:27] [INFO ] Deduced a trap composed of 58 places in 118 ms of which 2 ms to minimize.
[2024-06-01 14:18:27] [INFO ] Deduced a trap composed of 58 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:18:27] [INFO ] Deduced a trap composed of 58 places in 62 ms of which 1 ms to minimize.
[2024-06-01 14:18:28] [INFO ] Deduced a trap composed of 58 places in 66 ms of which 1 ms to minimize.
[2024-06-01 14:18:28] [INFO ] Deduced a trap composed of 232 places in 496 ms of which 3 ms to minimize.
[2024-06-01 14:18:29] [INFO ] Deduced a trap composed of 216 places in 453 ms of which 2 ms to minimize.
[2024-06-01 14:18:29] [INFO ] Deduced a trap composed of 229 places in 574 ms of which 4 ms to minimize.
[2024-06-01 14:18:30] [INFO ] Deduced a trap composed of 212 places in 516 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/2890 variables, and 49 constraints, problems are : Problem set: 0 solved, 2448 unsolved in 20045 ms.
Refiners :[Positive P Invariants (semi-flows): 15/20 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2448/1194 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2448 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-06-01 14:18:33] [INFO ] Deduced a trap composed of 58 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:18:33] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 1 ms to minimize.
[2024-06-01 14:18:37] [INFO ] Deduced a trap composed of 216 places in 422 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/2890 variables, and 52 constraints, problems are : Problem set: 0 solved, 2448 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 15/20 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1194 constraints, Known Traps: 12/12 constraints]
After SMT, in 62905ms problems are : Problem set: 0 solved, 2448 unsolved
Search for dead transitions found 0 dead transitions in 62939ms
[2024-06-01 14:18:50] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-06-01 14:18:50] [INFO ] Invariant cache hit.
[2024-06-01 14:18:51] [INFO ] Implicit Places using invariants in 614 ms returned []
[2024-06-01 14:18:51] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-06-01 14:18:51] [INFO ] Invariant cache hit.
[2024-06-01 14:18:52] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 14:18:58] [INFO ] Implicit Places using invariants and state equation in 7516 ms returned []
Implicit Place search using SMT with State Equation took 8134 ms to find 0 implicit places.
[2024-06-01 14:18:59] [INFO ] Redundant transitions in 176 ms returned []
Running 2448 sub problems to find dead transitions.
[2024-06-01 14:18:59] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-06-01 14:18:59] [INFO ] Invariant cache hit.
[2024-06-01 14:18:59] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-06-01 14:19:38] [INFO ] Deduced a trap composed of 58 places in 168 ms of which 2 ms to minimize.
[2024-06-01 14:19:39] [INFO ] Deduced a trap composed of 58 places in 150 ms of which 2 ms to minimize.
[2024-06-01 14:19:39] [INFO ] Deduced a trap composed of 58 places in 100 ms of which 1 ms to minimize.
[2024-06-01 14:19:39] [INFO ] Deduced a trap composed of 58 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:19:39] [INFO ] Deduced a trap composed of 58 places in 64 ms of which 0 ms to minimize.
[2024-06-01 14:19:40] [INFO ] Deduced a trap composed of 240 places in 688 ms of which 6 ms to minimize.
[2024-06-01 14:19:40] [INFO ] Deduced a trap composed of 252 places in 518 ms of which 4 ms to minimize.
[2024-06-01 14:19:41] [INFO ] Deduced a trap composed of 212 places in 513 ms of which 3 ms to minimize.
[2024-06-01 14:19:41] [INFO ] Deduced a trap composed of 58 places in 73 ms of which 2 ms to minimize.
[2024-06-01 14:19:45] [INFO ] Deduced a trap composed of 216 places in 462 ms of which 7 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/2890 variables, and 50 constraints, problems are : Problem set: 0 solved, 2448 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 15/20 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2448/1194 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2448 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-06-01 14:20:01] [INFO ] Deduced a trap composed of 17 places in 193 ms of which 2 ms to minimize.
[2024-06-01 14:20:06] [INFO ] Deduced a trap composed of 15 places in 275 ms of which 2 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 8)
(s1 2)
(s2 0)
(s3 0)
(s4 1)
(s5 1)
(s6 1)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 0)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 0)
(s57 0)
(s58 0)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 0)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 0)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 9)
(s129 0)
(s130 1)
(s131 1)
(s132 0)
(s133 0)
(s134 1)
(s135 0)
(s136 1)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 1)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 0)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 0)
(s170 0)
(s171 0)
(s172 0)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 1)
(s192 0)
(s193 0)
(s194 0)
(s195 0)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 0)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 1)
(s239 0)
(s240 0)
(s241 0)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 0)
(s273 0)
(s274 0)
(s275 0)
(s276 1)
(s277 0)
(s278 1)
(s279 1)
(s280 0)
(s281 1)
(s282 1)
(s283 0)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 0)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 0)
(s302 0)
(s303 0)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 1)
(s336 0)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 1)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 0)
(s370 0)
(s371 6)
(s372 0)
(s373 1)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 0)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 1)
(s415 1)
(s416 0)
(s417 0)
(s418 0)
(s419 2)
(s420 0)
(s421 1)
(s422 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/2890 variables, and 52 constraints, problems are : Problem set: 0 solved, 2448 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 15/20 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1194 constraints, Known Traps: 12/12 constraints]
After SMT, in 81683ms problems are : Problem set: 0 solved, 2448 unsolved
Search for dead transitions found 0 dead transitions in 81724ms
Starting structural reductions in SI_LTL mode, iteration 1 : 472/688 places, 2454/2670 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 153188 ms. Remains : 472/688 places, 2454/2670 transitions.
Stuttering acceptance computed with spot in 215 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S06J06T06-LTLCardinality-00
Stuttering criterion allowed to conclude after 8 steps with 0 reset in 2 ms.
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J06T06-LTLCardinality-00 finished in 153464 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(X(X(p0))) U p1))'
Support contains 56 out of 688 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 682 transition count 2664
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 682 transition count 2664
Applied a total of 12 rules in 30 ms. Remains 682 /688 variables (removed 6) and now considering 2664/2670 (removed 6) transitions.
Running 2658 sub problems to find dead transitions.
[2024-06-01 14:20:21] [INFO ] Flow matrix only has 2628 transitions (discarded 36 similar events)
// Phase 1: matrix 2628 rows 682 cols
[2024-06-01 14:20:21] [INFO ] Computed 46 invariants in 52 ms
[2024-06-01 14:20:21] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/676 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2658 unsolved
SMT process timed out in 41505ms, After SMT, problems are : Problem set: 0 solved, 2658 unsolved
Search for dead transitions found 0 dead transitions in 41529ms
[2024-06-01 14:21:02] [INFO ] Flow matrix only has 2628 transitions (discarded 36 similar events)
[2024-06-01 14:21:02] [INFO ] Invariant cache hit.
[2024-06-01 14:21:03] [INFO ] Implicit Places using invariants in 561 ms returned []
[2024-06-01 14:21:03] [INFO ] Flow matrix only has 2628 transitions (discarded 36 similar events)
[2024-06-01 14:21:03] [INFO ] Invariant cache hit.
[2024-06-01 14:21:04] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 14:21:15] [INFO ] Implicit Places using invariants and state equation in 12407 ms returned []
Implicit Place search using SMT with State Equation took 12986 ms to find 0 implicit places.
Running 2658 sub problems to find dead transitions.
[2024-06-01 14:21:15] [INFO ] Flow matrix only has 2628 transitions (discarded 36 similar events)
[2024-06-01 14:21:15] [INFO ] Invariant cache hit.
[2024-06-01 14:21:15] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/676 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2658 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/676 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 2658 unsolved
[2024-06-01 14:21:59] [INFO ] Deduced a trap composed of 93 places in 94 ms of which 1 ms to minimize.
[2024-06-01 14:21:59] [INFO ] Deduced a trap composed of 93 places in 85 ms of which 1 ms to minimize.
[2024-06-01 14:21:59] [INFO ] Deduced a trap composed of 93 places in 92 ms of which 2 ms to minimize.
[2024-06-01 14:21:59] [INFO ] Deduced a trap composed of 93 places in 89 ms of which 1 ms to minimize.
[2024-06-01 14:21:59] [INFO ] Deduced a trap composed of 93 places in 65 ms of which 1 ms to minimize.
[2024-06-01 14:22:00] [INFO ] Deduced a trap composed of 471 places in 483 ms of which 10 ms to minimize.
[2024-06-01 14:22:00] [INFO ] Deduced a trap composed of 403 places in 616 ms of which 4 ms to minimize.
[2024-06-01 14:22:01] [INFO ] Deduced a trap composed of 422 places in 587 ms of which 3 ms to minimize.
[2024-06-01 14:22:02] [INFO ] Deduced a trap composed of 384 places in 522 ms of which 5 ms to minimize.
[2024-06-01 14:22:02] [INFO ] Deduced a trap composed of 358 places in 456 ms of which 3 ms to minimize.
[2024-06-01 14:22:02] [INFO ] Deduced a trap composed of 93 places in 71 ms of which 1 ms to minimize.
[2024-06-01 14:22:04] [INFO ] Deduced a trap composed of 332 places in 514 ms of which 3 ms to minimize.
[2024-06-01 14:22:05] [INFO ] Deduced a trap composed of 379 places in 668 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 676/3310 variables, and 53 constraints, problems are : Problem set: 0 solved, 2658 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 18/22 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/682 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2658/1404 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2658 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/676 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 2658 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/676 variables, 22/40 constraints. Problems are: Problem set: 0 solved, 2658 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/676 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 2658 unsolved
[2024-06-01 14:22:09] [INFO ] Deduced a trap composed of 158 places in 467 ms of which 6 ms to minimize.
[2024-06-01 14:22:10] [INFO ] Deduced a trap composed of 161 places in 467 ms of which 3 ms to minimize.
[2024-06-01 14:22:13] [INFO ] Deduced a trap composed of 431 places in 612 ms of which 4 ms to minimize.
[2024-06-01 14:22:14] [INFO ] Deduced a trap composed of 471 places in 622 ms of which 4 ms to minimize.
[2024-06-01 14:22:15] [INFO ] Deduced a trap composed of 410 places in 620 ms of which 4 ms to minimize.
[2024-06-01 14:22:15] [INFO ] Deduced a trap composed of 477 places in 582 ms of which 4 ms to minimize.
[2024-06-01 14:22:16] [INFO ] Deduced a trap composed of 412 places in 590 ms of which 10 ms to minimize.
[2024-06-01 14:22:17] [INFO ] Deduced a trap composed of 398 places in 642 ms of which 4 ms to minimize.
[2024-06-01 14:22:17] [INFO ] Deduced a trap composed of 403 places in 677 ms of which 4 ms to minimize.
[2024-06-01 14:22:18] [INFO ] Deduced a trap composed of 213 places in 543 ms of which 3 ms to minimize.
[2024-06-01 14:22:19] [INFO ] Deduced a trap composed of 133 places in 547 ms of which 4 ms to minimize.
[2024-06-01 14:22:19] [INFO ] Deduced a trap composed of 46 places in 547 ms of which 4 ms to minimize.
[2024-06-01 14:22:20] [INFO ] Deduced a trap composed of 114 places in 551 ms of which 5 ms to minimize.
[2024-06-01 14:22:21] [INFO ] Deduced a trap composed of 15 places in 651 ms of which 5 ms to minimize.
[2024-06-01 14:22:22] [INFO ] Deduced a trap composed of 41 places in 682 ms of which 5 ms to minimize.
[2024-06-01 14:22:23] [INFO ] Deduced a trap composed of 344 places in 491 ms of which 3 ms to minimize.
[2024-06-01 14:22:33] [INFO ] Deduced a trap composed of 363 places in 637 ms of which 5 ms to minimize.
[2024-06-01 14:22:33] [INFO ] Deduced a trap composed of 338 places in 582 ms of which 5 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 676/3310 variables, and 71 constraints, problems are : Problem set: 0 solved, 2658 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 18/22 constraints, Generalized P Invariants (flows): 22/24 constraints, State Equation: 0/682 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1404 constraints, Known Traps: 31/31 constraints]
After SMT, in 80499ms problems are : Problem set: 0 solved, 2658 unsolved
Search for dead transitions found 0 dead transitions in 80524ms
Starting structural reductions in LTL mode, iteration 1 : 682/688 places, 2664/2670 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 135081 ms. Remains : 682/688 places, 2664/2670 transitions.
Stuttering acceptance computed with spot in 213 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : PolyORBLF-COL-S06J06T06-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 2473 steps with 12 reset in 54 ms.
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J06T06-LTLCardinality-01 finished in 135373 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)&&p0)))'
Support contains 20 out of 688 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 682 transition count 2664
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 682 transition count 2664
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 676 transition count 2658
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 676 transition count 2658
Applied a total of 24 rules in 60 ms. Remains 676 /688 variables (removed 12) and now considering 2658/2670 (removed 12) transitions.
Running 2652 sub problems to find dead transitions.
[2024-06-01 14:22:36] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
// Phase 1: matrix 2622 rows 676 cols
[2024-06-01 14:22:36] [INFO ] Computed 46 invariants in 123 ms
[2024-06-01 14:22:36] [INFO ] State equation strengthened by 168 read => feed constraints.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
SMT process timed out in 39770ms, After SMT, problems are : Problem set: 0 solved, 2652 unsolved
Search for dead transitions found 0 dead transitions in 39814ms
[2024-06-01 14:23:16] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-06-01 14:23:16] [INFO ] Invariant cache hit.
[2024-06-01 14:23:17] [INFO ] Implicit Places using invariants in 644 ms returned []
[2024-06-01 14:23:17] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-06-01 14:23:17] [INFO ] Invariant cache hit.
[2024-06-01 14:23:17] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 14:23:29] [INFO ] Implicit Places using invariants and state equation in 12746 ms returned []
Implicit Place search using SMT with State Equation took 13395 ms to find 0 implicit places.
Running 2652 sub problems to find dead transitions.
[2024-06-01 14:23:29] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-06-01 14:23:29] [INFO ] Invariant cache hit.
[2024-06-01 14:23:29] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
[2024-06-01 14:24:18] [INFO ] Deduced a trap composed of 93 places in 177 ms of which 2 ms to minimize.
[2024-06-01 14:24:18] [INFO ] Deduced a trap composed of 92 places in 114 ms of which 1 ms to minimize.
[2024-06-01 14:24:18] [INFO ] Deduced a trap composed of 92 places in 138 ms of which 2 ms to minimize.
[2024-06-01 14:24:18] [INFO ] Deduced a trap composed of 92 places in 112 ms of which 2 ms to minimize.
[2024-06-01 14:24:18] [INFO ] Deduced a trap composed of 92 places in 104 ms of which 1 ms to minimize.
[2024-06-01 14:24:19] [INFO ] Deduced a trap composed of 393 places in 596 ms of which 5 ms to minimize.
[2024-06-01 14:24:20] [INFO ] Deduced a trap composed of 407 places in 555 ms of which 5 ms to minimize.
[2024-06-01 14:24:21] [INFO ] Deduced a trap composed of 370 places in 522 ms of which 5 ms to minimize.
[2024-06-01 14:24:21] [INFO ] Deduced a trap composed of 163 places in 649 ms of which 4 ms to minimize.
[2024-06-01 14:24:22] [INFO ] Deduced a trap composed of 157 places in 493 ms of which 3 ms to minimize.
[2024-06-01 14:24:22] [INFO ] Deduced a trap composed of 92 places in 93 ms of which 2 ms to minimize.
[2024-06-01 14:24:24] [INFO ] Deduced a trap composed of 325 places in 642 ms of which 5 ms to minimize.
SMT process timed out in 54955ms, After SMT, problems are : Problem set: 0 solved, 2652 unsolved
Search for dead transitions found 0 dead transitions in 54995ms
Starting structural reductions in LTL mode, iteration 1 : 676/688 places, 2658/2670 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 108285 ms. Remains : 676/688 places, 2658/2670 transitions.
Stuttering acceptance computed with spot in 150 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : PolyORBLF-COL-S06J06T06-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J06T06-LTLCardinality-03 finished in 108462 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(F(p0)))))'
Support contains 43 out of 688 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Applied a total of 0 rules in 20 ms. Remains 688 /688 variables (removed 0) and now considering 2670/2670 (removed 0) transitions.
Running 2664 sub problems to find dead transitions.
[2024-06-01 14:24:25] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
// Phase 1: matrix 2634 rows 688 cols
[2024-06-01 14:24:25] [INFO ] Computed 46 invariants in 99 ms
[2024-06-01 14:24:25] [INFO ] State equation strengthened by 168 read => feed constraints.
Error getting values : (error "ParserException while parsing response: ((s0 10.0)
(s1 0.0)
(s2 1.0)
(s3 1.0)
(s4 1.0)
(s5 1.0)
(s6 1.0)
(s7 1.0)
(s8 1.0)
(s9 1.0)
(s10 1.0)
(s11 0.0)
(s12 1.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 10.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 0.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 0.0)
(s231 1.0)
(s232 1.0)
(s233 0.0)
(s234 1.0)
(s235 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/682 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2664 unsolved
SMT process timed out in 40735ms, After SMT, problems are : Problem set: 0 solved, 2664 unsolved
Search for dead transitions found 0 dead transitions in 40766ms
[2024-06-01 14:25:05] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
[2024-06-01 14:25:05] [INFO ] Invariant cache hit.
[2024-06-01 14:25:06] [INFO ] Implicit Places using invariants in 585 ms returned []
[2024-06-01 14:25:06] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
[2024-06-01 14:25:06] [INFO ] Invariant cache hit.
[2024-06-01 14:25:07] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 14:25:21] [INFO ] Implicit Places using invariants and state equation in 15141 ms returned []
Implicit Place search using SMT with State Equation took 15728 ms to find 0 implicit places.
Running 2664 sub problems to find dead transitions.
[2024-06-01 14:25:21] [INFO ] Flow matrix only has 2634 transitions (discarded 36 similar events)
[2024-06-01 14:25:21] [INFO ] Invariant cache hit.
[2024-06-01 14:25:21] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/682 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2664 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/682 variables, 23/39 constraints. Problems are: Problem set: 0 solved, 2664 unsolved
[2024-06-01 14:26:06] [INFO ] Deduced a trap composed of 94 places in 166 ms of which 2 ms to minimize.
[2024-06-01 14:26:06] [INFO ] Deduced a trap composed of 94 places in 119 ms of which 1 ms to minimize.
[2024-06-01 14:26:06] [INFO ] Deduced a trap composed of 94 places in 116 ms of which 2 ms to minimize.
[2024-06-01 14:26:06] [INFO ] Deduced a trap composed of 94 places in 77 ms of which 1 ms to minimize.
[2024-06-01 14:26:06] [INFO ] Deduced a trap composed of 94 places in 98 ms of which 1 ms to minimize.
[2024-06-01 14:26:07] [INFO ] Deduced a trap composed of 392 places in 448 ms of which 4 ms to minimize.
[2024-06-01 14:26:08] [INFO ] Deduced a trap composed of 442 places in 519 ms of which 4 ms to minimize.
[2024-06-01 14:26:08] [INFO ] Deduced a trap composed of 400 places in 432 ms of which 4 ms to minimize.
[2024-06-01 14:26:09] [INFO ] Deduced a trap composed of 407 places in 460 ms of which 5 ms to minimize.
[2024-06-01 14:26:09] [INFO ] Deduced a trap composed of 165 places in 415 ms of which 4 ms to minimize.
[2024-06-01 14:26:10] [INFO ] Deduced a trap composed of 94 places in 96 ms of which 2 ms to minimize.
[2024-06-01 14:26:11] [INFO ] Deduced a trap composed of 361 places in 576 ms of which 6 ms to minimize.
SMT process timed out in 50355ms, After SMT, problems are : Problem set: 0 solved, 2664 unsolved
Search for dead transitions found 0 dead transitions in 50379ms
Finished structural reductions in LTL mode , in 1 iterations and 106904 ms. Remains : 688/688 places, 2670/2670 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S06J06T06-LTLCardinality-05
Stuttering criterion allowed to conclude after 36 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J06T06-LTLCardinality-05 finished in 107056 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 12 out of 688 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 48 place count 688 transition count 2622
Reduce places removed 48 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 54 rules applied. Total rules applied 102 place count 640 transition count 2616
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 108 place count 634 transition count 2616
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 108 place count 634 transition count 2532
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 3 with 168 rules applied. Total rules applied 276 place count 550 transition count 2532
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 282 place count 544 transition count 2526
Iterating global reduction 3 with 6 rules applied. Total rules applied 288 place count 544 transition count 2526
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 1 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 348 place count 514 transition count 2496
Applied a total of 348 rules in 115 ms. Remains 514 /688 variables (removed 174) and now considering 2496/2670 (removed 174) transitions.
Running 2490 sub problems to find dead transitions.
[2024-06-01 14:26:12] [INFO ] Flow matrix only has 2460 transitions (discarded 36 similar events)
// Phase 1: matrix 2460 rows 514 cols
[2024-06-01 14:26:12] [INFO ] Computed 46 invariants in 63 ms
[2024-06-01 14:26:12] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2490 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 2490 unsolved
[2024-06-01 14:26:49] [INFO ] Deduced a trap composed of 65 places in 119 ms of which 2 ms to minimize.
[2024-06-01 14:26:49] [INFO ] Deduced a trap composed of 65 places in 85 ms of which 1 ms to minimize.
[2024-06-01 14:26:49] [INFO ] Deduced a trap composed of 65 places in 58 ms of which 0 ms to minimize.
[2024-06-01 14:26:49] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:26:49] [INFO ] Deduced a trap composed of 65 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:26:50] [INFO ] Deduced a trap composed of 179 places in 339 ms of which 3 ms to minimize.
[2024-06-01 14:26:51] [INFO ] Deduced a trap composed of 297 places in 529 ms of which 4 ms to minimize.
[2024-06-01 14:26:51] [INFO ] Deduced a trap composed of 253 places in 440 ms of which 3 ms to minimize.
[2024-06-01 14:26:52] [INFO ] Deduced a trap composed of 237 places in 412 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/2974 variables, and 49 constraints, problems are : Problem set: 0 solved, 2490 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 17/20 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/514 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2490/1236 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2490 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2490 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 2490 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/508 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 2490 unsolved
[2024-06-01 14:26:55] [INFO ] Deduced a trap composed of 65 places in 48 ms of which 0 ms to minimize.
[2024-06-01 14:27:03] [INFO ] Deduced a trap composed of 15 places in 182 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 508/2974 variables, and 51 constraints, problems are : Problem set: 0 solved, 2490 unsolved in 20033 ms.
Refiners :[Positive P Invariants (semi-flows): 17/20 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/514 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1236 constraints, Known Traps: 11/11 constraints]
After SMT, in 60494ms problems are : Problem set: 0 solved, 2490 unsolved
Search for dead transitions found 0 dead transitions in 60518ms
[2024-06-01 14:27:12] [INFO ] Flow matrix only has 2460 transitions (discarded 36 similar events)
[2024-06-01 14:27:12] [INFO ] Invariant cache hit.
[2024-06-01 14:27:13] [INFO ] Implicit Places using invariants in 572 ms returned []
[2024-06-01 14:27:13] [INFO ] Flow matrix only has 2460 transitions (discarded 36 similar events)
[2024-06-01 14:27:13] [INFO ] Invariant cache hit.
[2024-06-01 14:27:14] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 14:27:22] [INFO ] Implicit Places using invariants and state equation in 9318 ms returned []
Implicit Place search using SMT with State Equation took 9905 ms to find 0 implicit places.
[2024-06-01 14:27:22] [INFO ] Redundant transitions in 151 ms returned []
Running 2490 sub problems to find dead transitions.
[2024-06-01 14:27:22] [INFO ] Flow matrix only has 2460 transitions (discarded 36 similar events)
[2024-06-01 14:27:22] [INFO ] Invariant cache hit.
[2024-06-01 14:27:22] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2490 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 2490 unsolved
[2024-06-01 14:27:58] [INFO ] Deduced a trap composed of 66 places in 151 ms of which 2 ms to minimize.
[2024-06-01 14:27:58] [INFO ] Deduced a trap composed of 65 places in 141 ms of which 2 ms to minimize.
[2024-06-01 14:27:58] [INFO ] Deduced a trap composed of 65 places in 66 ms of which 1 ms to minimize.
[2024-06-01 14:27:58] [INFO ] Deduced a trap composed of 65 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:27:59] [INFO ] Deduced a trap composed of 65 places in 64 ms of which 1 ms to minimize.
[2024-06-01 14:27:59] [INFO ] Deduced a trap composed of 163 places in 501 ms of which 4 ms to minimize.
[2024-06-01 14:28:00] [INFO ] Deduced a trap composed of 65 places in 75 ms of which 1 ms to minimize.
[2024-06-01 14:28:00] [INFO ] Deduced a trap composed of 281 places in 522 ms of which 3 ms to minimize.
[2024-06-01 14:28:01] [INFO ] Deduced a trap composed of 237 places in 523 ms of which 4 ms to minimize.
[2024-06-01 14:28:02] [INFO ] Deduced a trap composed of 248 places in 523 ms of which 3 ms to minimize.
[2024-06-01 14:28:02] [INFO ] Deduced a trap composed of 270 places in 599 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 508/2974 variables, and 51 constraints, problems are : Problem set: 0 solved, 2490 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 17/20 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/514 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2490/1236 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2490 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/508 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 2490 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/508 variables, 23/40 constraints. Problems are: Problem set: 0 solved, 2490 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/508 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 2490 unsolved
[2024-06-01 14:28:18] [INFO ] Deduced a trap composed of 15 places in 212 ms of which 2 ms to minimize.
[2024-06-01 14:28:27] [INFO ] Deduced a trap composed of 29 places in 462 ms of which 4 ms to minimize.
[2024-06-01 14:28:27] [INFO ] Deduced a trap composed of 258 places in 508 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 508/2974 variables, and 54 constraints, problems are : Problem set: 0 solved, 2490 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 17/20 constraints, Generalized P Invariants (flows): 23/26 constraints, State Equation: 0/514 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1236 constraints, Known Traps: 14/14 constraints]
After SMT, in 79617ms problems are : Problem set: 0 solved, 2490 unsolved
Search for dead transitions found 0 dead transitions in 79640ms
Starting structural reductions in SI_LTL mode, iteration 1 : 514/688 places, 2496/2670 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 150349 ms. Remains : 514/688 places, 2496/2670 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S06J06T06-LTLCardinality-08
Stuttering criterion allowed to conclude after 144 steps with 3 reset in 1 ms.
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J06T06-LTLCardinality-08 finished in 150432 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 7 out of 688 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 54 place count 688 transition count 2616
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 108 place count 634 transition count 2616
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 84 Pre rules applied. Total rules applied 108 place count 634 transition count 2532
Deduced a syphon composed of 84 places in 1 ms
Reduce places removed 84 places and 0 transitions.
Iterating global reduction 2 with 168 rules applied. Total rules applied 276 place count 550 transition count 2532
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 282 place count 544 transition count 2526
Iterating global reduction 2 with 6 rules applied. Total rules applied 288 place count 544 transition count 2526
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 2 with 144 rules applied. Total rules applied 432 place count 472 transition count 2454
Applied a total of 432 rules in 105 ms. Remains 472 /688 variables (removed 216) and now considering 2454/2670 (removed 216) transitions.
Running 2448 sub problems to find dead transitions.
[2024-06-01 14:28:42] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
// Phase 1: matrix 2418 rows 472 cols
[2024-06-01 14:28:42] [INFO ] Computed 46 invariants in 32 ms
[2024-06-01 14:28:42] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-06-01 14:29:16] [INFO ] Deduced a trap composed of 58 places in 134 ms of which 2 ms to minimize.
[2024-06-01 14:29:16] [INFO ] Deduced a trap composed of 58 places in 102 ms of which 1 ms to minimize.
[2024-06-01 14:29:16] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:29:16] [INFO ] Deduced a trap composed of 58 places in 64 ms of which 0 ms to minimize.
[2024-06-01 14:29:17] [INFO ] Deduced a trap composed of 58 places in 81 ms of which 1 ms to minimize.
[2024-06-01 14:29:17] [INFO ] Deduced a trap composed of 232 places in 480 ms of which 3 ms to minimize.
[2024-06-01 14:29:18] [INFO ] Deduced a trap composed of 216 places in 559 ms of which 2 ms to minimize.
[2024-06-01 14:29:18] [INFO ] Deduced a trap composed of 229 places in 482 ms of which 3 ms to minimize.
[2024-06-01 14:29:19] [INFO ] Deduced a trap composed of 212 places in 477 ms of which 3 ms to minimize.
[2024-06-01 14:29:19] [INFO ] Deduced a trap composed of 58 places in 60 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/2890 variables, and 50 constraints, problems are : Problem set: 0 solved, 2448 unsolved in 20036 ms.
Refiners :[Positive P Invariants (semi-flows): 15/20 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2448/1194 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2448 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-06-01 14:29:25] [INFO ] Deduced a trap composed of 31 places in 398 ms of which 3 ms to minimize.
[2024-06-01 14:29:28] [INFO ] Deduced a trap composed of 216 places in 379 ms of which 2 ms to minimize.
[2024-06-01 14:29:28] [INFO ] Deduced a trap composed of 15 places in 126 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/2890 variables, and 53 constraints, problems are : Problem set: 0 solved, 2448 unsolved in 20027 ms.
Refiners :[Positive P Invariants (semi-flows): 15/20 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1194 constraints, Known Traps: 13/13 constraints]
After SMT, in 59286ms problems are : Problem set: 0 solved, 2448 unsolved
Search for dead transitions found 0 dead transitions in 59307ms
[2024-06-01 14:29:41] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-06-01 14:29:41] [INFO ] Invariant cache hit.
[2024-06-01 14:29:42] [INFO ] Implicit Places using invariants in 444 ms returned []
[2024-06-01 14:29:42] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-06-01 14:29:42] [INFO ] Invariant cache hit.
[2024-06-01 14:29:43] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 14:29:50] [INFO ] Implicit Places using invariants and state equation in 7959 ms returned []
Implicit Place search using SMT with State Equation took 8409 ms to find 0 implicit places.
[2024-06-01 14:29:50] [INFO ] Redundant transitions in 38 ms returned []
Running 2448 sub problems to find dead transitions.
[2024-06-01 14:29:50] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-06-01 14:29:50] [INFO ] Invariant cache hit.
[2024-06-01 14:29:50] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-06-01 14:30:26] [INFO ] Deduced a trap composed of 58 places in 157 ms of which 2 ms to minimize.
[2024-06-01 14:30:26] [INFO ] Deduced a trap composed of 58 places in 120 ms of which 1 ms to minimize.
[2024-06-01 14:30:26] [INFO ] Deduced a trap composed of 58 places in 84 ms of which 1 ms to minimize.
[2024-06-01 14:30:27] [INFO ] Deduced a trap composed of 58 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:30:27] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 1 ms to minimize.
[2024-06-01 14:30:27] [INFO ] Deduced a trap composed of 240 places in 510 ms of which 3 ms to minimize.
[2024-06-01 14:30:28] [INFO ] Deduced a trap composed of 252 places in 466 ms of which 2 ms to minimize.
[2024-06-01 14:30:28] [INFO ] Deduced a trap composed of 212 places in 461 ms of which 3 ms to minimize.
[2024-06-01 14:30:29] [INFO ] Deduced a trap composed of 58 places in 53 ms of which 1 ms to minimize.
[2024-06-01 14:30:31] [INFO ] Deduced a trap composed of 216 places in 493 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/2890 variables, and 50 constraints, problems are : Problem set: 0 solved, 2448 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 15/20 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2448/1194 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2448 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-06-01 14:30:50] [INFO ] Deduced a trap composed of 17 places in 128 ms of which 2 ms to minimize.
[2024-06-01 14:30:55] [INFO ] Deduced a trap composed of 15 places in 281 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/2890 variables, and 52 constraints, problems are : Problem set: 0 solved, 2448 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/20 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1194 constraints, Known Traps: 12/12 constraints]
After SMT, in 80245ms problems are : Problem set: 0 solved, 2448 unsolved
Search for dead transitions found 0 dead transitions in 80266ms
Starting structural reductions in SI_LTL mode, iteration 1 : 472/688 places, 2454/2670 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 148144 ms. Remains : 472/688 places, 2454/2670 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S06J06T06-LTLCardinality-09
Product exploration explored 100000 steps with 1002 reset in 598 ms.
Product exploration explored 100000 steps with 1028 reset in 603 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 126 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
RANDOM walk for 239 steps (6 resets) in 15 ms. (14 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 99 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 7 out of 472 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 472/472 places, 2454/2454 transitions.
Applied a total of 0 rules in 38 ms. Remains 472 /472 variables (removed 0) and now considering 2454/2454 (removed 0) transitions.
Running 2448 sub problems to find dead transitions.
[2024-06-01 14:31:12] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-06-01 14:31:12] [INFO ] Invariant cache hit.
[2024-06-01 14:31:12] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-06-01 14:31:48] [INFO ] Deduced a trap composed of 58 places in 111 ms of which 2 ms to minimize.
[2024-06-01 14:31:48] [INFO ] Deduced a trap composed of 58 places in 105 ms of which 6 ms to minimize.
[2024-06-01 14:31:48] [INFO ] Deduced a trap composed of 58 places in 88 ms of which 1 ms to minimize.
[2024-06-01 14:31:48] [INFO ] Deduced a trap composed of 58 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:31:48] [INFO ] Deduced a trap composed of 58 places in 58 ms of which 0 ms to minimize.
[2024-06-01 14:31:49] [INFO ] Deduced a trap composed of 240 places in 398 ms of which 3 ms to minimize.
[2024-06-01 14:31:49] [INFO ] Deduced a trap composed of 252 places in 400 ms of which 2 ms to minimize.
[2024-06-01 14:31:49] [INFO ] Deduced a trap composed of 212 places in 402 ms of which 2 ms to minimize.
[2024-06-01 14:31:50] [INFO ] Deduced a trap composed of 58 places in 66 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/2890 variables, and 49 constraints, problems are : Problem set: 0 solved, 2448 unsolved in 20034 ms.
Refiners :[Positive P Invariants (semi-flows): 15/20 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2448/1194 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2448 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 9/49 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-06-01 14:31:58] [INFO ] Deduced a trap composed of 70 places in 301 ms of which 1 ms to minimize.
[2024-06-01 14:32:00] [INFO ] Deduced a trap composed of 248 places in 358 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/2890 variables, and 51 constraints, problems are : Problem set: 0 solved, 2448 unsolved in 20030 ms.
Refiners :[Positive P Invariants (semi-flows): 15/20 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1194 constraints, Known Traps: 11/11 constraints]
After SMT, in 60608ms problems are : Problem set: 0 solved, 2448 unsolved
Search for dead transitions found 0 dead transitions in 60631ms
[2024-06-01 14:32:12] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-06-01 14:32:12] [INFO ] Invariant cache hit.
[2024-06-01 14:32:13] [INFO ] Implicit Places using invariants in 396 ms returned []
[2024-06-01 14:32:13] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-06-01 14:32:13] [INFO ] Invariant cache hit.
[2024-06-01 14:32:14] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 14:32:21] [INFO ] Implicit Places using invariants and state equation in 8053 ms returned []
Implicit Place search using SMT with State Equation took 8460 ms to find 0 implicit places.
[2024-06-01 14:32:21] [INFO ] Redundant transitions in 43 ms returned []
Running 2448 sub problems to find dead transitions.
[2024-06-01 14:32:21] [INFO ] Flow matrix only has 2418 transitions (discarded 36 similar events)
[2024-06-01 14:32:21] [INFO ] Invariant cache hit.
[2024-06-01 14:32:21] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-06-01 14:32:57] [INFO ] Deduced a trap composed of 58 places in 122 ms of which 2 ms to minimize.
[2024-06-01 14:32:57] [INFO ] Deduced a trap composed of 58 places in 112 ms of which 1 ms to minimize.
[2024-06-01 14:32:57] [INFO ] Deduced a trap composed of 58 places in 90 ms of which 1 ms to minimize.
[2024-06-01 14:32:57] [INFO ] Deduced a trap composed of 58 places in 75 ms of which 1 ms to minimize.
[2024-06-01 14:32:58] [INFO ] Deduced a trap composed of 58 places in 61 ms of which 1 ms to minimize.
[2024-06-01 14:32:58] [INFO ] Deduced a trap composed of 240 places in 573 ms of which 3 ms to minimize.
[2024-06-01 14:32:59] [INFO ] Deduced a trap composed of 252 places in 505 ms of which 2 ms to minimize.
[2024-06-01 14:32:59] [INFO ] Deduced a trap composed of 212 places in 494 ms of which 3 ms to minimize.
[2024-06-01 14:33:00] [INFO ] Deduced a trap composed of 58 places in 64 ms of which 0 ms to minimize.
[2024-06-01 14:33:03] [INFO ] Deduced a trap composed of 216 places in 441 ms of which 3 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/2890 variables, and 50 constraints, problems are : Problem set: 0 solved, 2448 unsolved in 30057 ms.
Refiners :[Positive P Invariants (semi-flows): 15/20 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2448/1194 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2448 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 25/40 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/466 variables, 10/50 constraints. Problems are: Problem set: 0 solved, 2448 unsolved
[2024-06-01 14:33:21] [INFO ] Deduced a trap composed of 17 places in 194 ms of which 2 ms to minimize.
[2024-06-01 14:33:25] [INFO ] Deduced a trap composed of 15 places in 273 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/2890 variables, and 52 constraints, problems are : Problem set: 0 solved, 2448 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/20 constraints, Generalized P Invariants (flows): 25/26 constraints, State Equation: 0/472 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1194 constraints, Known Traps: 12/12 constraints]
After SMT, in 80138ms problems are : Problem set: 0 solved, 2448 unsolved
Search for dead transitions found 0 dead transitions in 80161ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 149360 ms. Remains : 472/472 places, 2454/2454 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 291 steps (3 resets) in 7 ms. (36 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 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Product exploration explored 100000 steps with 1033 reset in 545 ms.
Stack based approach found an accepted trace after 17190 steps with 185 reset with depth 444 and stack size 444 in 96 ms.
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property PolyORBLF-COL-S06J06T06-LTLCardinality-09 finished in 300179 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(G(p0))))'
Support contains 2 out of 688 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 682 transition count 2664
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 682 transition count 2664
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 676 transition count 2658
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 676 transition count 2658
Applied a total of 24 rules in 39 ms. Remains 676 /688 variables (removed 12) and now considering 2658/2670 (removed 12) transitions.
Running 2652 sub problems to find dead transitions.
[2024-06-01 14:33:42] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
// Phase 1: matrix 2622 rows 676 cols
[2024-06-01 14:33:42] [INFO ] Computed 46 invariants in 71 ms
[2024-06-01 14:33:42] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
SMT process timed out in 39822ms, After SMT, problems are : Problem set: 0 solved, 2652 unsolved
Search for dead transitions found 0 dead transitions in 39846ms
[2024-06-01 14:34:22] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-06-01 14:34:22] [INFO ] Invariant cache hit.
[2024-06-01 14:34:23] [INFO ] Implicit Places using invariants in 569 ms returned []
[2024-06-01 14:34:23] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-06-01 14:34:23] [INFO ] Invariant cache hit.
[2024-06-01 14:34:23] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 14:34:35] [INFO ] Implicit Places using invariants and state equation in 12590 ms returned []
Implicit Place search using SMT with State Equation took 13173 ms to find 0 implicit places.
Running 2652 sub problems to find dead transitions.
[2024-06-01 14:34:35] [INFO ] Flow matrix only has 2622 transitions (discarded 36 similar events)
[2024-06-01 14:34:35] [INFO ] Invariant cache hit.
[2024-06-01 14:34:35] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
[2024-06-01 14:35:18] [INFO ] Deduced a trap composed of 93 places in 215 ms of which 2 ms to minimize.
[2024-06-01 14:35:18] [INFO ] Deduced a trap composed of 92 places in 154 ms of which 2 ms to minimize.
[2024-06-01 14:35:18] [INFO ] Deduced a trap composed of 92 places in 123 ms of which 2 ms to minimize.
[2024-06-01 14:35:18] [INFO ] Deduced a trap composed of 92 places in 81 ms of which 1 ms to minimize.
[2024-06-01 14:35:18] [INFO ] Deduced a trap composed of 92 places in 91 ms of which 1 ms to minimize.
[2024-06-01 14:35:19] [INFO ] Deduced a trap composed of 393 places in 473 ms of which 4 ms to minimize.
[2024-06-01 14:35:20] [INFO ] Deduced a trap composed of 407 places in 512 ms of which 3 ms to minimize.
[2024-06-01 14:35:20] [INFO ] Deduced a trap composed of 370 places in 463 ms of which 3 ms to minimize.
[2024-06-01 14:35:21] [INFO ] Deduced a trap composed of 163 places in 387 ms of which 4 ms to minimize.
[2024-06-01 14:35:21] [INFO ] Deduced a trap composed of 157 places in 436 ms of which 4 ms to minimize.
[2024-06-01 14:35:21] [INFO ] Deduced a trap composed of 92 places in 76 ms of which 1 ms to minimize.
[2024-06-01 14:35:23] [INFO ] Deduced a trap composed of 325 places in 509 ms of which 5 ms to minimize.
[2024-06-01 14:35:24] [INFO ] Deduced a trap composed of 369 places in 567 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 670/3298 variables, and 53 constraints, problems are : Problem set: 0 solved, 2652 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 16/19 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/676 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2652/1398 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2652 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/670 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/670 variables, 24/40 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/670 variables, 13/53 constraints. Problems are: Problem set: 0 solved, 2652 unsolved
[2024-06-01 14:35:32] [INFO ] Deduced a trap composed of 412 places in 670 ms of which 4 ms to minimize.
[2024-06-01 14:35:32] [INFO ] Deduced a trap composed of 15 places in 616 ms of which 4 ms to minimize.
[2024-06-01 14:35:33] [INFO ] Deduced a trap composed of 422 places in 641 ms of which 3 ms to minimize.
[2024-06-01 14:35:34] [INFO ] Deduced a trap composed of 426 places in 565 ms of which 4 ms to minimize.
[2024-06-01 14:35:34] [INFO ] Deduced a trap composed of 416 places in 577 ms of which 4 ms to minimize.
[2024-06-01 14:35:35] [INFO ] Deduced a trap composed of 400 places in 573 ms of which 3 ms to minimize.
[2024-06-01 14:35:36] [INFO ] Deduced a trap composed of 380 places in 607 ms of which 4 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 670/3298 variables, and 60 constraints, problems are : Problem set: 0 solved, 2652 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 16/19 constraints, Generalized P Invariants (flows): 24/27 constraints, State Equation: 0/676 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1398 constraints, Known Traps: 20/20 constraints]
After SMT, in 79408ms problems are : Problem set: 0 solved, 2652 unsolved
Search for dead transitions found 0 dead transitions in 79431ms
Starting structural reductions in LTL mode, iteration 1 : 676/688 places, 2658/2670 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 132499 ms. Remains : 676/688 places, 2658/2670 transitions.
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S06J06T06-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 18 steps with 0 reset in 0 ms.
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J06T06-LTLCardinality-12 finished in 132632 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 13 out of 688 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 688/688 places, 2670/2670 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 36 place count 688 transition count 2634
Reduce places removed 36 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 42 rules applied. Total rules applied 78 place count 652 transition count 2628
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 84 place count 646 transition count 2628
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 90 Pre rules applied. Total rules applied 84 place count 646 transition count 2538
Deduced a syphon composed of 90 places in 1 ms
Reduce places removed 90 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 264 place count 556 transition count 2538
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 270 place count 550 transition count 2532
Iterating global reduction 3 with 6 rules applied. Total rules applied 276 place count 550 transition count 2532
Performed 66 Post agglomeration using F-continuation condition.Transition count delta: 66
Deduced a syphon composed of 66 places in 1 ms
Reduce places removed 66 places and 0 transitions.
Iterating global reduction 3 with 132 rules applied. Total rules applied 408 place count 484 transition count 2466
Applied a total of 408 rules in 124 ms. Remains 484 /688 variables (removed 204) and now considering 2466/2670 (removed 204) transitions.
Running 2460 sub problems to find dead transitions.
[2024-06-01 14:35:55] [INFO ] Flow matrix only has 2430 transitions (discarded 36 similar events)
// Phase 1: matrix 2430 rows 484 cols
[2024-06-01 14:35:55] [INFO ] Computed 46 invariants in 37 ms
[2024-06-01 14:35:55] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 21/40 constraints. Problems are: Problem set: 0 solved, 2460 unsolved
[2024-06-01 14:36:33] [INFO ] Deduced a trap composed of 60 places in 135 ms of which 2 ms to minimize.
[2024-06-01 14:36:33] [INFO ] Deduced a trap composed of 60 places in 97 ms of which 1 ms to minimize.
[2024-06-01 14:36:33] [INFO ] Deduced a trap composed of 60 places in 69 ms of which 1 ms to minimize.
[2024-06-01 14:36:33] [INFO ] Deduced a trap composed of 60 places in 63 ms of which 1 ms to minimize.
[2024-06-01 14:36:33] [INFO ] Deduced a trap composed of 60 places in 57 ms of which 1 ms to minimize.
[2024-06-01 14:36:34] [INFO ] Deduced a trap composed of 219 places in 575 ms of which 3 ms to minimize.
[2024-06-01 14:36:34] [INFO ] Deduced a trap composed of 213 places in 580 ms of which 3 ms to minimize.
[2024-06-01 14:36:35] [INFO ] Deduced a trap composed of 60 places in 53 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/2914 variables, and 48 constraints, problems are : Problem set: 0 solved, 2460 unsolved in 20029 ms.
Refiners :[Positive P Invariants (semi-flows): 19/23 constraints, Generalized P Invariants (flows): 21/23 constraints, State Equation: 0/484 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2460/1206 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 21/40 constraints. Problems are: Problem set: 0 solved, 2460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 8/48 constraints. Problems are: Problem set: 0 solved, 2460 unsolved
[2024-06-01 14:36:39] [INFO ] Deduced a trap composed of 47 places in 305 ms of which 2 ms to minimize.
[2024-06-01 14:36:42] [INFO ] Deduced a trap composed of 228 places in 381 ms of which 2 ms to minimize.
[2024-06-01 14:36:44] [INFO ] Deduced a trap composed of 15 places in 129 ms of which 2 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/2914 variables, and 51 constraints, problems are : Problem set: 0 solved, 2460 unsolved in 20035 ms.
Refiners :[Positive P Invariants (semi-flows): 19/23 constraints, Generalized P Invariants (flows): 21/23 constraints, State Equation: 0/484 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1206 constraints, Known Traps: 11/11 constraints]
After SMT, in 59989ms problems are : Problem set: 0 solved, 2460 unsolved
Search for dead transitions found 0 dead transitions in 60010ms
[2024-06-01 14:36:55] [INFO ] Flow matrix only has 2430 transitions (discarded 36 similar events)
[2024-06-01 14:36:55] [INFO ] Invariant cache hit.
[2024-06-01 14:36:56] [INFO ] Implicit Places using invariants in 646 ms returned []
[2024-06-01 14:36:56] [INFO ] Flow matrix only has 2430 transitions (discarded 36 similar events)
[2024-06-01 14:36:56] [INFO ] Invariant cache hit.
[2024-06-01 14:36:57] [INFO ] State equation strengthened by 168 read => feed constraints.
[2024-06-01 14:37:08] [INFO ] Implicit Places using invariants and state equation in 12187 ms returned []
Implicit Place search using SMT with State Equation took 12834 ms to find 0 implicit places.
[2024-06-01 14:37:08] [INFO ] Redundant transitions in 94 ms returned []
Running 2460 sub problems to find dead transitions.
[2024-06-01 14:37:08] [INFO ] Flow matrix only has 2430 transitions (discarded 36 similar events)
[2024-06-01 14:37:08] [INFO ] Invariant cache hit.
[2024-06-01 14:37:08] [INFO ] State equation strengthened by 168 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 21/40 constraints. Problems are: Problem set: 0 solved, 2460 unsolved
[2024-06-01 14:37:45] [INFO ] Deduced a trap composed of 60 places in 139 ms of which 1 ms to minimize.
[2024-06-01 14:37:45] [INFO ] Deduced a trap composed of 60 places in 134 ms of which 1 ms to minimize.
[2024-06-01 14:37:45] [INFO ] Deduced a trap composed of 60 places in 92 ms of which 1 ms to minimize.
[2024-06-01 14:37:45] [INFO ] Deduced a trap composed of 60 places in 71 ms of which 1 ms to minimize.
[2024-06-01 14:37:45] [INFO ] Deduced a trap composed of 60 places in 59 ms of which 1 ms to minimize.
[2024-06-01 14:37:46] [INFO ] Deduced a trap composed of 250 places in 480 ms of which 3 ms to minimize.
[2024-06-01 14:37:47] [INFO ] Deduced a trap composed of 219 places in 482 ms of which 3 ms to minimize.
[2024-06-01 14:37:47] [INFO ] Deduced a trap composed of 241 places in 470 ms of which 3 ms to minimize.
[2024-06-01 14:37:49] [INFO ] Deduced a trap composed of 47 places in 299 ms of which 2 ms to minimize.
[2024-06-01 14:37:51] [INFO ] Deduced a trap composed of 228 places in 401 ms of which 2 ms to minimize.
[2024-06-01 14:37:52] [INFO ] Deduced a trap composed of 60 places in 78 ms of which 0 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 478/2914 variables, and 51 constraints, problems are : Problem set: 0 solved, 2460 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 19/23 constraints, Generalized P Invariants (flows): 21/23 constraints, State Equation: 0/484 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 2460/1206 constraints, Known Traps: 11/11 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/478 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 2460 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/478 variables, 21/40 constraints. Problems are: Problem set: 0 solved, 2460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/478 variables, 11/51 constraints. Problems are: Problem set: 0 solved, 2460 unsolved
[2024-06-01 14:38:07] [INFO ] Deduced a trap composed of 19 places in 150 ms of which 2 ms to minimize.
[2024-06-01 14:38:07] [INFO ] Deduced a trap composed of 15 places in 170 ms of which 1 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 478/2914 variables, and 53 constraints, problems are : Problem set: 0 solved, 2460 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 19/23 constraints, Generalized P Invariants (flows): 21/23 constraints, State Equation: 0/484 constraints, ReadFeed: 0/168 constraints, PredecessorRefiner: 1254/1206 constraints, Known Traps: 13/13 constraints]
After SMT, in 81342ms problems are : Problem set: 0 solved, 2460 unsolved
Search for dead transitions found 0 dead transitions in 81373ms
Starting structural reductions in SI_LTL mode, iteration 1 : 484/688 places, 2466/2670 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 154454 ms. Remains : 484/688 places, 2466/2670 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : PolyORBLF-COL-S06J06T06-LTLCardinality-14
Stuttering criterion allowed to conclude after 146 steps with 0 reset in 1 ms.
FORMULA PolyORBLF-COL-S06J06T06-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property PolyORBLF-COL-S06J06T06-LTLCardinality-14 finished in 154516 ms.
All properties solved by simple procedures.
Total runtime 1298728 ms.
ITS solved all properties within timeout
BK_STOP 1717252709898
--------------------
content from stderr:
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="PolyORBLF-COL-S06J06T06"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is PolyORBLF-COL-S06J06T06, 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 r516-tajo-171654446600203"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/PolyORBLF-COL-S06J06T06.tgz
mv PolyORBLF-COL-S06J06T06 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 ;