About the Execution of ITS-Tools for DES-PT-40a
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 583.476 | 316478.00 | 366830.00 | 909.40 | FFFFFFFFFFFTFTTT | normal |
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.r092-tall-171624189900715.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 DES-PT-40a, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r092-tall-171624189900715
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 516K
-rw-r--r-- 1 mcc users 6.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 68K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 35K 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.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Apr 22 14:37 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Apr 22 14:37 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 19 18:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Apr 12 08:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Apr 12 08:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.4K Apr 12 08:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 53K Apr 12 08:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 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 83K 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 DES-PT-40a-LTLCardinality-00
FORMULA_NAME DES-PT-40a-LTLCardinality-01
FORMULA_NAME DES-PT-40a-LTLCardinality-02
FORMULA_NAME DES-PT-40a-LTLCardinality-03
FORMULA_NAME DES-PT-40a-LTLCardinality-04
FORMULA_NAME DES-PT-40a-LTLCardinality-05
FORMULA_NAME DES-PT-40a-LTLCardinality-06
FORMULA_NAME DES-PT-40a-LTLCardinality-07
FORMULA_NAME DES-PT-40a-LTLCardinality-08
FORMULA_NAME DES-PT-40a-LTLCardinality-09
FORMULA_NAME DES-PT-40a-LTLCardinality-10
FORMULA_NAME DES-PT-40a-LTLCardinality-11
FORMULA_NAME DES-PT-40a-LTLCardinality-12
FORMULA_NAME DES-PT-40a-LTLCardinality-13
FORMULA_NAME DES-PT-40a-LTLCardinality-14
FORMULA_NAME DES-PT-40a-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1716352740220
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-40a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202405141337
[2024-05-22 04:39:01] [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 04:39:01] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 04:39:01] [INFO ] Load time of PNML (sax parser for PT used): 81 ms
[2024-05-22 04:39:01] [INFO ] Transformed 274 places.
[2024-05-22 04:39:01] [INFO ] Transformed 231 transitions.
[2024-05-22 04:39:01] [INFO ] Found NUPN structural information;
[2024-05-22 04:39:01] [INFO ] Parsed PT model containing 274 places and 231 transitions and 1116 arcs in 176 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Ensure Unique test removed 14 transitions
Reduce redundant transitions removed 14 transitions.
FORMULA DES-PT-40a-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40a-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 274 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 274/274 places, 217/217 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 273 transition count 216
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 273 transition count 216
Applied a total of 2 rules in 59 ms. Remains 273 /274 variables (removed 1) and now considering 216/217 (removed 1) transitions.
// Phase 1: matrix 216 rows 273 cols
[2024-05-22 04:39:01] [INFO ] Computed 59 invariants in 30 ms
[2024-05-22 04:39:02] [INFO ] Implicit Places using invariants in 384 ms returned [171]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 414 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 272/274 places, 216/217 transitions.
Applied a total of 0 rules in 10 ms. Remains 272 /272 variables (removed 0) and now considering 216/216 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 501 ms. Remains : 272/274 places, 216/217 transitions.
Support contains 12 out of 272 places after structural reductions.
[2024-05-22 04:39:02] [INFO ] Flatten gal took : 62 ms
[2024-05-22 04:39:02] [INFO ] Flatten gal took : 22 ms
[2024-05-22 04:39:02] [INFO ] Input system was already deterministic with 216 transitions.
Reduction of identical properties reduced properties to check from 9 to 8
RANDOM walk for 40000 steps (888 resets) in 921 ms. (43 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40003 steps (167 resets) in 251 ms. (158 steps per ms) remains 1/1 properties
// Phase 1: matrix 216 rows 272 cols
[2024-05-22 04:39:03] [INFO ] Computed 58 invariants in 16 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 152/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 53/207 variables, 33/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/229 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 215/444 variables, 229/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 0/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 44/488 variables, 43/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/488 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/488 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 330 constraints, problems are : Problem set: 0 solved, 1 unsolved in 421 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 272/272 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 152/154 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/154 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 53/207 variables, 33/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/207 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 22/229 variables, 18/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/229 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 215/444 variables, 229/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/444 variables, 1/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/444 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 44/488 variables, 43/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/488 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/488 variables, 0/331 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 488/488 variables, and 331 constraints, problems are : Problem set: 0 solved, 1 unsolved in 380 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 860ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 255 ms.
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 272/272 places, 216/216 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 272 transition count 214
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 8 place count 272 transition count 214
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 271 transition count 213
Applied a total of 9 rules in 41 ms. Remains 271 /272 variables (removed 1) and now considering 213/216 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 271/272 places, 213/216 transitions.
RANDOM walk for 40000 steps (555 resets) in 558 ms. (71 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (99 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1623303 steps, run timeout after 3001 ms. (steps per millisecond=540 ) properties seen :0 out of 1
Probabilistic random walk after 1623303 steps, saw 227784 distinct states, run finished after 3005 ms. (steps per millisecond=540 ) properties seen :0
// Phase 1: matrix 213 rows 271 cols
[2024-05-22 04:39:07] [INFO ] Computed 60 invariants in 10 ms
[2024-05-22 04:39:07] [INFO ] State equation strengthened by 2 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 153/155 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 33/188 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 25/213 variables, 17/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/213 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/220 variables, 7/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/220 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 170/390 variables, 220/275 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/390 variables, 2/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 0/277 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 12/402 variables, 8/285 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/402 variables, 3/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/402 variables, 0/288 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 1/403 variables, 1/289 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/403 variables, 1/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/403 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 42/445 variables, 3/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/445 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/445 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 39/484 variables, 39/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/484 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/484 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 484/484 variables, and 333 constraints, problems are : Problem set: 0 solved, 1 unsolved in 202 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 271/271 constraints, ReadFeed: 2/2 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/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 153/155 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/155 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 33/188 variables, 23/31 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 04:39:07] [INFO ] Deduced a trap composed of 7 places in 50 ms of which 7 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/188 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/188 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 25/213 variables, 17/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/213 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 7/220 variables, 7/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/220 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 170/390 variables, 220/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/390 variables, 2/278 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/390 variables, 1/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/390 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 12/402 variables, 8/287 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/402 variables, 3/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 04:39:08] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 2 ms to minimize.
[2024-05-22 04:39:08] [INFO ] Deduced a trap composed of 11 places in 55 ms of which 2 ms to minimize.
At refinement iteration 16 (INCLUDED_ONLY) 0/402 variables, 2/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/402 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/403 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/403 variables, 1/294 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-05-22 04:39:08] [INFO ] Deduced a trap composed of 16 places in 56 ms of which 1 ms to minimize.
[2024-05-22 04:39:08] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-22 04:39:08] [INFO ] Deduced a trap composed of 20 places in 58 ms of which 2 ms to minimize.
At refinement iteration 20 (INCLUDED_ONLY) 0/403 variables, 3/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/403 variables, 0/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 42/445 variables, 3/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/445 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/445 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 25 (OVERLAPS) 39/484 variables, 39/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/484 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 27 (OVERLAPS) 0/484 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 484/484 variables, and 340 constraints, problems are : Problem set: 0 solved, 1 unsolved in 709 ms.
Refiners :[Positive P Invariants (semi-flows): 35/35 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 271/271 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 6/6 constraints]
After SMT, in 932ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 937 steps, including 1 resets, run visited all 1 properties in 3 ms. (steps per millisecond=312 )
Parikh walk visited 1 properties in 8 ms.
Computed a total of 175 stabilizing places and 170 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' '!(F(G(p0)))'
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 10 ms. Remains 271 /272 variables (removed 1) and now considering 215/216 (removed 1) transitions.
// Phase 1: matrix 215 rows 271 cols
[2024-05-22 04:39:08] [INFO ] Computed 58 invariants in 5 ms
[2024-05-22 04:39:08] [INFO ] Implicit Places using invariants in 152 ms returned []
[2024-05-22 04:39:08] [INFO ] Invariant cache hit.
[2024-05-22 04:39:09] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 402 ms to find 0 implicit places.
[2024-05-22 04:39:09] [INFO ] Redundant transitions in 15 ms returned []
Running 212 sub problems to find dead transitions.
[2024-05-22 04:39:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (OVERLAPS) 2/270 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (OVERLAPS) 215/485 variables, 270/328 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-22 04:39:14] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-22 04:39:14] [INFO ] Deduced a trap composed of 9 places in 59 ms of which 2 ms to minimize.
[2024-05-22 04:39:14] [INFO ] Deduced a trap composed of 12 places in 42 ms of which 1 ms to minimize.
[2024-05-22 04:39:14] [INFO ] Deduced a trap composed of 8 places in 48 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 4/332 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-22 04:39:16] [INFO ] Deduced a trap composed of 14 places in 71 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-22 04:39:18] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/485 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-22 04:39:21] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/485 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 11 (OVERLAPS) 1/486 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/486 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-22 04:39:30] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/486 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-22 04:39:32] [INFO ] Deduced a trap composed of 16 places in 70 ms of which 4 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/486 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/486 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 16 (OVERLAPS) 0/486 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 486/486 variables, and 338 constraints, problems are : Problem set: 0 solved, 212 unsolved in 29844 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 2/270 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 215/485 variables, 270/337 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/485 variables, 212/549 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 10 (OVERLAPS) 1/486 variables, 1/550 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/486 variables, and 550 constraints, problems are : Problem set: 0 solved, 212 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 9/9 constraints]
After SMT, in 60020ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 60027ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60469 ms. Remains : 271/272 places, 215/216 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-40a-LTLCardinality-04
Stuttering criterion allowed to conclude after 76 steps with 1 reset in 3 ms.
FORMULA DES-PT-40a-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLCardinality-04 finished in 60670 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 272 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 11 ms. Remains 271 /272 variables (removed 1) and now considering 215/216 (removed 1) transitions.
[2024-05-22 04:40:09] [INFO ] Invariant cache hit.
[2024-05-22 04:40:09] [INFO ] Implicit Places using invariants in 265 ms returned []
[2024-05-22 04:40:09] [INFO ] Invariant cache hit.
[2024-05-22 04:40:09] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 571 ms to find 0 implicit places.
[2024-05-22 04:40:09] [INFO ] Redundant transitions in 14 ms returned []
Running 212 sub problems to find dead transitions.
[2024-05-22 04:40:09] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (OVERLAPS) 2/270 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (OVERLAPS) 215/485 variables, 270/328 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-22 04:40:14] [INFO ] Deduced a trap composed of 9 places in 55 ms of which 1 ms to minimize.
[2024-05-22 04:40:14] [INFO ] Deduced a trap composed of 9 places in 50 ms of which 0 ms to minimize.
[2024-05-22 04:40:15] [INFO ] Deduced a trap composed of 12 places in 43 ms of which 1 ms to minimize.
[2024-05-22 04:40:15] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 4/332 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-22 04:40:17] [INFO ] Deduced a trap composed of 14 places in 68 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-22 04:40:19] [INFO ] Deduced a trap composed of 12 places in 55 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/485 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-22 04:40:22] [INFO ] Deduced a trap composed of 9 places in 37 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/485 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 11 (OVERLAPS) 1/486 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/486 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-22 04:40:31] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/486 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-22 04:40:33] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/486 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/486 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 16 (OVERLAPS) 0/486 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 486/486 variables, and 338 constraints, problems are : Problem set: 0 solved, 212 unsolved in 29775 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 2/270 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 215/485 variables, 270/337 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/485 variables, 212/549 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 10 (OVERLAPS) 1/486 variables, 1/550 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/486 variables, and 550 constraints, problems are : Problem set: 0 solved, 212 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 9/9 constraints]
After SMT, in 59912ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 59915ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60520 ms. Remains : 271/272 places, 215/216 transitions.
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-40a-LTLCardinality-05
Product exploration explored 100000 steps with 2289 reset in 321 ms.
Product exploration explored 100000 steps with 2311 reset in 255 ms.
Computed a total of 174 stabilizing places and 169 stable transitions
Computed a total of 174 stabilizing places and 169 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 291 steps (3 resets) in 8 ms. (32 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Support contains 1 out of 271 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 271/271 places, 215/215 transitions.
Applied a total of 0 rules in 16 ms. Remains 271 /271 variables (removed 0) and now considering 215/215 (removed 0) transitions.
[2024-05-22 04:41:10] [INFO ] Invariant cache hit.
[2024-05-22 04:41:10] [INFO ] Implicit Places using invariants in 146 ms returned []
[2024-05-22 04:41:11] [INFO ] Invariant cache hit.
[2024-05-22 04:41:11] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
[2024-05-22 04:41:11] [INFO ] Redundant transitions in 1 ms returned []
Running 212 sub problems to find dead transitions.
[2024-05-22 04:41:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 0/51 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (OVERLAPS) 2/270 variables, 7/58 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (OVERLAPS) 215/485 variables, 270/328 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-22 04:41:16] [INFO ] Deduced a trap composed of 9 places in 49 ms of which 1 ms to minimize.
[2024-05-22 04:41:16] [INFO ] Deduced a trap composed of 9 places in 44 ms of which 1 ms to minimize.
[2024-05-22 04:41:16] [INFO ] Deduced a trap composed of 12 places in 46 ms of which 1 ms to minimize.
[2024-05-22 04:41:16] [INFO ] Deduced a trap composed of 8 places in 43 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/485 variables, 4/332 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-22 04:41:18] [INFO ] Deduced a trap composed of 14 places in 67 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/485 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-22 04:41:20] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/485 variables, 1/334 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-22 04:41:23] [INFO ] Deduced a trap composed of 9 places in 42 ms of which 1 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 1/335 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/485 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 11 (OVERLAPS) 1/486 variables, 1/336 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/486 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-22 04:41:32] [INFO ] Deduced a trap composed of 11 places in 40 ms of which 1 ms to minimize.
At refinement iteration 13 (OVERLAPS) 0/486 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 212 unsolved
[2024-05-22 04:41:34] [INFO ] Deduced a trap composed of 16 places in 62 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/486 variables, 1/338 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/486 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 16 (OVERLAPS) 0/486 variables, 0/338 constraints. Problems are: Problem set: 0 solved, 212 unsolved
No progress, stopping.
After SMT solving in domain Real declared 486/486 variables, and 338 constraints, problems are : Problem set: 0 solved, 212 unsolved in 29467 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 9/9 constraints]
Escalating to Integer solving :Problem set: 0 solved, 212 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/268 variables, 18/51 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 8/59 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 4 (OVERLAPS) 2/270 variables, 7/66 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 7 (OVERLAPS) 215/485 variables, 270/337 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/485 variables, 212/549 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/485 variables, 0/549 constraints. Problems are: Problem set: 0 solved, 212 unsolved
At refinement iteration 10 (OVERLAPS) 1/486 variables, 1/550 constraints. Problems are: Problem set: 0 solved, 212 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/486 variables, and 550 constraints, problems are : Problem set: 0 solved, 212 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 271/271 constraints, PredecessorRefiner: 212/212 constraints, Known Traps: 9/9 constraints]
After SMT, in 59598ms problems are : Problem set: 0 solved, 212 unsolved
Search for dead transitions found 0 dead transitions in 59601ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 60037 ms. Remains : 271/271 places, 215/215 transitions.
Computed a total of 174 stabilizing places and 169 stable transitions
Computed a total of 174 stabilizing places and 169 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[(NOT p0)]
RANDOM walk for 450 steps (8 resets) in 9 ms. (45 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 149 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Product exploration explored 100000 steps with 2264 reset in 196 ms.
Product exploration explored 100000 steps with 2312 reset in 209 ms.
Built C files in :
/tmp/ltsmin17316746977361053568
[2024-05-22 04:42:11] [INFO ] Computing symmetric may disable matrix : 215 transitions.
[2024-05-22 04:42:11] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 04:42:11] [INFO ] Computing symmetric may enable matrix : 215 transitions.
[2024-05-22 04:42:11] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 04:42:11] [INFO ] Computing Do-Not-Accords matrix : 215 transitions.
[2024-05-22 04:42:11] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 04:42:11] [INFO ] Built C files in 42ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17316746977361053568
Running compilation step : cd /tmp/ltsmin17316746977361053568;'/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 633 ms.
Running link step : cd /tmp/ltsmin17316746977361053568;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin17316746977361053568;'/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/stateBased2491724154522117877.hoa' '--buchi-type=spotba'
LTSmin run took 518 ms.
FORMULA DES-PT-40a-LTLCardinality-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-40a-LTLCardinality-05 finished in 123706 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' '!(((p0 U G(!p1))||X(X(G(p2)))))'
Support contains 3 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Applied a total of 0 rules in 5 ms. Remains 272 /272 variables (removed 0) and now considering 216/216 (removed 0) transitions.
// Phase 1: matrix 216 rows 272 cols
[2024-05-22 04:42:13] [INFO ] Computed 58 invariants in 5 ms
[2024-05-22 04:42:13] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-22 04:42:13] [INFO ] Invariant cache hit.
[2024-05-22 04:42:13] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 394 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2024-05-22 04:42:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/272 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 215 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/488 variables, 272/330 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 04:42:18] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 1 ms to minimize.
[2024-05-22 04:42:18] [INFO ] Deduced a trap composed of 17 places in 54 ms of which 4 ms to minimize.
[2024-05-22 04:42:18] [INFO ] Deduced a trap composed of 21 places in 56 ms of which 1 ms to minimize.
[2024-05-22 04:42:19] [INFO ] Deduced a trap composed of 10 places in 42 ms of which 1 ms to minimize.
[2024-05-22 04:42:19] [INFO ] Deduced a trap composed of 12 places in 40 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 5/335 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/488 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 335 constraints, problems are : Problem set: 0 solved, 215 unsolved in 10326 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/272 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 216/488 variables, 272/335 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 215/550 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/488 variables, and 550 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 5/5 constraints]
After SMT, in 40452ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 40454ms
Finished structural reductions in LTL mode , in 1 iterations and 40854 ms. Remains : 272/272 places, 216/216 transitions.
Stuttering acceptance computed with spot in 420 ms :[(AND p1 (NOT p2)), (NOT p2), (AND p1 (NOT p2)), (AND p1 (NOT p2)), (NOT p2), true, (AND (NOT p2) p1), (AND p1 (NOT p2)), p1, p1]
Running random walk in product with property : DES-PT-40a-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 333 steps with 8 reset in 2 ms.
FORMULA DES-PT-40a-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLCardinality-08 finished in 41296 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Applied a total of 0 rules in 3 ms. Remains 272 /272 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-22 04:42:54] [INFO ] Invariant cache hit.
[2024-05-22 04:42:54] [INFO ] Implicit Places using invariants in 147 ms returned []
[2024-05-22 04:42:54] [INFO ] Invariant cache hit.
[2024-05-22 04:42:54] [INFO ] Implicit Places using invariants and state equation in 258 ms returned []
Implicit Place search using SMT with State Equation took 406 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2024-05-22 04:42:54] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/272 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 215 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/488 variables, 272/330 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 04:42:59] [INFO ] Deduced a trap composed of 12 places in 59 ms of which 1 ms to minimize.
[2024-05-22 04:42:59] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 2 ms to minimize.
[2024-05-22 04:42:59] [INFO ] Deduced a trap composed of 21 places in 74 ms of which 1 ms to minimize.
[2024-05-22 04:43:00] [INFO ] Deduced a trap composed of 10 places in 43 ms of which 0 ms to minimize.
[2024-05-22 04:43:00] [INFO ] Deduced a trap composed of 12 places in 54 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 5/335 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/488 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 335 constraints, problems are : Problem set: 0 solved, 215 unsolved in 10887 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/272 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 216/488 variables, 272/335 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 215/550 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/488 variables, and 550 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 5/5 constraints]
After SMT, in 41035ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 41036ms
Finished structural reductions in LTL mode , in 1 iterations and 41447 ms. Remains : 272/272 places, 216/216 transitions.
Stuttering acceptance computed with spot in 89 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-40a-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-40a-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLCardinality-09 finished in 41555 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((X(p0)&&(X(G(p2))||p1))))'
Support contains 4 out of 272 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 272/272 places, 216/216 transitions.
Applied a total of 0 rules in 2 ms. Remains 272 /272 variables (removed 0) and now considering 216/216 (removed 0) transitions.
[2024-05-22 04:43:35] [INFO ] Invariant cache hit.
[2024-05-22 04:43:36] [INFO ] Implicit Places using invariants in 143 ms returned []
[2024-05-22 04:43:36] [INFO ] Invariant cache hit.
[2024-05-22 04:43:36] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 426 ms to find 0 implicit places.
Running 215 sub problems to find dead transitions.
[2024-05-22 04:43:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/272 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 215 unsolved
All remaining problems are real, not stopping.
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (OVERLAPS) 216/488 variables, 272/330 constraints. Problems are: Problem set: 0 solved, 215 unsolved
[2024-05-22 04:43:40] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 2 ms to minimize.
[2024-05-22 04:43:40] [INFO ] Deduced a trap composed of 17 places in 56 ms of which 1 ms to minimize.
[2024-05-22 04:43:40] [INFO ] Deduced a trap composed of 21 places in 62 ms of which 1 ms to minimize.
[2024-05-22 04:43:41] [INFO ] Deduced a trap composed of 10 places in 39 ms of which 0 ms to minimize.
[2024-05-22 04:43:41] [INFO ] Deduced a trap composed of 12 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 5/335 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (OVERLAPS) 0/488 variables, 0/335 constraints. Problems are: Problem set: 0 solved, 215 unsolved
No progress, stopping.
After SMT solving in domain Real declared 488/488 variables, and 335 constraints, problems are : Problem set: 0 solved, 215 unsolved in 9975 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 5/5 constraints]
Escalating to Integer solving :Problem set: 0 solved, 215 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/271 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/271 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 2 (OVERLAPS) 1/272 variables, 33/45 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/272 variables, 13/58 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/272 variables, 5/63 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/272 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 6 (OVERLAPS) 216/488 variables, 272/335 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 215/550 constraints. Problems are: Problem set: 0 solved, 215 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 0/550 constraints. Problems are: Problem set: 0 solved, 215 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/488 variables, and 550 constraints, problems are : Problem set: 0 solved, 215 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 33/33 constraints, Generalized P Invariants (flows): 25/25 constraints, State Equation: 272/272 constraints, PredecessorRefiner: 215/215 constraints, Known Traps: 5/5 constraints]
After SMT, in 40117ms problems are : Problem set: 0 solved, 215 unsolved
Search for dead transitions found 0 dead transitions in 40121ms
Finished structural reductions in LTL mode , in 1 iterations and 40549 ms. Remains : 272/272 places, 216/216 transitions.
Stuttering acceptance computed with spot in 125 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (NOT p0)), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : DES-PT-40a-LTLCardinality-12
Entered a terminal (fully accepting) state of product in 56 steps with 0 reset in 1 ms.
FORMULA DES-PT-40a-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40a-LTLCardinality-12 finished in 40697 ms.
All properties solved by simple procedures.
Total runtime 315286 ms.
BK_STOP 1716353056698
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DES-PT-40a"
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 DES-PT-40a, 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 r092-tall-171624189900715"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-40a.tgz
mv DES-PT-40a 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 '
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 ;