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.r488-tall-171631132900531.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 ltsminxred
Input is DoubleExponent-PT-002, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r488-tall-171631132900531
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 5.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K 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.7K Apr 22 14:41 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Apr 22 14:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Apr 22 14:41 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 22 14:41 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 03:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Apr 12 03:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Apr 12 03:15 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 125K Apr 12 03:15 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 33K 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-002-LTLCardinality-00
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-01
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-02
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-03
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-04
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-05
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-06
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-07
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-08
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-09
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-10
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-11
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-12
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-13
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-14
FORMULA_NAME DoubleExponent-PT-002-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1717193615231

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-002
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-05-31 22:13:36] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-31 22:13:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-31 22:13:36] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2024-05-31 22:13:36] [INFO ] Transformed 110 places.
[2024-05-31 22:13:36] [INFO ] Transformed 98 transitions.
[2024-05-31 22:13:36] [INFO ] Parsed PT model containing 110 places and 98 transitions and 276 arcs in 142 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 2 formulas.
FORMULA DoubleExponent-PT-002-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 34 out of 110 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 110/110 places, 98/98 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 107 transition count 98
Applied a total of 3 rules in 39 ms. Remains 107 /110 variables (removed 3) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 107 cols
[2024-05-31 22:13:36] [INFO ] Computed 11 invariants in 32 ms
[2024-05-31 22:13:36] [INFO ] Implicit Places using invariants in 213 ms returned [77]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 243 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 106/110 places, 98/98 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 105 transition count 97
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 105 transition count 97
Applied a total of 2 rules in 10 ms. Remains 105 /106 variables (removed 1) and now considering 97/98 (removed 1) transitions.
// Phase 1: matrix 97 rows 105 cols
[2024-05-31 22:13:36] [INFO ] Computed 10 invariants in 2 ms
[2024-05-31 22:13:37] [INFO ] Implicit Places using invariants in 64 ms returned []
[2024-05-31 22:13:37] [INFO ] Invariant cache hit.
[2024-05-31 22:13:37] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 177 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 105/110 places, 97/98 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 487 ms. Remains : 105/110 places, 97/98 transitions.
Support contains 34 out of 105 places after structural reductions.
[2024-05-31 22:13:37] [INFO ] Flatten gal took : 27 ms
[2024-05-31 22:13:37] [INFO ] Flatten gal took : 11 ms
[2024-05-31 22:13:37] [INFO ] Input system was already deterministic with 97 transitions.
Support contains 32 out of 105 places (down from 34) after GAL structural reductions.
RANDOM walk for 40000 steps (1326 resets) in 2332 ms. (17 steps per ms) remains 26/32 properties
BEST_FIRST walk for 4001 steps (118 resets) in 93 ms. (42 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4002 steps (111 resets) in 80 ms. (49 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (110 resets) in 59 ms. (66 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (102 resets) in 81 ms. (48 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (112 resets) in 18 ms. (210 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (112 resets) in 43 ms. (90 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (114 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (107 resets) in 24 ms. (160 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (116 resets) in 32 ms. (121 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (118 resets) in 40 ms. (97 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (106 resets) in 21 ms. (181 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (116 resets) in 33 ms. (117 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (117 resets) in 28 ms. (137 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (113 resets) in 30 ms. (129 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (107 resets) in 40 ms. (97 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (114 resets) in 28 ms. (137 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (116 resets) in 27 ms. (142 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (110 resets) in 43 ms. (90 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (112 resets) in 52 ms. (75 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (113 resets) in 37 ms. (105 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (113 resets) in 23 ms. (166 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (111 resets) in 46 ms. (85 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (113 resets) in 50 ms. (78 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (107 resets) in 28 ms. (137 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4000 steps (106 resets) in 19 ms. (200 steps per ms) remains 26/26 properties
BEST_FIRST walk for 4001 steps (114 resets) in 27 ms. (142 steps per ms) remains 26/26 properties
[2024-05-31 22:13:38] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 1 (OVERLAPS) 13/39 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 3 (OVERLAPS) 47/86 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 5 (OVERLAPS) 1/87 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 26 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/87 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 26 unsolved
Problem AtomicPropp23 is UNSAT
Problem AtomicPropp31 is UNSAT
At refinement iteration 7 (OVERLAPS) 90/177 variables, 87/97 constraints. Problems are: Problem set: 2 solved, 24 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/177 variables, 0/97 constraints. Problems are: Problem set: 2 solved, 24 unsolved
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp8 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp17 is UNSAT
At refinement iteration 9 (OVERLAPS) 20/197 variables, 14/111 constraints. Problems are: Problem set: 6 solved, 20 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/197 variables, 0/111 constraints. Problems are: Problem set: 6 solved, 20 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp18 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp26 is UNSAT
Problem AtomicPropp27 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
Problem AtomicPropp30 is UNSAT
At refinement iteration 11 (OVERLAPS) 5/202 variables, 4/115 constraints. Problems are: Problem set: 17 solved, 9 unsolved
[2024-05-31 22:13:39] [INFO ] Deduced a trap composed of 18 places in 56 ms of which 13 ms to minimize.
[2024-05-31 22:13:39] [INFO ] Deduced a trap composed of 31 places in 36 ms of which 1 ms to minimize.
[2024-05-31 22:13:39] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 1 ms to minimize.
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
At refinement iteration 12 (INCLUDED_ONLY) 0/202 variables, 3/118 constraints. Problems are: Problem set: 19 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/202 variables, 0/118 constraints. Problems are: Problem set: 19 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/202 variables, 0/118 constraints. Problems are: Problem set: 19 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 202/202 variables, and 118 constraints, problems are : Problem set: 19 solved, 7 unsolved in 784 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 26/26 constraints, Known Traps: 3/3 constraints]
Escalating to Integer solving :Problem set: 19 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 19 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 16/26 variables, 2/2 constraints. Problems are: Problem set: 19 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/2 constraints. Problems are: Problem set: 19 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 56/82 variables, 7/9 constraints. Problems are: Problem set: 19 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/82 variables, 0/9 constraints. Problems are: Problem set: 19 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 1/83 variables, 1/10 constraints. Problems are: Problem set: 19 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/83 variables, 0/10 constraints. Problems are: Problem set: 19 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 86/169 variables, 83/93 constraints. Problems are: Problem set: 19 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/169 variables, 1/94 constraints. Problems are: Problem set: 19 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/169 variables, 0/94 constraints. Problems are: Problem set: 19 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 26/195 variables, 17/111 constraints. Problems are: Problem set: 19 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/195 variables, 6/117 constraints. Problems are: Problem set: 19 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/195 variables, 1/118 constraints. Problems are: Problem set: 19 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/195 variables, 0/118 constraints. Problems are: Problem set: 19 solved, 7 unsolved
Problem AtomicPropp20 is UNSAT
At refinement iteration 14 (OVERLAPS) 7/202 variables, 5/123 constraints. Problems are: Problem set: 20 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/202 variables, 2/125 constraints. Problems are: Problem set: 20 solved, 6 unsolved
[2024-05-31 22:13:39] [INFO ] Deduced a trap composed of 16 places in 42 ms of which 1 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/202 variables, 1/126 constraints. Problems are: Problem set: 20 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/202 variables, 0/126 constraints. Problems are: Problem set: 20 solved, 6 unsolved
At refinement iteration 18 (OVERLAPS) 0/202 variables, 0/126 constraints. Problems are: Problem set: 20 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 202/202 variables, and 126 constraints, problems are : Problem set: 20 solved, 6 unsolved in 469 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 105/105 constraints, PredecessorRefiner: 7/26 constraints, Known Traps: 4/4 constraints]
After SMT, in 1295ms problems are : Problem set: 20 solved, 6 unsolved
Parikh walk visited 4 properties in 1369 ms.
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 105/105 places, 97/97 transitions.
Graph (complete) has 171 edges and 105 vertex of which 102 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 22 transitions
Trivial Post-agglo rules discarded 22 transitions
Performed 22 trivial Post agglomeration. Transition count delta: 22
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 102 transition count 73
Reduce places removed 22 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 23 rules applied. Total rules applied 47 place count 80 transition count 72
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 79 transition count 72
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 48 place count 79 transition count 67
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 58 place count 74 transition count 67
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 3 with 38 rules applied. Total rules applied 96 place count 55 transition count 48
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 100 place count 53 transition count 48
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 3 with 5 rules applied. Total rules applied 105 place count 53 transition count 43
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 110 place count 48 transition count 43
Partial Free-agglomeration rule applied 8 times.
Drop transitions (Partial Free agglomeration) removed 8 transitions
Iterating global reduction 4 with 8 rules applied. Total rules applied 118 place count 48 transition count 43
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 119 place count 47 transition count 42
Applied a total of 119 rules in 28 ms. Remains 47 /105 variables (removed 58) and now considering 42/97 (removed 55) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 47/105 places, 42/97 transitions.
RANDOM walk for 40000 steps (4124 resets) in 322 ms. (123 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (2878 resets) in 218 ms. (182 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (2925 resets) in 102 ms. (388 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 966 steps, run visited all 2 properties in 13 ms. (steps per millisecond=74 )
Probabilistic random walk after 966 steps, saw 498 distinct states, run finished after 18 ms. (steps per millisecond=53 ) properties seen :2
Successfully simplified 20 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA DoubleExponent-PT-002-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 171 edges and 105 vertex of which 102 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.4 ms
FORMULA DoubleExponent-PT-002-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DoubleExponent-PT-002-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X(X(p1)))))'
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 97/97 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 104 transition count 97
Applied a total of 1 rules in 4 ms. Remains 104 /105 variables (removed 1) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 104 cols
[2024-05-31 22:13:41] [INFO ] Computed 10 invariants in 2 ms
[2024-05-31 22:13:41] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-31 22:13:41] [INFO ] Invariant cache hit.
[2024-05-31 22:13:42] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 160 ms to find 0 implicit places.
Running 96 sub problems to find dead transitions.
[2024-05-31 22:13:42] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-31 22:13:42] [INFO ] Deduced a trap composed of 7 places in 24 ms of which 1 ms to minimize.
[2024-05-31 22:13:42] [INFO ] Deduced a trap composed of 8 places in 14 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 97/201 variables, 104/116 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-31 22:13:43] [INFO ] Deduced a trap composed of 26 places in 40 ms of which 1 ms to minimize.
[2024-05-31 22:13:43] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 1 ms to minimize.
[2024-05-31 22:13:43] [INFO ] Deduced a trap composed of 16 places in 36 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 3/119 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 0/119 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-31 22:13:44] [INFO ] Deduced a trap composed of 24 places in 43 ms of which 1 ms to minimize.
[2024-05-31 22:13:44] [INFO ] Deduced a trap composed of 25 places in 42 ms of which 1 ms to minimize.
[2024-05-31 22:13:44] [INFO ] Deduced a trap composed of 18 places in 42 ms of which 0 ms to minimize.
[2024-05-31 22:13:44] [INFO ] Deduced a trap composed of 31 places in 31 ms of which 1 ms to minimize.
At refinement iteration 9 (OVERLAPS) 0/201 variables, 4/123 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/201 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 11 (OVERLAPS) 0/201 variables, 0/123 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Real declared 201/201 variables, and 123 constraints, problems are : Problem set: 0 solved, 96 unsolved in 4080 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 96 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 2 (OVERLAPS) 1/104 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/104 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/104 variables, 9/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/104 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 6 (OVERLAPS) 97/201 variables, 104/123 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/201 variables, 96/219 constraints. Problems are: Problem set: 0 solved, 96 unsolved
[2024-05-31 22:13:47] [INFO ] Deduced a trap composed of 25 places in 54 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/201 variables, 1/220 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/201 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 96 unsolved
At refinement iteration 10 (OVERLAPS) 0/201 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 96 unsolved
No progress, stopping.
After SMT solving in domain Int declared 201/201 variables, and 220 constraints, problems are : Problem set: 0 solved, 96 unsolved in 4467 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 104/104 constraints, PredecessorRefiner: 96/96 constraints, Known Traps: 10/10 constraints]
After SMT, in 8569ms problems are : Problem set: 0 solved, 96 unsolved
Search for dead transitions found 0 dead transitions in 8573ms
Starting structural reductions in LTL mode, iteration 1 : 104/105 places, 97/97 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8739 ms. Remains : 104/105 places, 97/97 transitions.
Stuttering acceptance computed with spot in 232 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-002-LTLCardinality-00
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 2 ms.
FORMULA DoubleExponent-PT-002-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLCardinality-00 finished in 9032 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 1 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 97/97 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 104 transition count 97
Applied a total of 1 rules in 4 ms. Remains 104 /105 variables (removed 1) and now considering 97/97 (removed 0) transitions.
[2024-05-31 22:13:50] [INFO ] Invariant cache hit.
[2024-05-31 22:13:50] [INFO ] Implicit Places using invariants in 55 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 67 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/105 places, 97/97 transitions.
Applied a total of 0 rules in 3 ms. Remains 103 /103 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 74 ms. Remains : 103/105 places, 97/97 transitions.
Stuttering acceptance computed with spot in 76 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-002-LTLCardinality-01
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-002-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLCardinality-01 finished in 162 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&&(p1 U p2)))))'
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 97/97 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 104 transition count 97
Applied a total of 1 rules in 5 ms. Remains 104 /105 variables (removed 1) and now considering 97/97 (removed 0) transitions.
[2024-05-31 22:13:51] [INFO ] Invariant cache hit.
[2024-05-31 22:13:51] [INFO ] Implicit Places using invariants in 44 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 46 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/105 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 53 ms. Remains : 103/105 places, 97/97 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p2) (NOT p0)), (NOT p2), (OR (NOT p0) (NOT p2))]
Running random walk in product with property : DoubleExponent-PT-002-LTLCardinality-03
Stuttering criterion allowed to conclude after 24 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-002-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLCardinality-03 finished in 194 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(G(!p1)||G(F(p2)))))'
Support contains 5 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 97/97 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 104 transition count 97
Applied a total of 1 rules in 1 ms. Remains 104 /105 variables (removed 1) and now considering 97/97 (removed 0) transitions.
[2024-05-31 22:13:51] [INFO ] Invariant cache hit.
[2024-05-31 22:13:51] [INFO ] Implicit Places using invariants in 47 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/105 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 50 ms. Remains : 103/105 places, 97/97 transitions.
Stuttering acceptance computed with spot in 173 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (NOT p0), (NOT p2), (NOT p2), (AND (NOT p2) p1), true]
Running random walk in product with property : DoubleExponent-PT-002-LTLCardinality-05
Product exploration explored 100000 steps with 6273 reset in 178 ms.
Product exploration explored 100000 steps with 6266 reset in 121 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 167 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND p1 (NOT p2)))), (X p0), (X p2), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X p2)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 86 ms. Reduced automaton from 6 states, 12 edges and 3 AP (stutter sensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 121 ms :[(AND p1 (NOT p2)), (NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (1327 resets) in 134 ms. (296 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40000 steps (1144 resets) in 179 ms. (222 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (1123 resets) in 88 ms. (449 steps per ms) remains 1/2 properties
// Phase 1: matrix 97 rows 103 cols
[2024-05-31 22:13:52] [INFO ] Computed 9 invariants in 2 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 49/52 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/52 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 6/58 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 18/76 variables, 4/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/76 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 79/155 variables, 76/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/155 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 31/186 variables, 19/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/186 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/194 variables, 4/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/194 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/199 variables, 3/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/199 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf1 is UNSAT
After SMT solving in domain Real declared 200/200 variables, and 112 constraints, problems are : Problem set: 1 solved, 0 unsolved in 149 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 103/103 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 159ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND p1 (NOT p2)))), (X p0), (X p2), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p2))))), (X (X p2)), (X (X (NOT p1))), (G (OR p2 (NOT p1)))]
False Knowledge obtained : [(F (NOT p2)), (F p1)]
Knowledge based reduction with 9 factoid took 141 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND p1 (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 110 ms :[(AND p1 (NOT p2)), (NOT p2), (NOT p2)]
Support contains 3 out of 103 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 103/103 places, 97/97 transitions.
Graph (complete) has 167 edges and 103 vertex of which 102 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
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 101 transition count 75
Reduce places removed 20 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 22 rules applied. Total rules applied 43 place count 81 transition count 73
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 45 place count 79 transition count 73
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 45 place count 79 transition count 68
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 55 place count 74 transition count 68
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 20
Deduced a syphon composed of 20 places in 0 ms
Reduce places removed 20 places and 0 transitions.
Iterating global reduction 3 with 40 rules applied. Total rules applied 95 place count 54 transition count 48
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 99 place count 52 transition count 48
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 100 place count 51 transition count 47
Applied a total of 100 rules in 11 ms. Remains 51 /103 variables (removed 52) and now considering 47/97 (removed 50) transitions.
// Phase 1: matrix 47 rows 51 cols
[2024-05-31 22:13:52] [INFO ] Computed 9 invariants in 1 ms
[2024-05-31 22:13:52] [INFO ] Implicit Places using invariants in 43 ms returned []
[2024-05-31 22:13:52] [INFO ] Invariant cache hit.
[2024-05-31 22:13:52] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:13:52] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
[2024-05-31 22:13:52] [INFO ] Redundant transitions in 1 ms returned []
Running 46 sub problems to find dead transitions.
[2024-05-31 22:13:52] [INFO ] Invariant cache hit.
[2024-05-31 22:13:52] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 47/97 variables, 50/59 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (OVERLAPS) 1/98 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/98 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (OVERLAPS) 0/98 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/98 variables, and 62 constraints, problems are : Problem set: 0 solved, 46 unsolved in 634 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 51/51 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 46 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 3 (OVERLAPS) 47/97 variables, 50/59 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/97 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/97 variables, 43/104 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/97 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 7 (OVERLAPS) 1/98 variables, 1/105 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/98 variables, 3/108 constraints. Problems are: Problem set: 0 solved, 46 unsolved
[2024-05-31 22:13:54] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/98 variables, 1/109 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/98 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 11 (OVERLAPS) 0/98 variables, 0/109 constraints. Problems are: Problem set: 0 solved, 46 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/98 variables, and 109 constraints, problems are : Problem set: 0 solved, 46 unsolved in 1176 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 51/51 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 1/1 constraints]
After SMT, in 1854ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 1855ms
Starting structural reductions in SI_LTL mode, iteration 1 : 51/103 places, 47/97 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1989 ms. Remains : 51/103 places, 47/97 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 138 edges and 51 vertex of which 50 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p2), (X p2), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 78 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(AND p1 (NOT p2)), (NOT p2), (NOT p2)]
RANDOM walk for 40000 steps (4108 resets) in 77 ms. (512 steps per ms) remains 2/3 properties
BEST_FIRST walk for 40000 steps (2656 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (2697 resets) in 36 ms. (1081 steps per ms) remains 2/2 properties
[2024-05-31 22:13:54] [INFO ] Invariant cache hit.
[2024-05-31 22:13:54] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 3/31 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/31 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 2/33 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/33 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 38/71 variables, 33/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 23/94 variables, 15/54 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/94 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/94 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/94 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/94 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/95 variables, 1/58 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/95 variables, 1/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/95 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
At refinement iteration 17 (OVERLAPS) 3/98 variables, 2/61 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/98 variables, 1/62 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/98 variables, 0/62 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/98 variables, 0/62 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 98/98 variables, and 62 constraints, problems are : Problem set: 1 solved, 1 unsolved in 62 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 51/51 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 25/26 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
[2024-05-31 22:13:54] [INFO ] Deduced a trap composed of 6 places in 14 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 3/29 variables, 1/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/29 variables, 0/5 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 2/31 variables, 2/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/31 variables, 0/7 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 35/66 variables, 31/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/66 variables, 0/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 24/90 variables, 13/51 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/90 variables, 1/52 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/90 variables, 1/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/90 variables, 0/53 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 1/91 variables, 1/54 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/91 variables, 1/55 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/91 variables, 0/55 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 2/93 variables, 2/57 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/93 variables, 2/59 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/93 variables, 0/59 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 5/98 variables, 4/63 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/98 variables, 1/64 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/98 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/98 variables, 0/64 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 98/98 variables, and 64 constraints, problems are : Problem set: 1 solved, 1 unsolved in 76 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 51/51 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 141ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 3 ms.
Support contains 1 out of 51 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 51/51 places, 47/47 transitions.
Graph (complete) has 130 edges and 51 vertex of which 50 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 50 transition count 45
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 49 transition count 45
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 8 place count 47 transition count 43
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 47 transition count 37
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 20 place count 41 transition count 37
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 3 with 7 rules applied. Total rules applied 27 place count 41 transition count 37
Applied a total of 27 rules in 8 ms. Remains 41 /51 variables (removed 10) and now considering 37/47 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 41/51 places, 37/47 transitions.
RANDOM walk for 11527 steps (1499 resets) in 17 ms. (640 steps per ms) remains 0/1 properties
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2), (X p2), (X (NOT (AND (NOT p2) p1))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT p1))), (G (OR p2 (NOT p1)))]
False Knowledge obtained : [(F (NOT p2)), (F p1)]
Knowledge based reduction with 8 factoid took 134 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND p1 (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 132 ms :[(AND p1 (NOT p2)), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 119 ms :[(AND p1 (NOT p2)), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 10179 reset in 86 ms.
Product exploration explored 100000 steps with 10209 reset in 118 ms.
Support contains 3 out of 51 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 51/51 places, 47/47 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 50 transition count 46
Applied a total of 2 rules in 2 ms. Remains 50 /51 variables (removed 1) and now considering 46/47 (removed 1) transitions.
// Phase 1: matrix 46 rows 50 cols
[2024-05-31 22:13:55] [INFO ] Computed 9 invariants in 0 ms
[2024-05-31 22:13:55] [INFO ] Implicit Places using invariants in 41 ms returned []
[2024-05-31 22:13:55] [INFO ] Invariant cache hit.
[2024-05-31 22:13:55] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:13:55] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 97 ms to find 0 implicit places.
[2024-05-31 22:13:55] [INFO ] Redundant transitions in 0 ms returned []
Running 45 sub problems to find dead transitions.
[2024-05-31 22:13:55] [INFO ] Invariant cache hit.
[2024-05-31 22:13:55] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (OVERLAPS) 46/95 variables, 49/58 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (OVERLAPS) 1/96 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 61 constraints, problems are : Problem set: 0 solved, 45 unsolved in 580 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 50/50 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 45 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/49 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 3 (OVERLAPS) 46/95 variables, 49/58 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/95 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/95 variables, 42/102 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/95 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 1/96 variables, 1/103 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 3/106 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/96 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 45 unsolved
At refinement iteration 10 (OVERLAPS) 0/96 variables, 0/106 constraints. Problems are: Problem set: 0 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 106 constraints, problems are : Problem set: 0 solved, 45 unsolved in 1108 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 50/50 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 0/0 constraints]
After SMT, in 1699ms problems are : Problem set: 0 solved, 45 unsolved
Search for dead transitions found 0 dead transitions in 1699ms
Starting structural reductions in SI_LTL mode, iteration 1 : 50/51 places, 46/47 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1802 ms. Remains : 50/51 places, 46/47 transitions.
Treatment of property DoubleExponent-PT-002-LTLCardinality-05 finished in 6432 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 97/97 transitions.
Graph (complete) has 171 edges and 105 vertex of which 103 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 23 rules applied. Total rules applied 24 place count 102 transition count 72
Reduce places removed 23 places and 0 transitions.
Iterating post reduction 1 with 23 rules applied. Total rules applied 47 place count 79 transition count 72
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 4 Pre rules applied. Total rules applied 47 place count 79 transition count 68
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 55 place count 75 transition count 68
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 0 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 2 with 38 rules applied. Total rules applied 93 place count 56 transition count 49
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 97 place count 54 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 98 place count 53 transition count 48
Applied a total of 98 rules in 9 ms. Remains 53 /105 variables (removed 52) and now considering 48/97 (removed 49) transitions.
// Phase 1: matrix 48 rows 53 cols
[2024-05-31 22:13:57] [INFO ] Computed 10 invariants in 0 ms
[2024-05-31 22:13:57] [INFO ] Implicit Places using invariants in 42 ms returned [38]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 43 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 52/105 places, 48/97 transitions.
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 0 with 4 rules applied. Total rules applied 4 place count 50 transition count 46
Applied a total of 4 rules in 3 ms. Remains 50 /52 variables (removed 2) and now considering 46/48 (removed 2) transitions.
// Phase 1: matrix 46 rows 50 cols
[2024-05-31 22:13:57] [INFO ] Computed 9 invariants in 1 ms
[2024-05-31 22:13:57] [INFO ] Implicit Places using invariants in 42 ms returned []
[2024-05-31 22:13:57] [INFO ] Invariant cache hit.
[2024-05-31 22:13:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-31 22:13:57] [INFO ] Implicit Places using invariants and state equation in 65 ms returned []
Implicit Place search using SMT with State Equation took 107 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 50/105 places, 46/97 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 162 ms. Remains : 50/105 places, 46/97 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-002-LTLCardinality-08
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-002-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-002-LTLCardinality-08 finished in 211 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)&&F(p1))))'
Support contains 3 out of 105 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 105/105 places, 97/97 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 104 transition count 97
Applied a total of 1 rules in 3 ms. Remains 104 /105 variables (removed 1) and now considering 97/97 (removed 0) transitions.
// Phase 1: matrix 97 rows 104 cols
[2024-05-31 22:13:57] [INFO ] Computed 10 invariants in 3 ms
[2024-05-31 22:13:57] [INFO ] Implicit Places using invariants in 51 ms returned [73]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 52 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 103/105 places, 97/97 transitions.
Applied a total of 0 rules in 1 ms. Remains 103 /103 variables (removed 0) and now considering 97/97 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 57 ms. Remains : 103/105 places, 97/97 transitions.
Stuttering acceptance computed with spot in 149 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-002-LTLCardinality-11
Product exploration explored 100000 steps with 50000 reset in 85 ms.
Product exploration explored 100000 steps with 50000 reset in 123 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 167 edges and 103 vertex of which 101 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p0), (X (NOT (AND (NOT p0) p1))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 16 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-002-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-002-LTLCardinality-11 finished in 450 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(G(!p1)||G(F(p2)))))'
[2024-05-31 22:13:58] [INFO ] Flatten gal took : 7 ms
[2024-05-31 22:13:58] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-31 22:13:58] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 105 places, 97 transitions and 268 arcs took 2 ms.
Total runtime 22151 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA DoubleExponent-PT-002-LTLCardinality-05 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717193638778

--------------------
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
mcc2024
ltl formula name DoubleExponent-PT-002-LTLCardinality-05
ltl formula formula --ltl=/tmp/872/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 105 places, 97 transitions and 268 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.010 real 0.010 user 0.000 sys
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/872/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/872/ltl_0_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/872/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/872/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 106 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 106, there are 109 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 3709
pnml2lts-mc( 0/ 4): unique states count: 3709
pnml2lts-mc( 0/ 4): unique transitions count: 4104
pnml2lts-mc( 0/ 4): - self-loop count: 447
pnml2lts-mc( 0/ 4): - claim dead count: 174
pnml2lts-mc( 0/ 4): - claim found count: 0
pnml2lts-mc( 0/ 4): - claim success count: 7304
pnml2lts-mc( 0/ 4): - cum. max stack depth: 3499
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 7304 states 8157 transitions, fanout: 1.117
pnml2lts-mc( 0/ 4): Total exploration time 0.040 sec (0.040 sec minimum, 0.040 sec on average)
pnml2lts-mc( 0/ 4): States per second: 182600, Transitions per second: 203925
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.1MB, 20.6 B/state, compr.: 4.8%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 97 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.1MB (~256.0MB paged-in)

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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