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-171631131300523.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-001, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r135-tall-171631131300523
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 392K
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K 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.4K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K 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 16K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K Apr 12 03:12 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 72K Apr 12 03:12 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Apr 12 03:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 68K Apr 12 03:11 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 17K 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-001-LTLCardinality-00
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-01
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-02
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-03
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-04
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-05
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-06
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-07
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-08
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-09
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-10
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-11
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-12
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-13
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-14
FORMULA_NAME DoubleExponent-PT-001-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716375203134

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-001
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-22 10:53:24] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-22 10:53:24] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 10:53:24] [INFO ] Load time of PNML (sax parser for PT used): 41 ms
[2024-05-22 10:53:24] [INFO ] Transformed 57 places.
[2024-05-22 10:53:24] [INFO ] Transformed 48 transitions.
[2024-05-22 10:53:24] [INFO ] Parsed PT model containing 57 places and 48 transitions and 135 arcs in 133 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA DoubleExponent-PT-001-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 30 out of 57 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 57/57 places, 48/48 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 56 transition count 48
Applied a total of 1 rules in 17 ms. Remains 56 /57 variables (removed 1) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 56 cols
[2024-05-22 10:53:24] [INFO ] Computed 8 invariants in 14 ms
[2024-05-22 10:53:24] [INFO ] Implicit Places using invariants in 175 ms returned []
[2024-05-22 10:53:24] [INFO ] Invariant cache hit.
[2024-05-22 10:53:24] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Running 47 sub problems to find dead transitions.
[2024-05-22 10:53:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-05-22 10:53:25] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 7 ms to minimize.
[2024-05-22 10:53:25] [INFO ] Deduced a trap composed of 7 places in 18 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 3/56 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 48/104 variables, 56/66 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-05-22 10:53:25] [INFO ] Deduced a trap composed of 16 places in 28 ms of which 2 ms to minimize.
[2024-05-22 10:53:25] [INFO ] Deduced a trap composed of 14 places in 33 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (OVERLAPS) 0/104 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 68 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1211 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/52 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/53 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/53 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/53 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/53 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 3/56 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/56 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 48/104 variables, 56/68 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 47/115 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-05-22 10:53:26] [INFO ] Deduced a trap composed of 17 places in 26 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/104 variables, 1/116 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/104 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-05-22 10:53:27] [INFO ] Deduced a trap composed of 20 places in 24 ms of which 1 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/104 variables, 1/117 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/104 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 14 (OVERLAPS) 0/104 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 117 constraints, problems are : Problem set: 0 solved, 47 unsolved in 2092 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 6/6 constraints]
After SMT, in 3332ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 3342ms
Starting structural reductions in LTL mode, iteration 1 : 56/57 places, 48/48 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3658 ms. Remains : 56/57 places, 48/48 transitions.
Support contains 30 out of 56 places after structural reductions.
[2024-05-22 10:53:28] [INFO ] Flatten gal took : 21 ms
[2024-05-22 10:53:28] [INFO ] Flatten gal took : 10 ms
[2024-05-22 10:53:28] [INFO ] Input system was already deterministic with 48 transitions.
RANDOM walk for 40000 steps (1324 resets) in 1319 ms. (30 steps per ms) remains 10/25 properties
BEST_FIRST walk for 40002 steps (1138 resets) in 322 ms. (123 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1150 resets) in 279 ms. (142 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1155 resets) in 173 ms. (229 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1140 resets) in 174 ms. (228 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1199 resets) in 128 ms. (310 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1129 resets) in 152 ms. (261 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1212 resets) in 135 ms. (294 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1134 resets) in 108 ms. (366 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1122 resets) in 132 ms. (300 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1172 resets) in 184 ms. (216 steps per ms) remains 10/10 properties
[2024-05-22 10:53:29] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp16 is UNSAT
At refinement iteration 1 (OVERLAPS) 34/45 variables, 6/6 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/45 variables, 0/6 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 6/51 variables, 2/8 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 0/8 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 47/98 variables, 51/59 constraints. Problems are: Problem set: 2 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/98 variables, 0/59 constraints. Problems are: Problem set: 2 solved, 8 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp13 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp21 is UNSAT
At refinement iteration 7 (OVERLAPS) 6/104 variables, 5/64 constraints. Problems are: Problem set: 8 solved, 2 unsolved
[2024-05-22 10:53:29] [INFO ] Deduced a trap composed of 17 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/104 variables, 1/65 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/104 variables, 0/65 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/104 variables, 0/65 constraints. Problems are: Problem set: 8 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 104/104 variables, and 65 constraints, problems are : Problem set: 8 solved, 2 unsolved in 147 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 10/10 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 8 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 10/12 variables, 1/1 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 10/22 variables, 2/3 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/3 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 23/45 variables, 3/6 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/45 variables, 0/6 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 44/89 variables, 45/51 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/89 variables, 1/52 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/89 variables, 0/52 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 9/98 variables, 6/58 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/98 variables, 1/59 constraints. Problems are: Problem set: 8 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/98 variables, 0/59 constraints. Problems are: Problem set: 8 solved, 2 unsolved
Problem AtomicPropp11 is UNSAT
At refinement iteration 13 (OVERLAPS) 5/103 variables, 4/63 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/103 variables, 1/64 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/103 variables, 1/65 constraints. Problems are: Problem set: 9 solved, 1 unsolved
[2024-05-22 10:53:29] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/103 variables, 1/66 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/103 variables, 0/66 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/104 variables, 1/67 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/104 variables, 1/68 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/104 variables, 0/68 constraints. Problems are: Problem set: 9 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/104 variables, 0/68 constraints. Problems are: Problem set: 9 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 104/104 variables, and 68 constraints, problems are : Problem set: 9 solved, 1 unsolved in 107 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 56/56 constraints, PredecessorRefiner: 2/10 constraints, Known Traps: 2/2 constraints]
After SMT, in 262ms problems are : Problem set: 9 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 1 out of 56 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 56/56 places, 48/48 transitions.
Graph (complete) has 85 edges and 56 vertex of which 51 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 50 transition count 35
Reduce places removed 11 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 13 rules applied. Total rules applied 28 place count 39 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 30 place count 37 transition count 33
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 30 place count 37 transition count 30
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 36 place count 34 transition count 30
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 37 place count 33 transition count 29
Iterating global reduction 3 with 1 rules applied. Total rules applied 38 place count 33 transition count 29
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 58 place count 23 transition count 19
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 23 transition count 17
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 62 place count 21 transition count 17
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 64 place count 21 transition count 17
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 65 place count 20 transition count 16
Applied a total of 65 rules in 25 ms. Remains 20 /56 variables (removed 36) and now considering 16/48 (removed 32) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 20/56 places, 16/48 transitions.
RANDOM walk for 40000 steps (4653 resets) in 399 ms. (100 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40000 steps (3152 resets) in 188 ms. (211 steps per ms) remains 1/1 properties
Probably explored full state space saw : 52 states, properties seen :0
Probabilistic random walk after 103 steps, saw 52 distinct states, run finished after 9 ms. (steps per millisecond=11 ) properties seen :0
Explored full state space saw : 52 states, properties seen :0
Exhaustive walk after 103 steps, saw 52 distinct states, run finished after 2 ms. (steps per millisecond=51 ) properties seen :0
FORMULA DoubleExponent-PT-001-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 10 atomic propositions for a total of 11 simplifications.
FORMULA DoubleExponent-PT-001-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-001-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 85 edges and 56 vertex of which 51 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(((F(p0) U p1)&&X(F(p2)))))))'
Support contains 6 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 48/48 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 54 transition count 48
Applied a total of 2 rules in 2 ms. Remains 54 /56 variables (removed 2) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 54 cols
[2024-05-22 10:53:30] [INFO ] Computed 6 invariants in 1 ms
[2024-05-22 10:53:30] [INFO ] Implicit Places using invariants in 33 ms returned [14, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/56 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 51 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 51 transition count 47
Applied a total of 2 rules in 3 ms. Remains 51 /52 variables (removed 1) and now considering 47/48 (removed 1) transitions.
// Phase 1: matrix 47 rows 51 cols
[2024-05-22 10:53:30] [INFO ] Computed 4 invariants in 1 ms
[2024-05-22 10:53:30] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-22 10:53:30] [INFO ] Invariant cache hit.
[2024-05-22 10:53:30] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 79 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 51/56 places, 47/48 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 118 ms. Remains : 51/56 places, 47/48 transitions.
Stuttering acceptance computed with spot in 426 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : DoubleExponent-PT-001-LTLCardinality-01
Product exploration explored 100000 steps with 7692 reset in 175 ms.
Product exploration explored 100000 steps with 7692 reset in 113 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Graph (complete) has 77 edges and 51 vertex of which 48 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 6 stabilizing places and 6 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 118 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 48 steps (0 resets) in 5 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 4 factoid took 104 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 151 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 146 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
[2024-05-22 10:53:31] [INFO ] Invariant cache hit.
[2024-05-22 10:53:31] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-22 10:53:31] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-22 10:53:31] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-22 10:53:31] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 10:53:31] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-22 10:53:31] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 2 ms returned sat
[2024-05-22 10:53:31] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-22 10:53:31] [INFO ] Computed and/alt/rep : 46/83/46 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-22 10:53:32] [INFO ] Added : 35 causal constraints over 7 iterations in 63 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 2 out of 51 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 47/47 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 47/47 (removed 0) transitions.
[2024-05-22 10:53:32] [INFO ] Invariant cache hit.
[2024-05-22 10:53:32] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-22 10:53:32] [INFO ] Invariant cache hit.
[2024-05-22 10:53:32] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Running 46 sub problems to find dead transitions.
[2024-05-22 10:53:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-22 10:53:32] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 1 ms to minimize.
[2024-05-22 10:53:32] [INFO ] Deduced a trap composed of 7 places in 19 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 47/97 variables, 50/56 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-22 10:53:32] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 0 ms to minimize.
[2024-05-22 10:53:32] [INFO ] Deduced a trap composed of 14 places in 24 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (OVERLAPS) 1/98 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 11 (OVERLAPS) 0/98 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/98 variables, and 59 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1022 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 47/97 variables, 50/58 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 44/102 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-22 10:53:33] [INFO ] Deduced a trap composed of 20 places in 29 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/97 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 10 (OVERLAPS) 1/98 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/98 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-22 10:53:34] [INFO ] Deduced a trap composed of 28 places in 30 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/98 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/98 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 14 (OVERLAPS) 0/98 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/98 variables, and 107 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1932 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 6/6 constraints]
After SMT, in 2963ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 2964ms
Finished structural reductions in LTL mode , in 1 iterations and 3053 ms. Remains : 51/51 places, 47/47 transitions.
Computed a total of 6 stabilizing places and 6 stable transitions
Graph (complete) has 77 edges and 51 vertex of which 48 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.2 ms
Computed a total of 6 stabilizing places and 6 stable transitions
Knowledge obtained : [(NOT p2)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 76 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 48 steps (0 resets) in 4 ms. (9 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p2)]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 1 factoid took 83 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
[2024-05-22 10:53:35] [INFO ] Invariant cache hit.
[2024-05-22 10:53:35] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 10:53:35] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-22 10:53:35] [INFO ] [Real]Absence check using state equation in 17 ms returned sat
[2024-05-22 10:53:35] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 10:53:35] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-22 10:53:35] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-22 10:53:35] [INFO ] [Nat]Absence check using state equation in 25 ms returned sat
[2024-05-22 10:53:35] [INFO ] Computed and/alt/rep : 46/83/46 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-22 10:53:35] [INFO ] Added : 35 causal constraints over 7 iterations in 68 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 173 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 7692 reset in 69 ms.
Product exploration explored 100000 steps with 7692 reset in 64 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 152 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Support contains 2 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 47/47 transitions.
Graph (complete) has 77 edges and 51 vertex of which 50 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 11 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 50 transition count 46
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 12 place count 50 transition count 47
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 50 transition count 47
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 18 place count 47 transition count 44
Deduced a syphon composed of 11 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 21 place count 47 transition count 44
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 32 place count 47 transition count 46
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 33 place count 46 transition count 45
Deduced a syphon composed of 21 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 34 place count 46 transition count 45
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 23 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 36 place count 46 transition count 49
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 39 place count 43 transition count 43
Deduced a syphon composed of 20 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 42 place count 43 transition count 43
Deduced a syphon composed of 20 places in 0 ms
Applied a total of 42 rules in 13 ms. Remains 43 /51 variables (removed 8) and now considering 43/47 (removed 4) transitions.
[2024-05-22 10:53:36] [INFO ] Redundant transitions in 0 ms returned []
Running 42 sub problems to find dead transitions.
// Phase 1: matrix 43 rows 43 cols
[2024-05-22 10:53:36] [INFO ] Computed 4 invariants in 1 ms
[2024-05-22 10:53:36] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 2 (OVERLAPS) 1/42 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 42 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/42 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 42 unsolved
[2024-05-22 10:53:36] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
[2024-05-22 10:53:36] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/42 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/42 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 41 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD1 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
At refinement iteration 6 (OVERLAPS) 43/85 variables, 42/48 constraints. Problems are: Problem set: 24 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/85 variables, 1/49 constraints. Problems are: Problem set: 24 solved, 18 unsolved
[2024-05-22 10:53:36] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-22 10:53:36] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 0 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 2/51 constraints. Problems are: Problem set: 24 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/85 variables, 0/51 constraints. Problems are: Problem set: 24 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 1/86 variables, 1/52 constraints. Problems are: Problem set: 24 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/86 variables, 0/52 constraints. Problems are: Problem set: 24 solved, 18 unsolved
At refinement iteration 12 (OVERLAPS) 0/86 variables, 0/52 constraints. Problems are: Problem set: 24 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 86/86 variables, and 52 constraints, problems are : Problem set: 24 solved, 18 unsolved in 595 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 43/43 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 42/42 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 24 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 0/0 constraints. Problems are: Problem set: 24 solved, 18 unsolved
At refinement iteration 1 (OVERLAPS) 10/31 variables, 2/2 constraints. Problems are: Problem set: 24 solved, 18 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 4/6 constraints. Problems are: Problem set: 24 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/6 constraints. Problems are: Problem set: 24 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 3/34 variables, 2/8 constraints. Problems are: Problem set: 24 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/34 variables, 0/8 constraints. Problems are: Problem set: 24 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 43/77 variables, 34/42 constraints. Problems are: Problem set: 24 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/77 variables, 1/43 constraints. Problems are: Problem set: 24 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/77 variables, 14/57 constraints. Problems are: Problem set: 24 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/77 variables, 0/57 constraints. Problems are: Problem set: 24 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 9/86 variables, 9/66 constraints. Problems are: Problem set: 24 solved, 18 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/86 variables, 4/70 constraints. Problems are: Problem set: 24 solved, 18 unsolved
[2024-05-22 10:53:37] [INFO ] Deduced a trap composed of 11 places in 32 ms of which 0 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/86 variables, 1/71 constraints. Problems are: Problem set: 24 solved, 18 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/86 variables, 0/71 constraints. Problems are: Problem set: 24 solved, 18 unsolved
At refinement iteration 14 (OVERLAPS) 0/86 variables, 0/71 constraints. Problems are: Problem set: 24 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 86/86 variables, and 71 constraints, problems are : Problem set: 24 solved, 18 unsolved in 486 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 43/43 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 18/42 constraints, Known Traps: 5/5 constraints]
After SMT, in 1094ms problems are : Problem set: 24 solved, 18 unsolved
Search for dead transitions found 24 dead transitions in 1095ms
Found 24 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 24 transitions
Dead transitions reduction (with SMT) removed 24 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 43/51 places, 19/47 transitions.
Graph (complete) has 57 edges and 43 vertex of which 23 are kept as prefixes of interest. Removing 20 places using SCC suffix rule.0 ms
Discarding 20 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 23 /43 variables (removed 20) and now considering 19/19 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 23/51 places, 19/47 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1119 ms. Remains : 23/51 places, 19/47 transitions.
Support contains 2 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 47/47 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 47/47 (removed 0) transitions.
// Phase 1: matrix 47 rows 51 cols
[2024-05-22 10:53:37] [INFO ] Computed 4 invariants in 2 ms
[2024-05-22 10:53:37] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-05-22 10:53:37] [INFO ] Invariant cache hit.
[2024-05-22 10:53:37] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Running 46 sub problems to find dead transitions.
[2024-05-22 10:53:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-22 10:53:38] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 0 ms to minimize.
[2024-05-22 10:53:38] [INFO ] Deduced a trap composed of 7 places in 14 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 47/97 variables, 50/56 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-22 10:53:38] [INFO ] Deduced a trap composed of 16 places in 24 ms of which 0 ms to minimize.
[2024-05-22 10:53:38] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 2/58 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (OVERLAPS) 1/98 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 11 (OVERLAPS) 0/98 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/98 variables, and 59 constraints, problems are : Problem set: 0 solved, 46 unsolved in 964 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (OVERLAPS) 1/50 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/50 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 47/97 variables, 50/58 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/97 variables, 44/102 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-22 10:53:39] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/97 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/97 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 10 (OVERLAPS) 1/98 variables, 1/104 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/98 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-22 10:53:39] [INFO ] Deduced a trap composed of 28 places in 32 ms of which 1 ms to minimize.
At refinement iteration 12 (INCLUDED_ONLY) 0/98 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/98 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 14 (OVERLAPS) 0/98 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/98 variables, and 107 constraints, problems are : Problem set: 0 solved, 46 unsolved in 2123 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 6/6 constraints]
After SMT, in 3096ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 3096ms
Finished structural reductions in LTL mode , in 1 iterations and 3173 ms. Remains : 51/51 places, 47/47 transitions.
Treatment of property DoubleExponent-PT-001-LTLCardinality-01 finished in 10625 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 56 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 56/56 places, 48/48 transitions.
Graph (complete) has 85 edges and 56 vertex of which 54 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 53 transition count 36
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 42 transition count 36
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 23 place count 42 transition count 34
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 27 place count 40 transition count 34
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 51 place count 28 transition count 22
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 52 place count 27 transition count 21
Applied a total of 52 rules in 6 ms. Remains 27 /56 variables (removed 29) and now considering 21/48 (removed 27) transitions.
// Phase 1: matrix 21 rows 27 cols
[2024-05-22 10:53:40] [INFO ] Computed 6 invariants in 3 ms
[2024-05-22 10:53:40] [INFO ] Implicit Places using invariants in 30 ms returned [7, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 30 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 25/56 places, 21/48 transitions.
Graph (complete) has 57 edges and 25 vertex of which 24 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 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 7 place count 21 transition count 17
Applied a total of 7 rules in 2 ms. Remains 21 /25 variables (removed 4) and now considering 17/21 (removed 4) transitions.
// Phase 1: matrix 17 rows 21 cols
[2024-05-22 10:53:40] [INFO ] Computed 4 invariants in 1 ms
[2024-05-22 10:53:40] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-22 10:53:40] [INFO ] Invariant cache hit.
[2024-05-22 10:53:40] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 58 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 21/56 places, 17/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 96 ms. Remains : 21/56 places, 17/48 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-001-LTLCardinality-02
Stuttering criterion allowed to conclude after 13 steps with 1 reset in 0 ms.
FORMULA DoubleExponent-PT-001-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-001-LTLCardinality-02 finished in 144 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((p0&&G((p1&&F(p0)))) U (G((p0&&G((p1&&F(p0)))))||(G((p1&&F(p0)))&&p2))))))'
Support contains 4 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 48/48 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 54 transition count 48
Applied a total of 2 rules in 3 ms. Remains 54 /56 variables (removed 2) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 54 cols
[2024-05-22 10:53:41] [INFO ] Computed 6 invariants in 1 ms
[2024-05-22 10:53:41] [INFO ] Implicit Places using invariants in 34 ms returned [14, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 34 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/56 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 52 /52 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 38 ms. Remains : 52/56 places, 48/48 transitions.
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-001-LTLCardinality-03
Stuttering criterion allowed to conclude after 52 steps with 0 reset in 1 ms.
FORMULA DoubleExponent-PT-001-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-001-LTLCardinality-03 finished in 297 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 48/48 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 53 transition count 48
Applied a total of 3 rules in 4 ms. Remains 53 /56 variables (removed 3) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 53 cols
[2024-05-22 10:53:41] [INFO ] Computed 6 invariants in 0 ms
[2024-05-22 10:53:41] [INFO ] Implicit Places using invariants in 35 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 52/56 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 51 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 51 transition count 47
Applied a total of 2 rules in 3 ms. Remains 51 /52 variables (removed 1) and now considering 47/48 (removed 1) transitions.
// Phase 1: matrix 47 rows 51 cols
[2024-05-22 10:53:41] [INFO ] Computed 5 invariants in 1 ms
[2024-05-22 10:53:41] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-22 10:53:41] [INFO ] Invariant cache hit.
[2024-05-22 10:53:41] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 51/56 places, 47/48 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 112 ms. Remains : 51/56 places, 47/48 transitions.
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-001-LTLCardinality-06
Product exploration explored 100000 steps with 50000 reset in 39 ms.
Product exploration explored 100000 steps with 50000 reset in 51 ms.
Computed a total of 6 stabilizing places and 6 stable transitions
Graph (complete) has 79 edges and 51 vertex of which 49 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Computed a total of 6 stabilizing places and 6 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 17 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-001-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-001-LTLCardinality-06 finished in 296 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 48/48 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 53 transition count 48
Applied a total of 3 rules in 3 ms. Remains 53 /56 variables (removed 3) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 53 cols
[2024-05-22 10:53:41] [INFO ] Computed 6 invariants in 1 ms
[2024-05-22 10:53:41] [INFO ] Implicit Places using invariants in 31 ms returned [14, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 31 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/56 places, 48/48 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 50 transition count 47
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 50 transition count 47
Applied a total of 2 rules in 2 ms. Remains 50 /51 variables (removed 1) and now considering 47/48 (removed 1) transitions.
// Phase 1: matrix 47 rows 50 cols
[2024-05-22 10:53:41] [INFO ] Computed 4 invariants in 0 ms
[2024-05-22 10:53:41] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-22 10:53:41] [INFO ] Invariant cache hit.
[2024-05-22 10:53:41] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 67 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 50/56 places, 47/48 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 103 ms. Remains : 50/56 places, 47/48 transitions.
Stuttering acceptance computed with spot in 87 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-001-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-001-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-001-LTLCardinality-09 finished in 200 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) U (p1||X((G((p1||X(p2))) U (p1&&G((p1||X(p2))))))))))'
Support contains 5 out of 56 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 56/56 places, 48/48 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 53 transition count 48
Applied a total of 3 rules in 1 ms. Remains 53 /56 variables (removed 3) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 53 cols
[2024-05-22 10:53:41] [INFO ] Computed 6 invariants in 0 ms
[2024-05-22 10:53:41] [INFO ] Implicit Places using invariants in 27 ms returned [14, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 28 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 51/56 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 51 /51 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 30 ms. Remains : 51/56 places, 48/48 transitions.
Stuttering acceptance computed with spot in 381 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), true, (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-001-LTLCardinality-15
Product exploration explored 100000 steps with 16441 reset in 111 ms.
Product exploration explored 100000 steps with 16078 reset in 112 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 77 edges and 51 vertex of which 49 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) (NOT p0) p2), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 122 ms. Reduced automaton from 10 states, 23 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 232 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true]
RANDOM walk for 6283 steps (216 resets) in 47 ms. (130 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) p2), (X (NOT (AND (NOT p1) p0))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p2)), (F p1)]
Knowledge based reduction with 11 factoid took 165 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true]
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true]
// Phase 1: matrix 48 rows 51 cols
[2024-05-22 10:53:43] [INFO ] Computed 4 invariants in 1 ms
[2024-05-22 10:53:43] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-22 10:53:43] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-22 10:53:43] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-22 10:53:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 10:53:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-22 10:53:43] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-22 10:53:43] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-22 10:53:43] [INFO ] Deduced a trap composed of 28 places in 27 ms of which 1 ms to minimize.
[2024-05-22 10:53:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 32 ms
[2024-05-22 10:53:43] [INFO ] Computed and/alt/rep : 47/84/47 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-22 10:53:43] [INFO ] Added : 43 causal constraints over 9 iterations in 67 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 51 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2024-05-22 10:53:43] [INFO ] Invariant cache hit.
[2024-05-22 10:53:43] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-22 10:53:43] [INFO ] Invariant cache hit.
[2024-05-22 10:53:43] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Running 47 sub problems to find dead transitions.
[2024-05-22 10:53:43] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-05-22 10:53:44] [INFO ] Deduced a trap composed of 6 places in 24 ms of which 1 ms to minimize.
[2024-05-22 10:53:44] [INFO ] Deduced a trap composed of 7 places in 17 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 48/99 variables, 51/57 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-05-22 10:53:44] [INFO ] Deduced a trap composed of 16 places in 29 ms of which 1 ms to minimize.
[2024-05-22 10:53:44] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/99 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 59 constraints, problems are : Problem set: 0 solved, 47 unsolved in 915 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 48/99 variables, 51/59 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 47/106 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-05-22 10:53:45] [INFO ] Deduced a trap composed of 20 places in 28 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 0/99 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/99 variables, and 107 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1167 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 5/5 constraints]
After SMT, in 2089ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 2090ms
Finished structural reductions in LTL mode , in 1 iterations and 2173 ms. Remains : 51/51 places, 48/48 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 77 edges and 51 vertex of which 49 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), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 312 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true]
RANDOM walk for 4618 steps (152 resets) in 16 ms. (271 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) p2), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT p2)), (F p1)]
Knowledge based reduction with 2 factoid took 125 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true]
Stuttering acceptance computed with spot in 220 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true]
[2024-05-22 10:53:46] [INFO ] Invariant cache hit.
[2024-05-22 10:53:46] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-22 10:53:46] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-22 10:53:46] [INFO ] [Real]Absence check using state equation in 16 ms returned sat
[2024-05-22 10:53:46] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 10:53:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-22 10:53:46] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-22 10:53:46] [INFO ] [Nat]Absence check using state equation in 17 ms returned sat
[2024-05-22 10:53:47] [INFO ] Deduced a trap composed of 28 places in 33 ms of which 0 ms to minimize.
[2024-05-22 10:53:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 40 ms
[2024-05-22 10:53:47] [INFO ] Computed and/alt/rep : 47/84/47 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-22 10:53:47] [INFO ] Added : 43 causal constraints over 9 iterations in 67 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 221 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true]
Product exploration explored 100000 steps with 16347 reset in 60 ms.
Product exploration explored 100000 steps with 16362 reset in 199 ms.
Applying partial POR strategy [false, false, false, true, false, true]
Stuttering acceptance computed with spot in 236 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true]
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 48/48 transitions.
Graph (complete) has 77 edges and 51 vertex of which 50 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 9 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 9 rules applied. Total rules applied 10 place count 50 transition count 47
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 10 place count 50 transition count 48
Deduced a syphon composed of 12 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 13 place count 50 transition count 48
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 17 place count 46 transition count 44
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 21 place count 46 transition count 44
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 28 place count 46 transition count 45
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 29 place count 45 transition count 44
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 30 place count 45 transition count 44
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 45 transition count 46
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 33 place count 43 transition count 42
Deduced a syphon composed of 13 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 35 place count 43 transition count 42
Deduced a syphon composed of 13 places in 0 ms
Applied a total of 35 rules in 12 ms. Remains 43 /51 variables (removed 8) and now considering 42/48 (removed 6) transitions.
[2024-05-22 10:53:47] [INFO ] Redundant transitions in 0 ms returned []
Running 41 sub problems to find dead transitions.
// Phase 1: matrix 42 rows 43 cols
[2024-05-22 10:53:47] [INFO ] Computed 4 invariants in 1 ms
[2024-05-22 10:53:47] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/42 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/42 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 1/43 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 41 unsolved
[2024-05-22 10:53:48] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 0 ms to minimize.
Problem TDEAD2 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/43 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 40 unsolved
[2024-05-22 10:53:48] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/43 variables, 1/6 constraints. Problems are: Problem set: 1 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 40 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
At refinement iteration 7 (OVERLAPS) 42/85 variables, 43/49 constraints. Problems are: Problem set: 15 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/85 variables, 1/50 constraints. Problems are: Problem set: 15 solved, 26 unsolved
[2024-05-22 10:53:48] [INFO ] Deduced a trap composed of 12 places in 34 ms of which 3 ms to minimize.
[2024-05-22 10:53:48] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-22 10:53:48] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/85 variables, 3/53 constraints. Problems are: Problem set: 15 solved, 26 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/85 variables, 0/53 constraints. Problems are: Problem set: 15 solved, 26 unsolved
At refinement iteration 11 (OVERLAPS) 0/85 variables, 0/53 constraints. Problems are: Problem set: 15 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Real declared 85/85 variables, and 53 constraints, problems are : Problem set: 15 solved, 26 unsolved in 674 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 43/43 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 15 solved, 26 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 1/1 constraints. Problems are: Problem set: 15 solved, 26 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 15 solved, 26 unsolved
At refinement iteration 2 (OVERLAPS) 9/38 variables, 2/3 constraints. Problems are: Problem set: 15 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 1/4 constraints. Problems are: Problem set: 15 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 5/9 constraints. Problems are: Problem set: 15 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/9 constraints. Problems are: Problem set: 15 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 42/80 variables, 38/47 constraints. Problems are: Problem set: 15 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 1/48 constraints. Problems are: Problem set: 15 solved, 26 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 26/74 constraints. Problems are: Problem set: 15 solved, 26 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/80 variables, 0/74 constraints. Problems are: Problem set: 15 solved, 26 unsolved
At refinement iteration 10 (OVERLAPS) 5/85 variables, 5/79 constraints. Problems are: Problem set: 15 solved, 26 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/85 variables, 0/79 constraints. Problems are: Problem set: 15 solved, 26 unsolved
[2024-05-22 10:53:49] [INFO ] Deduced a trap composed of 13 places in 28 ms of which 0 ms to minimize.
At refinement iteration 12 (OVERLAPS) 0/85 variables, 1/80 constraints. Problems are: Problem set: 15 solved, 26 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/85 variables, 0/80 constraints. Problems are: Problem set: 15 solved, 26 unsolved
At refinement iteration 14 (OVERLAPS) 0/85 variables, 0/80 constraints. Problems are: Problem set: 15 solved, 26 unsolved
No progress, stopping.
After SMT solving in domain Int declared 85/85 variables, and 80 constraints, problems are : Problem set: 15 solved, 26 unsolved in 810 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 43/43 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 26/41 constraints, Known Traps: 6/6 constraints]
After SMT, in 1491ms problems are : Problem set: 15 solved, 26 unsolved
Search for dead transitions found 15 dead transitions in 1493ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 43/51 places, 27/48 transitions.
Graph (complete) has 63 edges and 43 vertex of which 30 are kept as prefixes of interest. Removing 13 places using SCC suffix rule.1 ms
Discarding 13 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 30 /43 variables (removed 13) and now considering 27/27 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 30/51 places, 27/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1518 ms. Remains : 30/51 places, 27/48 transitions.
Support contains 4 out of 51 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 51/51 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 51 /51 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 51 cols
[2024-05-22 10:53:49] [INFO ] Computed 4 invariants in 1 ms
[2024-05-22 10:53:49] [INFO ] Implicit Places using invariants in 32 ms returned []
[2024-05-22 10:53:49] [INFO ] Invariant cache hit.
[2024-05-22 10:53:49] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 80 ms to find 0 implicit places.
Running 47 sub problems to find dead transitions.
[2024-05-22 10:53:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-05-22 10:53:49] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
[2024-05-22 10:53:49] [INFO ] Deduced a trap composed of 7 places in 15 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 48/99 variables, 51/57 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-05-22 10:53:49] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 0 ms to minimize.
[2024-05-22 10:53:50] [INFO ] Deduced a trap composed of 14 places in 20 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 2/59 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/99 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 59 constraints, problems are : Problem set: 0 solved, 47 unsolved in 885 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 4/4 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (OVERLAPS) 1/51 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/51 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/51 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/51 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 48/99 variables, 51/59 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/99 variables, 47/106 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-05-22 10:53:50] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 1/107 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 0/99 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/99 variables, and 107 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1152 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 51/51 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 5/5 constraints]
After SMT, in 2042ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 2043ms
Finished structural reductions in LTL mode , in 1 iterations and 2126 ms. Remains : 51/51 places, 48/48 transitions.
Treatment of property DoubleExponent-PT-001-LTLCardinality-15 finished in 9741 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(((F(p0) U p1)&&X(F(p2)))))))'
Found a Shortening insensitive property : DoubleExponent-PT-001-LTLCardinality-01
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2))]
Support contains 6 out of 56 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 56/56 places, 48/48 transitions.
Graph (complete) has 85 edges and 56 vertex of which 54 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 53 transition count 40
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 15 place count 46 transition count 40
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 15 place count 46 transition count 39
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 17 place count 45 transition count 39
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 37 place count 35 transition count 29
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 38 place count 34 transition count 28
Applied a total of 38 rules in 9 ms. Remains 34 /56 variables (removed 22) and now considering 28/48 (removed 20) transitions.
// Phase 1: matrix 28 rows 34 cols
[2024-05-22 10:53:51] [INFO ] Computed 6 invariants in 1 ms
[2024-05-22 10:53:52] [INFO ] Implicit Places using invariants in 31 ms returned [7, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 32/56 places, 28/48 transitions.
Graph (complete) has 62 edges and 32 vertex of which 31 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
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 31 transition count 26
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 30 transition count 26
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
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 7 place count 28 transition count 24
Applied a total of 7 rules in 2 ms. Remains 28 /32 variables (removed 4) and now considering 24/28 (removed 4) transitions.
// Phase 1: matrix 24 rows 28 cols
[2024-05-22 10:53:52] [INFO ] Computed 4 invariants in 0 ms
[2024-05-22 10:53:52] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-05-22 10:53:52] [INFO ] Invariant cache hit.
[2024-05-22 10:53:52] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 28/56 places, 24/48 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 102 ms. Remains : 28/56 places, 24/48 transitions.
Running random walk in product with property : DoubleExponent-PT-001-LTLCardinality-01
Product exploration explored 100000 steps with 16666 reset in 145 ms.
Product exploration explored 100000 steps with 16666 reset in 179 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Graph (complete) has 57 edges and 28 vertex of which 26 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 74 ms. Reduced automaton from 7 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 20 steps (0 resets) in 5 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND p1 p0 (NOT p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 4 factoid took 111 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 158 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
[2024-05-22 10:53:53] [INFO ] Invariant cache hit.
[2024-05-22 10:53:53] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-22 10:53:53] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-22 10:53:53] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2024-05-22 10:53:53] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 10:53:53] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-22 10:53:53] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-22 10:53:53] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-22 10:53:53] [INFO ] Computed and/alt/rep : 23/36/23 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-22 10:53:53] [INFO ] Added : 3 causal constraints over 1 iterations in 11 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 2 out of 28 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 24/24 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 24/24 (removed 0) transitions.
[2024-05-22 10:53:53] [INFO ] Invariant cache hit.
[2024-05-22 10:53:53] [INFO ] Implicit Places using invariants in 28 ms returned []
[2024-05-22 10:53:53] [INFO ] Invariant cache hit.
[2024-05-22 10:53:53] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Running 23 sub problems to find dead transitions.
[2024-05-22 10:53:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 1/27 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 24/51 variables, 27/31 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-22 10:53:53] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/51 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 1/52 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/52 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (OVERLAPS) 0/52 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 33 constraints, problems are : Problem set: 0 solved, 23 unsolved in 296 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 28/28 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 1/27 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 24/51 variables, 27/32 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/51 variables, 19/51 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-22 10:53:53] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/51 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/51 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (OVERLAPS) 1/52 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/52 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/52 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 14 (OVERLAPS) 0/52 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 57 constraints, problems are : Problem set: 0 solved, 23 unsolved in 436 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 28/28 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 2/2 constraints]
After SMT, in 735ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 735ms
Finished structural reductions in LTL mode , in 1 iterations and 810 ms. Remains : 28/28 places, 24/24 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Graph (complete) has 57 edges and 28 vertex of which 26 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge obtained : [(NOT p2)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 68 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
RANDOM walk for 20 steps (0 resets) in 5 ms. (3 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p2)]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 1 factoid took 93 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 156 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 142 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
[2024-05-22 10:53:54] [INFO ] Invariant cache hit.
[2024-05-22 10:53:54] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 10:53:54] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-22 10:53:54] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2024-05-22 10:53:54] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 10:53:54] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-22 10:53:54] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-22 10:53:54] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2024-05-22 10:53:54] [INFO ] Computed and/alt/rep : 23/36/23 causal constraints (skipped 0 transitions) in 1 ms.
[2024-05-22 10:53:54] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 161 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 16666 reset in 57 ms.
Product exploration explored 100000 steps with 16666 reset in 64 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 141 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Support contains 2 out of 28 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 28/28 places, 24/24 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 28 transition count 24
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 4 place count 28 transition count 24
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 28 transition count 26
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 27 transition count 24
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 27 transition count 24
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 7 rules in 7 ms. Remains 27 /28 variables (removed 1) and now considering 24/24 (removed 0) transitions.
[2024-05-22 10:53:55] [INFO ] Redundant transitions in 0 ms returned []
Running 23 sub problems to find dead transitions.
// Phase 1: matrix 24 rows 27 cols
[2024-05-22 10:53:55] [INFO ] Computed 4 invariants in 1 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 1/26 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 23 unsolved
Problem TDEAD11 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
At refinement iteration 6 (OVERLAPS) 24/50 variables, 26/30 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/50 variables, 0/30 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 8 (OVERLAPS) 1/51 variables, 1/31 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/51 variables, 0/31 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 0/51 variables, 0/31 constraints. Problems are: Problem set: 5 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 51/51 variables, and 31 constraints, problems are : Problem set: 5 solved, 18 unsolved in 211 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 18 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/1 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 3/24 variables, 2/3 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/3 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 4 (OVERLAPS) 1/25 variables, 1/4 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 6 (OVERLAPS) 24/49 variables, 25/29 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/49 variables, 14/43 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/49 variables, 0/43 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 2/51 variables, 2/45 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/51 variables, 4/49 constraints. Problems are: Problem set: 5 solved, 18 unsolved
[2024-05-22 10:53:55] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/51 variables, 1/50 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/51 variables, 0/50 constraints. Problems are: Problem set: 5 solved, 18 unsolved
At refinement iteration 13 (OVERLAPS) 0/51 variables, 0/50 constraints. Problems are: Problem set: 5 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 51/51 variables, and 50 constraints, problems are : Problem set: 5 solved, 18 unsolved in 340 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 27/27 constraints, PredecessorRefiner: 18/23 constraints, Known Traps: 1/1 constraints]
After SMT, in 558ms problems are : Problem set: 5 solved, 18 unsolved
Search for dead transitions found 5 dead transitions in 558ms
Found 5 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 5 transitions
Dead transitions reduction (with SMT) removed 5 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 27/28 places, 19/24 transitions.
Graph (complete) has 56 edges and 27 vertex of which 23 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 23 /27 variables (removed 4) and now considering 19/19 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 23/28 places, 19/24 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 573 ms. Remains : 23/28 places, 19/24 transitions.
Support contains 2 out of 28 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 28/28 places, 24/24 transitions.
Applied a total of 0 rules in 1 ms. Remains 28 /28 variables (removed 0) and now considering 24/24 (removed 0) transitions.
// Phase 1: matrix 24 rows 28 cols
[2024-05-22 10:53:55] [INFO ] Computed 4 invariants in 1 ms
[2024-05-22 10:53:55] [INFO ] Implicit Places using invariants in 26 ms returned []
[2024-05-22 10:53:55] [INFO ] Invariant cache hit.
[2024-05-22 10:53:55] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 63 ms to find 0 implicit places.
Running 23 sub problems to find dead transitions.
[2024-05-22 10:53:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 1/27 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/27 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 24/51 variables, 27/31 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-22 10:53:56] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/51 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 9 (OVERLAPS) 1/52 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/52 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (OVERLAPS) 0/52 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 33 constraints, problems are : Problem set: 0 solved, 23 unsolved in 303 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 28/28 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (OVERLAPS) 1/27 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/27 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/27 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 24/51 variables, 27/32 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/51 variables, 19/51 constraints. Problems are: Problem set: 0 solved, 23 unsolved
[2024-05-22 10:53:56] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/51 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/51 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 11 (OVERLAPS) 1/52 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/52 variables, 4/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/52 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 14 (OVERLAPS) 0/52 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 57 constraints, problems are : Problem set: 0 solved, 23 unsolved in 466 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 28/28 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 2/2 constraints]
After SMT, in 775ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 775ms
Finished structural reductions in LTL mode , in 1 iterations and 842 ms. Remains : 28/28 places, 24/24 transitions.
Treatment of property DoubleExponent-PT-001-LTLCardinality-01 finished in 5069 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) U (p1||X((G((p1||X(p2))) U (p1&&G((p1||X(p2))))))))))'
[2024-05-22 10:53:56] [INFO ] Flatten gal took : 12 ms
[2024-05-22 10:53:56] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-22 10:53:56] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 56 places, 48 transitions and 134 arcs took 3 ms.
Total runtime 32543 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running DoubleExponent-PT-001

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: 56
TRANSITIONS: 48
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.000s, Sys 0.001s]


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: 1617
MODEL NAME: /home/mcc/execution/411/model
56 places, 48 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.
Building monolithic NSF...
Start RS construction.
Start RS construction.
Convergence in 55 steps.
Creating all event NSFs..
Convergence in 55 steps.
Creating all event NSFs..
Building monolithic NSF...
Start RS construction.
Building monolithic NSF...
Start RS construction.
Convergence in 55 steps.
Convergence in 53 steps.
Creating all event NSFs..
FORMULA DoubleExponent-PT-001-LTLCardinality-01 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
FORMULA DoubleExponent-PT-001-LTLCardinality-15 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716375237528

--------------------
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-001"
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-001, 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-171631131300523"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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