fond
Model Checking Contest 2023
13th edition, Paris, France, April 26, 2023 (at TOOLympics II)
Execution of r101-tall-167814475200308
Last Updated
May 14, 2023

About the Execution of ITS-Tools for DBSingleClientW-PT-d2m06

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
597.048 36685.00 59451.00 378.10 TFFFFFFFFFFFFFFF normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r101-tall-167814475200308.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is DBSingleClientW-PT-d2m06, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r101-tall-167814475200308
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 7.0K Feb 26 15:24 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K Feb 26 15:24 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.2K Feb 26 15:23 CTLFireability.txt
-rw-r--r-- 1 mcc users 45K Feb 26 15:23 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Feb 25 15:49 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:49 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Feb 25 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 15:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K Feb 26 15:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.4K Feb 26 15:25 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 70K Feb 26 15:25 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:49 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:49 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 1.6M Mar 5 18:22 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 DBSingleClientW-PT-d2m06-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d2m06-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678248964324

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d2m06
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-08 04:16:05] [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]
[2023-03-08 04:16:05] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 04:16:06] [INFO ] Load time of PNML (sax parser for PT used): 179 ms
[2023-03-08 04:16:06] [INFO ] Transformed 4763 places.
[2023-03-08 04:16:06] [INFO ] Transformed 2478 transitions.
[2023-03-08 04:16:06] [INFO ] Parsed PT model containing 4763 places and 2478 transitions and 9912 arcs in 270 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 3580 places in 14 ms
Reduce places removed 3580 places and 0 transitions.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 46 out of 1183 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1183/1183 places, 2478/2478 transitions.
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 199 transitions
Reduce isomorphic transitions removed 199 transitions.
Iterating post reduction 0 with 245 rules applied. Total rules applied 245 place count 1137 transition count 2279
Discarding 371 places :
Symmetric choice reduction at 1 with 371 rule applications. Total rules 616 place count 766 transition count 1471
Iterating global reduction 1 with 371 rules applied. Total rules applied 987 place count 766 transition count 1471
Ensure Unique test removed 81 transitions
Reduce isomorphic transitions removed 81 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 1068 place count 766 transition count 1390
Discarding 295 places :
Symmetric choice reduction at 2 with 295 rule applications. Total rules 1363 place count 471 transition count 1095
Iterating global reduction 2 with 295 rules applied. Total rules applied 1658 place count 471 transition count 1095
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 2 with 7 rules applied. Total rules applied 1665 place count 471 transition count 1088
Discarding 217 places :
Symmetric choice reduction at 3 with 217 rule applications. Total rules 1882 place count 254 transition count 795
Iterating global reduction 3 with 217 rules applied. Total rules applied 2099 place count 254 transition count 795
Ensure Unique test removed 253 transitions
Reduce isomorphic transitions removed 253 transitions.
Iterating post reduction 3 with 253 rules applied. Total rules applied 2352 place count 254 transition count 542
Discarding 14 places :
Symmetric choice reduction at 4 with 14 rule applications. Total rules 2366 place count 240 transition count 517
Iterating global reduction 4 with 14 rules applied. Total rules applied 2380 place count 240 transition count 517
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 4 with 27 rules applied. Total rules applied 2407 place count 240 transition count 490
Discarding 8 places :
Symmetric choice reduction at 5 with 8 rule applications. Total rules 2415 place count 232 transition count 482
Iterating global reduction 5 with 8 rules applied. Total rules applied 2423 place count 232 transition count 482
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2424 place count 232 transition count 481
Discarding 7 places :
Symmetric choice reduction at 6 with 7 rule applications. Total rules 2431 place count 225 transition count 474
Iterating global reduction 6 with 7 rules applied. Total rules applied 2438 place count 225 transition count 474
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 2442 place count 225 transition count 470
Applied a total of 2442 rules in 189 ms. Remains 225 /1183 variables (removed 958) and now considering 470/2478 (removed 2008) transitions.
// Phase 1: matrix 470 rows 225 cols
[2023-03-08 04:16:06] [INFO ] Computed 2 place invariants in 26 ms
[2023-03-08 04:16:06] [INFO ] Implicit Places using invariants in 291 ms returned []
[2023-03-08 04:16:06] [INFO ] Invariant cache hit.
[2023-03-08 04:16:07] [INFO ] State equation strengthened by 245 read => feed constraints.
[2023-03-08 04:16:07] [INFO ] Implicit Places using invariants and state equation in 918 ms returned []
Implicit Place search using SMT with State Equation took 1232 ms to find 0 implicit places.
[2023-03-08 04:16:07] [INFO ] Invariant cache hit.
[2023-03-08 04:16:08] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 225/1183 places, 470/2478 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1603 ms. Remains : 225/1183 places, 470/2478 transitions.
Support contains 46 out of 225 places after structural reductions.
[2023-03-08 04:16:08] [INFO ] Flatten gal took : 56 ms
[2023-03-08 04:16:08] [INFO ] Flatten gal took : 30 ms
[2023-03-08 04:16:08] [INFO ] Input system was already deterministic with 470 transitions.
Support contains 45 out of 225 places (down from 46) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2257 resets, run finished after 534 ms. (steps per millisecond=18 ) properties (out of 36) seen :3
Incomplete Best-First random walk after 1001 steps, including 36 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 41 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 33) seen :1
Incomplete Best-First random walk after 1000 steps, including 54 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 45 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 92 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 52 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 100 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 93 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 110 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 36 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 50 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 32) seen :0
Incomplete Best-First random walk after 1000 steps, including 76 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 32) seen :1
Incomplete Best-First random walk after 1001 steps, including 37 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 81 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 36 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 96 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 91 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1000 steps, including 93 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 31) seen :0
Running SMT prover for 31 properties.
[2023-03-08 04:16:09] [INFO ] Invariant cache hit.
[2023-03-08 04:16:09] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-08 04:16:09] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 4 ms returned sat
[2023-03-08 04:16:10] [INFO ] After 1026ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:31
[2023-03-08 04:16:10] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-08 04:16:10] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 04:16:12] [INFO ] After 1571ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :30
[2023-03-08 04:16:12] [INFO ] State equation strengthened by 245 read => feed constraints.
[2023-03-08 04:16:15] [INFO ] After 3298ms SMT Verify possible using 245 Read/Feed constraints in natural domain returned unsat :1 sat :30
[2023-03-08 04:16:19] [INFO ] After 6936ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :30
Attempting to minimize the solution found.
Minimization took 3122 ms.
[2023-03-08 04:16:22] [INFO ] After 11938ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :30
Fused 31 Parikh solutions to 30 different solutions.
Parikh walk visited 0 properties in 323 ms.
Support contains 38 out of 225 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 225/225 places, 470/470 transitions.
Graph (complete) has 849 edges and 225 vertex of which 224 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 224 transition count 464
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 13 place count 218 transition count 437
Iterating global reduction 1 with 6 rules applied. Total rules applied 19 place count 218 transition count 437
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 23 place count 214 transition count 433
Iterating global reduction 1 with 4 rules applied. Total rules applied 27 place count 214 transition count 433
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 31 place count 210 transition count 427
Iterating global reduction 1 with 4 rules applied. Total rules applied 35 place count 210 transition count 427
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 39 place count 210 transition count 423
Applied a total of 39 rules in 56 ms. Remains 210 /225 variables (removed 15) and now considering 423/470 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 210/225 places, 423/470 transitions.
Incomplete random walk after 10000 steps, including 2285 resets, run finished after 257 ms. (steps per millisecond=38 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 36 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 42 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 34 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 98 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 83 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 79 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 86 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 37 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 86 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 41 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 107 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 38 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 102 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1000 steps, including 108 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 95 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Incomplete Best-First random walk after 1001 steps, including 44 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 30) seen :0
Finished probabilistic random walk after 310406 steps, run visited all 30 properties in 1028 ms. (steps per millisecond=301 )
Probabilistic random walk after 310406 steps, saw 120801 distinct states, run finished after 1028 ms. (steps per millisecond=301 ) properties seen :30
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 14 simplifications.
Computed a total of 5 stabilizing places and 33 stable transitions
Graph (complete) has 919 edges and 225 vertex of which 224 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||F(p1)||G(F(p0)))))'
Support contains 3 out of 225 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 470/470 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 194 transition count 345
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 194 transition count 345
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 66 place count 194 transition count 341
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 89 place count 171 transition count 310
Iterating global reduction 1 with 23 rules applied. Total rules applied 112 place count 171 transition count 310
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 122 place count 171 transition count 300
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 141 place count 152 transition count 266
Iterating global reduction 2 with 19 rules applied. Total rules applied 160 place count 152 transition count 266
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 170 place count 152 transition count 256
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 180 place count 142 transition count 239
Iterating global reduction 3 with 10 rules applied. Total rules applied 190 place count 142 transition count 239
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 194 place count 142 transition count 235
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 201 place count 135 transition count 228
Iterating global reduction 4 with 7 rules applied. Total rules applied 208 place count 135 transition count 228
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 214 place count 135 transition count 222
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 219 place count 130 transition count 206
Iterating global reduction 5 with 5 rules applied. Total rules applied 224 place count 130 transition count 206
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 228 place count 130 transition count 202
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 231 place count 127 transition count 182
Iterating global reduction 6 with 3 rules applied. Total rules applied 234 place count 127 transition count 182
Applied a total of 234 rules in 18 ms. Remains 127 /225 variables (removed 98) and now considering 182/470 (removed 288) transitions.
// Phase 1: matrix 182 rows 127 cols
[2023-03-08 04:16:24] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-08 04:16:24] [INFO ] Implicit Places using invariants in 71 ms returned []
[2023-03-08 04:16:24] [INFO ] Invariant cache hit.
[2023-03-08 04:16:24] [INFO ] State equation strengthened by 62 read => feed constraints.
[2023-03-08 04:16:25] [INFO ] Implicit Places using invariants and state equation in 301 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
[2023-03-08 04:16:25] [INFO ] Invariant cache hit.
[2023-03-08 04:16:25] [INFO ] Dead Transitions using invariants and state equation in 88 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 127/225 places, 182/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 483 ms. Remains : 127/225 places, 182/470 transitions.
Stuttering acceptance computed with spot in 282 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s64 1)), p1:(OR (LT s1 1) (LT s96 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 352 ms.
Product exploration explored 100000 steps with 50000 reset in 280 ms.
Computed a total of 5 stabilizing places and 17 stable transitions
Graph (complete) has 458 edges and 127 vertex of which 126 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 17 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 4 factoid took 79 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-00 finished in 1535 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(G(p0))))))'
Support contains 2 out of 225 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 470/470 transitions.
Discarding 33 places :
Symmetric choice reduction at 0 with 33 rule applications. Total rules 33 place count 192 transition count 342
Iterating global reduction 0 with 33 rules applied. Total rules applied 66 place count 192 transition count 342
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 71 place count 192 transition count 337
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 94 place count 169 transition count 306
Iterating global reduction 1 with 23 rules applied. Total rules applied 117 place count 169 transition count 306
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 127 place count 169 transition count 296
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 146 place count 150 transition count 262
Iterating global reduction 2 with 19 rules applied. Total rules applied 165 place count 150 transition count 262
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 175 place count 150 transition count 252
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 185 place count 140 transition count 235
Iterating global reduction 3 with 10 rules applied. Total rules applied 195 place count 140 transition count 235
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 199 place count 140 transition count 231
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 206 place count 133 transition count 224
Iterating global reduction 4 with 7 rules applied. Total rules applied 213 place count 133 transition count 224
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 219 place count 133 transition count 218
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 225 place count 127 transition count 195
Iterating global reduction 5 with 6 rules applied. Total rules applied 231 place count 127 transition count 195
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 235 place count 127 transition count 191
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 238 place count 124 transition count 171
Iterating global reduction 6 with 3 rules applied. Total rules applied 241 place count 124 transition count 171
Applied a total of 241 rules in 25 ms. Remains 124 /225 variables (removed 101) and now considering 171/470 (removed 299) transitions.
// Phase 1: matrix 171 rows 124 cols
[2023-03-08 04:16:26] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 04:16:26] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-08 04:16:26] [INFO ] Invariant cache hit.
[2023-03-08 04:16:26] [INFO ] State equation strengthened by 52 read => feed constraints.
[2023-03-08 04:16:26] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 278 ms to find 0 implicit places.
[2023-03-08 04:16:26] [INFO ] Invariant cache hit.
[2023-03-08 04:16:26] [INFO ] Dead Transitions using invariants and state equation in 84 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 124/225 places, 171/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 392 ms. Remains : 124/225 places, 171/470 transitions.
Stuttering acceptance computed with spot in 190 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=true, acceptance={} source=5 dest: 4}]], initial=5, aps=[p0:(AND (GEQ s1 1) (GEQ s58 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-01 finished in 599 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 225 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 225/225 places, 470/470 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 193 transition count 343
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 193 transition count 343
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 69 place count 193 transition count 338
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 91 place count 171 transition count 308
Iterating global reduction 1 with 22 rules applied. Total rules applied 113 place count 171 transition count 308
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 123 place count 171 transition count 298
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 141 place count 153 transition count 268
Iterating global reduction 2 with 18 rules applied. Total rules applied 159 place count 153 transition count 268
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 169 place count 153 transition count 258
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 178 place count 144 transition count 242
Iterating global reduction 3 with 9 rules applied. Total rules applied 187 place count 144 transition count 242
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 191 place count 144 transition count 238
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 197 place count 138 transition count 232
Iterating global reduction 4 with 6 rules applied. Total rules applied 203 place count 138 transition count 232
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 209 place count 138 transition count 226
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 214 place count 133 transition count 204
Iterating global reduction 5 with 5 rules applied. Total rules applied 219 place count 133 transition count 204
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 220 place count 133 transition count 203
Applied a total of 220 rules in 45 ms. Remains 133 /225 variables (removed 92) and now considering 203/470 (removed 267) transitions.
// Phase 1: matrix 203 rows 133 cols
[2023-03-08 04:16:26] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-08 04:16:27] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-08 04:16:27] [INFO ] Invariant cache hit.
[2023-03-08 04:16:27] [INFO ] State equation strengthened by 77 read => feed constraints.
[2023-03-08 04:16:27] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 379 ms to find 0 implicit places.
[2023-03-08 04:16:27] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-08 04:16:27] [INFO ] Invariant cache hit.
[2023-03-08 04:16:27] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/225 places, 203/470 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 534 ms. Remains : 133/225 places, 203/470 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s88 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-02 finished in 588 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(p1)))'
Support contains 4 out of 225 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 470/470 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 193 transition count 343
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 193 transition count 343
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 68 place count 193 transition count 339
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 91 place count 170 transition count 308
Iterating global reduction 1 with 23 rules applied. Total rules applied 114 place count 170 transition count 308
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 124 place count 170 transition count 298
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 143 place count 151 transition count 264
Iterating global reduction 2 with 19 rules applied. Total rules applied 162 place count 151 transition count 264
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 172 place count 151 transition count 254
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 182 place count 141 transition count 237
Iterating global reduction 3 with 10 rules applied. Total rules applied 192 place count 141 transition count 237
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 196 place count 141 transition count 233
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 203 place count 134 transition count 226
Iterating global reduction 4 with 7 rules applied. Total rules applied 210 place count 134 transition count 226
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 216 place count 134 transition count 220
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 221 place count 129 transition count 205
Iterating global reduction 5 with 5 rules applied. Total rules applied 226 place count 129 transition count 205
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 230 place count 129 transition count 201
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 233 place count 126 transition count 181
Iterating global reduction 6 with 3 rules applied. Total rules applied 236 place count 126 transition count 181
Applied a total of 236 rules in 21 ms. Remains 126 /225 variables (removed 99) and now considering 181/470 (removed 289) transitions.
// Phase 1: matrix 181 rows 126 cols
[2023-03-08 04:16:27] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 04:16:27] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-08 04:16:27] [INFO ] Invariant cache hit.
[2023-03-08 04:16:27] [INFO ] State equation strengthened by 61 read => feed constraints.
[2023-03-08 04:16:27] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2023-03-08 04:16:27] [INFO ] Invariant cache hit.
[2023-03-08 04:16:27] [INFO ] Dead Transitions using invariants and state equation in 72 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 126/225 places, 181/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 393 ms. Remains : 126/225 places, 181/470 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s4 1) (GEQ s52 1)), p1:(AND (GEQ s1 1) (GEQ s69 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-03 finished in 570 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((p0 U p1)&&(p2||X(G(p3)))))))'
Support contains 5 out of 225 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 470/470 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 196 transition count 365
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 196 transition count 365
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 63 place count 196 transition count 360
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 84 place count 175 transition count 331
Iterating global reduction 1 with 21 rules applied. Total rules applied 105 place count 175 transition count 331
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 115 place count 175 transition count 321
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 132 place count 158 transition count 291
Iterating global reduction 2 with 17 rules applied. Total rules applied 149 place count 158 transition count 291
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 160 place count 158 transition count 280
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 169 place count 149 transition count 264
Iterating global reduction 3 with 9 rules applied. Total rules applied 178 place count 149 transition count 264
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 186 place count 149 transition count 256
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 191 place count 144 transition count 251
Iterating global reduction 4 with 5 rules applied. Total rules applied 196 place count 144 transition count 251
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 201 place count 144 transition count 246
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 206 place count 139 transition count 224
Iterating global reduction 5 with 5 rules applied. Total rules applied 211 place count 139 transition count 224
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 214 place count 139 transition count 221
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 216 place count 137 transition count 209
Iterating global reduction 6 with 2 rules applied. Total rules applied 218 place count 137 transition count 209
Applied a total of 218 rules in 20 ms. Remains 137 /225 variables (removed 88) and now considering 209/470 (removed 261) transitions.
// Phase 1: matrix 209 rows 137 cols
[2023-03-08 04:16:28] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 04:16:28] [INFO ] Implicit Places using invariants in 65 ms returned []
[2023-03-08 04:16:28] [INFO ] Invariant cache hit.
[2023-03-08 04:16:28] [INFO ] State equation strengthened by 78 read => feed constraints.
[2023-03-08 04:16:28] [INFO ] Implicit Places using invariants and state equation in 293 ms returned []
Implicit Place search using SMT with State Equation took 360 ms to find 0 implicit places.
[2023-03-08 04:16:28] [INFO ] Invariant cache hit.
[2023-03-08 04:16:28] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 137/225 places, 209/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 463 ms. Remains : 137/225 places, 209/470 transitions.
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p1) (AND (NOT p2) (NOT p3))), true, (NOT p1), (NOT p3)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 4}, { cond=(OR (AND p1 (NOT p2)) (AND p0 (NOT p2))), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p3), acceptance={} source=5 dest: 3}, { cond=p3, acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s100 1)), p0:(AND (GEQ s1 1) (GEQ s130 1)), p2:(AND (GEQ s1 1) (GEQ s73 1)), p3:(AND (GEQ s1 1) (GEQ s131 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-04 finished in 720 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 5 out of 225 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 470/470 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 195 transition count 351
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 195 transition count 351
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 64 place count 195 transition count 347
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 84 place count 175 transition count 319
Iterating global reduction 1 with 20 rules applied. Total rules applied 104 place count 175 transition count 319
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 111 place count 175 transition count 312
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 128 place count 158 transition count 282
Iterating global reduction 2 with 17 rules applied. Total rules applied 145 place count 158 transition count 282
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 154 place count 158 transition count 273
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 163 place count 149 transition count 258
Iterating global reduction 3 with 9 rules applied. Total rules applied 172 place count 149 transition count 258
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 175 place count 149 transition count 255
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 182 place count 142 transition count 248
Iterating global reduction 4 with 7 rules applied. Total rules applied 189 place count 142 transition count 248
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 195 place count 142 transition count 242
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 201 place count 136 transition count 219
Iterating global reduction 5 with 6 rules applied. Total rules applied 207 place count 136 transition count 219
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 211 place count 136 transition count 215
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 213 place count 134 transition count 203
Iterating global reduction 6 with 2 rules applied. Total rules applied 215 place count 134 transition count 203
Applied a total of 215 rules in 18 ms. Remains 134 /225 variables (removed 91) and now considering 203/470 (removed 267) transitions.
// Phase 1: matrix 203 rows 134 cols
[2023-03-08 04:16:28] [INFO ] Computed 2 place invariants in 5 ms
[2023-03-08 04:16:28] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-08 04:16:28] [INFO ] Invariant cache hit.
[2023-03-08 04:16:28] [INFO ] State equation strengthened by 74 read => feed constraints.
[2023-03-08 04:16:29] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 319 ms to find 0 implicit places.
[2023-03-08 04:16:29] [INFO ] Invariant cache hit.
[2023-03-08 04:16:29] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 134/225 places, 203/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 417 ms. Remains : 134/225 places, 203/470 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s123 1) (OR (LT s49 1) (LT s55 1) (LT s8 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-05 finished in 515 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(p1)))))'
Support contains 4 out of 225 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 470/470 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 193 transition count 348
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 193 transition count 348
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 69 place count 193 transition count 343
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 91 place count 171 transition count 313
Iterating global reduction 1 with 22 rules applied. Total rules applied 113 place count 171 transition count 313
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 123 place count 171 transition count 303
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 141 place count 153 transition count 271
Iterating global reduction 2 with 18 rules applied. Total rules applied 159 place count 153 transition count 271
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 169 place count 153 transition count 261
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 179 place count 143 transition count 244
Iterating global reduction 3 with 10 rules applied. Total rules applied 189 place count 143 transition count 244
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 195 place count 143 transition count 238
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 201 place count 137 transition count 232
Iterating global reduction 4 with 6 rules applied. Total rules applied 207 place count 137 transition count 232
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 213 place count 137 transition count 226
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 218 place count 132 transition count 204
Iterating global reduction 5 with 5 rules applied. Total rules applied 223 place count 132 transition count 204
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 226 place count 132 transition count 201
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 229 place count 129 transition count 181
Iterating global reduction 6 with 3 rules applied. Total rules applied 232 place count 129 transition count 181
Applied a total of 232 rules in 17 ms. Remains 129 /225 variables (removed 96) and now considering 181/470 (removed 289) transitions.
// Phase 1: matrix 181 rows 129 cols
[2023-03-08 04:16:29] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 04:16:29] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-08 04:16:29] [INFO ] Invariant cache hit.
[2023-03-08 04:16:29] [INFO ] State equation strengthened by 57 read => feed constraints.
[2023-03-08 04:16:29] [INFO ] Implicit Places using invariants and state equation in 255 ms returned []
Implicit Place search using SMT with State Equation took 326 ms to find 0 implicit places.
[2023-03-08 04:16:29] [INFO ] Invariant cache hit.
[2023-03-08 04:16:29] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 129/225 places, 181/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 422 ms. Remains : 129/225 places, 181/470 transitions.
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}]], initial=1, aps=[p1:(AND (GEQ s29 1) (GEQ s99 1)), p0:(AND (GEQ s1 1) (GEQ s123 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-06 finished in 524 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U G((F(G(p1))&&(p2||X(p3))))))'
Support contains 8 out of 225 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 470/470 transitions.
Discarding 29 places :
Symmetric choice reduction at 0 with 29 rule applications. Total rules 29 place count 196 transition count 351
Iterating global reduction 0 with 29 rules applied. Total rules applied 58 place count 196 transition count 351
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 63 place count 196 transition count 346
Discarding 19 places :
Symmetric choice reduction at 1 with 19 rule applications. Total rules 82 place count 177 transition count 326
Iterating global reduction 1 with 19 rules applied. Total rules applied 101 place count 177 transition count 326
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 110 place count 177 transition count 317
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 126 place count 161 transition count 287
Iterating global reduction 2 with 16 rules applied. Total rules applied 142 place count 161 transition count 287
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 152 place count 161 transition count 277
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 159 place count 154 transition count 263
Iterating global reduction 3 with 7 rules applied. Total rules applied 166 place count 154 transition count 263
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 170 place count 154 transition count 259
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 175 place count 149 transition count 254
Iterating global reduction 4 with 5 rules applied. Total rules applied 180 place count 149 transition count 254
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 182 place count 149 transition count 252
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 185 place count 146 transition count 249
Iterating global reduction 5 with 3 rules applied. Total rules applied 188 place count 146 transition count 249
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 192 place count 146 transition count 245
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 194 place count 144 transition count 232
Iterating global reduction 6 with 2 rules applied. Total rules applied 196 place count 144 transition count 232
Applied a total of 196 rules in 16 ms. Remains 144 /225 variables (removed 81) and now considering 232/470 (removed 238) transitions.
// Phase 1: matrix 232 rows 144 cols
[2023-03-08 04:16:29] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 04:16:29] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-08 04:16:29] [INFO ] Invariant cache hit.
[2023-03-08 04:16:29] [INFO ] State equation strengthened by 90 read => feed constraints.
[2023-03-08 04:16:30] [INFO ] Implicit Places using invariants and state equation in 321 ms returned []
Implicit Place search using SMT with State Equation took 404 ms to find 0 implicit places.
[2023-03-08 04:16:30] [INFO ] Invariant cache hit.
[2023-03-08 04:16:30] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 144/225 places, 232/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 520 ms. Remains : 144/225 places, 232/470 transitions.
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p3))), false, true, (AND p0 (NOT p3)), (AND (NOT p2) p0 (NOT p3))]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={0} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p2) p0 (NOT p3)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p3)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=3 dest: 5}, { cond=(NOT p0), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(AND p0 (NOT p3)), acceptance={} source=5 dest: 4}], [{ cond=(AND (NOT p2) p0), acceptance={} source=6 dest: 5}, { cond=p0, acceptance={} source=6 dest: 6}]], initial=0, aps=[p1:(AND (GEQ s27 1) (GEQ s119 1)), p2:(AND (GEQ s1 1) (GEQ s137 1)), p0:(AND (GEQ s58 1) (GEQ s99 1)), p3:(AND (GEQ s8 1) (GEQ s59 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-08 finished in 790 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))&&(X(!p1) U G((X(p1)&&p2)))))'
Support contains 5 out of 225 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 470/470 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 194 transition count 355
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 194 transition count 355
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 67 place count 194 transition count 350
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 88 place count 173 transition count 321
Iterating global reduction 1 with 21 rules applied. Total rules applied 109 place count 173 transition count 321
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 119 place count 173 transition count 311
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 136 place count 156 transition count 280
Iterating global reduction 2 with 17 rules applied. Total rules applied 153 place count 156 transition count 280
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 2 with 11 rules applied. Total rules applied 164 place count 156 transition count 269
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 172 place count 148 transition count 255
Iterating global reduction 3 with 8 rules applied. Total rules applied 180 place count 148 transition count 255
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 186 place count 148 transition count 249
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 191 place count 143 transition count 244
Iterating global reduction 4 with 5 rules applied. Total rules applied 196 place count 143 transition count 244
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 200 place count 143 transition count 240
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 205 place count 138 transition count 218
Iterating global reduction 5 with 5 rules applied. Total rules applied 210 place count 138 transition count 218
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 213 place count 138 transition count 215
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 216 place count 135 transition count 195
Iterating global reduction 6 with 3 rules applied. Total rules applied 219 place count 135 transition count 195
Applied a total of 219 rules in 17 ms. Remains 135 /225 variables (removed 90) and now considering 195/470 (removed 275) transitions.
// Phase 1: matrix 195 rows 135 cols
[2023-03-08 04:16:30] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 04:16:30] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-08 04:16:30] [INFO ] Invariant cache hit.
[2023-03-08 04:16:30] [INFO ] State equation strengthened by 65 read => feed constraints.
[2023-03-08 04:16:30] [INFO ] Implicit Places using invariants and state equation in 270 ms returned []
Implicit Place search using SMT with State Equation took 358 ms to find 0 implicit places.
[2023-03-08 04:16:30] [INFO ] Invariant cache hit.
[2023-03-08 04:16:31] [INFO ] Dead Transitions using invariants and state equation in 78 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 135/225 places, 195/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 454 ms. Remains : 135/225 places, 195/470 transitions.
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (OR (NOT p2) (NOT p1) (NOT p0)), true]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p2 p0 p1), acceptance={} source=0 dest: 0}, { cond=(OR (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND p2 p0 p1), acceptance={0} source=1 dest: 0}, { cond=(AND p2 p0 (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(OR (AND (NOT p2) p1) (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p2, acceptance={} source=3 dest: 1}, { cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=(AND p2 p0 (NOT p1)), acceptance={0} source=4 dest: 1}, { cond=(OR (NOT p0) p1), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(AND (GEQ s38 1) (GEQ s102 1)), p0:(OR (LT s1 1) (LT s133 1)), p1:(AND (GEQ s1 1) (GEQ s127 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-09 finished in 657 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(G(p1)))||p0)))'
Support contains 4 out of 225 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 470/470 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 195 transition count 360
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 195 transition count 360
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 65 place count 195 transition count 355
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 85 place count 175 transition count 327
Iterating global reduction 1 with 20 rules applied. Total rules applied 105 place count 175 transition count 327
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 115 place count 175 transition count 317
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 131 place count 159 transition count 287
Iterating global reduction 2 with 16 rules applied. Total rules applied 147 place count 159 transition count 287
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 156 place count 159 transition count 278
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 164 place count 151 transition count 267
Iterating global reduction 3 with 8 rules applied. Total rules applied 172 place count 151 transition count 267
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 178 place count 151 transition count 261
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 183 place count 146 transition count 256
Iterating global reduction 4 with 5 rules applied. Total rules applied 188 place count 146 transition count 256
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 193 place count 146 transition count 251
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 198 place count 141 transition count 229
Iterating global reduction 5 with 5 rules applied. Total rules applied 203 place count 141 transition count 229
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 207 place count 141 transition count 225
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 210 place count 138 transition count 205
Iterating global reduction 6 with 3 rules applied. Total rules applied 213 place count 138 transition count 205
Applied a total of 213 rules in 22 ms. Remains 138 /225 variables (removed 87) and now considering 205/470 (removed 265) transitions.
// Phase 1: matrix 205 rows 138 cols
[2023-03-08 04:16:31] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 04:16:31] [INFO ] Implicit Places using invariants in 70 ms returned []
[2023-03-08 04:16:31] [INFO ] Invariant cache hit.
[2023-03-08 04:16:31] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-08 04:16:31] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 376 ms to find 0 implicit places.
[2023-03-08 04:16:31] [INFO ] Invariant cache hit.
[2023-03-08 04:16:31] [INFO ] Dead Transitions using invariants and state equation in 75 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 138/225 places, 205/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 475 ms. Remains : 138/225 places, 205/470 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}]], initial=2, aps=[p0:(OR (LT s1 1) (LT s131 1)), p1:(AND (OR (LT s1 1) (LT s128 1)) (GEQ s1 1) (GEQ s136 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 22917 reset in 187 ms.
Product exploration explored 100000 steps with 22851 reset in 185 ms.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 506 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT p1))), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 201 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2299 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 450 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 437 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Finished probabilistic random walk after 17082 steps, run visited all 2 properties in 55 ms. (steps per millisecond=310 )
Probabilistic random walk after 17082 steps, saw 7651 distinct states, run finished after 55 ms. (steps per millisecond=310 ) properties seen :2
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT p1))), true, (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 225 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 138/138 places, 205/205 transitions.
Applied a total of 0 rules in 1 ms. Remains 138 /138 variables (removed 0) and now considering 205/205 (removed 0) transitions.
[2023-03-08 04:16:33] [INFO ] Invariant cache hit.
[2023-03-08 04:16:33] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-08 04:16:33] [INFO ] Invariant cache hit.
[2023-03-08 04:16:33] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-08 04:16:33] [INFO ] Implicit Places using invariants and state equation in 242 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
[2023-03-08 04:16:33] [INFO ] Invariant cache hit.
[2023-03-08 04:16:33] [INFO ] Dead Transitions using invariants and state equation in 73 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 395 ms. Remains : 138/138 places, 205/205 transitions.
Computed a total of 5 stabilizing places and 16 stable transitions
Graph (complete) has 506 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 5 stabilizing places and 16 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X (NOT p1))), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 187 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2313 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 436 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 04:16:33] [INFO ] Invariant cache hit.
[2023-03-08 04:16:34] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 04:16:34] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-08 04:16:34] [INFO ] After 126ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 04:16:34] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 04:16:34] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2023-03-08 04:16:34] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 04:16:34] [INFO ] State equation strengthened by 67 read => feed constraints.
[2023-03-08 04:16:34] [INFO ] After 36ms SMT Verify possible using 67 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 04:16:34] [INFO ] After 77ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 27 ms.
[2023-03-08 04:16:34] [INFO ] After 216ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 138 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 138/138 places, 205/205 transitions.
Graph (complete) has 473 edges and 138 vertex of which 137 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 137 transition count 202
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 135 transition count 194
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 135 transition count 194
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 10 place count 133 transition count 192
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 133 transition count 192
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 14 place count 131 transition count 189
Iterating global reduction 1 with 2 rules applied. Total rules applied 16 place count 131 transition count 189
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 18 place count 131 transition count 187
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 130 transition count 186
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 130 transition count 186
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 129 transition count 185
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 129 transition count 185
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 129 transition count 184
Applied a total of 23 rules in 19 ms. Remains 129 /138 variables (removed 9) and now considering 184/205 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 129/138 places, 184/205 transitions.
Incomplete random walk after 10000 steps, including 2260 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 446 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 16926 steps, run visited all 1 properties in 30 ms. (steps per millisecond=564 )
Probabilistic random walk after 16926 steps, saw 7930 distinct states, run finished after 30 ms. (steps per millisecond=564 ) properties seen :1
Knowledge obtained : [(AND (NOT p1) p0), (X p0), (X (X (NOT p1))), true, (X (X p0))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 278 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 108 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 23069 reset in 150 ms.
Product exploration explored 100000 steps with 22919 reset in 147 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 159 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 138 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 138/138 places, 205/205 transitions.
Applied a total of 0 rules in 14 ms. Remains 138 /138 variables (removed 0) and now considering 205/205 (removed 0) transitions.
[2023-03-08 04:16:35] [INFO ] Redundant transitions in 6 ms returned []
[2023-03-08 04:16:35] [INFO ] Invariant cache hit.
[2023-03-08 04:16:35] [INFO ] Dead Transitions using invariants and state equation in 112 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 143 ms. Remains : 138/138 places, 205/205 transitions.
Built C files in :
/tmp/ltsmin15893765065970416648
[2023-03-08 04:16:35] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15893765065970416648
Running compilation step : cd /tmp/ltsmin15893765065970416648;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 405 ms.
Running link step : cd /tmp/ltsmin15893765065970416648;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin15893765065970416648;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13190426371499079415.hoa' '--buchi-type=spotba'
LTSmin run took 1142 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-10 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-10 finished in 6215 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||X((X(p1)||(X(G(p3))&&p2))))))'
Support contains 6 out of 225 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 470/470 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 194 transition count 349
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 194 transition count 349
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 67 place count 194 transition count 344
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 88 place count 173 transition count 315
Iterating global reduction 1 with 21 rules applied. Total rules applied 109 place count 173 transition count 315
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 1 with 7 rules applied. Total rules applied 116 place count 173 transition count 308
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 134 place count 155 transition count 276
Iterating global reduction 2 with 18 rules applied. Total rules applied 152 place count 155 transition count 276
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 162 place count 155 transition count 266
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 172 place count 145 transition count 249
Iterating global reduction 3 with 10 rules applied. Total rules applied 182 place count 145 transition count 249
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 3 with 6 rules applied. Total rules applied 188 place count 145 transition count 243
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 194 place count 139 transition count 237
Iterating global reduction 4 with 6 rules applied. Total rules applied 200 place count 139 transition count 237
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 206 place count 139 transition count 231
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 208 place count 137 transition count 229
Iterating global reduction 5 with 2 rules applied. Total rules applied 210 place count 137 transition count 229
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 213 place count 137 transition count 226
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 216 place count 134 transition count 206
Iterating global reduction 6 with 3 rules applied. Total rules applied 219 place count 134 transition count 206
Applied a total of 219 rules in 23 ms. Remains 134 /225 variables (removed 91) and now considering 206/470 (removed 264) transitions.
// Phase 1: matrix 206 rows 134 cols
[2023-03-08 04:16:37] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 04:16:37] [INFO ] Implicit Places using invariants in 66 ms returned []
[2023-03-08 04:16:37] [INFO ] Invariant cache hit.
[2023-03-08 04:16:37] [INFO ] State equation strengthened by 80 read => feed constraints.
[2023-03-08 04:16:37] [INFO ] Implicit Places using invariants and state equation in 262 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
[2023-03-08 04:16:37] [INFO ] Invariant cache hit.
[2023-03-08 04:16:37] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 134/225 places, 206/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 432 ms. Remains : 134/225 places, 206/470 transitions.
Stuttering acceptance computed with spot in 155 ms :[(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))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3))]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p2 (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p3), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p2 (NOT p1) (NOT p3)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s7 1) (GEQ s55 1)), p2:(AND (GEQ s1 1) (GEQ s128 1)), p1:(AND (GEQ s40 1) (GEQ s106 1)), p3:(AND (GEQ s1 1) (GEQ s128 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-11 finished in 609 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(X(X(F(p1))))))'
Support contains 4 out of 225 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 470/470 transitions.
Discarding 31 places :
Symmetric choice reduction at 0 with 31 rule applications. Total rules 31 place count 194 transition count 353
Iterating global reduction 0 with 31 rules applied. Total rules applied 62 place count 194 transition count 353
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 67 place count 194 transition count 348
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 90 place count 171 transition count 317
Iterating global reduction 1 with 23 rules applied. Total rules applied 113 place count 171 transition count 317
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 123 place count 171 transition count 307
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 141 place count 153 transition count 275
Iterating global reduction 2 with 18 rules applied. Total rules applied 159 place count 153 transition count 275
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 169 place count 153 transition count 265
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 178 place count 144 transition count 250
Iterating global reduction 3 with 9 rules applied. Total rules applied 187 place count 144 transition count 250
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 190 place count 144 transition count 247
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 197 place count 137 transition count 240
Iterating global reduction 4 with 7 rules applied. Total rules applied 204 place count 137 transition count 240
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 211 place count 137 transition count 233
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 217 place count 131 transition count 210
Iterating global reduction 5 with 6 rules applied. Total rules applied 223 place count 131 transition count 210
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 227 place count 131 transition count 206
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 230 place count 128 transition count 186
Iterating global reduction 6 with 3 rules applied. Total rules applied 233 place count 128 transition count 186
Applied a total of 233 rules in 22 ms. Remains 128 /225 variables (removed 97) and now considering 186/470 (removed 284) transitions.
// Phase 1: matrix 186 rows 128 cols
[2023-03-08 04:16:38] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 04:16:38] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-08 04:16:38] [INFO ] Invariant cache hit.
[2023-03-08 04:16:38] [INFO ] State equation strengthened by 63 read => feed constraints.
[2023-03-08 04:16:38] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 300 ms to find 0 implicit places.
[2023-03-08 04:16:38] [INFO ] Invariant cache hit.
[2023-03-08 04:16:38] [INFO ] Dead Transitions using invariants and state equation in 70 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 128/225 places, 186/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 392 ms. Remains : 128/225 places, 186/470 transitions.
Stuttering acceptance computed with spot in 380 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 0}], [{ cond=true, acceptance={} source=4 dest: 3}], [{ cond=(NOT p0), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 6}], [{ cond=p0, acceptance={} source=6 dest: 1}, { cond=(NOT p0), acceptance={} source=6 dest: 3}]], initial=5, aps=[p1:(AND (GEQ s1 1) (GEQ s95 1)), p0:(AND (GEQ s47 1) (GEQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-12 finished in 793 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(((G(p1) U p2)&&p0))))'
Support contains 5 out of 225 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 225/225 places, 470/470 transitions.
Discarding 30 places :
Symmetric choice reduction at 0 with 30 rule applications. Total rules 30 place count 195 transition count 351
Iterating global reduction 0 with 30 rules applied. Total rules applied 60 place count 195 transition count 351
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 65 place count 195 transition count 346
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 86 place count 174 transition count 318
Iterating global reduction 1 with 21 rules applied. Total rules applied 107 place count 174 transition count 318
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 116 place count 174 transition count 309
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 134 place count 156 transition count 277
Iterating global reduction 2 with 18 rules applied. Total rules applied 152 place count 156 transition count 277
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 161 place count 156 transition count 268
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 171 place count 146 transition count 251
Iterating global reduction 3 with 10 rules applied. Total rules applied 181 place count 146 transition count 251
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 185 place count 146 transition count 247
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 192 place count 139 transition count 240
Iterating global reduction 4 with 7 rules applied. Total rules applied 199 place count 139 transition count 240
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 205 place count 139 transition count 234
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 210 place count 134 transition count 218
Iterating global reduction 5 with 5 rules applied. Total rules applied 215 place count 134 transition count 218
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 219 place count 134 transition count 214
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 221 place count 132 transition count 201
Iterating global reduction 6 with 2 rules applied. Total rules applied 223 place count 132 transition count 201
Applied a total of 223 rules in 38 ms. Remains 132 /225 variables (removed 93) and now considering 201/470 (removed 269) transitions.
// Phase 1: matrix 201 rows 132 cols
[2023-03-08 04:16:38] [INFO ] Computed 2 place invariants in 4 ms
[2023-03-08 04:16:38] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-08 04:16:38] [INFO ] Invariant cache hit.
[2023-03-08 04:16:39] [INFO ] State equation strengthened by 76 read => feed constraints.
[2023-03-08 04:16:39] [INFO ] Implicit Places using invariants and state equation in 230 ms returned []
Implicit Place search using SMT with State Equation took 308 ms to find 0 implicit places.
[2023-03-08 04:16:39] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 04:16:39] [INFO ] Invariant cache hit.
[2023-03-08 04:16:39] [INFO ] Dead Transitions using invariants and state equation in 83 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/225 places, 201/470 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 438 ms. Remains : 132/225 places, 201/470 transitions.
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(OR (AND p2 p0) (AND p0 p1)), acceptance={0} source=0 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (NOT p0)), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p2) p0 p1), acceptance={1} source=0 dest: 1}, { cond=(AND (NOT p2) p0 p1), acceptance={0, 1} source=0 dest: 2}], [{ cond=(AND p2 p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(OR (AND (NOT p2) (NOT p1)) (AND (NOT p0) (NOT p1))), acceptance={0, 1} source=1 dest: 0}, { cond=(AND p2 p0 p1), acceptance={} source=1 dest: 1}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p0) p1)), acceptance={1} source=1 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0, 1} source=2 dest: 0}, { cond=(AND (NOT p2) p1), acceptance={1} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0, 1} source=2 dest: 2}]], initial=0, aps=[p2:(AND (GEQ s1 1) (GEQ s59 1)), p0:(AND (GEQ s9 1) (GEQ s54 1)), p1:(AND (GEQ s1 1) (GEQ s93 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-13 finished in 585 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 225 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 225/225 places, 470/470 transitions.
Discarding 32 places :
Symmetric choice reduction at 0 with 32 rule applications. Total rules 32 place count 193 transition count 344
Iterating global reduction 0 with 32 rules applied. Total rules applied 64 place count 193 transition count 344
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 69 place count 193 transition count 339
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 92 place count 170 transition count 308
Iterating global reduction 1 with 23 rules applied. Total rules applied 115 place count 170 transition count 308
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 125 place count 170 transition count 298
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 144 place count 151 transition count 264
Iterating global reduction 2 with 19 rules applied. Total rules applied 163 place count 151 transition count 264
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 173 place count 151 transition count 254
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 183 place count 141 transition count 237
Iterating global reduction 3 with 10 rules applied. Total rules applied 193 place count 141 transition count 237
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 197 place count 141 transition count 233
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 204 place count 134 transition count 226
Iterating global reduction 4 with 7 rules applied. Total rules applied 211 place count 134 transition count 226
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 217 place count 134 transition count 220
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 223 place count 128 transition count 197
Iterating global reduction 5 with 6 rules applied. Total rules applied 229 place count 128 transition count 197
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 233 place count 128 transition count 193
Discarding 3 places :
Symmetric choice reduction at 6 with 3 rule applications. Total rules 236 place count 125 transition count 173
Iterating global reduction 6 with 3 rules applied. Total rules applied 239 place count 125 transition count 173
Applied a total of 239 rules in 15 ms. Remains 125 /225 variables (removed 100) and now considering 173/470 (removed 297) transitions.
// Phase 1: matrix 173 rows 125 cols
[2023-03-08 04:16:39] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 04:16:39] [INFO ] Implicit Places using invariants in 69 ms returned []
[2023-03-08 04:16:39] [INFO ] Invariant cache hit.
[2023-03-08 04:16:39] [INFO ] State equation strengthened by 54 read => feed constraints.
[2023-03-08 04:16:39] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 343 ms to find 0 implicit places.
[2023-03-08 04:16:39] [INFO ] Invariant cache hit.
[2023-03-08 04:16:39] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 125/225 places, 173/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 422 ms. Remains : 125/225 places, 173/470 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d2m06-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s94 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d2m06-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d2m06-LTLFireability-15 finished in 527 ms.
All properties solved by simple procedures.
Total runtime 34203 ms.

BK_STOP 1678249001009

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="DBSingleClientW-PT-d2m06"
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-5348"
echo " Executing tool itstools"
echo " Input is DBSingleClientW-PT-d2m06, 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 r101-tall-167814475200308"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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