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-167814481000260.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-d1m07, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r105-tall-167814481000260
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 900K
-rw-r--r-- 1 mcc users 8.9K Feb 26 15:21 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 15:21 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K Feb 26 15:20 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Feb 26 15:20 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.3K Feb 25 15:49 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:49 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 15:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 129K Feb 26 15:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Feb 26 15:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 63K Feb 26 15:22 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 432K 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-d1m07-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d1m07-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678266501790

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=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m07
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202303021504
[2023-03-08 09:08:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2023-03-08 09:08:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 09:08:23] [INFO ] Load time of PNML (sax parser for PT used): 92 ms
[2023-03-08 09:08:23] [INFO ] Transformed 1440 places.
[2023-03-08 09:08:23] [INFO ] Transformed 672 transitions.
[2023-03-08 09:08:23] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 162 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 5 formulas.
Deduced a syphon composed of 1093 places in 6 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 347 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 347/347 places, 672/672 transitions.
Reduce places removed 21 places and 0 transitions.
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 0 with 101 rules applied. Total rules applied 101 place count 326 transition count 592
Discarding 84 places :
Symmetric choice reduction at 1 with 84 rule applications. Total rules 185 place count 242 transition count 417
Iterating global reduction 1 with 84 rules applied. Total rules applied 269 place count 242 transition count 417
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 1 with 20 rules applied. Total rules applied 289 place count 242 transition count 397
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 351 place count 180 transition count 335
Iterating global reduction 2 with 62 rules applied. Total rules applied 413 place count 180 transition count 335
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 414 place count 180 transition count 334
Discarding 32 places :
Symmetric choice reduction at 3 with 32 rule applications. Total rules 446 place count 148 transition count 282
Iterating global reduction 3 with 32 rules applied. Total rules applied 478 place count 148 transition count 282
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 509 place count 148 transition count 251
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 516 place count 141 transition count 241
Iterating global reduction 4 with 7 rules applied. Total rules applied 523 place count 141 transition count 241
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 527 place count 137 transition count 237
Iterating global reduction 4 with 4 rules applied. Total rules applied 531 place count 137 transition count 237
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 534 place count 137 transition count 234
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 536 place count 135 transition count 232
Iterating global reduction 5 with 2 rules applied. Total rules applied 538 place count 135 transition count 232
Applied a total of 538 rules in 71 ms. Remains 135 /347 variables (removed 212) and now considering 232/672 (removed 440) transitions.
// Phase 1: matrix 232 rows 135 cols
[2023-03-08 09:08:23] [INFO ] Computed 2 place invariants in 20 ms
[2023-03-08 09:08:24] [INFO ] Implicit Places using invariants in 438 ms returned []
[2023-03-08 09:08:24] [INFO ] Invariant cache hit.
[2023-03-08 09:08:24] [INFO ] State equation strengthened by 114 read => feed constraints.
[2023-03-08 09:08:24] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 813 ms to find 0 implicit places.
[2023-03-08 09:08:24] [INFO ] Invariant cache hit.
[2023-03-08 09:08:24] [INFO ] Dead Transitions using invariants and state equation in 141 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 135/347 places, 232/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1029 ms. Remains : 135/347 places, 232/672 transitions.
Support contains 22 out of 135 places after structural reductions.
[2023-03-08 09:08:24] [INFO ] Flatten gal took : 41 ms
[2023-03-08 09:08:24] [INFO ] Flatten gal took : 18 ms
[2023-03-08 09:08:24] [INFO ] Input system was already deterministic with 232 transitions.
Incomplete random walk after 10000 steps, including 2307 resets, run finished after 445 ms. (steps per millisecond=22 ) properties (out of 21) seen :3
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 48 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 107 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) 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 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 90 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 47 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 53 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) 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 18) seen :0
Running SMT prover for 18 properties.
[2023-03-08 09:08:25] [INFO ] Invariant cache hit.
[2023-03-08 09:08:25] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2023-03-08 09:08:25] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2023-03-08 09:08:25] [INFO ] After 245ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2023-03-08 09:08:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2023-03-08 09:08:25] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2023-03-08 09:08:26] [INFO ] After 500ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2023-03-08 09:08:26] [INFO ] State equation strengthened by 114 read => feed constraints.
[2023-03-08 09:08:27] [INFO ] After 764ms SMT Verify possible using 114 Read/Feed constraints in natural domain returned unsat :0 sat :18
[2023-03-08 09:08:27] [INFO ] After 1509ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 647 ms.
[2023-03-08 09:08:28] [INFO ] After 2809ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Parikh walk visited 0 properties in 177 ms.
Support contains 19 out of 135 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 135/135 places, 232/232 transitions.
Graph (complete) has 454 edges and 135 vertex of which 134 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 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 5 place count 134 transition count 228
Applied a total of 5 rules in 23 ms. Remains 134 /135 variables (removed 1) and now considering 228/232 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 134/135 places, 228/232 transitions.
Incomplete random walk after 10000 steps, including 2357 resets, run finished after 211 ms. (steps per millisecond=47 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) 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 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 57 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 106 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 39 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 98 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 58 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 18) 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 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 43 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 18) seen :0
Finished probabilistic random walk after 158248 steps, run visited all 18 properties in 738 ms. (steps per millisecond=214 )
Probabilistic random walk after 158248 steps, saw 60210 distinct states, run finished after 738 ms. (steps per millisecond=214 ) properties seen :18
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-12 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 5 stabilizing places and 23 stable transitions
Graph (complete) has 499 edges and 135 vertex of which 134 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((F(G(p1))&&p0)))'
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 232/232 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 122 transition count 176
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 122 transition count 176
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 37 place count 111 transition count 165
Iterating global reduction 0 with 11 rules applied. Total rules applied 48 place count 111 transition count 165
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 53 place count 111 transition count 160
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 61 place count 103 transition count 148
Iterating global reduction 1 with 8 rules applied. Total rules applied 69 place count 103 transition count 148
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 72 place count 103 transition count 145
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 78 place count 97 transition count 135
Iterating global reduction 2 with 6 rules applied. Total rules applied 84 place count 97 transition count 135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 97 transition count 134
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 90 place count 92 transition count 128
Iterating global reduction 3 with 5 rules applied. Total rules applied 95 place count 92 transition count 128
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 98 place count 92 transition count 125
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 99 place count 91 transition count 124
Iterating global reduction 4 with 1 rules applied. Total rules applied 100 place count 91 transition count 124
Applied a total of 100 rules in 14 ms. Remains 91 /135 variables (removed 44) and now considering 124/232 (removed 108) transitions.
// Phase 1: matrix 124 rows 91 cols
[2023-03-08 09:08:30] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 09:08:30] [INFO ] Implicit Places using invariants in 58 ms returned []
[2023-03-08 09:08:30] [INFO ] Invariant cache hit.
[2023-03-08 09:08:30] [INFO ] State equation strengthened by 47 read => feed constraints.
[2023-03-08 09:08:30] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2023-03-08 09:08:30] [INFO ] Invariant cache hit.
[2023-03-08 09:08:30] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 91/135 places, 124/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 281 ms. Remains : 91/135 places, 124/232 transitions.
Stuttering acceptance computed with spot in 357 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=p0, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s83 1)), p1:(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], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-01 finished in 702 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 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 232/232 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 121 transition count 174
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 121 transition count 174
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 40 place count 109 transition count 162
Iterating global reduction 0 with 12 rules applied. Total rules applied 52 place count 109 transition count 162
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 59 place count 109 transition count 155
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 68 place count 100 transition count 142
Iterating global reduction 1 with 9 rules applied. Total rules applied 77 place count 100 transition count 142
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 80 place count 100 transition count 139
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 87 place count 93 transition count 122
Iterating global reduction 2 with 7 rules applied. Total rules applied 94 place count 93 transition count 122
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 98 place count 93 transition count 118
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 102 place count 89 transition count 113
Iterating global reduction 3 with 4 rules applied. Total rules applied 106 place count 89 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 108 place count 89 transition count 111
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 109 place count 88 transition count 110
Iterating global reduction 4 with 1 rules applied. Total rules applied 110 place count 88 transition count 110
Applied a total of 110 rules in 29 ms. Remains 88 /135 variables (removed 47) and now considering 110/232 (removed 122) transitions.
// Phase 1: matrix 110 rows 88 cols
[2023-03-08 09:08:30] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 09:08:30] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-08 09:08:30] [INFO ] Invariant cache hit.
[2023-03-08 09:08:30] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-08 09:08:31] [INFO ] Implicit Places using invariants and state equation in 125 ms returned []
Implicit Place search using SMT with State Equation took 178 ms to find 0 implicit places.
[2023-03-08 09:08:31] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 09:08:31] [INFO ] Invariant cache hit.
[2023-03-08 09:08:31] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/135 places, 110/232 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 268 ms. Remains : 88/135 places, 110/232 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-03 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:(OR (LT s1 1) (LT s83 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22933 reset in 256 ms.
Product exploration explored 100000 steps with 22915 reset in 170 ms.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 298 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2346 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 499 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 17459 steps, run visited all 1 properties in 26 ms. (steps per millisecond=671 )
Probabilistic random walk after 17459 steps, saw 8309 distinct states, run finished after 26 ms. (steps per millisecond=671 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 135 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 110/110 transitions.
Applied a total of 0 rules in 11 ms. Remains 88 /88 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2023-03-08 09:08:32] [INFO ] Invariant cache hit.
[2023-03-08 09:08:32] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-08 09:08:32] [INFO ] Invariant cache hit.
[2023-03-08 09:08:32] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-08 09:08:32] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 168 ms to find 0 implicit places.
[2023-03-08 09:08:32] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 09:08:32] [INFO ] Invariant cache hit.
[2023-03-08 09:08:32] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 244 ms. Remains : 88/88 places, 110/110 transitions.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 298 edges and 88 vertex of which 87 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2297 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 434 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 17459 steps, run visited all 1 properties in 24 ms. (steps per millisecond=727 )
Probabilistic random walk after 17459 steps, saw 8309 distinct states, run finished after 24 ms. (steps per millisecond=727 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 147 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22967 reset in 112 ms.
Product exploration explored 100000 steps with 22906 reset in 154 ms.
Support contains 2 out of 88 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 88/88 places, 110/110 transitions.
Applied a total of 0 rules in 4 ms. Remains 88 /88 variables (removed 0) and now considering 110/110 (removed 0) transitions.
[2023-03-08 09:08:33] [INFO ] Invariant cache hit.
[2023-03-08 09:08:33] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-08 09:08:33] [INFO ] Invariant cache hit.
[2023-03-08 09:08:33] [INFO ] State equation strengthened by 35 read => feed constraints.
[2023-03-08 09:08:33] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 181 ms to find 0 implicit places.
[2023-03-08 09:08:33] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 09:08:33] [INFO ] Invariant cache hit.
[2023-03-08 09:08:33] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 248 ms. Remains : 88/88 places, 110/110 transitions.
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-03 finished in 2819 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(p1))&&p0) U (!p1 U (p2||G(!p1)))))'
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 232/232 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 122 transition count 180
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 122 transition count 180
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 37 place count 111 transition count 169
Iterating global reduction 0 with 11 rules applied. Total rules applied 48 place count 111 transition count 169
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 54 place count 111 transition count 163
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 61 place count 104 transition count 151
Iterating global reduction 1 with 7 rules applied. Total rules applied 68 place count 104 transition count 151
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 72 place count 104 transition count 147
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 78 place count 98 transition count 135
Iterating global reduction 2 with 6 rules applied. Total rules applied 84 place count 98 transition count 135
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 85 place count 98 transition count 134
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 89 place count 94 transition count 129
Iterating global reduction 3 with 4 rules applied. Total rules applied 93 place count 94 transition count 129
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 96 place count 94 transition count 126
Applied a total of 96 rules in 18 ms. Remains 94 /135 variables (removed 41) and now considering 126/232 (removed 106) transitions.
// Phase 1: matrix 126 rows 94 cols
[2023-03-08 09:08:33] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 09:08:33] [INFO ] Implicit Places using invariants in 56 ms returned []
[2023-03-08 09:08:33] [INFO ] Invariant cache hit.
[2023-03-08 09:08:33] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-08 09:08:33] [INFO ] Implicit Places using invariants and state equation in 148 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2023-03-08 09:08:33] [INFO ] Redundant transitions in 5 ms returned []
[2023-03-08 09:08:33] [INFO ] Invariant cache hit.
[2023-03-08 09:08:33] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 94/135 places, 126/232 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 299 ms. Remains : 94/135 places, 126/232 transitions.
Stuttering acceptance computed with spot in 119 ms :[(AND p1 (NOT p2)), true, (NOT p1), (AND (NOT p2) p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 3}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p2) p1), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(AND (NOT (AND (GEQ s1 1) (GEQ s88 1))) (GEQ s1 1) (GEQ s83 1)), p1:(AND (GEQ s1 1) (GEQ s88 1)), p0:(AND (GEQ s1 1) (GEQ s88 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 22845 reset in 215 ms.
Product exploration explored 100000 steps with 22994 reset in 181 ms.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 325 edges and 94 vertex of which 93 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT p1)), (X (NOT (AND (NOT p2) p1))), true, (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 16 factoid took 626 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter insensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2282 resets, run finished after 127 ms. (steps per millisecond=78 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 476 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 457 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 2) seen :0
Finished probabilistic random walk after 18916 steps, run visited all 2 properties in 104 ms. (steps per millisecond=181 )
Probabilistic random walk after 18916 steps, saw 8749 distinct states, run finished after 104 ms. (steps per millisecond=181 ) properties seen :2
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (AND (NOT p2) (NOT p1) (NOT p0))), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (NOT (AND (NOT p2) p1 p0))), (X (NOT p1)), (X (NOT (AND (NOT p2) p1))), true, (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) p1 p0)))), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 16 factoid took 782 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 87 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Support contains 3 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 126/126 transitions.
Applied a total of 0 rules in 0 ms. Remains 94 /94 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-08 09:08:36] [INFO ] Invariant cache hit.
[2023-03-08 09:08:36] [INFO ] Implicit Places using invariants in 52 ms returned []
[2023-03-08 09:08:36] [INFO ] Invariant cache hit.
[2023-03-08 09:08:36] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-08 09:08:36] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2023-03-08 09:08:36] [INFO ] Invariant cache hit.
[2023-03-08 09:08:36] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 244 ms. Remains : 94/94 places, 126/126 transitions.
Computed a total of 5 stabilizing places and 15 stable transitions
Graph (complete) has 325 edges and 94 vertex of which 93 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 15 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 244 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Incomplete random walk after 10000 steps, including 2268 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 492 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 456 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Finished probabilistic random walk after 18916 steps, run visited all 2 properties in 64 ms. (steps per millisecond=295 )
Probabilistic random walk after 18916 steps, saw 8749 distinct states, run finished after 64 ms. (steps per millisecond=295 ) properties seen :2
Knowledge obtained : [(AND (NOT p1) (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (AND (NOT p1) (NOT p2))), true, (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 6 factoid took 268 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 4 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 82 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 84 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 22927 reset in 140 ms.
Product exploration explored 100000 steps with 22969 reset in 135 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 98 ms :[true, (AND p1 (NOT p2)), (AND p1 (NOT p2))]
Support contains 3 out of 94 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 94/94 places, 126/126 transitions.
Applied a total of 0 rules in 6 ms. Remains 94 /94 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-08 09:08:38] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 09:08:38] [INFO ] Invariant cache hit.
[2023-03-08 09:08:38] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 73 ms. Remains : 94/94 places, 126/126 transitions.
Support contains 3 out of 94 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 94/94 places, 126/126 transitions.
Applied a total of 0 rules in 1 ms. Remains 94 /94 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2023-03-08 09:08:38] [INFO ] Invariant cache hit.
[2023-03-08 09:08:38] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-08 09:08:38] [INFO ] Invariant cache hit.
[2023-03-08 09:08:38] [INFO ] State equation strengthened by 46 read => feed constraints.
[2023-03-08 09:08:38] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 201 ms to find 0 implicit places.
[2023-03-08 09:08:38] [INFO ] Invariant cache hit.
[2023-03-08 09:08:38] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 259 ms. Remains : 94/94 places, 126/126 transitions.
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-04 finished in 5098 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)) U p0))'
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 232/232 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 121 transition count 171
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 121 transition count 171
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 40 place count 109 transition count 159
Iterating global reduction 0 with 12 rules applied. Total rules applied 52 place count 109 transition count 159
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 58 place count 109 transition count 153
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 68 place count 99 transition count 138
Iterating global reduction 1 with 10 rules applied. Total rules applied 78 place count 99 transition count 138
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 82 place count 99 transition count 134
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 89 place count 92 transition count 122
Iterating global reduction 2 with 7 rules applied. Total rules applied 96 place count 92 transition count 122
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 98 place count 92 transition count 120
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 103 place count 87 transition count 114
Iterating global reduction 3 with 5 rules applied. Total rules applied 108 place count 87 transition count 114
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 111 place count 87 transition count 111
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 112 place count 86 transition count 110
Iterating global reduction 4 with 1 rules applied. Total rules applied 113 place count 86 transition count 110
Applied a total of 113 rules in 18 ms. Remains 86 /135 variables (removed 49) and now considering 110/232 (removed 122) transitions.
// Phase 1: matrix 110 rows 86 cols
[2023-03-08 09:08:38] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 09:08:38] [INFO ] Implicit Places using invariants in 47 ms returned []
[2023-03-08 09:08:38] [INFO ] Invariant cache hit.
[2023-03-08 09:08:38] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-08 09:08:38] [INFO ] Implicit Places using invariants and state equation in 129 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2023-03-08 09:08:38] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 09:08:38] [INFO ] Invariant cache hit.
[2023-03-08 09:08:39] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 86/135 places, 110/232 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 264 ms. Remains : 86/135 places, 110/232 transitions.
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s7 1) (GEQ s33 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-05 finished in 380 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(p0)))'
Support contains 2 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 232/232 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 121 transition count 177
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 121 transition count 177
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 41 place count 108 transition count 164
Iterating global reduction 0 with 13 rules applied. Total rules applied 54 place count 108 transition count 164
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 61 place count 108 transition count 157
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 71 place count 98 transition count 142
Iterating global reduction 1 with 10 rules applied. Total rules applied 81 place count 98 transition count 142
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 86 place count 98 transition count 137
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 94 place count 90 transition count 119
Iterating global reduction 2 with 8 rules applied. Total rules applied 102 place count 90 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 104 place count 90 transition count 117
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 109 place count 85 transition count 111
Iterating global reduction 3 with 5 rules applied. Total rules applied 114 place count 85 transition count 111
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 117 place count 85 transition count 108
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 118 place count 84 transition count 107
Iterating global reduction 4 with 1 rules applied. Total rules applied 119 place count 84 transition count 107
Applied a total of 119 rules in 27 ms. Remains 84 /135 variables (removed 51) and now considering 107/232 (removed 125) transitions.
// Phase 1: matrix 107 rows 84 cols
[2023-03-08 09:08:39] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 09:08:39] [INFO ] Implicit Places using invariants in 51 ms returned []
[2023-03-08 09:08:39] [INFO ] Invariant cache hit.
[2023-03-08 09:08:39] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-08 09:08:39] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 167 ms to find 0 implicit places.
[2023-03-08 09:08:39] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 09:08:39] [INFO ] Invariant cache hit.
[2023-03-08 09:08:39] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 84/135 places, 107/232 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 260 ms. Remains : 84/135 places, 107/232 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s58 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 23029 reset in 113 ms.
Product exploration explored 100000 steps with 22896 reset in 119 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 285 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 122 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2294 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 454 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 13010 steps, run visited all 1 properties in 18 ms. (steps per millisecond=722 )
Probabilistic random walk after 13010 steps, saw 6117 distinct states, run finished after 18 ms. (steps per millisecond=722 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 155 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 107/107 transitions.
Applied a total of 0 rules in 5 ms. Remains 84 /84 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2023-03-08 09:08:40] [INFO ] Invariant cache hit.
[2023-03-08 09:08:40] [INFO ] Implicit Places using invariants in 57 ms returned []
[2023-03-08 09:08:40] [INFO ] Invariant cache hit.
[2023-03-08 09:08:40] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-08 09:08:40] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 188 ms to find 0 implicit places.
[2023-03-08 09:08:40] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 09:08:40] [INFO ] Invariant cache hit.
[2023-03-08 09:08:40] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 259 ms. Remains : 84/84 places, 107/107 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 285 edges and 84 vertex of which 83 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 2315 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 476 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 13010 steps, run visited all 1 properties in 17 ms. (steps per millisecond=765 )
Probabilistic random walk after 13010 steps, saw 6117 distinct states, run finished after 18 ms. (steps per millisecond=722 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 223 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Product exploration explored 100000 steps with 23013 reset in 118 ms.
Product exploration explored 100000 steps with 22889 reset in 120 ms.
Support contains 2 out of 84 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 84/84 places, 107/107 transitions.
Applied a total of 0 rules in 3 ms. Remains 84 /84 variables (removed 0) and now considering 107/107 (removed 0) transitions.
[2023-03-08 09:08:41] [INFO ] Invariant cache hit.
[2023-03-08 09:08:41] [INFO ] Implicit Places using invariants in 49 ms returned []
[2023-03-08 09:08:41] [INFO ] Invariant cache hit.
[2023-03-08 09:08:41] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-08 09:08:41] [INFO ] Implicit Places using invariants and state equation in 114 ms returned []
Implicit Place search using SMT with State Equation took 165 ms to find 0 implicit places.
[2023-03-08 09:08:41] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 09:08:41] [INFO ] Invariant cache hit.
[2023-03-08 09:08:41] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 228 ms. Remains : 84/84 places, 107/107 transitions.
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-07 finished in 2283 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&&X(F(p1)))||(p0&&G(p2))))))'
Support contains 5 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 232/232 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 122 transition count 176
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 122 transition count 176
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 37 place count 111 transition count 165
Iterating global reduction 0 with 11 rules applied. Total rules applied 48 place count 111 transition count 165
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 52 place count 111 transition count 161
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 61 place count 102 transition count 148
Iterating global reduction 1 with 9 rules applied. Total rules applied 70 place count 102 transition count 148
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 74 place count 102 transition count 144
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 80 place count 96 transition count 134
Iterating global reduction 2 with 6 rules applied. Total rules applied 86 place count 96 transition count 134
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 87 place count 96 transition count 133
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 91 place count 92 transition count 129
Iterating global reduction 3 with 4 rules applied. Total rules applied 95 place count 92 transition count 129
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 98 place count 92 transition count 126
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 99 place count 91 transition count 125
Iterating global reduction 4 with 1 rules applied. Total rules applied 100 place count 91 transition count 125
Applied a total of 100 rules in 16 ms. Remains 91 /135 variables (removed 44) and now considering 125/232 (removed 107) transitions.
// Phase 1: matrix 125 rows 91 cols
[2023-03-08 09:08:41] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 09:08:41] [INFO ] Implicit Places using invariants in 55 ms returned []
[2023-03-08 09:08:41] [INFO ] Invariant cache hit.
[2023-03-08 09:08:41] [INFO ] State equation strengthened by 48 read => feed constraints.
[2023-03-08 09:08:41] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2023-03-08 09:08:41] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 09:08:41] [INFO ] Invariant cache hit.
[2023-03-08 09:08:41] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/135 places, 125/232 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 283 ms. Remains : 91/135 places, 125/232 transitions.
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}], [{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p2) (NOT p1))), acceptance={0} source=2 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s7 1) (LT s34 1)), p2:(AND (GEQ s1 1) (GEQ s63 1)), p1:(AND (GEQ s1 1) (GEQ s82 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-08 finished in 468 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))&&F(G((X(p1) U !p2)))))'
Support contains 4 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 232/232 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 122 transition count 177
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 122 transition count 177
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 37 place count 111 transition count 166
Iterating global reduction 0 with 11 rules applied. Total rules applied 48 place count 111 transition count 166
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 55 place count 111 transition count 159
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 63 place count 103 transition count 147
Iterating global reduction 1 with 8 rules applied. Total rules applied 71 place count 103 transition count 147
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 74 place count 103 transition count 144
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 80 place count 97 transition count 128
Iterating global reduction 2 with 6 rules applied. Total rules applied 86 place count 97 transition count 128
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 90 place count 97 transition count 124
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 93 place count 94 transition count 121
Iterating global reduction 3 with 3 rules applied. Total rules applied 96 place count 94 transition count 121
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 97 place count 94 transition count 120
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 98 place count 93 transition count 119
Iterating global reduction 4 with 1 rules applied. Total rules applied 99 place count 93 transition count 119
Applied a total of 99 rules in 16 ms. Remains 93 /135 variables (removed 42) and now considering 119/232 (removed 113) transitions.
// Phase 1: matrix 119 rows 93 cols
[2023-03-08 09:08:41] [INFO ] Computed 2 place invariants in 3 ms
[2023-03-08 09:08:41] [INFO ] Implicit Places using invariants in 54 ms returned []
[2023-03-08 09:08:41] [INFO ] Invariant cache hit.
[2023-03-08 09:08:42] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-08 09:08:42] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 202 ms to find 0 implicit places.
[2023-03-08 09:08:42] [INFO ] Invariant cache hit.
[2023-03-08 09:08:42] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/135 places, 119/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 273 ms. Remains : 93/135 places, 119/232 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) p2), (NOT p0), p2, p2]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p2, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=p2, acceptance={0} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 2}, { cond=p2, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s88 1)), p2:(AND (GEQ s1 1) (GEQ s84 1)), p1:(AND (GEQ s1 1) (GEQ s53 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-10 finished in 455 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)))))'
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 232/232 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 121 transition count 178
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 121 transition count 178
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 41 place count 108 transition count 165
Iterating global reduction 0 with 13 rules applied. Total rules applied 54 place count 108 transition count 165
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 63 place count 108 transition count 156
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 73 place count 98 transition count 141
Iterating global reduction 1 with 10 rules applied. Total rules applied 83 place count 98 transition count 141
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 87 place count 98 transition count 137
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 95 place count 90 transition count 119
Iterating global reduction 2 with 8 rules applied. Total rules applied 103 place count 90 transition count 119
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 105 place count 90 transition count 117
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 110 place count 85 transition count 111
Iterating global reduction 3 with 5 rules applied. Total rules applied 115 place count 85 transition count 111
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 118 place count 85 transition count 108
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 119 place count 84 transition count 107
Iterating global reduction 4 with 1 rules applied. Total rules applied 120 place count 84 transition count 107
Applied a total of 120 rules in 11 ms. Remains 84 /135 variables (removed 51) and now considering 107/232 (removed 125) transitions.
// Phase 1: matrix 107 rows 84 cols
[2023-03-08 09:08:42] [INFO ] Computed 2 place invariants in 2 ms
[2023-03-08 09:08:42] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-08 09:08:42] [INFO ] Invariant cache hit.
[2023-03-08 09:08:42] [INFO ] State equation strengthened by 37 read => feed constraints.
[2023-03-08 09:08:42] [INFO ] Implicit Places using invariants and state equation in 102 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2023-03-08 09:08:42] [INFO ] Invariant cache hit.
[2023-03-08 09:08:42] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/135 places, 107/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 213 ms. Remains : 84/135 places, 107/232 transitions.
Stuttering acceptance computed with spot in 123 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-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: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p0:(OR (LT s1 1) (LT s36 1)), p1:(OR (LT s1 1) (LT s60 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]]
Entered a terminal (fully accepting) state of product in 22 steps with 4 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-11 finished in 350 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&&X(F(!p0))))))'
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 135/135 places, 232/232 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 122 transition count 178
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 122 transition count 178
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 37 place count 111 transition count 167
Iterating global reduction 0 with 11 rules applied. Total rules applied 48 place count 111 transition count 167
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 55 place count 111 transition count 160
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 63 place count 103 transition count 149
Iterating global reduction 1 with 8 rules applied. Total rules applied 71 place count 103 transition count 149
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 74 place count 103 transition count 146
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 80 place count 97 transition count 130
Iterating global reduction 2 with 6 rules applied. Total rules applied 86 place count 97 transition count 130
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 92 place count 97 transition count 124
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 95 place count 94 transition count 120
Iterating global reduction 3 with 3 rules applied. Total rules applied 98 place count 94 transition count 120
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 99 place count 94 transition count 119
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 100 place count 93 transition count 118
Iterating global reduction 4 with 1 rules applied. Total rules applied 101 place count 93 transition count 118
Applied a total of 101 rules in 10 ms. Remains 93 /135 variables (removed 42) and now considering 118/232 (removed 114) transitions.
// Phase 1: matrix 118 rows 93 cols
[2023-03-08 09:08:42] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-08 09:08:42] [INFO ] Implicit Places using invariants in 50 ms returned []
[2023-03-08 09:08:42] [INFO ] Invariant cache hit.
[2023-03-08 09:08:42] [INFO ] State equation strengthened by 38 read => feed constraints.
[2023-03-08 09:08:42] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2023-03-08 09:08:42] [INFO ] Invariant cache hit.
[2023-03-08 09:08:42] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 93/135 places, 118/232 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 245 ms. Remains : 93/135 places, 118/232 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s88 1)), p1:(OR (LT s1 1) (LT s87 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 231 ms.
Product exploration explored 100000 steps with 50000 reset in 223 ms.
Computed a total of 5 stabilizing places and 12 stable transitions
Graph (complete) has 315 edges and 93 vertex of which 92 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 12 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) (NOT p1))))
Knowledge based reduction with 3 factoid took 57 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-13 finished in 884 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) U p1))'
Support contains 3 out of 135 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 135/135 places, 232/232 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 120 transition count 170
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 120 transition count 170
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 43 place count 107 transition count 157
Iterating global reduction 0 with 13 rules applied. Total rules applied 56 place count 107 transition count 157
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 63 place count 107 transition count 150
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 73 place count 97 transition count 135
Iterating global reduction 1 with 10 rules applied. Total rules applied 83 place count 97 transition count 135
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 87 place count 97 transition count 131
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 95 place count 89 transition count 113
Iterating global reduction 2 with 8 rules applied. Total rules applied 103 place count 89 transition count 113
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 105 place count 89 transition count 111
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 110 place count 84 transition count 105
Iterating global reduction 3 with 5 rules applied. Total rules applied 115 place count 84 transition count 105
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 118 place count 84 transition count 102
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 119 place count 83 transition count 101
Iterating global reduction 4 with 1 rules applied. Total rules applied 120 place count 83 transition count 101
Applied a total of 120 rules in 16 ms. Remains 83 /135 variables (removed 52) and now considering 101/232 (removed 131) transitions.
// Phase 1: matrix 101 rows 83 cols
[2023-03-08 09:08:43] [INFO ] Computed 2 place invariants in 1 ms
[2023-03-08 09:08:43] [INFO ] Implicit Places using invariants in 48 ms returned []
[2023-03-08 09:08:43] [INFO ] Invariant cache hit.
[2023-03-08 09:08:43] [INFO ] State equation strengthened by 31 read => feed constraints.
[2023-03-08 09:08:43] [INFO ] Implicit Places using invariants and state equation in 103 ms returned []
Implicit Place search using SMT with State Equation took 154 ms to find 0 implicit places.
[2023-03-08 09:08:43] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 09:08:43] [INFO ] Invariant cache hit.
[2023-03-08 09:08:43] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 83/135 places, 101/232 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 231 ms. Remains : 83/135 places, 101/232 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m07-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s53 1)), p0:(AND (GEQ s1 1) (GEQ s44 1))], nbAcceptance=0, 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 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m07-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m07-LTLFireability-15 finished in 321 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)))'
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(p1))&&p0) U (!p1 U (p2||G(!p1)))))'
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(p0)))'
[2023-03-08 09:08:44] [INFO ] Flatten gal took : 14 ms
[2023-03-08 09:08:44] [INFO ] Export to MCC of 3 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2023-03-08 09:08:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 135 places, 232 transitions and 910 arcs took 2 ms.
Total runtime 20928 ms.
There are residual formulas that ITS could not solve within timeout
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1248/ltl_0_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1248/ltl_1_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
pnml2lts-mc model.pnml -s80% --procs=4 --ltl=/tmp/1248/ltl_2_ --buchi-type=spotba --strategy=ufscc --ltl-semantics=spin --state=tree
Could not compute solution for formula : DBSingleClientW-PT-d1m07-LTLFireability-03
Could not compute solution for formula : DBSingleClientW-PT-d1m07-LTLFireability-04
Could not compute solution for formula : DBSingleClientW-PT-d1m07-LTLFireability-07

