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.r136-tall-171631132800523.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
..................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool itstools
Input is DoubleExponent-PT-001, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631132800523
=====================================================================

--------------------
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 1716384811241

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-001
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-22 13:33:32] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 13:33:32] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 13:33:32] [INFO ] Load time of PNML (sax parser for PT used): 39 ms
[2024-05-22 13:33:32] [INFO ] Transformed 57 places.
[2024-05-22 13:33:32] [INFO ] Transformed 48 transitions.
[2024-05-22 13:33:32] [INFO ] Parsed PT model containing 57 places and 48 transitions and 135 arcs in 123 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 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 13:33:32] [INFO ] Computed 8 invariants in 13 ms
[2024-05-22 13:33:32] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-22 13:33:32] [INFO ] Invariant cache hit.
[2024-05-22 13:33:32] [INFO ] Implicit Places using invariants and state equation in 62 ms returned []
Implicit Place search using SMT with State Equation took 241 ms to find 0 implicit places.
Running 47 sub problems to find dead transitions.
[2024-05-22 13:33:32] [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 13:33:33] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 7 ms to minimize.
[2024-05-22 13:33:33] [INFO ] Deduced a trap composed of 7 places in 17 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 13:33:33] [INFO ] Deduced a trap composed of 16 places in 21 ms of which 2 ms to minimize.
[2024-05-22 13:33:33] [INFO ] Deduced a trap composed of 14 places in 36 ms of which 2 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 1236 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 13:33:34] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 1 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 13:33:35] [INFO ] Deduced a trap composed of 20 places in 26 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 1974 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 3241ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 3252ms
Starting structural reductions in LTL mode, iteration 1 : 56/57 places, 48/48 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3532 ms. Remains : 56/57 places, 48/48 transitions.
Support contains 30 out of 56 places after structural reductions.
[2024-05-22 13:33:36] [INFO ] Flatten gal took : 18 ms
[2024-05-22 13:33:36] [INFO ] Flatten gal took : 8 ms
[2024-05-22 13:33:36] [INFO ] Input system was already deterministic with 48 transitions.
RANDOM walk for 40000 steps (1312 resets) in 1132 ms. (35 steps per ms) remains 10/25 properties
BEST_FIRST walk for 40000 steps (1140 resets) in 503 ms. (79 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1122 resets) in 187 ms. (212 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40002 steps (1150 resets) in 182 ms. (218 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1129 resets) in 142 ms. (279 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40001 steps (1199 resets) in 161 ms. (246 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1143 resets) in 201 ms. (198 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1212 resets) in 155 ms. (256 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1125 resets) in 82 ms. (481 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1133 resets) in 215 ms. (185 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40000 steps (1175 resets) in 141 ms. (281 steps per ms) remains 10/10 properties
[2024-05-22 13:33:37] [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 13:33:37] [INFO ] Deduced a trap composed of 17 places in 24 ms of which 0 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 132 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 13:33:37] [INFO ] Deduced a trap composed of 14 places in 21 ms of which 1 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 96 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 237ms problems are : Problem set: 9 solved, 1 unsolved
Parikh walk visited 0 properties in 15 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.0 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 0 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 24 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 24 ms. Remains : 20/56 places, 16/48 transitions.
RANDOM walk for 40000 steps (4606 resets) in 476 ms. (83 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (3182 resets) in 242 ms. (164 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 8 ms. (steps per millisecond=12 ) 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 1 ms. (steps per millisecond=103 ) 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 13:33:38] [INFO ] Computed 6 invariants in 2 ms
[2024-05-22 13:33:38] [INFO ] Implicit Places using invariants in 40 ms returned [14, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 41 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 13:33:38] [INFO ] Computed 4 invariants in 2 ms
[2024-05-22 13:33:38] [INFO ] Implicit Places using invariants in 30 ms returned []
[2024-05-22 13:33:38] [INFO ] Invariant cache hit.
[2024-05-22 13:33:38] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 83 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 129 ms. Remains : 51/56 places, 47/48 transitions.
Stuttering acceptance computed with spot in 374 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 171 ms.
Product exploration explored 100000 steps with 7692 reset in 122 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.0 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 72 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 116 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 : [(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 87 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 134 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 136 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
[2024-05-22 13:33:39] [INFO ] Invariant cache hit.
[2024-05-22 13:33:39] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 13:33:39] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 8 ms returned sat
[2024-05-22 13:33:39] [INFO ] [Real]Absence check using state equation in 22 ms returned sat
[2024-05-22 13:33:39] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:33:39] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-22 13:33:39] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-22 13:33:39] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-22 13:33:39] [INFO ] Computed and/alt/rep : 46/83/46 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-22 13:33:39] [INFO ] Added : 35 causal constraints over 7 iterations in 54 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 2 ms. Remains 51 /51 variables (removed 0) and now considering 47/47 (removed 0) transitions.
[2024-05-22 13:33:39] [INFO ] Invariant cache hit.
[2024-05-22 13:33:39] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-22 13:33:39] [INFO ] Invariant cache hit.
[2024-05-22 13:33:39] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Running 46 sub problems to find dead transitions.
[2024-05-22 13:33:39] [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 13:33:40] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
[2024-05-22 13:33:40] [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 13:33:40] [INFO ] Deduced a trap composed of 16 places in 25 ms of which 1 ms to minimize.
[2024-05-22 13:33:40] [INFO ] Deduced a trap composed of 14 places in 21 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 944 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 13:33:41] [INFO ] Deduced a trap composed of 20 places in 31 ms of which 0 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 13:33:41] [INFO ] Deduced a trap composed of 28 places in 28 ms of which 0 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 1941 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 2895ms problems are : Problem set: 0 solved, 46 unsolved
Search for dead transitions found 0 dead transitions in 2896ms
Finished structural reductions in LTL mode , in 1 iterations and 2977 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 64 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 150 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 : [(NOT p2)]
False Knowledge obtained : [(F p2)]
Knowledge based reduction with 1 factoid took 70 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 126 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 13:33:43] [INFO ] Invariant cache hit.
[2024-05-22 13:33:43] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-22 13:33:43] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-22 13:33:43] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-22 13:33:43] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:33:43] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-22 13:33:43] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-22 13:33:43] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2024-05-22 13:33:43] [INFO ] Computed and/alt/rep : 46/83/46 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-22 13:33:43] [INFO ] Added : 35 causal constraints over 7 iterations in 50 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 138 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 7692 reset in 57 ms.
Product exploration explored 100000 steps with 7692 reset in 97 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 136 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.0 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 17 ms. Remains 43 /51 variables (removed 8) and now considering 43/47 (removed 4) transitions.
[2024-05-22 13:33:44] [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 13:33:44] [INFO ] Computed 4 invariants in 1 ms
[2024-05-22 13:33:44] [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 13:33:44] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-22 13:33:44] [INFO ] Deduced a trap composed of 4 places in 15 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 13:33:44] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-22 13:33:44] [INFO ] Deduced a trap composed of 7 places in 26 ms of which 1 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 571 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 13:33:45] [INFO ] Deduced a trap composed of 11 places in 30 ms of which 1 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 474 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 1055ms problems are : Problem set: 24 solved, 18 unsolved
Search for dead transitions found 24 dead transitions in 1056ms
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 5 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 1084 ms. Remains : 23/51 places, 19/47 transitions.
Built C files in :
/tmp/ltsmin1091540839230889812
[2024-05-22 13:33:45] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1091540839230889812
Running compilation step : cd /tmp/ltsmin1091540839230889812;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 222 ms.
Running link step : cd /tmp/ltsmin1091540839230889812;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin1091540839230889812;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17773814753984129211.hoa' '--buchi-type=spotba'
LTSmin run took 338 ms.
FORMULA DoubleExponent-PT-001-LTLCardinality-01 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-001-LTLCardinality-01 finished in 7767 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.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 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 0 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 9 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 13:33:45] [INFO ] Computed 6 invariants in 1 ms
[2024-05-22 13:33:45] [INFO ] Implicit Places using invariants in 34 ms returned [7, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 35 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.1 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 1 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 3 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 13:33:45] [INFO ] Computed 4 invariants in 0 ms
[2024-05-22 13:33:45] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-05-22 13:33:45] [INFO ] Invariant cache hit.
[2024-05-22 13:33:46] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 57 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 104 ms. Remains : 21/56 places, 17/48 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-001-LTLCardinality-02
Stuttering criterion allowed to conclude after 5 steps with 0 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 13:33:46] [INFO ] Computed 6 invariants in 1 ms
[2024-05-22 13:33:46] [INFO ] Implicit Places using invariants in 35 ms returned [14, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 36 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 41 ms. Remains : 52/56 places, 48/48 transitions.
Stuttering acceptance computed with spot in 162 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 35 steps with 0 reset in 2 ms.
FORMULA DoubleExponent-PT-001-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-001-LTLCardinality-03 finished in 226 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 2 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 13:33:46] [INFO ] Computed 6 invariants in 0 ms
[2024-05-22 13:33:46] [INFO ] Implicit Places using invariants in 33 ms returned [16]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 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 13:33:46] [INFO ] Computed 5 invariants in 2 ms
[2024-05-22 13:33:46] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-05-22 13:33:46] [INFO ] Invariant cache hit.
[2024-05-22 13:33:46] [INFO ] Implicit Places using invariants and state equation in 39 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 : 51/56 places, 47/48 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 106 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 70 ms.
Product exploration explored 100000 steps with 50000 reset in 72 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.1 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 346 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 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 13:33:46] [INFO ] Computed 6 invariants in 1 ms
[2024-05-22 13:33:46] [INFO ] Implicit Places using invariants in 37 ms returned [14, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 37 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 3 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 13:33:46] [INFO ] Computed 4 invariants in 0 ms
[2024-05-22 13:33:46] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-22 13:33:46] [INFO ] Invariant cache hit.
[2024-05-22 13:33:46] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 63 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 104 ms. Remains : 50/56 places, 47/48 transitions.
Stuttering acceptance computed with spot in 91 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 212 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 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 13:33:46] [INFO ] Computed 6 invariants in 2 ms
[2024-05-22 13:33:46] [INFO ] Implicit Places using invariants in 34 ms returned [14, 16]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 35 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 40 ms. Remains : 51/56 places, 48/48 transitions.
Stuttering acceptance computed with spot in 361 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 16122 reset in 65 ms.
Product exploration explored 100000 steps with 16299 reset in 172 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 125 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 204 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true]
RANDOM walk for 3566 steps (118 resets) in 17 ms. (198 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 187 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 211 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true]
Stuttering acceptance computed with spot in 223 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 13:33:48] [INFO ] Computed 4 invariants in 4 ms
[2024-05-22 13:33:48] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 13:33:48] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-22 13:33:48] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-22 13:33:48] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:33:48] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-22 13:33:48] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 0 ms returned sat
[2024-05-22 13:33:48] [INFO ] [Nat]Absence check using state equation in 16 ms returned sat
[2024-05-22 13:33:48] [INFO ] Deduced a trap composed of 28 places in 25 ms of which 0 ms to minimize.
[2024-05-22 13:33:48] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 33 ms
[2024-05-22 13:33:48] [INFO ] Computed and/alt/rep : 47/84/47 causal constraints (skipped 0 transitions) in 3 ms.
[2024-05-22 13:33:48] [INFO ] Added : 43 causal constraints over 9 iterations in 63 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 3 ms. Remains 51 /51 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2024-05-22 13:33:48] [INFO ] Invariant cache hit.
[2024-05-22 13:33:48] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-22 13:33:48] [INFO ] Invariant cache hit.
[2024-05-22 13:33:48] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Running 47 sub problems to find dead transitions.
[2024-05-22 13:33:48] [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 13:33:48] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 0 ms to minimize.
[2024-05-22 13:33:49] [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 13:33:49] [INFO ] Deduced a trap composed of 16 places in 26 ms of which 1 ms to minimize.
[2024-05-22 13:33:49] [INFO ] Deduced a trap composed of 14 places in 26 ms of which 0 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 846 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 13:33:49] [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 1044 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 1906ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 1907ms
Finished structural reductions in LTL mode , in 1 iterations and 1980 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.2 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 65 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 204 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true]
RANDOM walk for 4628 steps (147 resets) in 17 ms. (257 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 124 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 212 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true]
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true]
[2024-05-22 13:33:51] [INFO ] Invariant cache hit.
[2024-05-22 13:33:51] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 13:33:51] [INFO ] [Real]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-22 13:33:51] [INFO ] [Real]Absence check using state equation in 15 ms returned sat
[2024-05-22 13:33:51] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 13:33:51] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-22 13:33:51] [INFO ] [Nat]Absence check using 2 positive and 2 generalized place invariants in 1 ms returned sat
[2024-05-22 13:33:51] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2024-05-22 13:33:51] [INFO ] Deduced a trap composed of 28 places in 26 ms of which 1 ms to minimize.
[2024-05-22 13:33:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 31 ms
[2024-05-22 13:33:51] [INFO ] Computed and/alt/rep : 47/84/47 causal constraints (skipped 0 transitions) in 2 ms.
[2024-05-22 13:33:51] [INFO ] Added : 43 causal constraints over 9 iterations in 63 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p2), (AND (NOT p1) (NOT p2)), true]
Product exploration explored 100000 steps with 16268 reset in 56 ms.
Product exploration explored 100000 steps with 16266 reset in 114 ms.
Applying partial POR strategy [false, false, false, true, false, true]
Stuttering acceptance computed with spot in 194 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.0 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 16 ms. Remains 43 /51 variables (removed 8) and now considering 42/48 (removed 6) transitions.
[2024-05-22 13:33:52] [INFO ] Redundant transitions in 1 ms returned []
Running 41 sub problems to find dead transitions.
// Phase 1: matrix 42 rows 43 cols
[2024-05-22 13:33:52] [INFO ] Computed 4 invariants in 1 ms
[2024-05-22 13:33:52] [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 13:33:52] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 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 13:33:52] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 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 13:33:52] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 1 ms to minimize.
[2024-05-22 13:33:52] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-22 13:33:52] [INFO ] Deduced a trap composed of 14 places in 22 ms of which 1 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 616 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 13:33:53] [INFO ] Deduced a trap composed of 13 places in 24 ms of which 1 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 699 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 1321ms problems are : Problem set: 15 solved, 26 unsolved
Search for dead transitions found 15 dead transitions in 1321ms
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.0 ms
Discarding 13 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 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 1346 ms. Remains : 30/51 places, 27/48 transitions.
Built C files in :
/tmp/ltsmin7989946930623113268
[2024-05-22 13:33:53] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7989946930623113268
Running compilation step : cd /tmp/ltsmin7989946930623113268;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 126 ms.
Running link step : cd /tmp/ltsmin7989946930623113268;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin7989946930623113268;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7114506116688157751.hoa' '--buchi-type=spotba'
LTSmin run took 236 ms.
FORMULA DoubleExponent-PT-001-LTLCardinality-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-001-LTLCardinality-15 finished in 7262 ms.
All properties solved by simple procedures.
Total runtime 21771 ms.

BK_STOP 1716384834129

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-001"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool itstools"
echo " Input is 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 r136-tall-171631132800523"
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 ;