Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r135-tall-171631131300539.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool greatspnxred
Input is DoubleExponent-PT-003, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631131300539
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 7.7K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 88K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K Apr 12 03:15 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 200K Apr 12 03:15 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Apr 12 03:14 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 112K Apr 12 03:14 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:41 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:41 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 50K May 18 16:42 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 DoubleExponent-PT-003-LTLCardinality-00
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-01
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-02
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-03
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-04
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-05
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-06
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-07
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-08
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-09
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-10
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-11
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-12
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-13
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-14
FORMULA_NAME DoubleExponent-PT-003-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716375697126

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-003
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 11:01:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 11:01:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 11:01:38] [INFO ] Load time of PNML (sax parser for PT used): 59 ms
[2024-05-22 11:01:38] [INFO ] Transformed 163 places.
[2024-05-22 11:01:38] [INFO ] Transformed 148 transitions.
[2024-05-22 11:01:38] [INFO ] Parsed PT model containing 163 places and 148 transitions and 417 arcs in 153 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA DoubleExponent-PT-003-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-003-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 163 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 163/163 places, 148/148 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 160 transition count 148
Applied a total of 3 rules in 25 ms. Remains 160 /163 variables (removed 3) and now considering 148/148 (removed 0) transitions.
// Phase 1: matrix 148 rows 160 cols
[2024-05-22 11:01:38] [INFO ] Computed 17 invariants in 17 ms
[2024-05-22 11:01:38] [INFO ] Implicit Places using invariants in 250 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 284 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 159/163 places, 148/148 transitions.
Applied a total of 0 rules in 7 ms. Remains 159 /159 variables (removed 0) and now considering 148/148 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 336 ms. Remains : 159/163 places, 148/148 transitions.
Support contains 34 out of 159 places after structural reductions.
[2024-05-22 11:01:39] [INFO ] Flatten gal took : 41 ms
[2024-05-22 11:01:39] [INFO ] Flatten gal took : 13 ms
[2024-05-22 11:01:39] [INFO ] Input system was already deterministic with 148 transitions.
RANDOM walk for 40000 steps (1313 resets) in 2699 ms. (14 steps per ms) remains 16/25 properties
BEST_FIRST walk for 4000 steps (103 resets) in 151 ms. (26 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (114 resets) in 94 ms. (42 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (107 resets) in 58 ms. (67 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (111 resets) in 42 ms. (93 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (108 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (116 resets) in 40 ms. (97 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (114 resets) in 29 ms. (133 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (109 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (117 resets) in 25 ms. (153 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (111 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (117 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (105 resets) in 33 ms. (117 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (118 resets) in 20 ms. (190 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (115 resets) in 19 ms. (200 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4000 steps (110 resets) in 21 ms. (181 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4001 steps (114 resets) in 38 ms. (102 steps per ms) remains 16/16 properties
// Phase 1: matrix 148 rows 159 cols
[2024-05-22 11:01:40] [INFO ] Computed 16 invariants in 7 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp22 is UNSAT
At refinement iteration 1 (OVERLAPS) 65/87 variables, 3/3 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/87 variables, 1/4 constraints. Problems are: Problem set: 2 solved, 14 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/87 variables, 0/4 constraints. Problems are: Problem set: 2 solved, 14 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp24 is UNSAT
At refinement iteration 4 (OVERLAPS) 72/159 variables, 12/16 constraints. Problems are: Problem set: 4 solved, 12 unsolved
[2024-05-22 11:01:40] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 7 ms to minimize.
[2024-05-22 11:01:40] [INFO ] Deduced a trap composed of 21 places in 60 ms of which 2 ms to minimize.
[2024-05-22 11:01:40] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 2 ms to minimize.
[2024-05-22 11:01:40] [INFO ] Deduced a trap composed of 16 places in 51 ms of which 1 ms to minimize.
[2024-05-22 11:01:40] [INFO ] Deduced a trap composed of 31 places in 50 ms of which 1 ms to minimize.
[2024-05-22 11:01:40] [INFO ] Deduced a trap composed of 43 places in 53 ms of which 1 ms to minimize.
[2024-05-22 11:01:40] [INFO ] Deduced a trap composed of 42 places in 47 ms of which 1 ms to minimize.
[2024-05-22 11:01:40] [INFO ] Deduced a trap composed of 37 places in 37 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 8/24 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/159 variables, 0/24 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 7 (OVERLAPS) 148/307 variables, 159/183 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/307 variables, 0/183 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 9 (OVERLAPS) 0/307 variables, 0/183 constraints. Problems are: Problem set: 4 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Real declared 307/307 variables, and 183 constraints, problems are : Problem set: 4 solved, 12 unsolved in 1064 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 8/8 constraints]
Escalating to Integer solving :Problem set: 4 solved, 12 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 58/74 variables, 1/1 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 1/2 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/2 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 4 (OVERLAPS) 10/84 variables, 2/4 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 6 (OVERLAPS) 75/159 variables, 12/16 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/159 variables, 8/24 constraints. Problems are: Problem set: 4 solved, 12 unsolved
[2024-05-22 11:01:41] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
[2024-05-22 11:01:41] [INFO ] Deduced a trap composed of 75 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 2/26 constraints. Problems are: Problem set: 4 solved, 12 unsolved
[2024-05-22 11:01:41] [INFO ] Deduced a trap composed of 84 places in 50 ms of which 2 ms to minimize.
[2024-05-22 11:01:41] [INFO ] Deduced a trap composed of 64 places in 45 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/159 variables, 2/28 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 0/28 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 11 (OVERLAPS) 148/307 variables, 159/187 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/307 variables, 12/199 constraints. Problems are: Problem set: 4 solved, 12 unsolved
[2024-05-22 11:01:42] [INFO ] Deduced a trap composed of 60 places in 57 ms of which 2 ms to minimize.
[2024-05-22 11:01:42] [INFO ] Deduced a trap composed of 46 places in 52 ms of which 2 ms to minimize.
[2024-05-22 11:01:42] [INFO ] Deduced a trap composed of 29 places in 36 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/307 variables, 3/202 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/307 variables, 0/202 constraints. Problems are: Problem set: 4 solved, 12 unsolved
At refinement iteration 15 (OVERLAPS) 0/307 variables, 0/202 constraints. Problems are: Problem set: 4 solved, 12 unsolved
No progress, stopping.
After SMT solving in domain Int declared 307/307 variables, and 202 constraints, problems are : Problem set: 4 solved, 12 unsolved in 1421 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 159/159 constraints, PredecessorRefiner: 12/16 constraints, Known Traps: 15/15 constraints]
After SMT, in 2520ms problems are : Problem set: 4 solved, 12 unsolved
Fused 12 Parikh solutions to 9 different solutions.
Parikh walk visited 0 properties in 10212 ms.
Support contains 16 out of 159 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 159/159 places, 148/148 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 159 transition count 124
Reduce places removed 24 places and 0 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Iterating post reduction 1 with 28 rules applied. Total rules applied 52 place count 135 transition count 120
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 56 place count 131 transition count 120
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 56 place count 131 transition count 115
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 66 place count 126 transition count 115
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 3 with 46 rules applied. Total rules applied 112 place count 103 transition count 92
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 118 place count 100 transition count 92
Free-agglomeration rule (complex) applied 9 times.
Iterating global reduction 3 with 9 rules applied. Total rules applied 127 place count 100 transition count 83
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 136 place count 91 transition count 83
Partial Free-agglomeration rule applied 12 times.
Drop transitions (Partial Free agglomeration) removed 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 148 place count 91 transition count 83
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 149 place count 90 transition count 82
Applied a total of 149 rules in 56 ms. Remains 90 /159 variables (removed 69) and now considering 82/148 (removed 66) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 90/159 places, 82/148 transitions.
RANDOM walk for 40000 steps (3774 resets) in 644 ms. (62 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (2754 resets) in 193 ms. (206 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (2678 resets) in 188 ms. (211 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (2779 resets) in 191 ms. (208 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (2718 resets) in 186 ms. (213 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (2702 resets) in 148 ms. (268 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (2709 resets) in 173 ms. (229 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (2763 resets) in 91 ms. (434 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (2706 resets) in 82 ms. (481 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (2731 resets) in 84 ms. (470 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (2773 resets) in 83 ms. (476 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (2721 resets) in 78 ms. (506 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40002 steps (2752 resets) in 82 ms. (481 steps per ms) remains 12/12 properties
Interrupted probabilistic random walk after 1323655 steps, run timeout after 3001 ms. (steps per millisecond=441 ) properties seen :11 out of 12
Probabilistic random walk after 1323655 steps, saw 661872 distinct states, run finished after 3004 ms. (steps per millisecond=440 ) properties seen :11
// Phase 1: matrix 82 rows 90 cols
[2024-05-22 11:01:56] [INFO ] Computed 16 invariants in 4 ms
[2024-05-22 11:01:56] [INFO ] State equation strengthened by 8 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 44/85 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:01:56] [INFO ] Deduced a trap composed of 6 places in 36 ms of which 1 ms to minimize.
[2024-05-22 11:01:56] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 1 ms to minimize.
[2024-05-22 11:01:57] [INFO ] Deduced a trap composed of 15 places in 30 ms of which 0 ms to minimize.
[2024-05-22 11:01:57] [INFO ] Deduced a trap composed of 15 places in 29 ms of which 1 ms to minimize.
[2024-05-22 11:01:57] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-22 11:01:57] [INFO ] Deduced a trap composed of 11 places in 29 ms of which 1 ms to minimize.
[2024-05-22 11:01:57] [INFO ] Deduced a trap composed of 17 places in 27 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 1/86 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/86 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 82/168 variables, 86/107 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/168 variables, 8/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/172 variables, 4/119 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/172 variables, 2/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/172 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/172 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 172/172 variables, and 121 constraints, problems are : Problem set: 0 solved, 1 unsolved in 322 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 90/90 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 7/7 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 40/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 44/85 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:01:57] [INFO ] Deduced a trap composed of 17 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/85 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/86 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/86 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 82/168 variables, 86/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/168 variables, 8/116 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/168 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/168 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/172 variables, 4/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/172 variables, 2/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/172 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/172 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 172/172 variables, and 123 constraints, problems are : Problem set: 0 solved, 1 unsolved in 120 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 90/90 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 8/8 constraints]
After SMT, in 449ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 19 ms.
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 82/82 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 90 transition count 78
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 86 transition count 78
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 8 place count 86 transition count 76
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 84 transition count 76
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 26 place count 77 transition count 69
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
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 32 place count 74 transition count 69
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 2 with 4 rules applied. Total rules applied 36 place count 74 transition count 65
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 40 place count 70 transition count 65
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 3 with 2 rules applied. Total rules applied 42 place count 70 transition count 65
Applied a total of 42 rules in 19 ms. Remains 70 /90 variables (removed 20) and now considering 65/82 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 70/90 places, 65/82 transitions.
RANDOM walk for 40000 steps (5541 resets) in 129 ms. (307 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3475 resets) in 47 ms. (833 steps per ms) remains 1/1 properties
Probably explored full state space saw : 484596 states, properties seen :0
Probabilistic random walk after 969202 steps, saw 484596 distinct states, run finished after 1833 ms. (steps per millisecond=528 ) properties seen :0
Interrupted probabilistic random walk after 1548951 steps, run timeout after 3001 ms. (steps per millisecond=516 ) properties seen :0 out of 1
Exhaustive walk after 1548951 steps, saw 774563 distinct states, run finished after 3001 ms. (steps per millisecond=516 ) properties seen :0
// Phase 1: matrix 65 rows 70 cols
[2024-05-22 11:02:02] [INFO ] Computed 16 invariants in 5 ms
[2024-05-22 11:02:02] [INFO ] State equation strengthened by 14 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 45/63 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:02:02] [INFO ] Deduced a trap composed of 4 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 3/66 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/66 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 65/131 variables, 66/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/131 variables, 14/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/131 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 4/135 variables, 4/99 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/135 variables, 2/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/135 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/135 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 101 constraints, problems are : Problem set: 0 solved, 1 unsolved in 122 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 70/70 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 17/18 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/18 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 45/63 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 11:02:02] [INFO ] Deduced a trap composed of 6 places in 34 ms of which 1 ms to minimize.
[2024-05-22 11:02:02] [INFO ] Deduced a trap composed of 7 places in 22 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 3/66 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/66 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 65/131 variables, 66/83 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/131 variables, 14/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/131 variables, 1/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/131 variables, 0/98 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 4/135 variables, 4/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/135 variables, 2/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/135 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/135 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 104 constraints, problems are : Problem set: 0 solved, 1 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 70/70 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 276ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 21 ms.
Support contains 1 out of 70 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 65/65 transitions.
Applied a total of 0 rules in 14 ms. Remains 70 /70 variables (removed 0) and now considering 65/65 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 70/70 places, 65/65 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 70/70 places, 65/65 transitions.
Applied a total of 0 rules in 3 ms. Remains 70 /70 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2024-05-22 11:02:02] [INFO ] Invariant cache hit.
[2024-05-22 11:02:02] [INFO ] Implicit Places using invariants in 64 ms returned [13, 25, 38, 43, 61, 67]
[2024-05-22 11:02:02] [INFO ] Actually due to overlaps returned [43, 38]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 66 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 68/70 places, 65/65 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 68 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 67 transition count 64
Applied a total of 2 rules in 6 ms. Remains 67 /68 variables (removed 1) and now considering 64/65 (removed 1) transitions.
// Phase 1: matrix 64 rows 67 cols
[2024-05-22 11:02:02] [INFO ] Computed 14 invariants in 2 ms
[2024-05-22 11:02:02] [INFO ] Implicit Places using invariants in 66 ms returned [13, 25, 58, 64]
[2024-05-22 11:02:02] [INFO ] Actually due to overlaps returned [58, 64]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 69 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 65/70 places, 64/65 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 65 transition count 63
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 64 transition count 63
Applied a total of 2 rules in 6 ms. Remains 64 /65 variables (removed 1) and now considering 63/64 (removed 1) transitions.
// Phase 1: matrix 63 rows 64 cols
[2024-05-22 11:02:02] [INFO ] Computed 12 invariants in 3 ms
[2024-05-22 11:02:02] [INFO ] Implicit Places using invariants in 58 ms returned [13, 25]
[2024-05-22 11:02:02] [INFO ] Actually due to overlaps returned [13]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 60 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 63/70 places, 63/65 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 63 transition count 61
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 61 transition count 61
Applied a total of 4 rules in 6 ms. Remains 61 /63 variables (removed 2) and now considering 61/63 (removed 2) transitions.
// Phase 1: matrix 61 rows 61 cols
[2024-05-22 11:02:02] [INFO ] Computed 11 invariants in 2 ms
[2024-05-22 11:02:02] [INFO ] Implicit Places using invariants in 47 ms returned []
[2024-05-22 11:02:02] [INFO ] Invariant cache hit.
[2024-05-22 11:02:02] [INFO ] State equation strengthened by 14 read => feed constraints.
[2024-05-22 11:02:02] [INFO ] Implicit Places using invariants and state equation in 126 ms returned []
Implicit Place search using SMT with State Equation took 175 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 4 : 61/70 places, 61/65 transitions.
Finished structural reductions in REACHABILITY mode , in 4 iterations and 391 ms. Remains : 61/70 places, 61/65 transitions.
RANDOM walk for 40000 steps (6311 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (3834 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1451752 steps, run visited all 1 properties in 2657 ms. (steps per millisecond=546 )
Probabilistic random walk after 1451752 steps, saw 725928 distinct states, run finished after 2660 ms. (steps per millisecond=545 ) properties seen :1
FORMULA DoubleExponent-PT-003-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 4 atomic propositions for a total of 10 simplifications.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 263 edges and 159 vertex of which 156 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.3 ms
FORMULA DoubleExponent-PT-003-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&F(p1)&&(p2||X(!p0)))))'
Support contains 2 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 148/148 transitions.
Graph (complete) has 263 edges and 159 vertex of which 158 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 158 transition count 114
Reduce places removed 34 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 124 transition count 112
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 73 place count 122 transition count 112
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 73 place count 122 transition count 105
Deduced a syphon composed of 7 places in 4 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 87 place count 115 transition count 105
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 145 place count 86 transition count 76
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 153 place count 82 transition count 76
Applied a total of 153 rules in 24 ms. Remains 82 /159 variables (removed 77) and now considering 76/148 (removed 72) transitions.
// Phase 1: matrix 76 rows 82 cols
[2024-05-22 11:02:06] [INFO ] Computed 15 invariants in 2 ms
[2024-05-22 11:02:06] [INFO ] Implicit Places using invariants in 61 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 63 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/159 places, 76/148 transitions.
Graph (complete) has 241 edges and 81 vertex of which 80 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 79 transition count 74
Applied a total of 3 rules in 5 ms. Remains 79 /81 variables (removed 2) and now considering 74/76 (removed 2) transitions.
// Phase 1: matrix 74 rows 79 cols
[2024-05-22 11:02:06] [INFO ] Computed 14 invariants in 4 ms
[2024-05-22 11:02:06] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-22 11:02:06] [INFO ] Invariant cache hit.
[2024-05-22 11:02:06] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-22 11:02:06] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 152 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 79/159 places, 74/148 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 244 ms. Remains : 79/159 places, 74/148 transitions.
Stuttering acceptance computed with spot in 272 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p1), (OR (AND p0 (NOT p1)) (AND p0 (NOT p2)))]
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-01
Product exploration explored 100000 steps with 33333 reset in 272 ms.
Product exploration explored 100000 steps with 33333 reset in 134 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Graph (complete) has 238 edges and 79 vertex of which 78 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT p2)), (X (AND p0 (NOT p2))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X p1), (X (X p2)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 123 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-003-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-003-LTLCardinality-01 finished in 1122 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 148/148 transitions.
Graph (complete) has 263 edges and 159 vertex of which 158 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 157 transition count 112
Reduce places removed 35 places and 0 transitions.
Iterating post reduction 1 with 35 rules applied. Total rules applied 71 place count 122 transition count 112
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 71 place count 122 transition count 108
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 79 place count 118 transition count 108
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 0 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 2 with 58 rules applied. Total rules applied 137 place count 89 transition count 79
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 141 place count 87 transition count 79
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 142 place count 86 transition count 78
Applied a total of 142 rules in 18 ms. Remains 86 /159 variables (removed 73) and now considering 78/148 (removed 70) transitions.
// Phase 1: matrix 78 rows 86 cols
[2024-05-22 11:02:07] [INFO ] Computed 15 invariants in 2 ms
[2024-05-22 11:02:07] [INFO ] Implicit Places using invariants in 55 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 85/159 places, 78/148 transitions.
Graph (complete) has 232 edges and 85 vertex of which 84 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 83 transition count 76
Applied a total of 3 rules in 5 ms. Remains 83 /85 variables (removed 2) and now considering 76/78 (removed 2) transitions.
// Phase 1: matrix 76 rows 83 cols
[2024-05-22 11:02:07] [INFO ] Computed 14 invariants in 1 ms
[2024-05-22 11:02:07] [INFO ] Implicit Places using invariants in 67 ms returned []
[2024-05-22 11:02:07] [INFO ] Invariant cache hit.
[2024-05-22 11:02:07] [INFO ] State equation strengthened by 3 read => feed constraints.
[2024-05-22 11:02:07] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 83/159 places, 76/148 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 244 ms. Remains : 83/159 places, 76/148 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-02
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLCardinality-02 finished in 290 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((p1||X(p1))))))'
Support contains 4 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 148/148 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 158 transition count 148
Applied a total of 1 rules in 5 ms. Remains 158 /159 variables (removed 1) and now considering 148/148 (removed 0) transitions.
// Phase 1: matrix 148 rows 158 cols
[2024-05-22 11:02:07] [INFO ] Computed 15 invariants in 2 ms
[2024-05-22 11:02:07] [INFO ] Implicit Places using invariants in 64 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 66 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 157/159 places, 148/148 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 156 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 156 transition count 147
Applied a total of 2 rules in 7 ms. Remains 156 /157 variables (removed 1) and now considering 147/148 (removed 1) transitions.
// Phase 1: matrix 147 rows 156 cols
[2024-05-22 11:02:07] [INFO ] Computed 14 invariants in 1 ms
[2024-05-22 11:02:07] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-22 11:02:07] [INFO ] Invariant cache hit.
[2024-05-22 11:02:07] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 156/159 places, 147/148 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 283 ms. Remains : 156/159 places, 147/148 transitions.
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-03
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLCardinality-03 finished in 387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(F(p1)))))'
Support contains 2 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 148/148 transitions.
Graph (complete) has 263 edges and 159 vertex of which 158 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 34 transitions
Trivial Post-agglo rules discarded 34 transitions
Performed 34 trivial Post agglomeration. Transition count delta: 34
Iterating post reduction 0 with 34 rules applied. Total rules applied 35 place count 157 transition count 113
Reduce places removed 34 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 36 rules applied. Total rules applied 71 place count 123 transition count 111
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 73 place count 121 transition count 111
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 73 place count 121 transition count 106
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 83 place count 116 transition count 106
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 30
Deduced a syphon composed of 30 places in 0 ms
Reduce places removed 30 places and 0 transitions.
Iterating global reduction 3 with 60 rules applied. Total rules applied 143 place count 86 transition count 76
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 151 place count 82 transition count 76
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 152 place count 81 transition count 75
Applied a total of 152 rules in 24 ms. Remains 81 /159 variables (removed 78) and now considering 75/148 (removed 73) transitions.
// Phase 1: matrix 75 rows 81 cols
[2024-05-22 11:02:07] [INFO ] Computed 15 invariants in 3 ms
[2024-05-22 11:02:07] [INFO ] Implicit Places using invariants in 55 ms returned [17]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 56 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 80/159 places, 75/148 transitions.
Graph (complete) has 235 edges and 80 vertex of which 79 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 78 transition count 73
Applied a total of 3 rules in 4 ms. Remains 78 /80 variables (removed 2) and now considering 73/75 (removed 2) transitions.
// Phase 1: matrix 73 rows 78 cols
[2024-05-22 11:02:07] [INFO ] Computed 14 invariants in 1 ms
[2024-05-22 11:02:07] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-22 11:02:07] [INFO ] Invariant cache hit.
[2024-05-22 11:02:07] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 11:02:08] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 78/159 places, 73/148 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 242 ms. Remains : 78/159 places, 73/148 transitions.
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-04
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 4 ms.
FORMULA DoubleExponent-PT-003-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLCardinality-04 finished in 332 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 159 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 159/159 places, 148/148 transitions.
Graph (complete) has 263 edges and 159 vertex of which 158 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 36 place count 157 transition count 112
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 72 place count 122 transition count 111
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 73 place count 121 transition count 111
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 73 place count 121 transition count 105
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 85 place count 115 transition count 105
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 28
Deduced a syphon composed of 28 places in 0 ms
Reduce places removed 28 places and 0 transitions.
Iterating global reduction 3 with 56 rules applied. Total rules applied 141 place count 87 transition count 77
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 149 place count 83 transition count 77
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 150 place count 82 transition count 76
Applied a total of 150 rules in 17 ms. Remains 82 /159 variables (removed 77) and now considering 76/148 (removed 72) transitions.
// Phase 1: matrix 76 rows 82 cols
[2024-05-22 11:02:08] [INFO ] Computed 15 invariants in 1 ms
[2024-05-22 11:02:08] [INFO ] Implicit Places using invariants in 49 ms returned [15]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 50 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 81/159 places, 76/148 transitions.
Graph (complete) has 233 edges and 81 vertex of which 80 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 79 transition count 74
Applied a total of 3 rules in 2 ms. Remains 79 /81 variables (removed 2) and now considering 74/76 (removed 2) transitions.
// Phase 1: matrix 74 rows 79 cols
[2024-05-22 11:02:08] [INFO ] Computed 14 invariants in 1 ms
[2024-05-22 11:02:08] [INFO ] Implicit Places using invariants in 46 ms returned []
[2024-05-22 11:02:08] [INFO ] Invariant cache hit.
[2024-05-22 11:02:08] [INFO ] State equation strengthened by 4 read => feed constraints.
[2024-05-22 11:02:08] [INFO ] Implicit Places using invariants and state equation in 92 ms returned []
Implicit Place search using SMT with State Equation took 140 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 79/159 places, 74/148 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 209 ms. Remains : 79/159 places, 74/148 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-06
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-003-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLCardinality-06 finished in 252 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G((p1||X(p2))))))'
Support contains 4 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 148/148 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 158 transition count 148
Applied a total of 1 rules in 3 ms. Remains 158 /159 variables (removed 1) and now considering 148/148 (removed 0) transitions.
// Phase 1: matrix 148 rows 158 cols
[2024-05-22 11:02:08] [INFO ] Computed 15 invariants in 3 ms
[2024-05-22 11:02:08] [INFO ] Implicit Places using invariants in 67 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 68 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 157/159 places, 148/148 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 156 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 156 transition count 147
Applied a total of 2 rules in 5 ms. Remains 156 /157 variables (removed 1) and now considering 147/148 (removed 1) transitions.
// Phase 1: matrix 147 rows 156 cols
[2024-05-22 11:02:08] [INFO ] Computed 14 invariants in 1 ms
[2024-05-22 11:02:08] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-22 11:02:08] [INFO ] Invariant cache hit.
[2024-05-22 11:02:08] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 156/159 places, 147/148 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 289 ms. Remains : 156/159 places, 147/148 transitions.
Stuttering acceptance computed with spot in 182 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-003-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-003-LTLCardinality-08 finished in 495 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0)) U p1)))'
Support contains 4 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 148/148 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 158 transition count 148
Applied a total of 1 rules in 6 ms. Remains 158 /159 variables (removed 1) and now considering 148/148 (removed 0) transitions.
// Phase 1: matrix 148 rows 158 cols
[2024-05-22 11:02:08] [INFO ] Computed 15 invariants in 3 ms
[2024-05-22 11:02:08] [INFO ] Implicit Places using invariants in 60 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 61 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 157/159 places, 148/148 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 156 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 156 transition count 147
Applied a total of 2 rules in 5 ms. Remains 156 /157 variables (removed 1) and now considering 147/148 (removed 1) transitions.
// Phase 1: matrix 147 rows 156 cols
[2024-05-22 11:02:08] [INFO ] Computed 14 invariants in 1 ms
[2024-05-22 11:02:08] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-22 11:02:08] [INFO ] Invariant cache hit.
[2024-05-22 11:02:09] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 156/159 places, 147/148 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 282 ms. Remains : 156/159 places, 147/148 transitions.
Stuttering acceptance computed with spot in 311 ms :[(NOT p1), (NOT p1), (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 86 ms.
Product exploration explored 100000 steps with 50000 reset in 83 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 258 edges and 156 vertex of which 154 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X p1), (X p0), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 12 ms. Reduced automaton from 4 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-003-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-003-LTLCardinality-10 finished in 797 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0&&X(p0)))))'
Support contains 2 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 148/148 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 158 transition count 148
Applied a total of 1 rules in 3 ms. Remains 158 /159 variables (removed 1) and now considering 148/148 (removed 0) transitions.
// Phase 1: matrix 148 rows 158 cols
[2024-05-22 11:02:09] [INFO ] Computed 15 invariants in 1 ms
[2024-05-22 11:02:09] [INFO ] Implicit Places using invariants in 60 ms returned [27]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 61 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 157/159 places, 148/148 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 156 transition count 147
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 156 transition count 147
Applied a total of 2 rules in 6 ms. Remains 156 /157 variables (removed 1) and now considering 147/148 (removed 1) transitions.
// Phase 1: matrix 147 rows 156 cols
[2024-05-22 11:02:09] [INFO ] Computed 14 invariants in 1 ms
[2024-05-22 11:02:09] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-22 11:02:09] [INFO ] Invariant cache hit.
[2024-05-22 11:02:09] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 156/159 places, 147/148 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 273 ms. Remains : 156/159 places, 147/148 transitions.
Stuttering acceptance computed with spot in 67 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-11
Product exploration explored 100000 steps with 3324 reset in 74 ms.
Product exploration explored 100000 steps with 3286 reset in 83 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 258 edges and 156 vertex of which 154 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 44 ms :[true, (NOT p0)]
RANDOM walk for 40000 steps (1333 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (1156 resets) in 50 ms. (784 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 7395 steps, run visited all 1 properties in 43 ms. (steps per millisecond=171 )
Probabilistic random walk after 7395 steps, saw 3723 distinct states, run finished after 44 ms. (steps per millisecond=168 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 99 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-003-LTLCardinality-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-003-LTLCardinality-11 finished in 849 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||F((p1&&X(F(p2))))))'
Support contains 5 out of 159 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 159/159 places, 148/148 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 158 transition count 148
Applied a total of 1 rules in 2 ms. Remains 158 /159 variables (removed 1) and now considering 148/148 (removed 0) transitions.
// Phase 1: matrix 148 rows 158 cols
[2024-05-22 11:02:10] [INFO ] Computed 15 invariants in 4 ms
[2024-05-22 11:02:10] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-22 11:02:10] [INFO ] Invariant cache hit.
[2024-05-22 11:02:10] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 231 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2024-05-22 11:02:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-05-22 11:02:12] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 1 ms to minimize.
[2024-05-22 11:02:12] [INFO ] Deduced a trap composed of 8 places in 21 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 148/306 variables, 158/175 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-05-22 11:02:13] [INFO ] Deduced a trap composed of 43 places in 31 ms of which 1 ms to minimize.
[2024-05-22 11:02:13] [INFO ] Deduced a trap composed of 37 places in 27 ms of which 1 ms to minimize.
[2024-05-22 11:02:13] [INFO ] Deduced a trap composed of 43 places in 36 ms of which 0 ms to minimize.
[2024-05-22 11:02:14] [INFO ] Deduced a trap composed of 45 places in 63 ms of which 1 ms to minimize.
[2024-05-22 11:02:14] [INFO ] Deduced a trap composed of 29 places in 31 ms of which 1 ms to minimize.
[2024-05-22 11:02:14] [INFO ] Deduced a trap composed of 25 places in 47 ms of which 1 ms to minimize.
[2024-05-22 11:02:14] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 4 ms to minimize.
[2024-05-22 11:02:14] [INFO ] Deduced a trap composed of 16 places in 43 ms of which 1 ms to minimize.
[2024-05-22 11:02:15] [INFO ] Deduced a trap composed of 24 places in 47 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 9/184 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-05-22 11:02:15] [INFO ] Deduced a trap composed of 35 places in 40 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-05-22 11:02:16] [INFO ] Deduced a trap composed of 31 places in 40 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/306 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 11 (OVERLAPS) 0/306 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 186 constraints, problems are : Problem set: 0 solved, 147 unsolved in 9312 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 13/28 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 148/306 variables, 158/186 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 147/333 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-05-22 11:02:23] [INFO ] Deduced a trap composed of 18 places in 45 ms of which 2 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 10 (OVERLAPS) 0/306 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 334 constraints, problems are : Problem set: 0 solved, 147 unsolved in 12088 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 14/14 constraints]
After SMT, in 21429ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 21432ms
Starting structural reductions in LTL mode, iteration 1 : 158/159 places, 148/148 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 21668 ms. Remains : 158/159 places, 148/148 transitions.
Stuttering acceptance computed with spot in 220 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-003-LTLCardinality-13
Product exploration explored 100000 steps with 3301 reset in 115 ms.
Product exploration explored 100000 steps with 3275 reset in 111 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 261 edges and 158 vertex of which 156 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X p2)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 98 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p2) (NOT p0))]
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (1325 resets) in 148 ms. (268 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (1158 resets) in 127 ms. (312 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40002 steps (1138 resets) in 129 ms. (307 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (1120 resets) in 97 ms. (408 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40000 steps (1133 resets) in 126 ms. (314 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (1141 resets) in 134 ms. (296 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (1121 resets) in 94 ms. (421 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40000 steps (1135 resets) in 150 ms. (264 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (1141 resets) in 127 ms. (312 steps per ms) remains 7/7 properties
[2024-05-22 11:02:33] [INFO ] Invariant cache hit.
Problem apf1 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 69/74 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 48/122 variables, 4/11 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 6/128 variables, 2/13 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 2/130 variables, 2/15 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 135/265 variables, 130/145 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 0/145 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 32/297 variables, 23/168 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/297 variables, 0/168 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 4/301 variables, 2/170 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/301 variables, 0/170 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 4/305 variables, 2/172 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/305 variables, 0/172 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 1/306 variables, 1/173 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/306 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 0/306 variables, 0/173 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 173 constraints, problems are : Problem set: 1 solved, 6 unsolved in 333 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 69/74 variables, 7/7 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 48/122 variables, 4/11 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/122 variables, 0/11 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 6/128 variables, 2/13 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 2/130 variables, 2/15 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/130 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 135/265 variables, 130/145 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/265 variables, 0/145 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 32/297 variables, 23/168 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/297 variables, 6/174 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-22 11:02:34] [INFO ] Deduced a trap composed of 32 places in 28 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/297 variables, 1/175 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/297 variables, 0/175 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 15 (OVERLAPS) 4/301 variables, 2/177 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/301 variables, 0/177 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 4/305 variables, 2/179 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/305 variables, 0/179 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 1/306 variables, 1/180 constraints. Problems are: Problem set: 1 solved, 6 unsolved
[2024-05-22 11:02:34] [INFO ] Deduced a trap composed of 29 places in 41 ms of which 0 ms to minimize.
[2024-05-22 11:02:34] [INFO ] Deduced a trap composed of 37 places in 32 ms of which 0 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/306 variables, 2/182 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/306 variables, 0/182 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 0/306 variables, 0/182 constraints. Problems are: Problem set: 1 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 182 constraints, problems are : Problem set: 1 solved, 6 unsolved in 859 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 6/7 constraints, Known Traps: 3/3 constraints]
After SMT, in 1213ms problems are : Problem set: 1 solved, 6 unsolved
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 5147 ms.
Support contains 5 out of 158 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 158/158 places, 148/148 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 32 transitions
Trivial Post-agglo rules discarded 32 transitions
Performed 32 trivial Post agglomeration. Transition count delta: 32
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 158 transition count 116
Reduce places removed 32 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 34 rules applied. Total rules applied 66 place count 126 transition count 114
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 68 place count 124 transition count 114
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 68 place count 124 transition count 107
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 82 place count 117 transition count 107
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: 27
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 3 with 54 rules applied. Total rules applied 136 place count 90 transition count 80
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 144 place count 86 transition count 80
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 3 with 11 rules applied. Total rules applied 155 place count 86 transition count 69
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 166 place count 75 transition count 69
Partial Free-agglomeration rule applied 13 times.
Drop transitions (Partial Free agglomeration) removed 13 transitions
Iterating global reduction 4 with 13 rules applied. Total rules applied 179 place count 75 transition count 69
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 180 place count 74 transition count 68
Applied a total of 180 rules in 20 ms. Remains 74 /158 variables (removed 84) and now considering 68/148 (removed 80) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 74/158 places, 68/148 transitions.
RANDOM walk for 40000 steps (5101 resets) in 97 ms. (408 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3414 resets) in 79 ms. (500 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3397 resets) in 57 ms. (689 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3434 resets) in 66 ms. (597 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3370 resets) in 55 ms. (714 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (3356 resets) in 56 ms. (701 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (3341 resets) in 56 ms. (701 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 11867 steps, run visited all 6 properties in 37 ms. (steps per millisecond=320 )
Probabilistic random walk after 11867 steps, saw 5953 distinct states, run finished after 37 ms. (steps per millisecond=320 ) properties seen :6
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 p0))), (X (AND (NOT p1) p0)), (X (NOT (AND p1 (NOT p0)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 p0)))), (X (X (AND (NOT p1) p0))), (X (X p2)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1))), (X (X p0)), (G (OR p0 p2))]
False Knowledge obtained : [(F (NOT p2)), (F (NOT (AND p0 (NOT p1)))), (F p1), (F (NOT (OR p0 p1))), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p0) p2))), (F (NOT p0)), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 20 factoid took 336 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Support contains 5 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 148/148 transitions.
Applied a total of 0 rules in 3 ms. Remains 158 /158 variables (removed 0) and now considering 148/148 (removed 0) transitions.
[2024-05-22 11:02:40] [INFO ] Invariant cache hit.
[2024-05-22 11:02:40] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-22 11:02:40] [INFO ] Invariant cache hit.
[2024-05-22 11:02:40] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2024-05-22 11:02:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-05-22 11:02:42] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-22 11:02:42] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 148/306 variables, 158/175 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-05-22 11:02:44] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 0 ms to minimize.
[2024-05-22 11:02:44] [INFO ] Deduced a trap composed of 37 places in 35 ms of which 1 ms to minimize.
[2024-05-22 11:02:44] [INFO ] Deduced a trap composed of 43 places in 34 ms of which 1 ms to minimize.
[2024-05-22 11:02:44] [INFO ] Deduced a trap composed of 45 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:02:44] [INFO ] Deduced a trap composed of 29 places in 33 ms of which 1 ms to minimize.
[2024-05-22 11:02:44] [INFO ] Deduced a trap composed of 25 places in 50 ms of which 2 ms to minimize.
[2024-05-22 11:02:44] [INFO ] Deduced a trap composed of 34 places in 46 ms of which 2 ms to minimize.
[2024-05-22 11:02:44] [INFO ] Deduced a trap composed of 16 places in 44 ms of which 1 ms to minimize.
[2024-05-22 11:02:45] [INFO ] Deduced a trap composed of 24 places in 54 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 9/184 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-05-22 11:02:46] [INFO ] Deduced a trap composed of 35 places in 41 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-05-22 11:02:46] [INFO ] Deduced a trap composed of 31 places in 39 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/306 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 11 (OVERLAPS) 0/306 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 186 constraints, problems are : Problem set: 0 solved, 147 unsolved in 9370 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 13/28 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 148/306 variables, 158/186 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 147/333 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-05-22 11:02:53] [INFO ] Deduced a trap composed of 18 places in 50 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 10 (OVERLAPS) 0/306 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 334 constraints, problems are : Problem set: 0 solved, 147 unsolved in 12084 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 14/14 constraints]
After SMT, in 21472ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 21474ms
Finished structural reductions in LTL mode , in 1 iterations and 21685 ms. Remains : 158/158 places, 148/148 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 261 edges and 158 vertex of which 156 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 128 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
RANDOM walk for 40000 steps (1326 resets) in 88 ms. (449 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1121 resets) in 70 ms. (563 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1155 resets) in 61 ms. (645 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (1133 resets) in 64 ms. (615 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (1135 resets) in 63 ms. (625 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (1139 resets) in 85 ms. (465 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40000 steps (1146 resets) in 121 ms. (327 steps per ms) remains 6/6 properties
Finished probabilistic random walk after 40356 steps, run visited all 6 properties in 136 ms. (steps per millisecond=296 )
Probabilistic random walk after 40356 steps, saw 20191 distinct states, run finished after 137 ms. (steps per millisecond=294 ) properties seen :6
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p0) p1))), (X (AND p0 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND p0 (NOT p1)))), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p1)))), (F (NOT p2)), (F (NOT (AND p0 (NOT p1))))]
Knowledge based reduction with 12 factoid took 359 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 154 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Stuttering acceptance computed with spot in 131 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Product exploration explored 100000 steps with 3328 reset in 97 ms.
Product exploration explored 100000 steps with 3319 reset in 106 ms.
Applying partial POR strategy [false, true, false, false]
Stuttering acceptance computed with spot in 166 ms :[(OR (NOT p1) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Support contains 5 out of 158 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 158/158 places, 148/148 transitions.
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 32 rules applied. Total rules applied 32 place count 158 transition count 148
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 32 place count 158 transition count 153
Deduced a syphon composed of 40 places in 1 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 40 place count 158 transition count 153
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 155 transition count 150
Deduced a syphon composed of 37 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 155 transition count 150
Performed 27 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 64 places in 0 ms
Iterating global reduction 1 with 27 rules applied. Total rules applied 73 place count 155 transition count 156
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 75 place count 153 transition count 153
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 77 place count 153 transition count 153
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: -25
Deduced a syphon composed of 67 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 82 place count 153 transition count 178
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 87 place count 148 transition count 168
Deduced a syphon composed of 62 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 92 place count 148 transition count 168
Deduced a syphon composed of 62 places in 0 ms
Applied a total of 92 rules in 28 ms. Remains 148 /158 variables (removed 10) and now considering 168/148 (removed -20) transitions.
[2024-05-22 11:03:04] [INFO ] Redundant transitions in 4 ms returned []
Running 167 sub problems to find dead transitions.
// Phase 1: matrix 168 rows 148 cols
[2024-05-22 11:03:04] [INFO ] Computed 15 invariants in 2 ms
[2024-05-22 11:03:04] [INFO ] State equation strengthened by 6 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/147 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/147 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 2 (OVERLAPS) 1/148 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 167 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/148 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 167 unsolved
[2024-05-22 11:03:06] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
[2024-05-22 11:03:06] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD110 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 2/17 constraints. Problems are: Problem set: 1 solved, 166 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 166 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
At refinement iteration 6 (OVERLAPS) 168/316 variables, 148/165 constraints. Problems are: Problem set: 88 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/316 variables, 6/171 constraints. Problems are: Problem set: 88 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/316 variables, 0/171 constraints. Problems are: Problem set: 88 solved, 79 unsolved
At refinement iteration 9 (OVERLAPS) 0/316 variables, 0/171 constraints. Problems are: Problem set: 88 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Real declared 316/316 variables, and 171 constraints, problems are : Problem set: 88 solved, 79 unsolved in 4522 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 148/148 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 167/167 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 88 solved, 79 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/85 variables, 0/0 constraints. Problems are: Problem set: 88 solved, 79 unsolved
At refinement iteration 1 (OVERLAPS) 13/98 variables, 2/2 constraints. Problems are: Problem set: 88 solved, 79 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/98 variables, 2/4 constraints. Problems are: Problem set: 88 solved, 79 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/98 variables, 0/4 constraints. Problems are: Problem set: 88 solved, 79 unsolved
At refinement iteration 4 (OVERLAPS) 37/135 variables, 13/17 constraints. Problems are: Problem set: 88 solved, 79 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/135 variables, 0/17 constraints. Problems are: Problem set: 88 solved, 79 unsolved
At refinement iteration 6 (OVERLAPS) 168/303 variables, 135/152 constraints. Problems are: Problem set: 88 solved, 79 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/303 variables, 6/158 constraints. Problems are: Problem set: 88 solved, 79 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/303 variables, 79/237 constraints. Problems are: Problem set: 88 solved, 79 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/303 variables, 0/237 constraints. Problems are: Problem set: 88 solved, 79 unsolved
At refinement iteration 10 (OVERLAPS) 13/316 variables, 13/250 constraints. Problems are: Problem set: 88 solved, 79 unsolved
[2024-05-22 11:03:11] [INFO ] Deduced a trap composed of 7 places in 55 ms of which 1 ms to minimize.
[2024-05-22 11:03:12] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/316 variables, 2/252 constraints. Problems are: Problem set: 88 solved, 79 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/316 variables, 0/252 constraints. Problems are: Problem set: 88 solved, 79 unsolved
At refinement iteration 13 (OVERLAPS) 0/316 variables, 0/252 constraints. Problems are: Problem set: 88 solved, 79 unsolved
No progress, stopping.
After SMT solving in domain Int declared 316/316 variables, and 252 constraints, problems are : Problem set: 88 solved, 79 unsolved in 6517 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 148/148 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 79/167 constraints, Known Traps: 4/4 constraints]
After SMT, in 11065ms problems are : Problem set: 88 solved, 79 unsolved
Search for dead transitions found 88 dead transitions in 11069ms
Found 88 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 88 transitions
Dead transitions reduction (with SMT) removed 88 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 148/158 places, 80/148 transitions.
Graph (complete) has 238 edges and 148 vertex of which 86 are kept as prefixes of interest. Removing 62 places using SCC suffix rule.1 ms
Discarding 62 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 86 /148 variables (removed 62) and now considering 80/80 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 86/158 places, 80/148 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 11114 ms. Remains : 86/158 places, 80/148 transitions.
Support contains 5 out of 158 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 158/158 places, 148/148 transitions.
Applied a total of 0 rules in 1 ms. Remains 158 /158 variables (removed 0) and now considering 148/148 (removed 0) transitions.
// Phase 1: matrix 148 rows 158 cols
[2024-05-22 11:03:15] [INFO ] Computed 15 invariants in 1 ms
[2024-05-22 11:03:15] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-22 11:03:15] [INFO ] Invariant cache hit.
[2024-05-22 11:03:15] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Running 147 sub problems to find dead transitions.
[2024-05-22 11:03:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-05-22 11:03:17] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
[2024-05-22 11:03:17] [INFO ] Deduced a trap composed of 8 places in 19 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 2/17 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 148/306 variables, 158/175 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-05-22 11:03:19] [INFO ] Deduced a trap composed of 43 places in 39 ms of which 1 ms to minimize.
[2024-05-22 11:03:19] [INFO ] Deduced a trap composed of 37 places in 29 ms of which 1 ms to minimize.
[2024-05-22 11:03:19] [INFO ] Deduced a trap composed of 43 places in 37 ms of which 0 ms to minimize.
[2024-05-22 11:03:19] [INFO ] Deduced a trap composed of 45 places in 47 ms of which 1 ms to minimize.
[2024-05-22 11:03:19] [INFO ] Deduced a trap composed of 29 places in 34 ms of which 1 ms to minimize.
[2024-05-22 11:03:19] [INFO ] Deduced a trap composed of 25 places in 49 ms of which 1 ms to minimize.
[2024-05-22 11:03:19] [INFO ] Deduced a trap composed of 34 places in 55 ms of which 1 ms to minimize.
[2024-05-22 11:03:19] [INFO ] Deduced a trap composed of 16 places in 45 ms of which 1 ms to minimize.
[2024-05-22 11:03:20] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 9/184 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-05-22 11:03:21] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 1/185 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-05-22 11:03:21] [INFO ] Deduced a trap composed of 31 places in 35 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 1/186 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/306 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 11 (OVERLAPS) 0/306 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Real declared 306/306 variables, and 186 constraints, problems are : Problem set: 0 solved, 147 unsolved in 9511 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 13/13 constraints]
Escalating to Integer solving :Problem set: 0 solved, 147 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 2 (OVERLAPS) 1/158 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/158 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/158 variables, 13/28 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/158 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 6 (OVERLAPS) 148/306 variables, 158/186 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/306 variables, 147/333 constraints. Problems are: Problem set: 0 solved, 147 unsolved
[2024-05-22 11:03:28] [INFO ] Deduced a trap composed of 18 places in 38 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/306 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/306 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 147 unsolved
At refinement iteration 10 (OVERLAPS) 0/306 variables, 0/334 constraints. Problems are: Problem set: 0 solved, 147 unsolved
No progress, stopping.
After SMT solving in domain Int declared 306/306 variables, and 334 constraints, problems are : Problem set: 0 solved, 147 unsolved in 11956 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 158/158 constraints, PredecessorRefiner: 147/147 constraints, Known Traps: 14/14 constraints]
After SMT, in 21488ms problems are : Problem set: 0 solved, 147 unsolved
Search for dead transitions found 0 dead transitions in 21491ms
Finished structural reductions in LTL mode , in 1 iterations and 21713 ms. Remains : 158/158 places, 148/148 transitions.
Treatment of property DoubleExponent-PT-003-LTLCardinality-13 finished in 86906 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||F((p1&&X(F(p2))))))'
[2024-05-22 11:03:37] [INFO ] Flatten gal took : 9 ms
[2024-05-22 11:03:37] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-22 11:03:37] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 159 places, 148 transitions and 411 arcs took 4 ms.
Total runtime 119279 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DoubleExponent-PT-003

