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.r158-smll-171636265900003.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 EGFr-PT-02010, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r158-smll-171636265900003
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 664K
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 106K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K 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.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.4K Apr 22 14:42 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 22 14:42 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Apr 22 14:42 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K Apr 22 14:42 LTLFireability.xml
-rw-r--r-- 1 mcc users 21K Apr 11 15:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 184K Apr 11 15:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 21K Apr 11 15:27 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 79K Apr 11 15:27 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Apr 22 14:42 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Apr 22 14:42 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 59K 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 EGFr-PT-02010-LTLCardinality-00
FORMULA_NAME EGFr-PT-02010-LTLCardinality-01
FORMULA_NAME EGFr-PT-02010-LTLCardinality-02
FORMULA_NAME EGFr-PT-02010-LTLCardinality-03
FORMULA_NAME EGFr-PT-02010-LTLCardinality-04
FORMULA_NAME EGFr-PT-02010-LTLCardinality-05
FORMULA_NAME EGFr-PT-02010-LTLCardinality-06
FORMULA_NAME EGFr-PT-02010-LTLCardinality-07
FORMULA_NAME EGFr-PT-02010-LTLCardinality-08
FORMULA_NAME EGFr-PT-02010-LTLCardinality-09
FORMULA_NAME EGFr-PT-02010-LTLCardinality-10
FORMULA_NAME EGFr-PT-02010-LTLCardinality-11
FORMULA_NAME EGFr-PT-02010-LTLCardinality-12
FORMULA_NAME EGFr-PT-02010-LTLCardinality-13
FORMULA_NAME EGFr-PT-02010-LTLCardinality-14
FORMULA_NAME EGFr-PT-02010-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716402893955

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EGFr-PT-02010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-22 18:34:56] [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 18:34:56] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 18:34:57] [INFO ] Load time of PNML (sax parser for PT used): 118 ms
[2024-05-22 18:34:57] [INFO ] Transformed 40 places.
[2024-05-22 18:34:57] [INFO ] Transformed 68 transitions.
[2024-05-22 18:34:57] [INFO ] Found NUPN structural information;
[2024-05-22 18:34:57] [INFO ] Parsed PT model containing 40 places and 68 transitions and 338 arcs in 362 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 28 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA EGFr-PT-02010-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 68/68 transitions.
Applied a total of 0 rules in 14 ms. Remains 40 /40 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2024-05-22 18:34:57] [INFO ] Flow matrix only has 39 transitions (discarded 29 similar events)
// Phase 1: matrix 39 rows 40 cols
[2024-05-22 18:34:57] [INFO ] Computed 20 invariants in 5 ms
[2024-05-22 18:34:57] [INFO ] Implicit Places using invariants in 402 ms returned []
[2024-05-22 18:34:57] [INFO ] Flow matrix only has 39 transitions (discarded 29 similar events)
[2024-05-22 18:34:57] [INFO ] Invariant cache hit.
[2024-05-22 18:34:58] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-22 18:34:58] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 636 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2024-05-22 18:34:58] [INFO ] Flow matrix only has 39 transitions (discarded 29 similar events)
[2024-05-22 18:34:58] [INFO ] Invariant cache hit.
[2024-05-22 18:34:58] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 65 unsolved
[2024-05-22 18:34:59] [INFO ] Deduced a trap composed of 2 places in 189 ms of which 38 ms to minimize.
[2024-05-22 18:34:59] [INFO ] Deduced a trap composed of 2 places in 67 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
[2024-05-22 18:34:59] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 13 ms to minimize.
Problem TDEAD12 is UNSAT
[2024-05-22 18:34:59] [INFO ] Deduced a trap composed of 2 places in 59 ms of which 2 ms to minimize.
Problem TDEAD13 is UNSAT
[2024-05-22 18:34:59] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD25 is UNSAT
[2024-05-22 18:34:59] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 6/66 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/66 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 39/79 variables, 40/106 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 19/125 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/125 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/79 variables, 0/125 constraints. Problems are: Problem set: 9 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/79 variables, and 125 constraints, problems are : Problem set: 9 solved, 56 unsolved in 2520 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 6/6 constraints]
Escalating to Integer solving :Problem set: 9 solved, 56 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 19/58 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 6/64 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/64 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 1/40 variables, 1/65 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 1/66 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/66 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 39/79 variables, 40/106 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 19/125 constraints. Problems are: Problem set: 9 solved, 56 unsolved
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 56/181 constraints. Problems are: Problem set: 15 solved, 50 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 0/181 constraints. Problems are: Problem set: 15 solved, 50 unsolved
At refinement iteration 11 (OVERLAPS) 0/79 variables, 0/181 constraints. Problems are: Problem set: 15 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/79 variables, and 181 constraints, problems are : Problem set: 15 solved, 50 unsolved in 1518 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 56/65 constraints, Known Traps: 6/6 constraints]
After SMT, in 4195ms problems are : Problem set: 15 solved, 50 unsolved
Search for dead transitions found 15 dead transitions in 4226ms
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 LTL mode, iteration 1 : 40/40 places, 53/68 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4914 ms. Remains : 40/40 places, 53/68 transitions.
Support contains 21 out of 40 places after structural reductions.
[2024-05-22 18:35:02] [INFO ] Flatten gal took : 42 ms
[2024-05-22 18:35:02] [INFO ] Flatten gal took : 23 ms
[2024-05-22 18:35:02] [INFO ] Input system was already deterministic with 53 transitions.
Support contains 18 out of 40 places (down from 21) after GAL structural reductions.
RANDOM walk for 40000 steps (1796 resets) in 1992 ms. (20 steps per ms) remains 2/13 properties
BEST_FIRST walk for 40002 steps (406 resets) in 263 ms. (151 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (413 resets) in 146 ms. (272 steps per ms) remains 2/2 properties
[2024-05-22 18:35:03] [INFO ] Flow matrix only has 33 transitions (discarded 20 similar events)
// Phase 1: matrix 33 rows 40 cols
[2024-05-22 18:35:03] [INFO ] Computed 20 invariants in 1 ms
[2024-05-22 18:35:03] [INFO ] State equation strengthened by 19 read => feed constraints.
Problem AtomicPropp10 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/3 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 3/6 variables, 3/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 3/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/9 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 5/11 variables, 6/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/11 variables, 0/15 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 10/21 variables, 9/24 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/21 variables, 3/27 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/21 variables, 0/27 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 24/45 variables, 20/47 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/45 variables, 20/67 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/45 variables, 10/77 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/45 variables, 0/77 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/50 variables, 5/82 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/50 variables, 0/82 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 15/65 variables, 10/92 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/65 variables, 10/102 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/65 variables, 5/107 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/65 variables, 0/107 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 2/67 variables, 2/109 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/67 variables, 0/109 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 6/73 variables, 4/113 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/73 variables, 4/117 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/73 variables, 2/119 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/73 variables, 0/119 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 26 (OVERLAPS) 0/73 variables, 0/119 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 119 constraints, problems are : Problem set: 1 solved, 1 unsolved in 119 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 19/19 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/2 variables, 2/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/4 variables, 2/4 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 2/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 3/7 variables, 4/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/7 variables, 0/10 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 9/16 variables, 6/16 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/16 variables, 4/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/16 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 21/37 variables, 18/38 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/37 variables, 18/56 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/37 variables, 9/65 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/37 variables, 1/66 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/37 variables, 0/66 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/41 variables, 4/70 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/41 variables, 0/70 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 12/53 variables, 8/78 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/53 variables, 8/86 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/53 variables, 4/90 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/53 variables, 0/90 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 3/56 variables, 3/93 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/56 variables, 0/93 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 9/65 variables, 6/99 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/65 variables, 6/105 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/65 variables, 3/108 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/65 variables, 0/108 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 2/67 variables, 2/110 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 28 (INCLUDED_ONLY) 0/67 variables, 0/110 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 29 (OVERLAPS) 6/73 variables, 4/114 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 30 (INCLUDED_ONLY) 0/73 variables, 4/118 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 31 (INCLUDED_ONLY) 0/73 variables, 2/120 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 32 (INCLUDED_ONLY) 0/73 variables, 0/120 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 33 (OVERLAPS) 0/73 variables, 0/120 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/73 variables, and 120 constraints, problems are : Problem set: 1 solved, 1 unsolved in 150 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 282ms problems are : Problem set: 1 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 53/53 transitions.
Graph (complete) has 116 edges and 40 vertex of which 22 are kept as prefixes of interest. Removing 18 places using SCC suffix rule.2 ms
Discarding 18 places :
Also discarding 15 output transitions
Drop transitions (Output transitions of discarded places.) removed 15 transitions
Drop transitions (Empty/Sink Transition effects.) removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 22 transition count 26
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 21 transition count 24
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 21 transition count 24
Applied a total of 15 rules in 33 ms. Remains 21 /40 variables (removed 19) and now considering 24/53 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 21/40 places, 24/53 transitions.
RANDOM walk for 40000 steps (3368 resets) in 313 ms. (127 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (983 resets) in 122 ms. (325 steps per ms) remains 1/1 properties
Probably explored full state space saw : 168 states, properties seen :0
Probabilistic random walk after 681 steps, saw 168 distinct states, run finished after 29 ms. (steps per millisecond=23 ) properties seen :0
Explored full state space saw : 168 states, properties seen :0
Exhaustive walk after 681 steps, saw 168 distinct states, run finished after 3 ms. (steps per millisecond=227 ) properties seen :0
FORMULA EGFr-PT-02010-LTLCardinality-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA EGFr-PT-02010-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 7 simplifications.
FORMULA EGFr-PT-02010-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 14 stabilizing places and 7 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 39 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 39 transition count 51
Applied a total of 2 rules in 3 ms. Remains 39 /40 variables (removed 1) and now considering 51/53 (removed 2) transitions.
[2024-05-22 18:35:04] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 39 cols
[2024-05-22 18:35:04] [INFO ] Computed 19 invariants in 3 ms
[2024-05-22 18:35:04] [INFO ] Implicit Places using invariants in 103 ms returned []
[2024-05-22 18:35:04] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-22 18:35:04] [INFO ] Invariant cache hit.
[2024-05-22 18:35:04] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-22 18:35:04] [INFO ] Implicit Places using invariants and state equation in 116 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Running 48 sub problems to find dead transitions.
[2024-05-22 18:35:04] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-22 18:35:04] [INFO ] Invariant cache hit.
[2024-05-22 18:35:04] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-22 18:35:04] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-22 18:35:04] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 2 ms to minimize.
[2024-05-22 18:35:04] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 0 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-22 18:35:04] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-22 18:35:04] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-22 18:35:04] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-05-22 18:35:04] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 7/25 constraints. Problems are: Problem set: 1 solved, 47 unsolved
[2024-05-22 18:35:05] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-22 18:35:05] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
[2024-05-22 18:35:05] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 3/28 constraints. Problems are: Problem set: 1 solved, 47 unsolved
[2024-05-22 18:35:05] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-22 18:35:05] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 2/30 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 1/39 variables, 1/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 33/72 variables, 39/70 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 19/89 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 0/89 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 0/72 variables, 0/89 constraints. Problems are: Problem set: 1 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 89 constraints, problems are : Problem set: 1 solved, 47 unsolved in 1558 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 39/39 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 1 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 18/18 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 12/30 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 1/39 variables, 1/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 33/72 variables, 39/70 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 19/89 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 47/136 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/72 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 136 constraints, problems are : Problem set: 1 solved, 47 unsolved in 991 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 39/39 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 47/48 constraints, Known Traps: 12/12 constraints]
After SMT, in 2579ms problems are : Problem set: 1 solved, 47 unsolved
Search for dead transitions found 1 dead transitions in 2586ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 39/40 places, 50/53 transitions.
Applied a total of 0 rules in 3 ms. Remains 39 /39 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2820 ms. Remains : 39/40 places, 50/53 transitions.
Stuttering acceptance computed with spot in 379 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : EGFr-PT-02010-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA EGFr-PT-02010-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EGFr-PT-02010-LTLCardinality-02 finished in 3303 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(p0))))'
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 39 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 39 transition count 51
Applied a total of 2 rules in 3 ms. Remains 39 /40 variables (removed 1) and now considering 51/53 (removed 2) transitions.
[2024-05-22 18:35:07] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-22 18:35:07] [INFO ] Invariant cache hit.
[2024-05-22 18:35:07] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-22 18:35:07] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-22 18:35:07] [INFO ] Invariant cache hit.
[2024-05-22 18:35:07] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-22 18:35:07] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
Running 48 sub problems to find dead transitions.
[2024-05-22 18:35:07] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-22 18:35:07] [INFO ] Invariant cache hit.
[2024-05-22 18:35:07] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-22 18:35:08] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 2 ms to minimize.
[2024-05-22 18:35:08] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-22 18:35:08] [INFO ] Deduced a trap composed of 5 places in 46 ms of which 6 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-22 18:35:08] [INFO ] Deduced a trap composed of 5 places in 34 ms of which 1 ms to minimize.
[2024-05-22 18:35:08] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-05-22 18:35:08] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-05-22 18:35:08] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 7/25 constraints. Problems are: Problem set: 1 solved, 47 unsolved
[2024-05-22 18:35:08] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-22 18:35:08] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
[2024-05-22 18:35:08] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 3/28 constraints. Problems are: Problem set: 1 solved, 47 unsolved
[2024-05-22 18:35:08] [INFO ] Deduced a trap composed of 5 places in 20 ms of which 0 ms to minimize.
[2024-05-22 18:35:08] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 0 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 2/30 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 1/39 variables, 1/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 33/72 variables, 39/70 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 19/89 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 0/89 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 0/72 variables, 0/89 constraints. Problems are: Problem set: 1 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 89 constraints, problems are : Problem set: 1 solved, 47 unsolved in 1842 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 39/39 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 1 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 18/18 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 12/30 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 1/39 variables, 1/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 33/72 variables, 39/70 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 19/89 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 47/136 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/72 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 136 constraints, problems are : Problem set: 1 solved, 47 unsolved in 1057 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 39/39 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 47/48 constraints, Known Traps: 12/12 constraints]
After SMT, in 2921ms problems are : Problem set: 1 solved, 47 unsolved
Search for dead transitions found 1 dead transitions in 2924ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 39/40 places, 50/53 transitions.
Applied a total of 0 rules in 2 ms. Remains 39 /39 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3272 ms. Remains : 39/40 places, 50/53 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : EGFr-PT-02010-LTLCardinality-04
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 1 ms.
FORMULA EGFr-PT-02010-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EGFr-PT-02010-LTLCardinality-04 finished in 3434 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||G((p1||X(p2))))))'
Support contains 5 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 39 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 39 transition count 51
Applied a total of 2 rules in 3 ms. Remains 39 /40 variables (removed 1) and now considering 51/53 (removed 2) transitions.
[2024-05-22 18:35:11] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-22 18:35:11] [INFO ] Invariant cache hit.
[2024-05-22 18:35:11] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-22 18:35:11] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-22 18:35:11] [INFO ] Invariant cache hit.
[2024-05-22 18:35:11] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-22 18:35:11] [INFO ] Implicit Places using invariants and state equation in 110 ms returned []
Implicit Place search using SMT with State Equation took 180 ms to find 0 implicit places.
Running 48 sub problems to find dead transitions.
[2024-05-22 18:35:11] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-22 18:35:11] [INFO ] Invariant cache hit.
[2024-05-22 18:35:11] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-22 18:35:11] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-22 18:35:11] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
[2024-05-22 18:35:11] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-22 18:35:11] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 1 ms to minimize.
[2024-05-22 18:35:11] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 6 ms to minimize.
[2024-05-22 18:35:11] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-22 18:35:11] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 7/25 constraints. Problems are: Problem set: 1 solved, 47 unsolved
[2024-05-22 18:35:11] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-22 18:35:11] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 0 ms to minimize.
[2024-05-22 18:35:11] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 3/28 constraints. Problems are: Problem set: 1 solved, 47 unsolved
[2024-05-22 18:35:11] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-22 18:35:11] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 2/30 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 1/39 variables, 1/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 33/72 variables, 39/70 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 19/89 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 0/89 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 0/72 variables, 0/89 constraints. Problems are: Problem set: 1 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 89 constraints, problems are : Problem set: 1 solved, 47 unsolved in 1812 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 39/39 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 1 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 18/18 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 12/30 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 1/39 variables, 1/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 33/72 variables, 39/70 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 19/89 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 47/136 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/72 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 136 constraints, problems are : Problem set: 1 solved, 47 unsolved in 1014 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 39/39 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 47/48 constraints, Known Traps: 12/12 constraints]
After SMT, in 2840ms problems are : Problem set: 1 solved, 47 unsolved
Search for dead transitions found 1 dead transitions in 2841ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 39/40 places, 50/53 transitions.
Applied a total of 0 rules in 4 ms. Remains 39 /39 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3028 ms. Remains : 39/40 places, 50/53 transitions.
Stuttering acceptance computed with spot in 444 ms :[true, (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : EGFr-PT-02010-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 125 steps with 5 reset in 4 ms.
FORMULA EGFr-PT-02010-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EGFr-PT-02010-LTLCardinality-05 finished in 3498 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||X((p1||G(p0)))))||F(p0)))'
Support contains 4 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 39 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 39 transition count 51
Applied a total of 2 rules in 3 ms. Remains 39 /40 variables (removed 1) and now considering 51/53 (removed 2) transitions.
[2024-05-22 18:35:14] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-22 18:35:14] [INFO ] Invariant cache hit.
[2024-05-22 18:35:14] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-05-22 18:35:14] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-22 18:35:14] [INFO ] Invariant cache hit.
[2024-05-22 18:35:14] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-22 18:35:14] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
Running 48 sub problems to find dead transitions.
[2024-05-22 18:35:14] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-22 18:35:14] [INFO ] Invariant cache hit.
[2024-05-22 18:35:14] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-22 18:35:15] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
[2024-05-22 18:35:15] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-22 18:35:15] [INFO ] Deduced a trap composed of 5 places in 37 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-22 18:35:15] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-22 18:35:15] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-05-22 18:35:15] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-22 18:35:15] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 7/25 constraints. Problems are: Problem set: 1 solved, 47 unsolved
[2024-05-22 18:35:15] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 1 ms to minimize.
[2024-05-22 18:35:15] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-22 18:35:15] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 3/28 constraints. Problems are: Problem set: 1 solved, 47 unsolved
[2024-05-22 18:35:15] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 0 ms to minimize.
[2024-05-22 18:35:15] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 2/30 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 1/39 variables, 1/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 33/72 variables, 39/70 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 19/89 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 0/89 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 0/72 variables, 0/89 constraints. Problems are: Problem set: 1 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 89 constraints, problems are : Problem set: 1 solved, 47 unsolved in 1886 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 39/39 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 1 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 18/18 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 12/30 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 1/39 variables, 1/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 33/72 variables, 39/70 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 19/89 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 47/136 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/72 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 136 constraints, problems are : Problem set: 1 solved, 47 unsolved in 1099 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 39/39 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 47/48 constraints, Known Traps: 12/12 constraints]
After SMT, in 3005ms problems are : Problem set: 1 solved, 47 unsolved
Search for dead transitions found 1 dead transitions in 3008ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 39/40 places, 50/53 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3277 ms. Remains : 39/40 places, 50/53 transitions.
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : EGFr-PT-02010-LTLCardinality-06
Product exploration explored 100000 steps with 9991 reset in 536 ms.
Product exploration explored 100000 steps with 9916 reset in 462 ms.
Computed a total of 15 stabilizing places and 11 stable transitions
Computed a total of 15 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 533 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 256 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 472 steps (20 resets) in 12 ms. (36 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p0), (F (NOT (OR p0 p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 3 factoid took 720 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 256 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 266 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 4 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 50/50 transitions.
Applied a total of 0 rules in 7 ms. Remains 39 /39 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2024-05-22 18:35:21] [INFO ] Flow matrix only has 32 transitions (discarded 18 similar events)
// Phase 1: matrix 32 rows 39 cols
[2024-05-22 18:35:21] [INFO ] Computed 19 invariants in 2 ms
[2024-05-22 18:35:21] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-05-22 18:35:21] [INFO ] Flow matrix only has 32 transitions (discarded 18 similar events)
[2024-05-22 18:35:21] [INFO ] Invariant cache hit.
[2024-05-22 18:35:21] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-22 18:35:21] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2024-05-22 18:35:21] [INFO ] Redundant transitions in 1 ms returned []
Running 47 sub problems to find dead transitions.
[2024-05-22 18:35:21] [INFO ] Flow matrix only has 32 transitions (discarded 18 similar events)
[2024-05-22 18:35:21] [INFO ] Invariant cache hit.
[2024-05-22 18:35:21] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-05-22 18:35:21] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-22 18:35:21] [INFO ] Deduced a trap composed of 7 places in 25 ms of which 1 ms to minimize.
[2024-05-22 18:35:21] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-22 18:35:21] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-05-22 18:35:21] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-22 18:35:21] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-05-22 18:35:21] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-22 18:35:21] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-05-22 18:35:21] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 9/27 constraints. Problems are: Problem set: 0 solved, 47 unsolved
[2024-05-22 18:35:22] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 1/28 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (OVERLAPS) 1/39 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (OVERLAPS) 32/71 variables, 39/68 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 19/87 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/71 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 71/71 variables, and 87 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1596 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 39/39 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 1/39 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 32/71 variables, 39/68 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 19/87 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 47/134 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/71 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 71/71 variables, and 134 constraints, problems are : Problem set: 0 solved, 47 unsolved in 1185 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 39/39 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 10/10 constraints]
After SMT, in 2802ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 2804ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3102 ms. Remains : 39/39 places, 50/50 transitions.
Computed a total of 15 stabilizing places and 11 stable transitions
Computed a total of 15 stabilizing places and 11 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 614 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 372 steps (15 resets) in 8 ms. (41 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p0)))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p0), (F (NOT (OR p1 (NOT p0)))), (F (NOT p1)), (F (NOT (OR p1 p0))), (F (NOT (AND p1 (NOT p0)))), (F (NOT (OR (NOT p1) (NOT p0))))]
Knowledge based reduction with 7 factoid took 771 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 286 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 9934 reset in 272 ms.
Product exploration explored 100000 steps with 10020 reset in 281 ms.
Built C files in :
/tmp/ltsmin16989495628825862624
[2024-05-22 18:35:27] [INFO ] Computing symmetric may disable matrix : 50 transitions.
[2024-05-22 18:35:27] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 18:35:27] [INFO ] Computing symmetric may enable matrix : 50 transitions.
[2024-05-22 18:35:27] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 18:35:27] [INFO ] Computing Do-Not-Accords matrix : 50 transitions.
[2024-05-22 18:35:27] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 18:35:27] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16989495628825862624
Running compilation step : cd /tmp/ltsmin16989495628825862624;'/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 697 ms.
Running link step : cd /tmp/ltsmin16989495628825862624;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 76 ms.
Running LTSmin : cd /tmp/ltsmin16989495628825862624;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202405141337/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6692521111508456929.hoa' '--buchi-type=spotba'
LTSmin run took 338 ms.
FORMULA EGFr-PT-02010-LTLCardinality-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property EGFr-PT-02010-LTLCardinality-06 finished in 13919 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(p0))))'
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 53/53 (removed 0) transitions.
[2024-05-22 18:35:28] [INFO ] Flow matrix only has 33 transitions (discarded 20 similar events)
// Phase 1: matrix 33 rows 40 cols
[2024-05-22 18:35:28] [INFO ] Computed 20 invariants in 1 ms
[2024-05-22 18:35:28] [INFO ] Implicit Places using invariants in 97 ms returned []
[2024-05-22 18:35:28] [INFO ] Flow matrix only has 33 transitions (discarded 20 similar events)
[2024-05-22 18:35:28] [INFO ] Invariant cache hit.
[2024-05-22 18:35:28] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-22 18:35:28] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 280 ms to find 0 implicit places.
Running 50 sub problems to find dead transitions.
[2024-05-22 18:35:28] [INFO ] Flow matrix only has 33 transitions (discarded 20 similar events)
[2024-05-22 18:35:28] [INFO ] Invariant cache hit.
[2024-05-22 18:35:28] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 50 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 19/58 constraints. Problems are: Problem set: 0 solved, 50 unsolved
[2024-05-22 18:35:29] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
[2024-05-22 18:35:29] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-22 18:35:29] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 0 ms to minimize.
[2024-05-22 18:35:29] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
Problem TDEAD5 is UNSAT
[2024-05-22 18:35:29] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-05-22 18:35:29] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
[2024-05-22 18:35:29] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 7/65 constraints. Problems are: Problem set: 1 solved, 49 unsolved
[2024-05-22 18:35:29] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 4 ms to minimize.
[2024-05-22 18:35:29] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
[2024-05-22 18:35:29] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 3 ms to minimize.
[2024-05-22 18:35:29] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-22 18:35:29] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-22 18:35:29] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-22 18:35:29] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 7/72 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 5 (OVERLAPS) 1/40 variables, 1/73 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 1/74 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/74 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 8 (OVERLAPS) 33/73 variables, 40/114 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/73 variables, 19/133 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 0/133 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 11 (OVERLAPS) 0/73 variables, 0/133 constraints. Problems are: Problem set: 1 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 133 constraints, problems are : Problem set: 1 solved, 49 unsolved in 2128 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 50/50 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 1 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 19/58 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 14/72 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/72 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 1/40 variables, 1/73 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 1/74 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/74 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 33/73 variables, 40/114 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/73 variables, 19/133 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/73 variables, 49/182 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/73 variables, 0/182 constraints. Problems are: Problem set: 1 solved, 49 unsolved
At refinement iteration 11 (OVERLAPS) 0/73 variables, 0/182 constraints. Problems are: Problem set: 1 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/73 variables, and 182 constraints, problems are : Problem set: 1 solved, 49 unsolved in 1343 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 49/50 constraints, Known Traps: 14/14 constraints]
After SMT, in 3502ms problems are : Problem set: 1 solved, 49 unsolved
Search for dead transitions found 1 dead transitions in 3505ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 40/40 places, 52/53 transitions.
Applied a total of 0 rules in 2 ms. Remains 40 /40 variables (removed 0) and now considering 52/52 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 3790 ms. Remains : 40/40 places, 52/53 transitions.
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : EGFr-PT-02010-LTLCardinality-10
Product exploration explored 100000 steps with 7736 reset in 247 ms.
Product exploration explored 100000 steps with 7718 reset in 268 ms.
Computed a total of 16 stabilizing places and 12 stable transitions
Computed a total of 16 stabilizing places and 12 stable transitions
Detected a total of 16/40 stabilizing places and 12/52 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 48 steps (0 resets) in 5 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-22 18:35:33] [INFO ] Flow matrix only has 32 transitions (discarded 20 similar events)
// Phase 1: matrix 32 rows 40 cols
[2024-05-22 18:35:33] [INFO ] Computed 20 invariants in 1 ms
[2024-05-22 18:35:33] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2024-05-22 18:35:33] [INFO ] [Real]Absence check using state equation in 26 ms returned sat
[2024-05-22 18:35:33] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-22 18:35:33] [INFO ] [Real]Added 19 Read/Feed constraints in 6 ms returned sat
[2024-05-22 18:35:33] [INFO ] Computed and/alt/rep : 49/63/29 causal constraints (skipped 0 transitions) in 10 ms.
[2024-05-22 18:35:33] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 18:35:33] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2024-05-22 18:35:33] [INFO ] [Nat]Absence check using state equation in 27 ms returned sat
[2024-05-22 18:35:33] [INFO ] [Nat]Added 19 Read/Feed constraints in 5 ms returned sat
[2024-05-22 18:35:33] [INFO ] Computed and/alt/rep : 49/63/29 causal constraints (skipped 0 transitions) in 5 ms.
[2024-05-22 18:35:34] [INFO ] Added : 17 causal constraints over 4 iterations in 44 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 52/52 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2024-05-22 18:35:34] [INFO ] Flow matrix only has 32 transitions (discarded 20 similar events)
[2024-05-22 18:35:34] [INFO ] Invariant cache hit.
[2024-05-22 18:35:34] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-05-22 18:35:34] [INFO ] Flow matrix only has 32 transitions (discarded 20 similar events)
[2024-05-22 18:35:34] [INFO ] Invariant cache hit.
[2024-05-22 18:35:34] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-22 18:35:34] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 271 ms to find 0 implicit places.
Running 49 sub problems to find dead transitions.
[2024-05-22 18:35:34] [INFO ] Flow matrix only has 32 transitions (discarded 20 similar events)
[2024-05-22 18:35:34] [INFO ] Invariant cache hit.
[2024-05-22 18:35:34] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 19/58 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-05-22 18:35:34] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
[2024-05-22 18:35:34] [INFO ] Deduced a trap composed of 7 places in 28 ms of which 1 ms to minimize.
[2024-05-22 18:35:34] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-22 18:35:34] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
[2024-05-22 18:35:34] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
[2024-05-22 18:35:34] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-22 18:35:34] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-22 18:35:34] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
[2024-05-22 18:35:34] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
[2024-05-22 18:35:34] [INFO ] Deduced a trap composed of 6 places in 33 ms of which 1 ms to minimize.
[2024-05-22 18:35:34] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
[2024-05-22 18:35:35] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 12/70 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-05-22 18:35:35] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-05-22 18:35:35] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 1/40 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (OVERLAPS) 32/72 variables, 40/114 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 19/133 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/72 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 12 (OVERLAPS) 0/72 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 133 constraints, problems are : Problem set: 0 solved, 49 unsolved in 2187 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 19/58 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 1/40 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 32/72 variables, 40/114 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 19/133 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 49/182 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 11 (OVERLAPS) 0/72 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 182 constraints, problems are : Problem set: 0 solved, 49 unsolved in 1339 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 14/14 constraints]
After SMT, in 3547ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 3551ms
Finished structural reductions in LTL mode , in 1 iterations and 3824 ms. Remains : 40/40 places, 52/52 transitions.
Computed a total of 16 stabilizing places and 12 stable transitions
Computed a total of 16 stabilizing places and 12 stable transitions
Detected a total of 16/40 stabilizing places and 12/52 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 97 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 41 steps (0 resets) in 4 ms. (8 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 155 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2024-05-22 18:35:38] [INFO ] Flow matrix only has 32 transitions (discarded 20 similar events)
[2024-05-22 18:35:38] [INFO ] Invariant cache hit.
[2024-05-22 18:35:38] [INFO ] [Real]Absence check using 20 positive place invariants in 9 ms returned sat
[2024-05-22 18:35:38] [INFO ] [Real]Absence check using state equation in 27 ms returned sat
[2024-05-22 18:35:38] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-22 18:35:38] [INFO ] [Real]Added 19 Read/Feed constraints in 6 ms returned sat
[2024-05-22 18:35:38] [INFO ] Computed and/alt/rep : 49/63/29 causal constraints (skipped 0 transitions) in 4 ms.
[2024-05-22 18:35:38] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 18:35:38] [INFO ] [Nat]Absence check using 20 positive place invariants in 9 ms returned sat
[2024-05-22 18:35:38] [INFO ] [Nat]Absence check using state equation in 28 ms returned sat
[2024-05-22 18:35:38] [INFO ] [Nat]Added 19 Read/Feed constraints in 6 ms returned sat
[2024-05-22 18:35:38] [INFO ] Computed and/alt/rep : 49/63/29 causal constraints (skipped 0 transitions) in 6 ms.
[2024-05-22 18:35:38] [INFO ] Added : 17 causal constraints over 4 iterations in 42 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7758 reset in 240 ms.
Product exploration explored 100000 steps with 7750 reset in 268 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 154 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 52/52 transitions.
Applied a total of 0 rules in 6 ms. Remains 40 /40 variables (removed 0) and now considering 52/52 (removed 0) transitions.
[2024-05-22 18:35:40] [INFO ] Redundant transitions in 1 ms returned []
Running 49 sub problems to find dead transitions.
[2024-05-22 18:35:40] [INFO ] Flow matrix only has 32 transitions (discarded 20 similar events)
[2024-05-22 18:35:40] [INFO ] Invariant cache hit.
[2024-05-22 18:35:40] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 19/58 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-05-22 18:35:40] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
[2024-05-22 18:35:40] [INFO ] Deduced a trap composed of 7 places in 30 ms of which 1 ms to minimize.
[2024-05-22 18:35:40] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-22 18:35:40] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-22 18:35:40] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 0 ms to minimize.
[2024-05-22 18:35:40] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-22 18:35:40] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 1 ms to minimize.
[2024-05-22 18:35:40] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 1 ms to minimize.
[2024-05-22 18:35:40] [INFO ] Deduced a trap composed of 5 places in 26 ms of which 2 ms to minimize.
[2024-05-22 18:35:40] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 1 ms to minimize.
[2024-05-22 18:35:40] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
[2024-05-22 18:35:40] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 12/70 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-05-22 18:35:40] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 1/71 constraints. Problems are: Problem set: 0 solved, 49 unsolved
[2024-05-22 18:35:41] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 1/72 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/39 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (OVERLAPS) 1/40 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (OVERLAPS) 32/72 variables, 40/114 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 19/133 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/72 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 12 (OVERLAPS) 0/72 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 133 constraints, problems are : Problem set: 0 solved, 49 unsolved in 2485 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 49 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 19/58 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 14/72 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 4 (OVERLAPS) 1/40 variables, 1/73 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 1/74 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 7 (OVERLAPS) 32/72 variables, 40/114 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 19/133 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 49/182 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/72 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 49 unsolved
At refinement iteration 11 (OVERLAPS) 0/72 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 49 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 182 constraints, problems are : Problem set: 0 solved, 49 unsolved in 1208 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 49/49 constraints, Known Traps: 14/14 constraints]
After SMT, in 3716ms problems are : Problem set: 0 solved, 49 unsolved
Search for dead transitions found 0 dead transitions in 3719ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3734 ms. Remains : 40/40 places, 52/52 transitions.
Built C files in :
/tmp/ltsmin6645516002371246804
[2024-05-22 18:35:43] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6645516002371246804
Running compilation step : cd /tmp/ltsmin6645516002371246804;'/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 326 ms.
Running link step : cd /tmp/ltsmin6645516002371246804;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin6645516002371246804;'/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/stateBased3491988023484947104.hoa' '--buchi-type=spotba'
LTSmin run took 233 ms.
FORMULA EGFr-PT-02010-LTLCardinality-10 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property EGFr-PT-02010-LTLCardinality-10 finished in 16032 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(p0)))'
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 39 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 39 transition count 51
Applied a total of 2 rules in 2 ms. Remains 39 /40 variables (removed 1) and now considering 51/53 (removed 2) transitions.
[2024-05-22 18:35:44] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 39 cols
[2024-05-22 18:35:44] [INFO ] Computed 19 invariants in 1 ms
[2024-05-22 18:35:44] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-22 18:35:44] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-22 18:35:44] [INFO ] Invariant cache hit.
[2024-05-22 18:35:44] [INFO ] State equation strengthened by 19 read => feed constraints.
[2024-05-22 18:35:44] [INFO ] Implicit Places using invariants and state equation in 106 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
Running 48 sub problems to find dead transitions.
[2024-05-22 18:35:44] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2024-05-22 18:35:44] [INFO ] Invariant cache hit.
[2024-05-22 18:35:44] [INFO ] State equation strengthened by 19 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
[2024-05-22 18:35:44] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
[2024-05-22 18:35:44] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
[2024-05-22 18:35:44] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 1 ms to minimize.
Problem TDEAD4 is UNSAT
[2024-05-22 18:35:44] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 1 ms to minimize.
[2024-05-22 18:35:45] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
[2024-05-22 18:35:45] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
[2024-05-22 18:35:45] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 7/25 constraints. Problems are: Problem set: 1 solved, 47 unsolved
[2024-05-22 18:35:45] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 1 ms to minimize.
[2024-05-22 18:35:45] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
[2024-05-22 18:35:45] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 3/28 constraints. Problems are: Problem set: 1 solved, 47 unsolved
[2024-05-22 18:35:45] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 1 ms to minimize.
[2024-05-22 18:35:45] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 2/30 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 1/39 variables, 1/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 33/72 variables, 39/70 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 19/89 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 0/89 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 0/72 variables, 0/89 constraints. Problems are: Problem set: 1 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 89 constraints, problems are : Problem set: 1 solved, 47 unsolved in 1567 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 39/39 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 12/12 constraints]
Escalating to Integer solving :Problem set: 1 solved, 47 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 18/18 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 12/30 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/30 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 1/39 variables, 1/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 33/72 variables, 39/70 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 19/89 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 47/136 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/72 variables, 0/136 constraints. Problems are: Problem set: 1 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 136 constraints, problems are : Problem set: 1 solved, 47 unsolved in 947 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 39/39 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 47/48 constraints, Known Traps: 12/12 constraints]
After SMT, in 2529ms problems are : Problem set: 1 solved, 47 unsolved
Search for dead transitions found 1 dead transitions in 2531ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 39/40 places, 50/53 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2733 ms. Remains : 39/40 places, 50/53 transitions.
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : EGFr-PT-02010-LTLCardinality-12
Product exploration explored 100000 steps with 33333 reset in 167 ms.
Product exploration explored 100000 steps with 33333 reset in 184 ms.
Computed a total of 15 stabilizing places and 11 stable transitions
Computed a total of 15 stabilizing places and 11 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 12 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA EGFr-PT-02010-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property EGFr-PT-02010-LTLCardinality-12 finished in 3277 ms.
All properties solved by simple procedures.
Total runtime 51007 ms.

BK_STOP 1716402947794

--------------------
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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="EGFr-PT-02010"
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 EGFr-PT-02010, 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 r158-smll-171636265900003"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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