BK_STOP 1678266525518

--------------------
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 LTLFireability -timeout 360 -rebuildPNML
mcc2023
ltl formula name DBSingleClientW-PT-d1m07-LTLFireability-03
ltl formula formula --ltl=/tmp/1248/ltl_0_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 135 places, 232 transitions and 910 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.000 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1248/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1248/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1248/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1248/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name DBSingleClientW-PT-d1m07-LTLFireability-04
ltl formula formula --ltl=/tmp/1248/ltl_1_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 135 places, 232 transitions and 910 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.010 user 0.010 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1248/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1248/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1248/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1248/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)
ltl formula name DBSingleClientW-PT-d1m07-LTLFireability-07
ltl formula formula --ltl=/tmp/1248/ltl_2_
pnml2lts-mc: =============================================================================
pnml2lts-mc: Runtime environment could only preallocate 15 GB while requesting 240 GB.
pnml2lts-mc: Configure your system limits to exploit all memory.
pnml2lts-mc: =============================================================================
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 135 places, 232 transitions and 910 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.020 real 0.010 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1248/ltl_2_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1248/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1248/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1248/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4), ** error **: area memory exhausted
double free or corruption (fasttop)

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-d1m07"
export BK_EXAMINATION="LTLFireability"
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-d1m07, 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 r105-tall-167814481000260"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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