IS_COLORED=
IS_NUPN=

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


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


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

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

Process ID: 1318
MODEL NAME: /home/mcc/execution/411/model
159 places, 148 transitions.
Enabling coverability test.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Building monolithic NSF...
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Start RS construction.
Building monolithic NSF...
Start RS construction.
Convergence in 55 steps.
Creating all event NSFs..
Convergence in 55 steps.
Creating all event NSFs..
Building monolithic NSF...
Convergence in 55 steps.
Creating all event NSFs..
Convergence in 55 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Start RS construction.
Building monolithic NSF...
Building monolithic NSF...
Start RS construction.
Start RS construction.
Convergence in 130 steps.
Creating all event NSFs..
Building monolithic NSF...
Convergence in 130 steps.
Creating all event NSFs..
Start RS construction.
Convergence in 130 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 130 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Building monolithic NSF...
Start RS construction.
Convergence in 246 steps.
Creating all event NSFs..
Convergence in 246 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Building monolithic NSF...
Convergence in 246 steps.
Creating all event NSFs..
Start RS construction.
Building monolithic NSF...
Start RS construction.
Convergence in 246 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Convergence in 682 steps.
Creating all event NSFs..
Convergence in 682 steps.
Building monolithic NSF...
Creating all event NSFs..
Start RS construction.
Building monolithic NSF...
Start RS construction.
coverability test failed!!
Convergence in 1 steps.
The state space is infinite.
CANNOT_COMPUTE
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716375821428

--------------------
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="DoubleExponent-PT-003"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="greatspnxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool greatspnxred"
echo " Input is DoubleExponent-PT-003, 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 r135-tall-171631131300539"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DoubleExponent-PT-003.tgz
mv DoubleExponent-PT-003 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;