Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 948K
-rw-r--r-- 1 mcc users 7.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 85K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 48K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Apr 22 14:36 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Apr 22 14:36 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 22 14:36 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Apr 22 14:36 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Apr 12 12:54 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 159K Apr 12 12:54 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 95K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:24 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 6 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 432K May 18 16:42 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

here is the order used to build the result vector(from text file)
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-00
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-01
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-02
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-03
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-04
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-05
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-06
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-07
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-08
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-09
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-10
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-11
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-12
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-13
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-14
FORMULA_NAME DBSingleClientW-PT-d1m10-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716327441944

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=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DBSingleClientW-PT-d1m10
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-21 21:37:23] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-21 21:37:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-21 21:37:23] [INFO ] Load time of PNML (sax parser for PT used): 97 ms
[2024-05-21 21:37:23] [INFO ] Transformed 1440 places.
[2024-05-21 21:37:23] [INFO ] Transformed 672 transitions.
[2024-05-21 21:37:23] [INFO ] Parsed PT model containing 1440 places and 672 transitions and 2688 arcs in 173 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 1093 places in 6 ms
Reduce places removed 1093 places and 0 transitions.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 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 78 places :
Symmetric choice reduction at 1 with 78 rule applications. Total rules 179 place count 248 transition count 419
Iterating global reduction 1 with 78 rules applied. Total rules applied 257 place count 248 transition count 419
Ensure Unique test removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 272 place count 248 transition count 404
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 329 place count 191 transition count 347
Iterating global reduction 2 with 57 rules applied. Total rules applied 386 place count 191 transition count 347
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 387 place count 191 transition count 346
Discarding 30 places :
Symmetric choice reduction at 3 with 30 rule applications. Total rules 417 place count 161 transition count 302
Iterating global reduction 3 with 30 rules applied. Total rules applied 447 place count 161 transition count 302
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 3 with 25 rules applied. Total rules applied 472 place count 161 transition count 277
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 476 place count 157 transition count 270
Iterating global reduction 4 with 4 rules applied. Total rules applied 480 place count 157 transition count 270
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 483 place count 154 transition count 267
Iterating global reduction 4 with 3 rules applied. Total rules applied 486 place count 154 transition count 267
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 489 place count 151 transition count 264
Iterating global reduction 4 with 3 rules applied. Total rules applied 492 place count 151 transition count 264
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 494 place count 151 transition count 262
Applied a total of 494 rules in 71 ms. Remains 151 /347 variables (removed 196) and now considering 262/672 (removed 410) transitions.
// Phase 1: matrix 262 rows 151 cols
[2024-05-21 21:37:24] [INFO ] Computed 2 invariants in 14 ms
[2024-05-21 21:37:24] [INFO ] Implicit Places using invariants in 232 ms returned []
[2024-05-21 21:37:24] [INFO ] Invariant cache hit.
[2024-05-21 21:37:24] [INFO ] State equation strengthened by 128 read => feed constraints.
[2024-05-21 21:37:24] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 600 ms to find 0 implicit places.
[2024-05-21 21:37:24] [INFO ] Invariant cache hit.
[2024-05-21 21:37:24] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 151/347 places, 262/672 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 793 ms. Remains : 151/347 places, 262/672 transitions.
Support contains 40 out of 151 places after structural reductions.
[2024-05-21 21:37:24] [INFO ] Flatten gal took : 40 ms
[2024-05-21 21:37:24] [INFO ] Flatten gal took : 17 ms
[2024-05-21 21:37:25] [INFO ] Input system was already deterministic with 262 transitions.
Incomplete random walk after 10000 steps, including 2302 resets, run finished after 641 ms. (steps per millisecond=15 ) properties (out of 36) seen :3
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 98 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 55 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 50 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 52 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 46 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 60 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 33) 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 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 47 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 99 resets, run finished after 17 ms. (steps per millisecond=58 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 49 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 92 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 36 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 106 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 51 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 37 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 200 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 49 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 90 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 53 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 42 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 33) 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 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 48 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 45 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 51 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 40 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 101 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 43 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1000 steps, including 104 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 33) seen :0
Incomplete Best-First random walk after 1001 steps, including 56 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 33) seen :0
Probabilistic random walk after 1000001 steps, saw 349908 distinct states, run finished after 2454 ms. (steps per millisecond=407 ) properties seen :32
Running SMT prover for 1 properties.
[2024-05-21 21:37:28] [INFO ] Invariant cache hit.
[2024-05-21 21:37:28] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 21:37:28] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 21:37:28] [INFO ] After 128ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 12 simplifications.
Computed a total of 5 stabilizing places and 25 stable transitions
Graph (complete) has 561 edges and 151 vertex of which 150 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(p1)||p0))))'
Support contains 4 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 262/262 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 128 transition count 192
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 128 transition count 192
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 128 transition count 189
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 63 place count 114 transition count 172
Iterating global reduction 1 with 14 rules applied. Total rules applied 77 place count 114 transition count 172
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 81 place count 114 transition count 168
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 91 place count 104 transition count 150
Iterating global reduction 2 with 10 rules applied. Total rules applied 101 place count 104 transition count 150
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 104 place count 104 transition count 147
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 111 place count 97 transition count 130
Iterating global reduction 3 with 7 rules applied. Total rules applied 118 place count 97 transition count 130
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 120 place count 97 transition count 128
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 123 place count 94 transition count 125
Iterating global reduction 4 with 3 rules applied. Total rules applied 126 place count 94 transition count 125
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 128 place count 94 transition count 123
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 130 place count 92 transition count 121
Iterating global reduction 5 with 2 rules applied. Total rules applied 132 place count 92 transition count 121
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 133 place count 91 transition count 119
Iterating global reduction 5 with 1 rules applied. Total rules applied 134 place count 91 transition count 119
Applied a total of 134 rules in 37 ms. Remains 91 /151 variables (removed 60) and now considering 119/262 (removed 143) transitions.
// Phase 1: matrix 119 rows 91 cols
[2024-05-21 21:37:29] [INFO ] Computed 2 invariants in 5 ms
[2024-05-21 21:37:29] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-21 21:37:29] [INFO ] Invariant cache hit.
[2024-05-21 21:37:29] [INFO ] State equation strengthened by 41 read => feed constraints.
[2024-05-21 21:37:29] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2024-05-21 21:37:29] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-21 21:37:29] [INFO ] Invariant cache hit.
[2024-05-21 21:37:29] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 91/151 places, 119/262 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 299 ms. Remains : 91/151 places, 119/262 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 201 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s83 1)), p1:(OR (LT s25 1) (LT s55 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 23003 reset in 305 ms.
Product exploration explored 100000 steps with 22985 reset in 153 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 312 edges and 91 vertex of which 90 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 97 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2283 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 484 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 989 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 2652932 steps, run timeout after 3001 ms. (steps per millisecond=884 ) properties seen :{1=1}
Probabilistic random walk after 2652932 steps, saw 1004290 distinct states, run finished after 3004 ms. (steps per millisecond=883 ) properties seen :1
Running SMT prover for 1 properties.
[2024-05-21 21:37:33] [INFO ] Invariant cache hit.
[2024-05-21 21:37:33] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 21:37:33] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 21:37:33] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 14 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-00 finished in 4469 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U X(X(((X(p2) U p3)&&p1)))))'
Support contains 4 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 262/262 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 130 transition count 202
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 130 transition count 202
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 45 place count 130 transition count 199
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 58 place count 117 transition count 183
Iterating global reduction 1 with 13 rules applied. Total rules applied 71 place count 117 transition count 183
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 73 place count 117 transition count 181
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 82 place count 108 transition count 164
Iterating global reduction 2 with 9 rules applied. Total rules applied 91 place count 108 transition count 164
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 95 place count 108 transition count 160
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 100 place count 103 transition count 147
Iterating global reduction 3 with 5 rules applied. Total rules applied 105 place count 103 transition count 147
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 106 place count 103 transition count 146
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 109 place count 100 transition count 143
Iterating global reduction 4 with 3 rules applied. Total rules applied 112 place count 100 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 114 place count 100 transition count 141
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 116 place count 98 transition count 139
Iterating global reduction 5 with 2 rules applied. Total rules applied 118 place count 98 transition count 139
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 119 place count 97 transition count 137
Iterating global reduction 5 with 1 rules applied. Total rules applied 120 place count 97 transition count 137
Applied a total of 120 rules in 17 ms. Remains 97 /151 variables (removed 54) and now considering 137/262 (removed 125) transitions.
// Phase 1: matrix 137 rows 97 cols
[2024-05-21 21:37:33] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 21:37:33] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-21 21:37:33] [INFO ] Invariant cache hit.
[2024-05-21 21:37:33] [INFO ] State equation strengthened by 54 read => feed constraints.
[2024-05-21 21:37:33] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
[2024-05-21 21:37:33] [INFO ] Invariant cache hit.
[2024-05-21 21:37:33] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 97/151 places, 137/262 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 292 ms. Remains : 97/151 places, 137/262 transitions.
Stuttering acceptance computed with spot in 757 ms :[(OR (NOT p2) (NOT p3)), (OR (NOT p1) (NOT p3)), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (NOT p1)), true, (OR (NOT p3) (NOT p1)), (OR (NOT p3) (NOT p1)), (OR (NOT p1) (NOT p3)), (OR (NOT p3) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) p2), acceptance={0} source=0 dest: 0}, { cond=(NOT p2), acceptance={0} source=0 dest: 6}], [{ cond=(AND p1 (NOT p3)), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 6}], [{ cond=(OR (AND (NOT p0) p1 (NOT p3)) (AND (NOT p0) (NOT p3) p2)), acceptance={0} source=2 dest: 2}, { cond=(OR (AND p0 p1 (NOT p3)) (AND p0 (NOT p3) p2)), acceptance={0} source=2 dest: 3}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 9}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 10}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(OR (AND p1 (NOT p3)) (AND (NOT p3) p2)), acceptance={} source=3 dest: 4}], [{ cond=(OR (AND p1 (NOT p3)) (AND (NOT p3) p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 6}], [{ cond=(NOT p0), acceptance={} source=5 dest: 7}, { cond=p0, acceptance={} source=5 dest: 8}], [{ cond=true, acceptance={0} source=6 dest: 6}], [{ cond=(NOT p0), acceptance={} source=7 dest: 9}, { cond=p0, acceptance={} source=7 dest: 10}], [{ cond=true, acceptance={} source=8 dest: 1}], [{ cond=(AND (NOT p0) p1 (NOT p3)), acceptance={0} source=9 dest: 2}, { cond=(AND p0 p1 (NOT p3)), acceptance={0} source=9 dest: 3}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=9 dest: 9}, { cond=(AND p0 (NOT p1)), acceptance={0} source=9 dest: 10}], [{ cond=(NOT p1), acceptance={} source=10 dest: 1}, { cond=(AND p1 (NOT p3)), acceptance={} source=10 dest: 4}]], initial=5, aps=[p3:(AND (GEQ s1 1) (GEQ s84 1) (GEQ s1 1) (GEQ s95 1)), p2:(AND (GEQ s1 1) (GEQ s86 1)), p1:(AND (GEQ s1 1) (GEQ s84 1)), p0:(AND (GEQ s1 1) (GEQ s95 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-01 finished in 1070 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)||X(X(G(p2)))||p0)))'
Support contains 5 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 262/262 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 129 transition count 197
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 129 transition count 197
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 48 place count 129 transition count 193
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 62 place count 115 transition count 176
Iterating global reduction 1 with 14 rules applied. Total rules applied 76 place count 115 transition count 176
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 81 place count 115 transition count 171
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 91 place count 105 transition count 153
Iterating global reduction 2 with 10 rules applied. Total rules applied 101 place count 105 transition count 153
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 104 place count 105 transition count 150
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 111 place count 98 transition count 135
Iterating global reduction 3 with 7 rules applied. Total rules applied 118 place count 98 transition count 135
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 123 place count 98 transition count 130
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 125 place count 96 transition count 128
Iterating global reduction 4 with 2 rules applied. Total rules applied 127 place count 96 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 129 place count 96 transition count 126
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 130 place count 95 transition count 125
Iterating global reduction 5 with 1 rules applied. Total rules applied 131 place count 95 transition count 125
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 132 place count 94 transition count 123
Iterating global reduction 5 with 1 rules applied. Total rules applied 133 place count 94 transition count 123
Applied a total of 133 rules in 20 ms. Remains 94 /151 variables (removed 57) and now considering 123/262 (removed 139) transitions.
// Phase 1: matrix 123 rows 94 cols
[2024-05-21 21:37:34] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:37:34] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 21:37:34] [INFO ] Invariant cache hit.
[2024-05-21 21:37:34] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 21:37:34] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2024-05-21 21:37:34] [INFO ] Invariant cache hit.
[2024-05-21 21:37:34] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 94/151 places, 123/262 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 285 ms. Remains : 94/151 places, 123/262 transitions.
Stuttering acceptance computed with spot in 180 ms :[(NOT p1), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(AND (GEQ s1 1) (GEQ s86 1)), p0:(OR (LT s1 1) (LT s89 1)), p2:(OR (LT s10 1) (LT s67 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 255 ms.
Product exploration explored 100000 steps with 50000 reset in 207 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 322 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 13 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 5 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-02 finished in 961 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((X(X(G(p0)))||G(p1))))))'
Support contains 3 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 262/262 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 129 transition count 193
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 129 transition count 193
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 129 transition count 190
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 62 place count 114 transition count 172
Iterating global reduction 1 with 15 rules applied. Total rules applied 77 place count 114 transition count 172
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 82 place count 114 transition count 167
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 93 place count 103 transition count 148
Iterating global reduction 2 with 11 rules applied. Total rules applied 104 place count 103 transition count 148
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 107 place count 103 transition count 145
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 114 place count 96 transition count 132
Iterating global reduction 3 with 7 rules applied. Total rules applied 121 place count 96 transition count 132
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 126 place count 96 transition count 127
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 129 place count 93 transition count 124
Iterating global reduction 4 with 3 rules applied. Total rules applied 132 place count 93 transition count 124
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 134 place count 93 transition count 122
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 136 place count 91 transition count 120
Iterating global reduction 5 with 2 rules applied. Total rules applied 138 place count 91 transition count 120
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 139 place count 90 transition count 118
Iterating global reduction 5 with 1 rules applied. Total rules applied 140 place count 90 transition count 118
Applied a total of 140 rules in 14 ms. Remains 90 /151 variables (removed 61) and now considering 118/262 (removed 144) transitions.
// Phase 1: matrix 118 rows 90 cols
[2024-05-21 21:37:35] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 21:37:35] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-21 21:37:35] [INFO ] Invariant cache hit.
[2024-05-21 21:37:35] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 21:37:35] [INFO ] Implicit Places using invariants and state equation in 135 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2024-05-21 21:37:35] [INFO ] Invariant cache hit.
[2024-05-21 21:37:35] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/151 places, 118/262 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 274 ms. Remains : 90/151 places, 118/262 transitions.
Stuttering acceptance computed with spot in 350 ms :[true, (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 1}, { cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=(NOT p1), acceptance={} source=5 dest: 1}, { cond=p1, acceptance={} source=5 dest: 2}], [{ cond=(NOT p1), acceptance={} source=6 dest: 4}, { cond=p1, acceptance={} source=6 dest: 5}], [{ cond=true, acceptance={} source=7 dest: 6}], [{ cond=true, acceptance={} source=8 dest: 9}], [{ cond=true, acceptance={} source=9 dest: 7}]], initial=8, aps=[p0:(OR (LT s1 1) (LT s50 1)), p1:(OR (LT s1 1) (LT s85 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 23026 reset in 121 ms.
Product exploration explored 100000 steps with 23084 reset in 104 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 308 edges and 90 vertex of which 89 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 : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 10 states, 17 edges and 2 AP (stutter sensitive) to 10 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 347 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2293 resets, run finished after 215 ms. (steps per millisecond=46 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 461 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 458 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 483 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 475 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 478 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 463 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 2437390 steps, run timeout after 3001 ms. (steps per millisecond=812 ) properties seen :{0=1, 1=1, 3=1, 4=1, 5=1}
Probabilistic random walk after 2437390 steps, saw 935995 distinct states, run finished after 3002 ms. (steps per millisecond=811 ) properties seen :5
Running SMT prover for 1 properties.
[2024-05-21 21:37:40] [INFO ] Invariant cache hit.
[2024-05-21 21:37:40] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-21 21:37:40] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-21 21:37:40] [INFO ] After 65ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1), true, (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (AND p0 (NOT p1))), (F (NOT (AND p0 p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 224 ms. Reduced automaton from 10 states, 17 edges and 2 AP (stutter sensitive) to 10 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 389 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 379 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 90/90 places, 118/118 transitions.
Applied a total of 0 rules in 1 ms. Remains 90 /90 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2024-05-21 21:37:41] [INFO ] Invariant cache hit.
[2024-05-21 21:37:41] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 21:37:41] [INFO ] Invariant cache hit.
[2024-05-21 21:37:41] [INFO ] State equation strengthened by 42 read => feed constraints.
[2024-05-21 21:37:41] [INFO ] Implicit Places using invariants and state equation in 124 ms returned []
Implicit Place search using SMT with State Equation took 179 ms to find 0 implicit places.
[2024-05-21 21:37:41] [INFO ] Invariant cache hit.
[2024-05-21 21:37:41] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 232 ms. Remains : 90/90 places, 118/118 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 308 edges and 90 vertex of which 89 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 : [(AND p0 p1), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 10 states, 16 edges and 2 AP (stutter sensitive) to 10 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 342 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2292 resets, run finished after 124 ms. (steps per millisecond=80 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 501 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 450 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 470 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Finished probabilistic random walk after 21241 steps, run visited all 3 properties in 78 ms. (steps per millisecond=272 )
Probabilistic random walk after 21241 steps, saw 10079 distinct states, run finished after 78 ms. (steps per millisecond=272 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), true]
False Knowledge obtained : [(F (NOT p0)), (F (NOT (AND p0 p1))), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 141 ms. Reduced automaton from 10 states, 16 edges and 2 AP (stutter sensitive) to 10 states, 16 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 370 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 342 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 350 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 22974 reset in 110 ms.
Product exploration explored 100000 steps with 22911 reset in 117 ms.
Applying partial POR strategy [true, true, true, false, false, false, false, false, false, false]
Stuttering acceptance computed with spot in 335 ms :[true, (NOT p0), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 90 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 90/90 places, 118/118 transitions.
Applied a total of 0 rules in 11 ms. Remains 90 /90 variables (removed 0) and now considering 118/118 (removed 0) transitions.
[2024-05-21 21:37:44] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-21 21:37:44] [INFO ] Invariant cache hit.
[2024-05-21 21:37:44] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 80 ms. Remains : 90/90 places, 118/118 transitions.
Built C files in :
/tmp/ltsmin383406307370659462
[2024-05-21 21:37:44] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin383406307370659462
Running compilation step : cd /tmp/ltsmin383406307370659462;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 308 ms.
Running link step : cd /tmp/ltsmin383406307370659462;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin383406307370659462;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5022477378916199945.hoa' '--buchi-type=spotba'
LTSmin run took 8607 ms.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-04 finished in 18277 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(G(p1))))'
Support contains 5 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 262/262 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 130 transition count 198
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 130 transition count 198
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 46 place count 130 transition count 194
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 59 place count 117 transition count 181
Iterating global reduction 1 with 13 rules applied. Total rules applied 72 place count 117 transition count 181
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 77 place count 117 transition count 176
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 86 place count 108 transition count 159
Iterating global reduction 2 with 9 rules applied. Total rules applied 95 place count 108 transition count 159
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 98 place count 108 transition count 156
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 104 place count 102 transition count 142
Iterating global reduction 3 with 6 rules applied. Total rules applied 110 place count 102 transition count 142
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 114 place count 102 transition count 138
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 116 place count 100 transition count 136
Iterating global reduction 4 with 2 rules applied. Total rules applied 118 place count 100 transition count 136
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 120 place count 100 transition count 134
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 121 place count 99 transition count 133
Iterating global reduction 5 with 1 rules applied. Total rules applied 122 place count 99 transition count 133
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 123 place count 98 transition count 131
Iterating global reduction 5 with 1 rules applied. Total rules applied 124 place count 98 transition count 131
Applied a total of 124 rules in 29 ms. Remains 98 /151 variables (removed 53) and now considering 131/262 (removed 131) transitions.
// Phase 1: matrix 131 rows 98 cols
[2024-05-21 21:37:53] [INFO ] Computed 2 invariants in 3 ms
[2024-05-21 21:37:53] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-21 21:37:53] [INFO ] Invariant cache hit.
[2024-05-21 21:37:53] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-21 21:37:54] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2024-05-21 21:37:54] [INFO ] Redundant transitions in 3 ms returned []
[2024-05-21 21:37:54] [INFO ] Invariant cache hit.
[2024-05-21 21:37:54] [INFO ] Dead Transitions using invariants and state equation in 267 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 98/151 places, 131/262 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 534 ms. Remains : 98/151 places, 131/262 transitions.
Stuttering acceptance computed with spot in 430 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s33 1) (GEQ s60 1)), p1:(AND (OR (LT s1 1) (LT s92 1)) (OR (LT s1 1) (LT s89 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 22912 reset in 219 ms.
Product exploration explored 100000 steps with 22988 reset in 182 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 338 edges and 98 vertex of which 97 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 : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 84 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 46 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 2316 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 444 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 20881 steps, run visited all 1 properties in 36 ms. (steps per millisecond=580 )
Probabilistic random walk after 20881 steps, saw 9429 distinct states, run finished after 36 ms. (steps per millisecond=580 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X p1), (X (X (NOT p0))), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 5 factoid took 108 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 26 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p1)]
Support contains 3 out of 98 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 98/98 places, 131/131 transitions.
Applied a total of 0 rules in 13 ms. Remains 98 /98 variables (removed 0) and now considering 131/131 (removed 0) transitions.
[2024-05-21 21:37:55] [INFO ] Invariant cache hit.
[2024-05-21 21:37:55] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-21 21:37:55] [INFO ] Invariant cache hit.
[2024-05-21 21:37:55] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-21 21:37:55] [INFO ] Implicit Places using invariants and state equation in 151 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2024-05-21 21:37:55] [INFO ] Redundant transitions in 4 ms returned []
[2024-05-21 21:37:55] [INFO ] Invariant cache hit.
[2024-05-21 21:37:55] [INFO ] Dead Transitions using invariants and state equation in 58 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 286 ms. Remains : 98/98 places, 131/131 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 338 edges and 98 vertex of which 97 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 5 stabilizing places and 13 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 59 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 28 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 2280 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 436 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 20881 steps, run visited all 1 properties in 30 ms. (steps per millisecond=696 )
Probabilistic random walk after 20881 steps, saw 9429 distinct states, run finished after 30 ms. (steps per millisecond=696 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 91 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 38 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Product exploration explored 100000 steps with 22959 reset in 121 ms.
Product exploration explored 100000 steps with 22946 reset in 130 ms.
Built C files in :
/tmp/ltsmin558240084018501154
[2024-05-21 21:37:56] [INFO ] Computing symmetric may disable matrix : 131 transitions.
[2024-05-21 21:37:56] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:37:56] [INFO ] Computing symmetric may enable matrix : 131 transitions.
[2024-05-21 21:37:56] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:37:56] [INFO ] Computing Do-Not-Accords matrix : 131 transitions.
[2024-05-21 21:37:56] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:37:56] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin558240084018501154
Running compilation step : cd /tmp/ltsmin558240084018501154;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 264 ms.
Running link step : cd /tmp/ltsmin558240084018501154;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin558240084018501154;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9762302649717777282.hoa' '--buchi-type=spotba'
LTSmin run took 113 ms.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-05 finished in 3217 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U G(!p1)))'
Support contains 4 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 262/262 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 128 transition count 188
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 128 transition count 188
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 49 place count 128 transition count 185
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 64 place count 113 transition count 170
Iterating global reduction 1 with 15 rules applied. Total rules applied 79 place count 113 transition count 170
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 84 place count 113 transition count 165
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 94 place count 103 transition count 147
Iterating global reduction 2 with 10 rules applied. Total rules applied 104 place count 103 transition count 147
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 108 place count 103 transition count 143
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 114 place count 97 transition count 127
Iterating global reduction 3 with 6 rules applied. Total rules applied 120 place count 97 transition count 127
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 121 place count 97 transition count 126
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 125 place count 93 transition count 122
Iterating global reduction 4 with 4 rules applied. Total rules applied 129 place count 93 transition count 122
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 131 place count 93 transition count 120
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 134 place count 90 transition count 117
Iterating global reduction 5 with 3 rules applied. Total rules applied 137 place count 90 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 138 place count 90 transition count 116
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 139 place count 89 transition count 114
Iterating global reduction 6 with 1 rules applied. Total rules applied 140 place count 89 transition count 114
Applied a total of 140 rules in 28 ms. Remains 89 /151 variables (removed 62) and now considering 114/262 (removed 148) transitions.
// Phase 1: matrix 114 rows 89 cols
[2024-05-21 21:37:56] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:37:57] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 21:37:57] [INFO ] Invariant cache hit.
[2024-05-21 21:37:57] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 21:37:57] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 157 ms to find 0 implicit places.
[2024-05-21 21:37:57] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 21:37:57] [INFO ] Invariant cache hit.
[2024-05-21 21:37:57] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 89/151 places, 114/262 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 241 ms. Remains : 89/151 places, 114/262 transitions.
Stuttering acceptance computed with spot in 80 ms :[p1, (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (GEQ s1 1) (GEQ s81 1)), p0:(AND (GEQ s32 1) (GEQ s58 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 23186 reset in 107 ms.
Product exploration explored 100000 steps with 22990 reset in 108 ms.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 304 edges and 89 vertex of which 88 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 : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 108 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[p1, (NOT p0)]
Incomplete random walk after 10000 steps, including 2302 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 479 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 456 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 977 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Finished probabilistic random walk after 19969 steps, run visited all 3 properties in 51 ms. (steps per millisecond=391 )
Probabilistic random walk after 19969 steps, saw 9139 distinct states, run finished after 51 ms. (steps per millisecond=391 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F p1), (F p0), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 159 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[p1, (NOT p0)]
Stuttering acceptance computed with spot in 63 ms :[p1, (NOT p0)]
Support contains 4 out of 89 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 89/89 places, 114/114 transitions.
Applied a total of 0 rules in 10 ms. Remains 89 /89 variables (removed 0) and now considering 114/114 (removed 0) transitions.
[2024-05-21 21:37:58] [INFO ] Invariant cache hit.
[2024-05-21 21:37:58] [INFO ] Implicit Places using invariants in 48 ms returned []
[2024-05-21 21:37:58] [INFO ] Invariant cache hit.
[2024-05-21 21:37:58] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 21:37:58] [INFO ] Implicit Places using invariants and state equation in 105 ms returned []
Implicit Place search using SMT with State Equation took 153 ms to find 0 implicit places.
[2024-05-21 21:37:58] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 21:37:58] [INFO ] Invariant cache hit.
[2024-05-21 21:37:58] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 224 ms. Remains : 89/89 places, 114/114 transitions.
Computed a total of 5 stabilizing places and 13 stable transitions
Graph (complete) has 304 edges and 89 vertex of which 88 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 : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 72 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[p1, (NOT p0)]
Incomplete random walk after 10000 steps, including 2319 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 487 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 442 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 967 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Finished probabilistic random walk after 19969 steps, run visited all 3 properties in 57 ms. (steps per millisecond=350 )
Probabilistic random walk after 19969 steps, saw 9139 distinct states, run finished after 57 ms. (steps per millisecond=350 ) properties seen :3
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (AND (NOT p0) p1))]
Knowledge based reduction with 7 factoid took 147 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[p1, (NOT p0)]
Stuttering acceptance computed with spot in 61 ms :[p1, (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[p1, (NOT p0)]
Product exploration explored 100000 steps with 22876 reset in 112 ms.
Product exploration explored 100000 steps with 22962 reset in 112 ms.
Built C files in :
/tmp/ltsmin1739565030682910692
[2024-05-21 21:37:59] [INFO ] Computing symmetric may disable matrix : 114 transitions.
[2024-05-21 21:37:59] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:37:59] [INFO ] Computing symmetric may enable matrix : 114 transitions.
[2024-05-21 21:37:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:37:59] [INFO ] Computing Do-Not-Accords matrix : 114 transitions.
[2024-05-21 21:37:59] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-21 21:37:59] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1739565030682910692
Running compilation step : cd /tmp/ltsmin1739565030682910692;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 553 ms.
Running link step : cd /tmp/ltsmin1739565030682910692;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin1739565030682910692;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17964994263064971302.hoa' '--buchi-type=spotba'
LTSmin run took 100 ms.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-06 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-06 finished in 3277 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((!(p0 U p1) U p2))&&(X(p0)||G(p3))))'
Support contains 6 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 262/262 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 130 transition count 195
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 130 transition count 195
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 44 place count 130 transition count 193
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 58 place count 116 transition count 176
Iterating global reduction 1 with 14 rules applied. Total rules applied 72 place count 116 transition count 176
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 77 place count 116 transition count 171
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 87 place count 106 transition count 155
Iterating global reduction 2 with 10 rules applied. Total rules applied 97 place count 106 transition count 155
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 101 place count 106 transition count 151
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 107 place count 100 transition count 137
Iterating global reduction 3 with 6 rules applied. Total rules applied 113 place count 100 transition count 137
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 116 place count 100 transition count 134
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 118 place count 98 transition count 132
Iterating global reduction 4 with 2 rules applied. Total rules applied 120 place count 98 transition count 132
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 122 place count 96 transition count 130
Iterating global reduction 4 with 2 rules applied. Total rules applied 124 place count 96 transition count 130
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 125 place count 96 transition count 129
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 126 place count 95 transition count 127
Iterating global reduction 5 with 1 rules applied. Total rules applied 127 place count 95 transition count 127
Applied a total of 127 rules in 12 ms. Remains 95 /151 variables (removed 56) and now considering 127/262 (removed 135) transitions.
// Phase 1: matrix 127 rows 95 cols
[2024-05-21 21:38:00] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:38:00] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-21 21:38:00] [INFO ] Invariant cache hit.
[2024-05-21 21:38:00] [INFO ] State equation strengthened by 43 read => feed constraints.
[2024-05-21 21:38:00] [INFO ] Implicit Places using invariants and state equation in 144 ms returned []
Implicit Place search using SMT with State Equation took 196 ms to find 0 implicit places.
[2024-05-21 21:38:00] [INFO ] Invariant cache hit.
[2024-05-21 21:38:00] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 95/151 places, 127/262 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 271 ms. Remains : 95/151 places, 127/262 transitions.
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p3))), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) p2)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) p2 (NOT p3))), true, p1, (NOT p3)]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p3), acceptance={} source=0 dest: 2}, { cond=p3, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 4}, { cond=(AND (NOT p2) p0 (NOT p1)), acceptance={0} source=1 dest: 5}], [{ cond=(OR (AND p2 (NOT p0)) (AND (NOT p0) (NOT p1))), acceptance={} source=2 dest: 4}], [{ cond=(OR (AND (NOT p3) p2 (NOT p0)) (AND (NOT p3) (NOT p0) (NOT p1))), acceptance={} source=3 dest: 4}, { cond=(AND p3 (NOT p0)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 5}], [{ cond=(NOT p3), acceptance={} source=6 dest: 4}, { cond=p3, acceptance={} source=6 dest: 6}]], initial=0, aps=[p3:(AND (GEQ s2 1) (GEQ s90 1)), p2:(AND (GEQ s1 1) (GEQ s76 1)), p1:(AND (GEQ s1 1) (GEQ s86 1)), p0:(AND (GEQ s1 1) (GEQ s88 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-07 finished in 548 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 151/151 places, 262/262 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 128 transition count 192
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 128 transition count 192
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 50 place count 128 transition count 188
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 65 place count 113 transition count 170
Iterating global reduction 1 with 15 rules applied. Total rules applied 80 place count 113 transition count 170
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 85 place count 113 transition count 165
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 96 place count 102 transition count 146
Iterating global reduction 2 with 11 rules applied. Total rules applied 107 place count 102 transition count 146
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 110 place count 102 transition count 143
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 118 place count 94 transition count 124
Iterating global reduction 3 with 8 rules applied. Total rules applied 126 place count 94 transition count 124
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 131 place count 94 transition count 119
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 134 place count 91 transition count 116
Iterating global reduction 4 with 3 rules applied. Total rules applied 137 place count 91 transition count 116
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 139 place count 91 transition count 114
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 141 place count 89 transition count 112
Iterating global reduction 5 with 2 rules applied. Total rules applied 143 place count 89 transition count 112
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 144 place count 88 transition count 110
Iterating global reduction 5 with 1 rules applied. Total rules applied 145 place count 88 transition count 110
Applied a total of 145 rules in 17 ms. Remains 88 /151 variables (removed 63) and now considering 110/262 (removed 152) transitions.
// Phase 1: matrix 110 rows 88 cols
[2024-05-21 21:38:00] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:38:00] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-21 21:38:00] [INFO ] Invariant cache hit.
[2024-05-21 21:38:00] [INFO ] State equation strengthened by 35 read => feed constraints.
[2024-05-21 21:38:00] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 173 ms to find 0 implicit places.
[2024-05-21 21:38:00] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-21 21:38:00] [INFO ] Invariant cache hit.
[2024-05-21 21:38:01] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 88/151 places, 110/262 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 254 ms. Remains : 88/151 places, 110/262 transitions.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-10 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:(AND (GEQ s1 1) (GEQ 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]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-10 finished in 327 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(!p1))))'
Support contains 3 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 262/262 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 129 transition count 197
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 129 transition count 197
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 48 place count 129 transition count 193
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 62 place count 115 transition count 176
Iterating global reduction 1 with 14 rules applied. Total rules applied 76 place count 115 transition count 176
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 80 place count 115 transition count 172
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 90 place count 105 transition count 154
Iterating global reduction 2 with 10 rules applied. Total rules applied 100 place count 105 transition count 154
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 103 place count 105 transition count 151
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 110 place count 98 transition count 134
Iterating global reduction 3 with 7 rules applied. Total rules applied 117 place count 98 transition count 134
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 120 place count 98 transition count 131
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 123 place count 95 transition count 128
Iterating global reduction 4 with 3 rules applied. Total rules applied 126 place count 95 transition count 128
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 128 place count 95 transition count 126
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 130 place count 93 transition count 124
Iterating global reduction 5 with 2 rules applied. Total rules applied 132 place count 93 transition count 124
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 133 place count 92 transition count 122
Iterating global reduction 5 with 1 rules applied. Total rules applied 134 place count 92 transition count 122
Applied a total of 134 rules in 10 ms. Remains 92 /151 variables (removed 59) and now considering 122/262 (removed 140) transitions.
// Phase 1: matrix 122 rows 92 cols
[2024-05-21 21:38:01] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:38:01] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-21 21:38:01] [INFO ] Invariant cache hit.
[2024-05-21 21:38:01] [INFO ] State equation strengthened by 44 read => feed constraints.
[2024-05-21 21:38:01] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 187 ms to find 0 implicit places.
[2024-05-21 21:38:01] [INFO ] Invariant cache hit.
[2024-05-21 21:38:01] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 92/151 places, 122/262 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 252 ms. Remains : 92/151 places, 122/262 transitions.
Stuttering acceptance computed with spot in 100 ms :[p1, (AND p1 (NOT p0)), (AND p1 (NOT p0))]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(AND (GEQ s1 1) (GEQ s86 1)), p0:(AND (GEQ s1 1) (GEQ s83 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 173 ms.
Product exploration explored 100000 steps with 50000 reset in 179 ms.
Computed a total of 5 stabilizing places and 14 stable transitions
Graph (complete) has 317 edges and 92 vertex of which 91 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 5 stabilizing places and 14 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 p1))), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 11 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-11 finished in 736 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((X(p1)&&p0))||X(G(p2))))'
Support contains 3 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 262/262 transitions.
Discarding 22 places :
Symmetric choice reduction at 0 with 22 rule applications. Total rules 22 place count 129 transition count 189
Iterating global reduction 0 with 22 rules applied. Total rules applied 44 place count 129 transition count 189
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 47 place count 129 transition count 186
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 61 place count 115 transition count 169
Iterating global reduction 1 with 14 rules applied. Total rules applied 75 place count 115 transition count 169
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 80 place count 115 transition count 164
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 90 place count 105 transition count 145
Iterating global reduction 2 with 10 rules applied. Total rules applied 100 place count 105 transition count 145
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 103 place count 105 transition count 142
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 110 place count 98 transition count 129
Iterating global reduction 3 with 7 rules applied. Total rules applied 117 place count 98 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 120 place count 98 transition count 126
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 124 place count 94 transition count 122
Iterating global reduction 4 with 4 rules applied. Total rules applied 128 place count 94 transition count 122
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 130 place count 94 transition count 120
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 133 place count 91 transition count 117
Iterating global reduction 5 with 3 rules applied. Total rules applied 136 place count 91 transition count 117
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 137 place count 91 transition count 116
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 138 place count 90 transition count 114
Iterating global reduction 6 with 1 rules applied. Total rules applied 139 place count 90 transition count 114
Applied a total of 139 rules in 11 ms. Remains 90 /151 variables (removed 61) and now considering 114/262 (removed 148) transitions.
// Phase 1: matrix 114 rows 90 cols
[2024-05-21 21:38:01] [INFO ] Computed 2 invariants in 1 ms
[2024-05-21 21:38:01] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 21:38:01] [INFO ] Invariant cache hit.
[2024-05-21 21:38:01] [INFO ] State equation strengthened by 40 read => feed constraints.
[2024-05-21 21:38:02] [INFO ] Implicit Places using invariants and state equation in 119 ms returned []
Implicit Place search using SMT with State Equation took 174 ms to find 0 implicit places.
[2024-05-21 21:38:02] [INFO ] Invariant cache hit.
[2024-05-21 21:38:02] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 90/151 places, 114/262 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 237 ms. Remains : 90/151 places, 114/262 transitions.
Stuttering acceptance computed with spot in 395 ms :[true, (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p0, acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p1))), acceptance={} source=2 dest: 0}, { cond=(AND p0 p2 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 3}, { cond=(OR (AND (NOT p0) p2) (AND p2 (NOT p1))), acceptance={} source=2 dest: 4}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=1, aps=[p0:(AND (GEQ s1 1) (GEQ s56 1)), p2:(AND (GEQ s1 1) (GEQ s59 1)), p1:(AND (GEQ s1 1) (GEQ s56 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-12 finished in 646 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 262/262 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 128 transition count 194
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 128 transition count 194
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 50 place count 128 transition count 190
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 66 place count 112 transition count 171
Iterating global reduction 1 with 16 rules applied. Total rules applied 82 place count 112 transition count 171
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 87 place count 112 transition count 166
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 99 place count 100 transition count 145
Iterating global reduction 2 with 12 rules applied. Total rules applied 111 place count 100 transition count 145
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 115 place count 100 transition count 141
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 123 place count 92 transition count 122
Iterating global reduction 3 with 8 rules applied. Total rules applied 131 place count 92 transition count 122
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 134 place count 92 transition count 119
Discarding 4 places :
Symmetric choice reduction at 4 with 4 rule applications. Total rules 138 place count 88 transition count 115
Iterating global reduction 4 with 4 rules applied. Total rules applied 142 place count 88 transition count 115
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 144 place count 88 transition count 113
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 147 place count 85 transition count 110
Iterating global reduction 5 with 3 rules applied. Total rules applied 150 place count 85 transition count 110
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 151 place count 85 transition count 109
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 152 place count 84 transition count 107
Iterating global reduction 6 with 1 rules applied. Total rules applied 153 place count 84 transition count 107
Applied a total of 153 rules in 9 ms. Remains 84 /151 variables (removed 67) and now considering 107/262 (removed 155) transitions.
// Phase 1: matrix 107 rows 84 cols
[2024-05-21 21:38:02] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:38:02] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-21 21:38:02] [INFO ] Invariant cache hit.
[2024-05-21 21:38:02] [INFO ] State equation strengthened by 37 read => feed constraints.
[2024-05-21 21:38:02] [INFO ] Implicit Places using invariants and state equation in 118 ms returned []
Implicit Place search using SMT with State Equation took 172 ms to find 0 implicit places.
[2024-05-21 21:38:02] [INFO ] Invariant cache hit.
[2024-05-21 21:38:02] [INFO ] Dead Transitions using invariants and state equation in 65 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 84/151 places, 107/262 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 248 ms. Remains : 84/151 places, 107/262 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s60 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-13 finished in 324 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&X(X(((p1 U p2) U p3))))))'
Support contains 7 out of 151 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 151/151 places, 262/262 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 131 transition count 199
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 131 transition count 199
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 44 place count 131 transition count 195
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 57 place count 118 transition count 179
Iterating global reduction 1 with 13 rules applied. Total rules applied 70 place count 118 transition count 179
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 73 place count 118 transition count 176
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 81 place count 110 transition count 163
Iterating global reduction 2 with 8 rules applied. Total rules applied 89 place count 110 transition count 163
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 92 place count 110 transition count 160
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 97 place count 105 transition count 146
Iterating global reduction 3 with 5 rules applied. Total rules applied 102 place count 105 transition count 146
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 103 place count 105 transition count 145
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 105 place count 103 transition count 143
Iterating global reduction 4 with 2 rules applied. Total rules applied 107 place count 103 transition count 143
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 109 place count 103 transition count 141
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 110 place count 102 transition count 140
Iterating global reduction 5 with 1 rules applied. Total rules applied 111 place count 102 transition count 140
Applied a total of 111 rules in 14 ms. Remains 102 /151 variables (removed 49) and now considering 140/262 (removed 122) transitions.
// Phase 1: matrix 140 rows 102 cols
[2024-05-21 21:38:02] [INFO ] Computed 2 invariants in 2 ms
[2024-05-21 21:38:02] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-21 21:38:02] [INFO ] Invariant cache hit.
[2024-05-21 21:38:02] [INFO ] State equation strengthened by 52 read => feed constraints.
[2024-05-21 21:38:03] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2024-05-21 21:38:03] [INFO ] Invariant cache hit.
[2024-05-21 21:38:03] [INFO ] Dead Transitions using invariants and state equation in 66 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 102/151 places, 140/262 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 311 ms. Remains : 102/151 places, 140/262 transitions.
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p0) (NOT p3)), (OR (NOT p3) (NOT p0)), (NOT p0), (NOT p3), (NOT p3), true, (NOT p2)]
Running random walk in product with property : DBSingleClientW-PT-d1m10-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=(OR (AND (NOT p3) p2) (AND (NOT p3) p1)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=4 dest: 5}, { cond=(AND (NOT p3) (NOT p2) p1), acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=6 dest: 5}, { cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 6}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s95 1)) (AND (GEQ s32 1) (GEQ s38 1)) (AND (GEQ s1 1) (GEQ s62 1))), p3:(AND (GEQ s1 1) (GEQ s91 1)), p2:(AND (GEQ s18 1) (GEQ...], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 1 ms.
FORMULA DBSingleClientW-PT-d1m10-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DBSingleClientW-PT-d1m10-LTLFireability-15 finished in 592 ms.
All properties solved by simple procedures.
Total runtime 40079 ms.

BK_STOP 1716327484458

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DBSingleClientW-PT-d1m10"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is DBSingleClientW-PT-d1m10, 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 r109-tall-171624208300338"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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