Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r136-tall-171631131900092.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 Dekker-PT-015, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r136-tall-171631131900092
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 668K
-rw-r--r-- 1 mcc users 6.8K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 22 14:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K Apr 22 14:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Apr 22 14:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 11 20:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 148K Apr 11 20:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K Apr 11 20:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 118K Apr 11 20:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Apr 22 14:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 141K 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 Dekker-PT-015-LTLFireability-00
FORMULA_NAME Dekker-PT-015-LTLFireability-01
FORMULA_NAME Dekker-PT-015-LTLFireability-02
FORMULA_NAME Dekker-PT-015-LTLFireability-03
FORMULA_NAME Dekker-PT-015-LTLFireability-04
FORMULA_NAME Dekker-PT-015-LTLFireability-05
FORMULA_NAME Dekker-PT-015-LTLFireability-06
FORMULA_NAME Dekker-PT-015-LTLFireability-07
FORMULA_NAME Dekker-PT-015-LTLFireability-08
FORMULA_NAME Dekker-PT-015-LTLFireability-09
FORMULA_NAME Dekker-PT-015-LTLFireability-10
FORMULA_NAME Dekker-PT-015-LTLFireability-11
FORMULA_NAME Dekker-PT-015-LTLFireability-12
FORMULA_NAME Dekker-PT-015-LTLFireability-13
FORMULA_NAME Dekker-PT-015-LTLFireability-14
FORMULA_NAME Dekker-PT-015-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716335983159

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Dekker-PT-015
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202405141337
[2024-05-21 23:59:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 23:59:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 23:59:44] [INFO ] Load time of PNML (sax parser for PT used): 84 ms
[2024-05-21 23:59:44] [INFO ] Transformed 75 places.
[2024-05-21 23:59:44] [INFO ] Transformed 255 transitions.
[2024-05-21 23:59:44] [INFO ] Found NUPN structural information;
[2024-05-21 23:59:44] [INFO ] Parsed PT model containing 75 places and 255 transitions and 1830 arcs in 177 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA Dekker-PT-015-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Dekker-PT-015-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 47 out of 75 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 75/75 places, 255/255 transitions.
Applied a total of 0 rules in 14 ms. Remains 75 /75 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2024-05-21 23:59:44] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 75 cols
[2024-05-21 23:59:44] [INFO ] Computed 45 invariants in 10 ms
[2024-05-21 23:59:44] [INFO ] Implicit Places using invariants in 239 ms returned [30, 33, 36, 42, 45, 48, 54, 57, 60, 63, 69, 72]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 289 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 63/75 places, 255/255 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 328 ms. Remains : 63/75 places, 255/255 transitions.
Support contains 47 out of 63 places after structural reductions.
[2024-05-21 23:59:45] [INFO ] Flatten gal took : 47 ms
[2024-05-21 23:59:45] [INFO ] Flatten gal took : 28 ms
[2024-05-21 23:59:45] [INFO ] Input system was already deterministic with 255 transitions.
Reduction of identical properties reduced properties to check from 30 to 29
RANDOM walk for 40000 steps (8 resets) in 1615 ms. (24 steps per ms) remains 4/29 properties
BEST_FIRST walk for 40004 steps (8 resets) in 265 ms. (150 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 147 ms. (270 steps per ms) remains 2/2 properties
[2024-05-21 23:59:45] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 63 cols
[2024-05-21 23:59:45] [INFO ] Computed 33 invariants in 3 ms
[2024-05-21 23:59:45] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 8/14 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-05-21 23:59:46] [INFO ] Deduced a trap composed of 4 places in 43 ms of which 18 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 12/26 variables, 14/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/26 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 24/50 variables, 15/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/50 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 61/111 variables, 37/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/111 variables, 37/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/111 variables, 11/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/111 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 12/123 variables, 13/150 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/123 variables, 12/162 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/123 variables, 1/163 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/123 variables, 12/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/123 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (OVERLAPS) 0/123 variables, 0/175 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 175 constraints, problems are : Problem set: 0 solved, 2 unsolved in 294 ms.
Refiners :[Domain max(s): 63/63 constraints, Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 63/63 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 8/14 variables, 6/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/14 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 12/26 variables, 14/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/26 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 24/50 variables, 15/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/50 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 61/111 variables, 37/89 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/111 variables, 37/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/111 variables, 11/137 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/111 variables, 2/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/111 variables, 0/139 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 12/123 variables, 13/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/123 variables, 12/164 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/123 variables, 1/165 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/123 variables, 12/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/123 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 21 (OVERLAPS) 0/123 variables, 0/177 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 177 constraints, problems are : Problem set: 0 solved, 2 unsolved in 289 ms.
Refiners :[Domain max(s): 63/63 constraints, Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 63/63 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 633ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 36 ms.
Support contains 4 out of 63 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 63/63 places, 255/255 transitions.
Applied a total of 0 rules in 15 ms. Remains 63 /63 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 63/63 places, 255/255 transitions.
RANDOM walk for 40000 steps (8 resets) in 689 ms. (57 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 2071504 steps, run timeout after 3001 ms. (steps per millisecond=690 ) properties seen :0 out of 1
Probabilistic random walk after 2071504 steps, saw 147407 distinct states, run finished after 3012 ms. (steps per millisecond=687 ) properties seen :0
[2024-05-21 23:59:49] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2024-05-21 23:59:49] [INFO ] Invariant cache hit.
[2024-05-21 23:59:49] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 5/9 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/17 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/17 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/43 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/43 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 67/110 variables, 41/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/110 variables, 41/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/110 variables, 11/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/110 variables, 0/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 13/123 variables, 15/146 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/123 variables, 13/159 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/123 variables, 2/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/123 variables, 13/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/123 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/123 variables, 0/174 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 123/123 variables, and 174 constraints, problems are : Problem set: 0 solved, 1 unsolved in 198 ms.
Refiners :[Domain max(s): 63/63 constraints, Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 63/63 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 5/9 variables, 4/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 5/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 8/17 variables, 9/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/17 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 26/43 variables, 15/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/43 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 67/110 variables, 41/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/110 variables, 41/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/110 variables, 11/131 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/110 variables, 1/132 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-21 23:59:50] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/110 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/110 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 13/123 variables, 15/148 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/123 variables, 13/161 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/123 variables, 2/163 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/123 variables, 13/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/123 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/123 variables, 0/176 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 123/123 variables, and 176 constraints, problems are : Problem set: 0 solved, 1 unsolved in 176 ms.
Refiners :[Domain max(s): 63/63 constraints, Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 63/63 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints]
After SMT, in 396ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 2048 steps, including 123 resets, run visited all 1 properties in 12 ms. (steps per millisecond=170 )
Parikh walk visited 1 properties in 16 ms.
Computed a total of 0 stabilizing places and 0 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' '!((G(p0)||X(X(X((p1||G(F(p2))))))))'
Support contains 7 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 255/255 transitions.
Applied a total of 0 rules in 3 ms. Remains 63 /63 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2024-05-21 23:59:50] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2024-05-21 23:59:50] [INFO ] Invariant cache hit.
[2024-05-21 23:59:50] [INFO ] Implicit Places using invariants in 93 ms returned [36, 45, 56]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 94 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/63 places, 255/255 transitions.
Applied a total of 0 rules in 3 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 102 ms. Remains : 60/63 places, 255/255 transitions.
Stuttering acceptance computed with spot in 655 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0))]
Running random walk in product with property : Dekker-PT-015-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 411 ms.
Stack based approach found an accepted trace after 5 steps with 0 reset with depth 6 and stack size 6 in 1 ms.
FORMULA Dekker-PT-015-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-015-LTLFireability-00 finished in 1241 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 255/255 transitions.
Applied a total of 0 rules in 20 ms. Remains 63 /63 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2024-05-21 23:59:51] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2024-05-21 23:59:51] [INFO ] Invariant cache hit.
[2024-05-21 23:59:52] [INFO ] Implicit Places using invariants in 85 ms returned [36, 45, 56]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 90 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/63 places, 255/255 transitions.
Applied a total of 0 rules in 13 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 124 ms. Remains : 60/63 places, 255/255 transitions.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : Dekker-PT-015-LTLFireability-01
Product exploration explored 100000 steps with 0 reset in 337 ms.
Stack based approach found an accepted trace after 12 steps with 0 reset with depth 13 and stack size 13 in 0 ms.
FORMULA Dekker-PT-015-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-015-LTLFireability-01 finished in 531 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 255/255 transitions.
Applied a total of 0 rules in 15 ms. Remains 63 /63 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2024-05-21 23:59:52] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2024-05-21 23:59:52] [INFO ] Invariant cache hit.
[2024-05-21 23:59:52] [INFO ] Implicit Places using invariants in 104 ms returned [36, 45, 56]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 105 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/63 places, 255/255 transitions.
Applied a total of 0 rules in 9 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 129 ms. Remains : 60/63 places, 255/255 transitions.
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : Dekker-PT-015-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 314 ms.
Stack based approach found an accepted trace after 20 steps with 0 reset with depth 21 and stack size 21 in 1 ms.
FORMULA Dekker-PT-015-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-015-LTLFireability-02 finished in 500 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(p1)&&p0))) U p2) U p3))'
Support contains 10 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 255/255 transitions.
Applied a total of 0 rules in 4 ms. Remains 63 /63 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2024-05-21 23:59:52] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2024-05-21 23:59:52] [INFO ] Invariant cache hit.
[2024-05-21 23:59:53] [INFO ] Implicit Places using invariants in 86 ms returned [36, 45, 56]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 88 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/63 places, 255/255 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 93 ms. Remains : 60/63 places, 255/255 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p3), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : Dekker-PT-015-LTLFireability-04
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA Dekker-PT-015-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-015-LTLFireability-04 finished in 310 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(G(p0))||G((F(p1) U !p2)))))'
Support contains 7 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 255/255 transitions.
Applied a total of 0 rules in 6 ms. Remains 63 /63 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2024-05-21 23:59:53] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2024-05-21 23:59:53] [INFO ] Invariant cache hit.
[2024-05-21 23:59:53] [INFO ] Implicit Places using invariants in 94 ms returned [36, 45, 56]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 96 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/63 places, 255/255 transitions.
Applied a total of 0 rules in 7 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 109 ms. Remains : 60/63 places, 255/255 transitions.
Stuttering acceptance computed with spot in 170 ms :[(AND (NOT p0) p2), (AND (NOT p1) (NOT p0)), (AND (NOT p0) p2), (AND (NOT p0) p2)]
Running random walk in product with property : Dekker-PT-015-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 332 ms.
Product exploration explored 100000 steps with 0 reset in 374 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p2 p0))))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 574 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 160 ms :[(AND (NOT p0) p2), (AND (NOT p1) (NOT p0)), (AND (NOT p0) p2)]
RANDOM walk for 40000 steps (8 resets) in 676 ms. (59 steps per ms) remains 4/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 134 ms. (296 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
[2024-05-21 23:59:55] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 60 cols
[2024-05-21 23:59:55] [INFO ] Computed 30 invariants in 7 ms
[2024-05-21 23:59:55] [INFO ] State equation strengthened by 15 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 2/6 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/6 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/6 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 2/8 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/16 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/16 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 26/42 variables, 15/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/42 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 65/107 variables, 39/74 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/107 variables, 39/113 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/107 variables, 13/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/107 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 13/120 variables, 13/139 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/120 variables, 13/152 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/120 variables, 13/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/120 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/120 variables, 0/165 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 165 constraints, problems are : Problem set: 0 solved, 1 unsolved in 63 ms.
Refiners :[Domain max(s): 60/60 constraints, Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 60/60 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf2 is UNSAT
After SMT solving in domain Int declared 6/120 variables, and 7 constraints, problems are : Problem set: 1 solved, 0 unsolved in 19 ms.
Refiners :[Domain max(s): 4/60 constraints, Positive P Invariants (semi-flows): 3/30 constraints, State Equation: 0/60 constraints, ReadFeed: 0/15 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 96ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p2 p0)))), (G (OR (NOT p2) (NOT p0)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p0)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p2) p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p2), (F (NOT (OR (NOT p2) p0))), (F p1)]
Knowledge based reduction with 8 factoid took 859 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[p2, (AND (NOT p1) (NOT p0)), p2]
Stuttering acceptance computed with spot in 124 ms :[p2, (AND (NOT p1) (NOT p0)), p2]
Support contains 7 out of 60 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 60/60 places, 255/255 transitions.
Applied a total of 0 rules in 10 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2024-05-21 23:59:56] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2024-05-21 23:59:56] [INFO ] Invariant cache hit.
[2024-05-21 23:59:56] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-21 23:59:56] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2024-05-21 23:59:56] [INFO ] Invariant cache hit.
[2024-05-21 23:59:56] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-05-21 23:59:56] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 156 ms to find 0 implicit places.
[2024-05-21 23:59:56] [INFO ] Redundant transitions in 10 ms returned []
Running 240 sub problems to find dead transitions.
[2024-05-21 23:59:56] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2024-05-21 23:59:56] [INFO ] Invariant cache hit.
[2024-05-21 23:59:56] [INFO ] State equation strengthened by 15 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 30/90 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-21 23:59:57] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:59:57] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:59:57] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 2 ms to minimize.
[2024-05-21 23:59:57] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
[2024-05-21 23:59:57] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 2 ms to minimize.
[2024-05-21 23:59:57] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 2 ms to minimize.
[2024-05-21 23:59:57] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:59:57] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:59:57] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:59:57] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-21 23:59:57] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:59:57] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 1 ms to minimize.
[2024-05-21 23:59:57] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 0 ms to minimize.
[2024-05-21 23:59:57] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 1 ms to minimize.
[2024-05-21 23:59:57] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 0 ms to minimize.
[2024-05-21 23:59:57] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:59:57] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:59:57] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-21 23:59:57] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-21 23:59:57] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 20/110 constraints. Problems are: Problem set: 0 solved, 240 unsolved
[2024-05-21 23:59:57] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 0 ms to minimize.
[2024-05-21 23:59:57] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 0 ms to minimize.
[2024-05-21 23:59:57] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:59:58] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 1 ms to minimize.
[2024-05-21 23:59:58] [INFO ] Deduced a trap composed of 4 places in 19 ms of which 1 ms to minimize.
[2024-05-21 23:59:58] [INFO ] Deduced a trap composed of 4 places in 20 ms of which 1 ms to minimize.
[2024-05-21 23:59:58] [INFO ] Deduced a trap composed of 4 places in 21 ms of which 0 ms to minimize.
[2024-05-21 23:59:58] [INFO ] Deduced a trap composed of 4 places in 30 ms of which 1 ms to minimize.
[2024-05-21 23:59:58] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 1 ms to minimize.
[2024-05-21 23:59:58] [INFO ] Deduced a trap composed of 4 places in 17 ms of which 0 ms to minimize.
[2024-05-21 23:59:58] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 0 ms to minimize.
[2024-05-21 23:59:58] [INFO ] Deduced a trap composed of 4 places in 18 ms of which 1 ms to minimize.
[2024-05-21 23:59:58] [INFO ] Deduced a trap composed of 4 places in 23 ms of which 1 ms to minimize.
[2024-05-21 23:59:58] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:59:58] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:59:58] [INFO ] Deduced a trap composed of 4 places in 15 ms of which 1 ms to minimize.
[2024-05-21 23:59:58] [INFO ] Deduced a trap composed of 4 places in 16 ms of which 0 ms to minimize.
[2024-05-21 23:59:58] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 18/128 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (OVERLAPS) 60/120 variables, 60/188 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 15/203 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (OVERLAPS) 0/120 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Real declared 120/120 variables, and 203 constraints, problems are : Problem set: 0 solved, 240 unsolved in 4520 ms.
Refiners :[Domain max(s): 60/60 constraints, Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 60/60 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 38/38 constraints]
Escalating to Integer solving :Problem set: 0 solved, 240 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/60 variables, 60/60 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/60 variables, 30/90 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/60 variables, 38/128 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/60 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 4 (OVERLAPS) 60/120 variables, 60/188 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/120 variables, 15/203 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/120 variables, 240/443 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/120 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 240 unsolved
At refinement iteration 8 (OVERLAPS) 0/120 variables, 0/443 constraints. Problems are: Problem set: 0 solved, 240 unsolved
No progress, stopping.
After SMT solving in domain Int declared 120/120 variables, and 443 constraints, problems are : Problem set: 0 solved, 240 unsolved in 3581 ms.
Refiners :[Domain max(s): 60/60 constraints, Positive P Invariants (semi-flows): 30/30 constraints, State Equation: 60/60 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 240/240 constraints, Known Traps: 38/38 constraints]
After SMT, in 8223ms problems are : Problem set: 0 solved, 240 unsolved
Search for dead transitions found 0 dead transitions in 8228ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 8412 ms. Remains : 60/60 places, 255/255 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 451 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 122 ms :[p2, (AND (NOT p1) (NOT p0)), p2]
RANDOM walk for 40000 steps (8 resets) in 186 ms. (213 steps per ms) remains 2/6 properties
BEST_FIRST walk for 128 steps (0 resets) in 4 ms. (25 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p2), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p2) p1)))]
Knowledge based reduction with 7 factoid took 637 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[p2, (AND (NOT p1) (NOT p0)), p2]
Stuttering acceptance computed with spot in 112 ms :[p2, (AND (NOT p1) (NOT p0)), p2]
Stuttering acceptance computed with spot in 142 ms :[p2, (AND (NOT p1) (NOT p0)), p2]
Product exploration explored 100000 steps with 0 reset in 325 ms.
Product exploration explored 100000 steps with 0 reset in 371 ms.
Built C files in :
/tmp/ltsmin17325420337109927235
[2024-05-22 00:00:07] [INFO ] Computing symmetric may disable matrix : 255 transitions.
[2024-05-22 00:00:07] [INFO ] Computation of Complete disable matrix. took 16 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:00:07] [INFO ] Computing symmetric may enable matrix : 255 transitions.
[2024-05-22 00:00:07] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:00:07] [INFO ] Computing Do-Not-Accords matrix : 255 transitions.
[2024-05-22 00:00:07] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 00:00:07] [INFO ] Built C files in 81ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17325420337109927235
Running compilation step : cd /tmp/ltsmin17325420337109927235;'/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 875 ms.
Running link step : cd /tmp/ltsmin17325420337109927235;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin17325420337109927235;'/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/stateBased11534604729500190215.hoa' '--buchi-type=spotba'
LTSmin run took 3915 ms.
FORMULA Dekker-PT-015-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Dekker-PT-015-LTLFireability-05 finished in 19089 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(F((p0||(p1&&G(p2))))))'
Support contains 5 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 255/255 transitions.
Applied a total of 0 rules in 16 ms. Remains 63 /63 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2024-05-22 00:00:12] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
// Phase 1: matrix 60 rows 63 cols
[2024-05-22 00:00:12] [INFO ] Computed 33 invariants in 1 ms
[2024-05-22 00:00:12] [INFO ] Implicit Places using invariants in 79 ms returned [36, 45]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 80 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/63 places, 255/255 transitions.
Applied a total of 0 rules in 7 ms. Remains 61 /61 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 103 ms. Remains : 61/63 places, 255/255 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : Dekker-PT-015-LTLFireability-06
Product exploration explored 100000 steps with 1978 reset in 382 ms.
Stack based approach found an accepted trace after 113 steps with 2 reset with depth 56 and stack size 51 in 1 ms.
FORMULA Dekker-PT-015-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-015-LTLFireability-06 finished in 617 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)||F(p1)||(G(p2)&&X(F(p3)))))'
Support contains 8 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 255/255 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2024-05-22 00:00:12] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2024-05-22 00:00:12] [INFO ] Invariant cache hit.
[2024-05-22 00:00:13] [INFO ] Implicit Places using invariants in 69 ms returned [45, 56]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 70 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 61/63 places, 255/255 transitions.
Applied a total of 0 rules in 0 ms. Remains 61 /61 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 71 ms. Remains : 61/63 places, 255/255 transitions.
Stuttering acceptance computed with spot in 293 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Dekker-PT-015-LTLFireability-08
Product exploration explored 100000 steps with 3232 reset in 337 ms.
Stack based approach found an accepted trace after 54 steps with 2 reset with depth 18 and stack size 18 in 1 ms.
FORMULA Dekker-PT-015-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-015-LTLFireability-08 finished in 729 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 255/255 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2024-05-22 00:00:13] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2024-05-22 00:00:13] [INFO ] Invariant cache hit.
[2024-05-22 00:00:13] [INFO ] Implicit Places using invariants in 70 ms returned [36, 45, 56]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 71 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/63 places, 255/255 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 73 ms. Remains : 60/63 places, 255/255 transitions.
Stuttering acceptance computed with spot in 82 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-015-LTLFireability-09
Entered a terminal (fully accepting) state of product in 58 steps with 0 reset in 1 ms.
FORMULA Dekker-PT-015-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-015-LTLFireability-09 finished in 179 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)))&&F((!p0 U (p1||G(!p0))))))'
Support contains 6 out of 63 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 63/63 places, 255/255 transitions.
Applied a total of 0 rules in 1 ms. Remains 63 /63 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2024-05-22 00:00:13] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2024-05-22 00:00:13] [INFO ] Invariant cache hit.
[2024-05-22 00:00:13] [INFO ] Implicit Places using invariants in 77 ms returned [36, 45, 56]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 78 ms to find 3 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 60/63 places, 255/255 transitions.
Applied a total of 0 rules in 1 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 80 ms. Remains : 60/63 places, 255/255 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) p0), (NOT p0), true]
Running random walk in product with property : Dekker-PT-015-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA Dekker-PT-015-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Dekker-PT-015-LTLFireability-10 finished in 256 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 6 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 255/255 transitions.
Applied a total of 0 rules in 6 ms. Remains 63 /63 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2024-05-22 00:00:14] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2024-05-22 00:00:14] [INFO ] Invariant cache hit.
[2024-05-22 00:00:14] [INFO ] Implicit Places using invariants in 68 ms returned [36, 45, 56]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 68 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/63 places, 255/255 transitions.
Applied a total of 0 rules in 6 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 80 ms. Remains : 60/63 places, 255/255 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : Dekker-PT-015-LTLFireability-11
Product exploration explored 100000 steps with 5575 reset in 307 ms.
Stack based approach found an accepted trace after 28 steps with 3 reset with depth 6 and stack size 6 in 0 ms.
FORMULA Dekker-PT-015-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-015-LTLFireability-11 finished in 443 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p1)||p0)))'
Support contains 9 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 255/255 transitions.
Applied a total of 0 rules in 8 ms. Remains 63 /63 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2024-05-22 00:00:14] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2024-05-22 00:00:14] [INFO ] Invariant cache hit.
[2024-05-22 00:00:14] [INFO ] Implicit Places using invariants in 67 ms returned [36, 45, 56]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 68 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/63 places, 255/255 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 80 ms. Remains : 60/63 places, 255/255 transitions.
Stuttering acceptance computed with spot in 28 ms :[(AND (NOT p1) (NOT p0))]
Running random walk in product with property : Dekker-PT-015-LTLFireability-13
Product exploration explored 100000 steps with 5521 reset in 324 ms.
Stack based approach found an accepted trace after 10 steps with 1 reset with depth 7 and stack size 7 in 0 ms.
FORMULA Dekker-PT-015-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-015-LTLFireability-13 finished in 452 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p1)||p0) U (F(p3)&&p2)))'
Support contains 20 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 255/255 transitions.
Applied a total of 0 rules in 10 ms. Remains 63 /63 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2024-05-22 00:00:15] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2024-05-22 00:00:15] [INFO ] Invariant cache hit.
[2024-05-22 00:00:15] [INFO ] Implicit Places using invariants in 68 ms returned [36, 56]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 68 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 61/63 places, 255/255 transitions.
Applied a total of 0 rules in 6 ms. Remains 61 /61 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 84 ms. Remains : 61/63 places, 255/255 transitions.
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p2) (NOT p3)), (NOT p1), (NOT p3)]
Running random walk in product with property : Dekker-PT-015-LTLFireability-14
Product exploration explored 100000 steps with 619 reset in 322 ms.
Stack based approach found an accepted trace after 60 steps with 3 reset with depth 5 and stack size 5 in 1 ms.
FORMULA Dekker-PT-015-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-015-LTLFireability-14 finished in 555 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(F(p0)))'
Support contains 3 out of 63 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 63/63 places, 255/255 transitions.
Applied a total of 0 rules in 7 ms. Remains 63 /63 variables (removed 0) and now considering 255/255 (removed 0) transitions.
[2024-05-22 00:00:15] [INFO ] Flow matrix only has 60 transitions (discarded 195 similar events)
[2024-05-22 00:00:15] [INFO ] Invariant cache hit.
[2024-05-22 00:00:15] [INFO ] Implicit Places using invariants in 72 ms returned [36, 45, 56]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 73 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 60/63 places, 255/255 transitions.
Applied a total of 0 rules in 4 ms. Remains 60 /60 variables (removed 0) and now considering 255/255 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 84 ms. Remains : 60/63 places, 255/255 transitions.
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Dekker-PT-015-LTLFireability-15
Product exploration explored 100000 steps with 3177 reset in 302 ms.
Stack based approach found an accepted trace after 13 steps with 1 reset with depth 9 and stack size 9 in 0 ms.
FORMULA Dekker-PT-015-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Dekker-PT-015-LTLFireability-15 finished in 480 ms.
All properties solved by simple procedures.
Total runtime 31744 ms.

BK_STOP 1716336016088

--------------------
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -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="Dekker-PT-015"
export BK_EXAMINATION="LTLFireability"
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 Dekker-PT-015, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r136-tall-171631131900092"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Dekker-PT-015.tgz
mv Dekker-PT-015 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;