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.r351-tall-171679102200383.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 ServersAndClients-PT-100020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r351-tall-171679102200383
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 9.0K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.7K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Apr 23 07:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 14K Apr 23 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 16:33 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 108K Apr 13 16:33 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.8K Apr 13 16:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Apr 13 16:26 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 4.1M May 18 16:43 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 ServersAndClients-PT-100020-LTLFireability-00
FORMULA_NAME ServersAndClients-PT-100020-LTLFireability-01
FORMULA_NAME ServersAndClients-PT-100020-LTLFireability-02
FORMULA_NAME ServersAndClients-PT-100020-LTLFireability-03
FORMULA_NAME ServersAndClients-PT-100020-LTLFireability-04
FORMULA_NAME ServersAndClients-PT-100020-LTLFireability-05
FORMULA_NAME ServersAndClients-PT-100020-LTLFireability-06
FORMULA_NAME ServersAndClients-PT-100020-LTLFireability-07
FORMULA_NAME ServersAndClients-PT-100020-LTLFireability-08
FORMULA_NAME ServersAndClients-PT-100020-LTLFireability-09
FORMULA_NAME ServersAndClients-PT-100020-LTLFireability-10
FORMULA_NAME ServersAndClients-PT-100020-LTLFireability-11
FORMULA_NAME ServersAndClients-PT-100020-LTLFireability-12
FORMULA_NAME ServersAndClients-PT-100020-LTLFireability-13
FORMULA_NAME ServersAndClients-PT-100020-LTLFireability-14
FORMULA_NAME ServersAndClients-PT-100020-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716893268875

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=ServersAndClients-PT-100020
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-28 10:47:50] [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-28 10:47:50] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 10:47:50] [INFO ] Load time of PNML (sax parser for PT used): 250 ms
[2024-05-28 10:47:50] [INFO ] Transformed 2421 places.
[2024-05-28 10:47:50] [INFO ] Transformed 4200 transitions.
[2024-05-28 10:47:50] [INFO ] Found NUPN structural information;
[2024-05-28 10:47:50] [INFO ] Parsed PT model containing 2421 places and 4200 transitions and 12800 arcs in 341 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 5 formulas.
FORMULA ServersAndClients-PT-100020-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100020-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100020-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100020-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100020-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 2421 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2421/2421 places, 4200/4200 transitions.
Applied a total of 0 rules in 358 ms. Remains 2421 /2421 variables (removed 0) and now considering 4200/4200 (removed 0) transitions.
// Phase 1: matrix 4200 rows 2421 cols
[2024-05-28 10:47:51] [INFO ] Computed 221 invariants in 87 ms
[2024-05-28 10:47:52] [INFO ] Implicit Places using invariants in 965 ms returned [1, 3, 5, 7, 9, 11, 13, 15, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 83, 85, 87, 89, 91, 93, 95, 97, 99, 101, 103, 105, 107, 109, 111, 113, 115, 117, 119, 121, 123, 125, 127, 129, 131, 133, 135, 137, 139, 141, 143, 145, 147, 149, 151, 153, 155, 157, 159, 161, 163, 165, 167, 169, 171, 173, 175, 177, 179, 181, 183, 185, 187, 189, 191, 193, 195, 197, 199]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 997 ms to find 100 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2321/2421 places, 4200/4200 transitions.
Applied a total of 0 rules in 178 ms. Remains 2321 /2321 variables (removed 0) and now considering 4200/4200 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1534 ms. Remains : 2321/2421 places, 4200/4200 transitions.
Support contains 37 out of 2321 places after structural reductions.
[2024-05-28 10:47:53] [INFO ] Flatten gal took : 250 ms
[2024-05-28 10:47:53] [INFO ] Flatten gal took : 157 ms
[2024-05-28 10:47:53] [INFO ] Input system was already deterministic with 4200 transitions.
Support contains 35 out of 2321 places (down from 37) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 465 ms. (steps per millisecond=21 ) properties (out of 24) seen :23
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 4200 rows 2321 cols
[2024-05-28 10:47:54] [INFO ] Computed 121 invariants in 99 ms
[2024-05-28 10:47:54] [INFO ] [Real]Absence check using 121 positive place invariants in 139 ms returned sat
[2024-05-28 10:47:56] [INFO ] After 1279ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-28 10:47:56] [INFO ] After 1474ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 108 ms.
[2024-05-28 10:47:56] [INFO ] After 2116ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Finished Parikh walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Parikh walk visited 1 properties in 6 ms.
FORMULA ServersAndClients-PT-100020-LTLFireability-11 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
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((p1||(G(p2) U p3)))))'
Support contains 9 out of 2321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2321/2321 places, 4200/4200 transitions.
Applied a total of 0 rules in 119 ms. Remains 2321 /2321 variables (removed 0) and now considering 4200/4200 (removed 0) transitions.
[2024-05-28 10:47:56] [INFO ] Invariant cache hit.
[2024-05-28 10:47:58] [INFO ] Implicit Places using invariants in 1885 ms returned [0, 1, 2, 3, 4, 6, 7, 8, 9, 10, 11, 12, 13, 14, 16, 17, 18, 19, 20, 21, 22, 23, 25, 26, 27, 28, 29, 30, 31, 32, 33, 36, 37, 38, 39, 40, 41, 42, 43, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 74, 75, 76, 77, 78, 79, 80, 81, 82, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 301, 402, 503, 604, 705, 806, 907, 1008, 1109, 1311, 1412, 1513, 1917, 2018, 2119, 2220]
Discarding 108 places :
Implicit Place search using SMT only with invariants took 1897 ms to find 108 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2213/2321 places, 4200/4200 transitions.
Discarding 1590 places :
Symmetric choice reduction at 0 with 1590 rule applications. Total rules 1590 place count 623 transition count 2610
Iterating global reduction 0 with 1590 rules applied. Total rules applied 3180 place count 623 transition count 2610
Ensure Unique test removed 1499 transitions
Reduce isomorphic transitions removed 1499 transitions.
Iterating post reduction 0 with 1499 rules applied. Total rules applied 4679 place count 623 transition count 1111
Discarding 455 places :
Symmetric choice reduction at 1 with 455 rule applications. Total rules 5134 place count 168 transition count 656
Iterating global reduction 1 with 455 rules applied. Total rules applied 5589 place count 168 transition count 656
Discarding 86 places :
Symmetric choice reduction at 1 with 86 rule applications. Total rules 5675 place count 82 transition count 226
Iterating global reduction 1 with 86 rules applied. Total rules applied 5761 place count 82 transition count 226
Ensure Unique test removed 86 transitions
Reduce isomorphic transitions removed 86 transitions.
Iterating post reduction 1 with 86 rules applied. Total rules applied 5847 place count 82 transition count 140
Applied a total of 5847 rules in 276 ms. Remains 82 /2213 variables (removed 2131) and now considering 140/4200 (removed 4060) transitions.
// Phase 1: matrix 140 rows 82 cols
[2024-05-28 10:47:59] [INFO ] Computed 13 invariants in 0 ms
[2024-05-28 10:47:59] [INFO ] Implicit Places using invariants in 41 ms returned [0, 1, 2, 3, 4, 5, 6, 7]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 41 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 74/2321 places, 140/4200 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 66 transition count 132
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 66 transition count 132
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 56 place count 26 transition count 92
Iterating global reduction 0 with 40 rules applied. Total rules applied 96 place count 26 transition count 92
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 104 place count 18 transition count 52
Iterating global reduction 0 with 8 rules applied. Total rules applied 112 place count 18 transition count 52
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 120 place count 18 transition count 44
Applied a total of 120 rules in 4 ms. Remains 18 /74 variables (removed 56) and now considering 44/140 (removed 96) transitions.
// Phase 1: matrix 44 rows 18 cols
[2024-05-28 10:47:59] [INFO ] Computed 5 invariants in 0 ms
[2024-05-28 10:47:59] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-28 10:47:59] [INFO ] Invariant cache hit.
[2024-05-28 10:47:59] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 3 : 18/2321 places, 44/4200 transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2392 ms. Remains : 18/2321 places, 44/4200 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 444 ms :[true, (AND (NOT p1) (NOT p3)), (OR (NOT p2) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (AND (NOT p0) (NOT p1) (NOT p3)), (NOT p0), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ServersAndClients-PT-100020-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) (NOT p3) p2), acceptance={} source=1 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p3) p2), acceptance={0} source=2 dest: 2}, { cond=(AND p3 p2), acceptance={0} source=2 dest: 6}], [{ cond=(NOT p0), acceptance={} source=3 dest: 1}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p3) p2), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p3) (NOT p2)), acceptance={} source=4 dest: 5}, { cond=(AND p0 (NOT p1) (NOT p3) p2), acceptance={} source=4 dest: 7}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(NOT p2), acceptance={} source=6 dest: 0}, { cond=p2, acceptance={} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=7 dest: 0}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=7 dest: 2}, { cond=(AND p0 (NOT p2)), acceptance={} source=7 dest: 5}, { cond=(AND (NOT p0) p3 p2), acceptance={} source=7 dest: 6}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=7 dest: 7}, { cond=(AND p0 p3 p2), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=8 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=8 dest: 5}, { cond=(AND (NOT p0) p2), acceptance={} source=8 dest: 6}, { cond=(AND p0 p2), acceptance={} source=8 dest: 8}]], initial=3, aps=[p1:(AND (EQ s7 1) (EQ s14 1)), p3:(AND (EQ s4 1) (EQ s12 1)), p2:(AND (EQ s3 1) (EQ s16 1)), p0:(OR (EQ s6 0) (EQ s10 0) (EQ s9 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 41 steps with 2 reset in 4 ms.
FORMULA ServersAndClients-PT-100020-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100020-LTLFireability-00 finished in 2904 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 2321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2321/2321 places, 4200/4200 transitions.
Drop transitions removed 1881 transitions
Trivial Post-agglo rules discarded 1881 transitions
Performed 1881 trivial Post agglomeration. Transition count delta: 1881
Iterating post reduction 0 with 1881 rules applied. Total rules applied 1881 place count 2321 transition count 2319
Reduce places removed 1881 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 1 with 1900 rules applied. Total rules applied 3781 place count 440 transition count 2300
Reduce places removed 38 places and 0 transitions.
Ensure Unique test removed 1800 transitions
Reduce isomorphic transitions removed 1800 transitions.
Iterating post reduction 2 with 1838 rules applied. Total rules applied 5619 place count 402 transition count 500
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 5819 place count 302 transition count 400
Applied a total of 5819 rules in 113 ms. Remains 302 /2321 variables (removed 2019) and now considering 400/4200 (removed 3800) transitions.
// Phase 1: matrix 400 rows 302 cols
[2024-05-28 10:47:59] [INFO ] Computed 102 invariants in 2 ms
[2024-05-28 10:48:00] [INFO ] Implicit Places using invariants in 201 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 202 ms to find 100 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 202/2321 places, 400/4200 transitions.
Graph (trivial) has 198 edges and 202 vertex of which 100 / 202 are part of one of the 1 SCC in 2 ms
Free SCC test removed 99 places
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 197 transitions.
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 100 place count 4 transition count 104
Iterating global reduction 0 with 99 rules applied. Total rules applied 199 place count 4 transition count 104
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 297 place count 4 transition count 6
Applied a total of 297 rules in 6 ms. Remains 4 /202 variables (removed 198) and now considering 6/400 (removed 394) transitions.
// Phase 1: matrix 6 rows 4 cols
[2024-05-28 10:48:00] [INFO ] Computed 2 invariants in 1 ms
[2024-05-28 10:48:00] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-28 10:48:00] [INFO ] Invariant cache hit.
[2024-05-28 10:48:00] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/2321 places, 6/4200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 405 ms. Remains : 4/2321 places, 6/4200 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100020-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s0 0) (EQ s2 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 8492 reset in 201 ms.
Product exploration explored 100000 steps with 8661 reset in 92 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 172 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 200 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 6/6 transitions.
Applied a total of 0 rules in 0 ms. Remains 4 /4 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2024-05-28 10:48:01] [INFO ] Invariant cache hit.
[2024-05-28 10:48:01] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-28 10:48:01] [INFO ] Invariant cache hit.
[2024-05-28 10:48:01] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 34 ms to find 0 implicit places.
[2024-05-28 10:48:01] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 10:48:01] [INFO ] Invariant cache hit.
[2024-05-28 10:48:01] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 55 ms. Remains : 4/4 places, 6/6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 162 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 208 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 8668 reset in 80 ms.
Product exploration explored 100000 steps with 8774 reset in 62 ms.
Built C files in :
/tmp/ltsmin1557718140855794531
[2024-05-28 10:48:02] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2024-05-28 10:48:02] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 10:48:02] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2024-05-28 10:48:02] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 10:48:02] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2024-05-28 10:48:02] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 10:48:02] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1557718140855794531
Running compilation step : cd /tmp/ltsmin1557718140855794531;'/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 153 ms.
Running link step : cd /tmp/ltsmin1557718140855794531;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin1557718140855794531;'/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/stateBased14264689239491288824.hoa' '--buchi-type=spotba'
LTSmin run took 112 ms.
FORMULA ServersAndClients-PT-100020-LTLFireability-01 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ServersAndClients-PT-100020-LTLFireability-01 finished in 2616 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(G((G(p2)||p1)))))))'
Support contains 3 out of 2321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2321/2321 places, 4200/4200 transitions.
Applied a total of 0 rules in 144 ms. Remains 2321 /2321 variables (removed 0) and now considering 4200/4200 (removed 0) transitions.
// Phase 1: matrix 4200 rows 2321 cols
[2024-05-28 10:48:02] [INFO ] Computed 121 invariants in 46 ms
[2024-05-28 10:48:04] [INFO ] Implicit Places using invariants in 2025 ms returned [0, 1, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 17, 18, 19, 20, 21, 22, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 301, 402, 503, 604, 705, 907, 1008, 1109, 1210, 1311, 1412, 1513, 1614, 1715, 1816, 1917, 2018, 2119, 2220]
Discarding 115 places :
Implicit Place search using SMT only with invariants took 2031 ms to find 115 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2206/2321 places, 4200/4200 transitions.
Discarding 1894 places :
Symmetric choice reduction at 0 with 1894 rule applications. Total rules 1894 place count 312 transition count 2306
Iterating global reduction 0 with 1894 rules applied. Total rules applied 3788 place count 312 transition count 2306
Ensure Unique test removed 1799 transitions
Reduce isomorphic transitions removed 1799 transitions.
Iterating post reduction 0 with 1799 rules applied. Total rules applied 5587 place count 312 transition count 507
Discarding 190 places :
Symmetric choice reduction at 1 with 190 rule applications. Total rules 5777 place count 122 transition count 317
Iterating global reduction 1 with 190 rules applied. Total rules applied 5967 place count 122 transition count 317
Discarding 93 places :
Symmetric choice reduction at 1 with 93 rule applications. Total rules 6060 place count 29 transition count 131
Iterating global reduction 1 with 93 rules applied. Total rules applied 6153 place count 29 transition count 131
Ensure Unique test removed 93 transitions
Reduce isomorphic transitions removed 93 transitions.
Iterating post reduction 1 with 93 rules applied. Total rules applied 6246 place count 29 transition count 38
Applied a total of 6246 rules in 35 ms. Remains 29 /2206 variables (removed 2177) and now considering 38/4200 (removed 4162) transitions.
// Phase 1: matrix 38 rows 29 cols
[2024-05-28 10:48:04] [INFO ] Computed 6 invariants in 0 ms
[2024-05-28 10:48:04] [INFO ] Implicit Places using invariants in 21 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 22 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 25/2321 places, 38/4200 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 21 transition count 34
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 21 transition count 34
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 16 place count 13 transition count 26
Iterating global reduction 0 with 8 rules applied. Total rules applied 24 place count 13 transition count 26
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 9 transition count 18
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 9 transition count 18
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 36 place count 9 transition count 14
Applied a total of 36 rules in 1 ms. Remains 9 /25 variables (removed 16) and now considering 14/38 (removed 24) transitions.
// Phase 1: matrix 14 rows 9 cols
[2024-05-28 10:48:04] [INFO ] Computed 2 invariants in 0 ms
[2024-05-28 10:48:04] [INFO ] Implicit Places using invariants in 35 ms returned []
[2024-05-28 10:48:04] [INFO ] Invariant cache hit.
[2024-05-28 10:48:04] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 3 : 9/2321 places, 14/4200 transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2290 ms. Remains : 9/2321 places, 14/4200 transitions.
Stuttering acceptance computed with spot in 207 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ServersAndClients-PT-100020-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0, 1} source=1 dest: 1}, { cond=p0, acceptance={0, 1} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 1}, { cond=(OR p1 p2), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={1} source=2 dest: 3}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={0, 1} source=3 dest: 1}, { cond=(AND p0 (NOT p2)), acceptance={0, 1} source=3 dest: 2}, { cond=(AND (NOT p0) p2), acceptance={1} source=3 dest: 3}, { cond=(AND p0 p2), acceptance={1} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={0, 1} source=4 dest: 2}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={1} source=4 dest: 3}, { cond=(AND p1 p2), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=4 dest: 4}]], initial=0, aps=[p0:(OR (NEQ s1 1) (NEQ s6 1)), p1:(OR (NEQ s1 1) (NEQ s6 1)), p2:(EQ s8 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 103 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA ServersAndClients-PT-100020-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100020-LTLFireability-03 finished in 2620 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&&(F(p1)||X(p0)))))'
Support contains 1 out of 2321 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2321/2321 places, 4200/4200 transitions.
Applied a total of 0 rules in 135 ms. Remains 2321 /2321 variables (removed 0) and now considering 4200/4200 (removed 0) transitions.
// Phase 1: matrix 4200 rows 2321 cols
[2024-05-28 10:48:05] [INFO ] Computed 121 invariants in 47 ms
[2024-05-28 10:48:07] [INFO ] Implicit Places using invariants in 2054 ms returned [0, 1, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 17, 18, 19, 20, 21, 22, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 301, 402, 503, 604, 705, 806, 907, 1008, 1109, 1210, 1311, 1412, 1513, 1614, 1715, 1816, 1917, 2018, 2119, 2220]
Discarding 116 places :
Implicit Place search using SMT only with invariants took 2061 ms to find 116 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2205/2321 places, 4200/4200 transitions.
Discarding 1994 places :
Symmetric choice reduction at 0 with 1994 rule applications. Total rules 1994 place count 211 transition count 2206
Iterating global reduction 0 with 1994 rules applied. Total rules applied 3988 place count 211 transition count 2206
Ensure Unique test removed 1899 transitions
Reduce isomorphic transitions removed 1899 transitions.
Iterating post reduction 0 with 1899 rules applied. Total rules applied 5887 place count 211 transition count 307
Discarding 95 places :
Symmetric choice reduction at 1 with 95 rule applications. Total rules 5982 place count 116 transition count 212
Iterating global reduction 1 with 95 rules applied. Total rules applied 6077 place count 116 transition count 212
Discarding 94 places :
Symmetric choice reduction at 1 with 94 rule applications. Total rules 6171 place count 22 transition count 118
Iterating global reduction 1 with 94 rules applied. Total rules applied 6265 place count 22 transition count 118
Ensure Unique test removed 94 transitions
Reduce isomorphic transitions removed 94 transitions.
Iterating post reduction 1 with 94 rules applied. Total rules applied 6359 place count 22 transition count 24
Applied a total of 6359 rules in 26 ms. Remains 22 /2205 variables (removed 2183) and now considering 24/4200 (removed 4176) transitions.
// Phase 1: matrix 24 rows 22 cols
[2024-05-28 10:48:07] [INFO ] Computed 5 invariants in 1 ms
[2024-05-28 10:48:07] [INFO ] Implicit Places using invariants in 196 ms returned [0, 1, 2, 3]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 197 ms to find 4 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 18/2321 places, 24/4200 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 14 transition count 20
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 14 transition count 20
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 12 place count 10 transition count 16
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 10 transition count 16
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 6 transition count 12
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 6 transition count 12
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 6 transition count 8
Applied a total of 28 rules in 2 ms. Remains 6 /18 variables (removed 12) and now considering 8/24 (removed 16) transitions.
// Phase 1: matrix 8 rows 6 cols
[2024-05-28 10:48:07] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 10:48:07] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-05-28 10:48:07] [INFO ] Invariant cache hit.
[2024-05-28 10:48:07] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 3 : 6/2321 places, 8/4200 transitions.
Finished structural reductions in LTL mode , in 3 iterations and 2451 ms. Remains : 6/2321 places, 8/4200 transitions.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-100020-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={0} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 0}]], initial=1, aps=[p0:(EQ s5 1), p1:(EQ s5 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 6255 reset in 48 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA ServersAndClients-PT-100020-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100020-LTLFireability-05 finished in 2644 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&&G(p1))))'
Support contains 3 out of 2321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2321/2321 places, 4200/4200 transitions.
Drop transitions removed 1880 transitions
Trivial Post-agglo rules discarded 1880 transitions
Performed 1880 trivial Post agglomeration. Transition count delta: 1880
Iterating post reduction 0 with 1880 rules applied. Total rules applied 1880 place count 2321 transition count 2320
Reduce places removed 1880 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 1 with 1899 rules applied. Total rules applied 3779 place count 441 transition count 2301
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 1700 transitions
Reduce isomorphic transitions removed 1700 transitions.
Iterating post reduction 2 with 1737 rules applied. Total rules applied 5516 place count 404 transition count 601
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 5716 place count 304 transition count 501
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 3 with 99 rules applied. Total rules applied 5815 place count 304 transition count 402
Applied a total of 5815 rules in 99 ms. Remains 304 /2321 variables (removed 2017) and now considering 402/4200 (removed 3798) transitions.
// Phase 1: matrix 402 rows 304 cols
[2024-05-28 10:48:07] [INFO ] Computed 103 invariants in 3 ms
[2024-05-28 10:48:08] [INFO ] Implicit Places using invariants in 304 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 302]
Discarding 101 places :
Implicit Place search using SMT only with invariants took 311 ms to find 101 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 203/2321 places, 402/4200 transitions.
Graph (trivial) has 198 edges and 203 vertex of which 100 / 203 are part of one of the 1 SCC in 0 ms
Free SCC test removed 99 places
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 197 transitions.
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 100 place count 5 transition count 106
Iterating global reduction 0 with 99 rules applied. Total rules applied 199 place count 5 transition count 106
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 297 place count 5 transition count 8
Applied a total of 297 rules in 3 ms. Remains 5 /203 variables (removed 198) and now considering 8/402 (removed 394) transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-28 10:48:08] [INFO ] Computed 2 invariants in 0 ms
[2024-05-28 10:48:08] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-28 10:48:08] [INFO ] Invariant cache hit.
[2024-05-28 10:48:08] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/2321 places, 8/4200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 458 ms. Remains : 5/2321 places, 8/4200 transitions.
Stuttering acceptance computed with spot in 72 ms :[(OR (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-100020-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s4 0), p1:(OR (EQ s0 0) (EQ s2 0))], 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 0 reset in 95 ms.
Stack based approach found an accepted trace after 2 steps with 0 reset with depth 3 and stack size 3 in 0 ms.
FORMULA ServersAndClients-PT-100020-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100020-LTLFireability-06 finished in 663 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(p1)))'
Support contains 3 out of 2321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2321/2321 places, 4200/4200 transitions.
Drop transitions removed 1880 transitions
Trivial Post-agglo rules discarded 1880 transitions
Performed 1880 trivial Post agglomeration. Transition count delta: 1880
Iterating post reduction 0 with 1880 rules applied. Total rules applied 1880 place count 2321 transition count 2320
Reduce places removed 1880 places and 0 transitions.
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Iterating post reduction 1 with 1899 rules applied. Total rules applied 3779 place count 441 transition count 2301
Reduce places removed 37 places and 0 transitions.
Ensure Unique test removed 1700 transitions
Reduce isomorphic transitions removed 1700 transitions.
Iterating post reduction 2 with 1737 rules applied. Total rules applied 5516 place count 404 transition count 601
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 5716 place count 304 transition count 501
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 3 with 99 rules applied. Total rules applied 5815 place count 304 transition count 402
Applied a total of 5815 rules in 66 ms. Remains 304 /2321 variables (removed 2017) and now considering 402/4200 (removed 3798) transitions.
// Phase 1: matrix 402 rows 304 cols
[2024-05-28 10:48:08] [INFO ] Computed 103 invariants in 2 ms
[2024-05-28 10:48:08] [INFO ] Implicit Places using invariants in 194 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 201]
Discarding 101 places :
Implicit Place search using SMT only with invariants took 197 ms to find 101 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 203/2321 places, 402/4200 transitions.
Graph (trivial) has 198 edges and 203 vertex of which 100 / 203 are part of one of the 1 SCC in 1 ms
Free SCC test removed 99 places
Ensure Unique test removed 197 transitions
Reduce isomorphic transitions removed 197 transitions.
Discarding 99 places :
Symmetric choice reduction at 0 with 99 rule applications. Total rules 100 place count 5 transition count 106
Iterating global reduction 0 with 99 rules applied. Total rules applied 199 place count 5 transition count 106
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 297 place count 5 transition count 8
Applied a total of 297 rules in 11 ms. Remains 5 /203 variables (removed 198) and now considering 8/402 (removed 394) transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-28 10:48:08] [INFO ] Computed 2 invariants in 0 ms
[2024-05-28 10:48:08] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-28 10:48:08] [INFO ] Invariant cache hit.
[2024-05-28 10:48:08] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 133 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/2321 places, 8/4200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 407 ms. Remains : 5/2321 places, 8/4200 transitions.
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ServersAndClients-PT-100020-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p1:(EQ s2 1), p0:(AND (EQ s0 1) (EQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100020-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100020-LTLFireability-07 finished in 485 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((F(p0)&&G(p1))))'
Support contains 2 out of 2321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2321/2321 places, 4200/4200 transitions.
Drop transitions removed 1998 transitions
Trivial Post-agglo rules discarded 1998 transitions
Performed 1998 trivial Post agglomeration. Transition count delta: 1998
Iterating post reduction 0 with 1998 rules applied. Total rules applied 1998 place count 2321 transition count 2202
Reduce places removed 2016 places and 0 transitions.
Ensure Unique test removed 1700 transitions
Reduce isomorphic transitions removed 1700 transitions.
Iterating post reduction 1 with 3716 rules applied. Total rules applied 5714 place count 305 transition count 502
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 5914 place count 205 transition count 402
Drop transitions removed 198 transitions
Redundant transition composition rules discarded 198 transitions
Iterating global reduction 2 with 198 rules applied. Total rules applied 6112 place count 205 transition count 204
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 2 with 98 rules applied. Total rules applied 6210 place count 205 transition count 106
Reduce places removed 196 places and 0 transitions.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 3 with 293 rules applied. Total rules applied 6503 place count 9 transition count 9
Applied a total of 6503 rules in 49 ms. Remains 9 /2321 variables (removed 2312) and now considering 9/4200 (removed 4191) transitions.
// Phase 1: matrix 9 rows 9 cols
[2024-05-28 10:48:08] [INFO ] Computed 5 invariants in 0 ms
[2024-05-28 10:48:08] [INFO ] Implicit Places using invariants in 22 ms returned [0, 1, 5, 7]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 23 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/2321 places, 9/4200 transitions.
Graph (trivial) has 5 edges and 5 vertex of which 3 / 5 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Applied a total of 1 rules in 0 ms. Remains 3 /5 variables (removed 2) and now considering 5/9 (removed 4) transitions.
// Phase 1: matrix 5 rows 3 cols
[2024-05-28 10:48:08] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 10:48:08] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-28 10:48:08] [INFO ] Invariant cache hit.
[2024-05-28 10:48:08] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 70 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3/2321 places, 5/4200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 142 ms. Remains : 3/2321 places, 5/4200 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-100020-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(NEQ s1 1), p0:(EQ s2 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 51 ms.
Stack based approach found an accepted trace after 1 steps with 0 reset with depth 2 and stack size 2 in 0 ms.
FORMULA ServersAndClients-PT-100020-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100020-LTLFireability-12 finished in 338 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||G(F(p1)))))'
Support contains 4 out of 2321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2321/2321 places, 4200/4200 transitions.
Drop transitions removed 1764 transitions
Trivial Post-agglo rules discarded 1764 transitions
Performed 1764 trivial Post agglomeration. Transition count delta: 1764
Iterating post reduction 0 with 1764 rules applied. Total rules applied 1764 place count 2321 transition count 2436
Reduce places removed 1764 places and 0 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Iterating post reduction 1 with 1800 rules applied. Total rules applied 3564 place count 557 transition count 2400
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 1700 transitions
Reduce isomorphic transitions removed 1700 transitions.
Iterating post reduction 2 with 1754 rules applied. Total rules applied 5318 place count 503 transition count 700
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 5518 place count 403 transition count 600
Applied a total of 5518 rules in 67 ms. Remains 403 /2321 variables (removed 1918) and now considering 600/4200 (removed 3600) transitions.
// Phase 1: matrix 600 rows 403 cols
[2024-05-28 10:48:09] [INFO ] Computed 103 invariants in 3 ms
[2024-05-28 10:48:09] [INFO ] Implicit Places using invariants in 220 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 223 ms to find 100 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 303/2321 places, 600/4200 transitions.
Graph (trivial) has 196 edges and 303 vertex of which 99 / 303 are part of one of the 1 SCC in 0 ms
Free SCC test removed 98 places
Ensure Unique test removed 195 transitions
Reduce isomorphic transitions removed 195 transitions.
Discarding 198 places :
Symmetric choice reduction at 0 with 198 rule applications. Total rules 199 place count 7 transition count 207
Iterating global reduction 0 with 198 rules applied. Total rules applied 397 place count 7 transition count 207
Ensure Unique test removed 194 transitions
Reduce isomorphic transitions removed 194 transitions.
Iterating post reduction 0 with 194 rules applied. Total rules applied 591 place count 7 transition count 13
Applied a total of 591 rules in 4 ms. Remains 7 /303 variables (removed 296) and now considering 13/600 (removed 587) transitions.
// Phase 1: matrix 13 rows 7 cols
[2024-05-28 10:48:09] [INFO ] Computed 3 invariants in 0 ms
[2024-05-28 10:48:09] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-28 10:48:09] [INFO ] Invariant cache hit.
[2024-05-28 10:48:09] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/2321 places, 13/4200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 341 ms. Remains : 7/2321 places, 13/4200 transitions.
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-100020-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s0 1) (EQ s3 1)), p1:(AND (EQ s1 1) (EQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ServersAndClients-PT-100020-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100020-LTLFireability-13 finished in 439 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)&&F(G(p1)))))'
Support contains 2 out of 2321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2321/2321 places, 4200/4200 transitions.
Drop transitions removed 1998 transitions
Trivial Post-agglo rules discarded 1998 transitions
Performed 1998 trivial Post agglomeration. Transition count delta: 1998
Iterating post reduction 0 with 1998 rules applied. Total rules applied 1998 place count 2321 transition count 2202
Reduce places removed 2016 places and 0 transitions.
Ensure Unique test removed 1700 transitions
Reduce isomorphic transitions removed 1700 transitions.
Iterating post reduction 1 with 3716 rules applied. Total rules applied 5714 place count 305 transition count 502
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 2 with 200 rules applied. Total rules applied 5914 place count 205 transition count 402
Drop transitions removed 198 transitions
Redundant transition composition rules discarded 198 transitions
Iterating global reduction 2 with 198 rules applied. Total rules applied 6112 place count 205 transition count 204
Drop transitions removed 98 transitions
Trivial Post-agglo rules discarded 98 transitions
Performed 98 trivial Post agglomeration. Transition count delta: 98
Iterating post reduction 2 with 98 rules applied. Total rules applied 6210 place count 205 transition count 106
Reduce places removed 196 places and 0 transitions.
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 3 with 293 rules applied. Total rules applied 6503 place count 9 transition count 9
Applied a total of 6503 rules in 42 ms. Remains 9 /2321 variables (removed 2312) and now considering 9/4200 (removed 4191) transitions.
// Phase 1: matrix 9 rows 9 cols
[2024-05-28 10:48:09] [INFO ] Computed 5 invariants in 0 ms
[2024-05-28 10:48:09] [INFO ] Implicit Places using invariants in 22 ms returned [0, 1, 5, 7]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 23 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 5/2321 places, 9/4200 transitions.
Graph (trivial) has 5 edges and 5 vertex of which 3 / 5 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Applied a total of 1 rules in 0 ms. Remains 3 /5 variables (removed 2) and now considering 5/9 (removed 4) transitions.
// Phase 1: matrix 5 rows 3 cols
[2024-05-28 10:48:09] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 10:48:09] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-28 10:48:09] [INFO ] Invariant cache hit.
[2024-05-28 10:48:09] [INFO ] Implicit Places using invariants and state equation in 15 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 3/2321 places, 5/4200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 101 ms. Remains : 3/2321 places, 5/4200 transitions.
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-100020-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(EQ s1 1), p1:(EQ s2 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100020-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100020-LTLFireability-14 finished in 228 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 (G(F(X(X(p0)))) U G(p1))))'
Support contains 4 out of 2321 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2321/2321 places, 4200/4200 transitions.
Drop transitions removed 1764 transitions
Trivial Post-agglo rules discarded 1764 transitions
Performed 1764 trivial Post agglomeration. Transition count delta: 1764
Iterating post reduction 0 with 1764 rules applied. Total rules applied 1764 place count 2321 transition count 2436
Reduce places removed 1764 places and 0 transitions.
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Iterating post reduction 1 with 1800 rules applied. Total rules applied 3564 place count 557 transition count 2400
Reduce places removed 54 places and 0 transitions.
Ensure Unique test removed 1700 transitions
Reduce isomorphic transitions removed 1700 transitions.
Iterating post reduction 2 with 1754 rules applied. Total rules applied 5318 place count 503 transition count 700
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Reduce places removed 100 places and 0 transitions.
Iterating global reduction 3 with 200 rules applied. Total rules applied 5518 place count 403 transition count 600
Applied a total of 5518 rules in 59 ms. Remains 403 /2321 variables (removed 1918) and now considering 600/4200 (removed 3600) transitions.
// Phase 1: matrix 600 rows 403 cols
[2024-05-28 10:48:09] [INFO ] Computed 103 invariants in 4 ms
[2024-05-28 10:48:09] [INFO ] Implicit Places using invariants in 167 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99]
Discarding 100 places :
Implicit Place search using SMT only with invariants took 171 ms to find 100 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 303/2321 places, 600/4200 transitions.
Graph (trivial) has 196 edges and 303 vertex of which 99 / 303 are part of one of the 1 SCC in 0 ms
Free SCC test removed 98 places
Ensure Unique test removed 195 transitions
Reduce isomorphic transitions removed 195 transitions.
Discarding 198 places :
Symmetric choice reduction at 0 with 198 rule applications. Total rules 199 place count 7 transition count 207
Iterating global reduction 0 with 198 rules applied. Total rules applied 397 place count 7 transition count 207
Ensure Unique test removed 194 transitions
Reduce isomorphic transitions removed 194 transitions.
Iterating post reduction 0 with 194 rules applied. Total rules applied 591 place count 7 transition count 13
Applied a total of 591 rules in 4 ms. Remains 7 /303 variables (removed 296) and now considering 13/600 (removed 587) transitions.
// Phase 1: matrix 13 rows 7 cols
[2024-05-28 10:48:09] [INFO ] Computed 3 invariants in 1 ms
[2024-05-28 10:48:10] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-28 10:48:10] [INFO ] Invariant cache hit.
[2024-05-28 10:48:10] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/2321 places, 13/4200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 285 ms. Remains : 7/2321 places, 13/4200 transitions.
Stuttering acceptance computed with spot in 141 ms :[p1, p1, (AND p0 p1), (AND p0 p1)]
Running random walk in product with property : ServersAndClients-PT-100020-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p1, acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 2}, { cond=(AND p0 p1), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 3}, { cond=(AND p0 p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s1 1) (EQ s5 1)), p1:(AND (EQ s0 1) (EQ s3 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 0 reset in 60 ms.
Product exploration explored 100000 steps with 0 reset in 82 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), true, (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 324 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 4 states, 8 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 156 ms :[p1, p1, (AND p0 p1), (AND p0 p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-28 10:48:10] [INFO ] Invariant cache hit.
[2024-05-28 10:48:10] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-28 10:48:10] [INFO ] After 22ms 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 (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), true, (X (X (NOT (AND p0 p1)))), (G (NOT (AND p0 p1)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X p1)), (X (X (NOT p1))), (F (AND (NOT p0) p1)), (F p0), (F p1)]
Knowledge based reduction with 5 factoid took 365 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[p1, p1]
Stuttering acceptance computed with spot in 76 ms :[p1, p1]
Support contains 4 out of 7 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 7/7 places, 13/13 transitions.
Applied a total of 0 rules in 0 ms. Remains 7 /7 variables (removed 0) and now considering 13/13 (removed 0) transitions.
[2024-05-28 10:48:11] [INFO ] Invariant cache hit.
[2024-05-28 10:48:11] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-28 10:48:11] [INFO ] Invariant cache hit.
[2024-05-28 10:48:11] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
[2024-05-28 10:48:11] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-28 10:48:11] [INFO ] Invariant cache hit.
[2024-05-28 10:48:11] [INFO ] Dead Transitions using invariants and state equation in 22 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 66 ms. Remains : 7/7 places, 13/13 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 275 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[p1, p1]
Finished random walk after 8 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=4 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F p0), (F p1)]
Knowledge based reduction with 1 factoid took 320 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[p1, p1]
Stuttering acceptance computed with spot in 62 ms :[p1, p1]
Stuttering acceptance computed with spot in 62 ms :[p1, p1]
Product exploration explored 100000 steps with 15216 reset in 65 ms.
Product exploration explored 100000 steps with 15227 reset in 66 ms.
Built C files in :
/tmp/ltsmin991205484059559010
[2024-05-28 10:48:12] [INFO ] Computing symmetric may disable matrix : 13 transitions.
[2024-05-28 10:48:12] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 10:48:12] [INFO ] Computing symmetric may enable matrix : 13 transitions.
[2024-05-28 10:48:12] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 10:48:12] [INFO ] Computing Do-Not-Accords matrix : 13 transitions.
[2024-05-28 10:48:12] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-28 10:48:12] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin991205484059559010
Running compilation step : cd /tmp/ltsmin991205484059559010;'/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 78 ms.
Running link step : cd /tmp/ltsmin991205484059559010;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin991205484059559010;'/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/stateBased7436554654929176830.hoa' '--buchi-type=spotba'
LTSmin run took 57 ms.
FORMULA ServersAndClients-PT-100020-LTLFireability-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ServersAndClients-PT-100020-LTLFireability-15 finished in 2906 ms.
All properties solved by simple procedures.
Total runtime 22265 ms.

BK_STOP 1716893293645

--------------------
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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ 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="ServersAndClients-PT-100020"
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 ServersAndClients-PT-100020, 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 r351-tall-171679102200383"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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