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

About the Execution of LTSMin+red for DBSingleClientW-PT-d0m05

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
300.779 8066.00 15120.00 340.40 FFTFFTTFTFFFTTTF 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.r105-tall-167814480900187.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 ltsminxred
Input is DBSingleClientW-PT-d0m05, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814480900187
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 620K
-rw-r--r-- 1 mcc users 8.5K Feb 26 15:17 CTLCardinality.txt
-rw-r--r-- 1 mcc users 96K Feb 26 15:17 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.8K Feb 26 15:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 40K Feb 26 15:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Feb 25 15:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 15:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 15:18 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 153K Feb 26 15:18 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Feb 26 15:17 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 88K Feb 26 15:17 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Feb 25 15:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:48 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 119K 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-d0m05-LTLCardinality-00
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLCardinality-01
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLCardinality-02
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLCardinality-03
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLCardinality-04
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLCardinality-05
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLCardinality-06
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLCardinality-07
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLCardinality-08
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLCardinality-09
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLCardinality-10
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLCardinality-11
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLCardinality-12
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLCardinality-13
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLCardinality-14
FORMULA_NAME DBSingleClientW-PT-d0m05-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1678265080838

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=ltsminxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d0m05
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 08:44:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2023-03-08 08:44:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 08:44:42] [INFO ] Load time of PNML (sax parser for PT used): 57 ms
[2023-03-08 08:44:42] [INFO ] Transformed 553 places.
[2023-03-08 08:44:42] [INFO ] Transformed 150 transitions.
[2023-03-08 08:44:42] [INFO ] Parsed PT model containing 553 places and 150 transitions and 600 arcs in 121 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 444 places in 1 ms
Reduce places removed 444 places and 0 transitions.
Initial state reduction rules removed 3 formulas.
FORMULA DBSingleClientW-PT-d0m05-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d0m05-LTLCardinality-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 4 out of 109 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 109/109 places, 150/150 transitions.
Reduce places removed 7 places and 0 transitions.
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 102 transition count 139
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 40 place count 80 transition count 100
Iterating global reduction 1 with 22 rules applied. Total rules applied 62 place count 80 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 63 place count 80 transition count 99
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 73 place count 70 transition count 89
Iterating global reduction 2 with 10 rules applied. Total rules applied 83 place count 70 transition count 89
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 85 place count 70 transition count 87
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 86 place count 69 transition count 84
Iterating global reduction 3 with 1 rules applied. Total rules applied 87 place count 69 transition count 84
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 88 place count 68 transition count 83
Iterating global reduction 3 with 1 rules applied. Total rules applied 89 place count 68 transition count 83
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 90 place count 67 transition count 82
Iterating global reduction 3 with 1 rules applied. Total rules applied 91 place count 67 transition count 82
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 93 place count 67 transition count 80
Applied a total of 93 rules in 33 ms. Remains 67 /109 variables (removed 42) and now considering 80/150 (removed 70) transitions.
// Phase 1: matrix 80 rows 67 cols
[2023-03-08 08:44:42] [INFO ] Computed 2 place invariants in 20 ms
[2023-03-08 08:44:42] [INFO ] Implicit Places using invariants in 179 ms returned []
[2023-03-08 08:44:42] [INFO ] Invariant cache hit.
[2023-03-08 08:44:42] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-08 08:44:43] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 413 ms to find 0 implicit places.
[2023-03-08 08:44:43] [INFO ] Invariant cache hit.
[2023-03-08 08:44:43] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 67/109 places, 80/150 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 497 ms. Remains : 67/109 places, 80/150 transitions.
Support contains 4 out of 67 places after structural reductions.
[2023-03-08 08:44:43] [INFO ] Flatten gal took : 27 ms
[2023-03-08 08:44:43] [INFO ] Flatten gal took : 12 ms
[2023-03-08 08:44:43] [INFO ] Input system was already deterministic with 80 transitions.
Incomplete random walk after 10000 steps, including 2273 resets, run finished after 187 ms. (steps per millisecond=53 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10000 steps, including 995 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 997 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-08 08:44:43] [INFO ] Invariant cache hit.
[2023-03-08 08:44:43] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 08:44:43] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-08 08:44:43] [INFO ] After 33ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2
[2023-03-08 08:44:43] [INFO ] State equation strengthened by 27 read => feed constraints.
[2023-03-08 08:44:43] [INFO ] After 13ms SMT Verify possible using 27 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 08:44:43] [INFO ] After 120ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-08 08:44:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-08 08:44:43] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-08 08:44:43] [INFO ] After 29ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-08 08:44:43] [INFO ] After 19ms SMT Verify possible using 27 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-08 08:44:43] [INFO ] After 39ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 13 ms.
[2023-03-08 08:44:43] [INFO ] After 125ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 67 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 67/67 places, 80/80 transitions.
Graph (complete) has 198 edges and 67 vertex of which 66 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 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 66 transition count 79
Applied a total of 2 rules in 11 ms. Remains 66 /67 variables (removed 1) and now considering 79/80 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 66/67 places, 79/80 transitions.
Incomplete random walk after 10000 steps, including 2323 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 1004 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 1024 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 2) seen :0
Finished probabilistic random walk after 20711 steps, run visited all 2 properties in 101 ms. (steps per millisecond=205 )
Probabilistic random walk after 20711 steps, saw 9150 distinct states, run finished after 101 ms. (steps per millisecond=205 ) properties seen :2
FORMULA DBSingleClientW-PT-d0m05-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 218 edges and 67 vertex of which 66 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 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))'
Support contains 1 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 80/80 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 65 transition count 76
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 65 transition count 76
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 63 transition count 74
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 63 transition count 74
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 61 transition count 71
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 61 transition count 71
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 61 transition count 70
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 60 transition count 68
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 60 transition count 68
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 59 transition count 67
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 59 transition count 67
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 58 transition count 66
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 58 transition count 66
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 21 place count 58 transition count 64
Applied a total of 21 rules in 12 ms. Remains 58 /67 variables (removed 9) and now considering 64/80 (removed 16) transitions.
// Phase 1: matrix 64 rows 58 cols
[2023-03-08 08:44:44] [INFO ] Computed 2 place invariants in 7 ms
[2023-03-08 08:44:44] [INFO ] Implicit Places using invariants in 75 ms returned []
[2023-03-08 08:44:44] [INFO ] Invariant cache hit.
[2023-03-08 08:44:44] [INFO ] State equation strengthened by 20 read => feed constraints.
[2023-03-08 08:44:44] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 186 ms to find 0 implicit places.
[2023-03-08 08:44:44] [INFO ] Invariant cache hit.
[2023-03-08 08:44:44] [INFO ] Dead Transitions using invariants and state equation in 40 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 58/67 places, 64/80 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 239 ms. Remains : 58/67 places, 64/80 transitions.
Stuttering acceptance computed with spot in 293 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLCardinality-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(LEQ s24 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 279 ms.
Product exploration explored 100000 steps with 50000 reset in 156 ms.
Computed a total of 5 stabilizing places and 9 stable transitions
Graph (complete) has 186 edges and 58 vertex of which 57 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 9 stable transitions
Knowledge obtained : [p0, (X p0), true]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 3 factoid took 67 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d0m05-LTLCardinality-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d0m05-LTLCardinality-05 finished in 1088 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(F(p0)))'
Support contains 1 out of 67 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 67/67 places, 80/80 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 66 transition count 77
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 66 transition count 77
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 65 transition count 76
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 65 transition count 76
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 64 transition count 75
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 64 transition count 75
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 63 transition count 73
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 63 transition count 73
Applied a total of 8 rules in 20 ms. Remains 63 /67 variables (removed 4) and now considering 73/80 (removed 7) transitions.
// Phase 1: matrix 73 rows 63 cols
[2023-03-08 08:44:45] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 08:44:45] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-08 08:44:45] [INFO ] Invariant cache hit.
[2023-03-08 08:44:45] [INFO ] State equation strengthened by 23 read => feed constraints.
[2023-03-08 08:44:45] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 137 ms to find 0 implicit places.
[2023-03-08 08:44:45] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 08:44:45] [INFO ] Invariant cache hit.
[2023-03-08 08:44:45] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 63/67 places, 73/80 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 218 ms. Remains : 63/67 places, 73/80 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLCardinality-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LEQ 2 s61)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 9 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m05-LTLCardinality-09 finished in 304 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 1 out of 67 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 67/67 places, 80/80 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 66 transition count 79
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 66 transition count 79
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 65 transition count 78
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 65 transition count 78
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 64 transition count 76
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 64 transition count 76
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 64 transition count 75
Applied a total of 7 rules in 5 ms. Remains 64 /67 variables (removed 3) and now considering 75/80 (removed 5) transitions.
// Phase 1: matrix 75 rows 64 cols
[2023-03-08 08:44:45] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 08:44:45] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-08 08:44:45] [INFO ] Invariant cache hit.
[2023-03-08 08:44:45] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 08:44:45] [INFO ] Implicit Places using invariants and state equation in 80 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2023-03-08 08:44:45] [INFO ] Invariant cache hit.
[2023-03-08 08:44:45] [INFO ] Dead Transitions using invariants and state equation in 44 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 64/67 places, 75/80 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 189 ms. Remains : 64/67 places, 75/80 transitions.
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d0m05-LTLCardinality-11 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:(GT 1 s62)], 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]]
Product exploration explored 100000 steps with 22962 reset in 183 ms.
Product exploration explored 100000 steps with 22991 reset in 138 ms.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 207 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 143 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2286 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1016 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 8386 steps, run visited all 1 properties in 15 ms. (steps per millisecond=559 )
Probabilistic random walk after 8386 steps, saw 3665 distinct states, run finished after 15 ms. (steps per millisecond=559 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 182 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 101 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[true, (NOT p0), (NOT p0)]
Support contains 1 out of 64 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 64/64 places, 75/75 transitions.
Applied a total of 0 rules in 6 ms. Remains 64 /64 variables (removed 0) and now considering 75/75 (removed 0) transitions.
[2023-03-08 08:44:46] [INFO ] Invariant cache hit.
[2023-03-08 08:44:46] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-08 08:44:46] [INFO ] Invariant cache hit.
[2023-03-08 08:44:46] [INFO ] State equation strengthened by 25 read => feed constraints.
[2023-03-08 08:44:46] [INFO ] Implicit Places using invariants and state equation in 83 ms returned []
Implicit Place search using SMT with State Equation took 139 ms to find 0 implicit places.
[2023-03-08 08:44:46] [INFO ] Invariant cache hit.
[2023-03-08 08:44:47] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 185 ms. Remains : 64/64 places, 75/75 transitions.
Computed a total of 5 stabilizing places and 10 stable transitions
Graph (complete) has 207 edges and 64 vertex of which 63 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 10 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 157 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2307 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 1030 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Finished probabilistic random walk after 8386 steps, run visited all 1 properties in 13 ms. (steps per millisecond=645 )
Probabilistic random walk after 8386 steps, saw 3665 distinct states, run finished after 13 ms. (steps per millisecond=645 ) properties seen :1
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 196 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[true, (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22892 reset in 101 ms.
Entered a terminal (fully accepting) state of product in 20966 steps with 4775 reset in 18 ms.
FORMULA DBSingleClientW-PT-d0m05-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d0m05-LTLCardinality-11 finished in 2402 ms.
All properties solved by simple procedures.
Total runtime 5631 ms.
ITS solved all properties within timeout

BK_STOP 1678265088904

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

+ 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//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -timeout 360 -rebuildPNML

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-d0m05"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="ltsminxred"
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 ltsminxred"
echo " Input is DBSingleClientW-PT-d0m05, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r105-tall-167814480900187"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DBSingleClientW-PT-d0m05.tgz
mv DBSingleClientW-PT-d0m05 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;