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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 3.0M
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Apr 23 07:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 24K Apr 23 07:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Apr 23 07:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Apr 23 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Apr 13 15:58 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 133K Apr 13 15:58 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K Apr 13 15:56 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 110K Apr 13 15:56 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 2.5M 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-100040-LTLFireability-00
FORMULA_NAME ServersAndClients-PT-100040-LTLFireability-01
FORMULA_NAME ServersAndClients-PT-100040-LTLFireability-02
FORMULA_NAME ServersAndClients-PT-100040-LTLFireability-03
FORMULA_NAME ServersAndClients-PT-100040-LTLFireability-04
FORMULA_NAME ServersAndClients-PT-100040-LTLFireability-05
FORMULA_NAME ServersAndClients-PT-100040-LTLFireability-06
FORMULA_NAME ServersAndClients-PT-100040-LTLFireability-07
FORMULA_NAME ServersAndClients-PT-100040-LTLFireability-08
FORMULA_NAME ServersAndClients-PT-100040-LTLFireability-09
FORMULA_NAME ServersAndClients-PT-100040-LTLFireability-10
FORMULA_NAME ServersAndClients-PT-100040-LTLFireability-11
FORMULA_NAME ServersAndClients-PT-100040-LTLFireability-12
FORMULA_NAME ServersAndClients-PT-100040-LTLFireability-13
FORMULA_NAME ServersAndClients-PT-100040-LTLFireability-14
FORMULA_NAME ServersAndClients-PT-100040-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716893379827

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-100040
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-28 10:49:41] [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:49:41] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 10:49:41] [INFO ] Load time of PNML (sax parser for PT used): 271 ms
[2024-05-28 10:49:41] [INFO ] Transformed 4441 places.
[2024-05-28 10:49:41] [INFO ] Transformed 8200 transitions.
[2024-05-28 10:49:41] [INFO ] Found NUPN structural information;
[2024-05-28 10:49:41] [INFO ] Parsed PT model containing 4441 places and 8200 transitions and 24800 arcs in 385 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ServersAndClients-PT-100040-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100040-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100040-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 48 out of 4441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4441/4441 places, 8200/8200 transitions.
Applied a total of 0 rules in 767 ms. Remains 4441 /4441 variables (removed 0) and now considering 8200/8200 (removed 0) transitions.
// Phase 1: matrix 8200 rows 4441 cols
[2024-05-28 10:49:43] [INFO ] Computed 241 invariants in 136 ms
[2024-05-28 10:49:44] [INFO ] Implicit Places using invariants in 1500 ms returned []
[2024-05-28 10:49:44] [INFO ] Invariant cache hit.
[2024-05-28 10:49:45] [INFO ] Implicit Places using invariants and state equation in 745 ms returned []
Implicit Place search using SMT with State Equation took 2273 ms to find 0 implicit places.
[2024-05-28 10:49:45] [INFO ] Invariant cache hit.
[2024-05-28 10:49:45] [INFO ] Dead Transitions using invariants and state equation in 696 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3741 ms. Remains : 4441/4441 places, 8200/8200 transitions.
Support contains 48 out of 4441 places after structural reductions.
[2024-05-28 10:49:46] [INFO ] Flatten gal took : 397 ms
[2024-05-28 10:49:46] [INFO ] Flatten gal took : 241 ms
[2024-05-28 10:49:47] [INFO ] Input system was already deterministic with 8200 transitions.
Support contains 46 out of 4441 places (down from 48) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 698 ms. (steps per millisecond=14 ) properties (out of 34) seen :21
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 12) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 7) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-28 10:49:48] [INFO ] Invariant cache hit.
[2024-05-28 10:49:49] [INFO ] [Real]Absence check using 141 positive place invariants in 252 ms returned sat
[2024-05-28 10:49:49] [INFO ] [Real]Absence check using 141 positive and 100 generalized place invariants in 76 ms returned sat
[2024-05-28 10:49:54] [INFO ] After 4392ms SMT Verify possible using state equation in real domain returned unsat :2 sat :4
[2024-05-28 10:49:55] [INFO ] After 5820ms SMT Verify possible using trap constraints in real domain returned unsat :2 sat :4
Attempting to minimize the solution found.
Minimization took 807 ms.
[2024-05-28 10:49:56] [INFO ] After 8324ms SMT Verify possible using all constraints in real domain returned unsat :2 sat :4
Fused 6 Parikh solutions to 4 different solutions.
Finished Parikh walk after 2 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=1 )
Parikh walk visited 3 properties in 22 ms.
Support contains 1 out of 4441 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 4441/4441 places, 8200/8200 transitions.
Drop transitions removed 3999 transitions
Trivial Post-agglo rules discarded 3999 transitions
Performed 3999 trivial Post agglomeration. Transition count delta: 3999
Iterating post reduction 0 with 3999 rules applied. Total rules applied 3999 place count 4441 transition count 4201
Reduce places removed 4038 places and 0 transitions.
Ensure Unique test removed 3800 transitions
Reduce isomorphic transitions removed 3800 transitions.
Iterating post reduction 1 with 7838 rules applied. Total rules applied 11837 place count 403 transition count 401
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 2 with 99 rules applied. Total rules applied 11936 place count 403 transition count 302
Discarding 99 places :
Implicit places reduction removed 99 places
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 2 with 297 rules applied. Total rules applied 12233 place count 304 transition count 104
Reduce places removed 297 places and 0 transitions.
Drop transitions removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 3 with 396 rules applied. Total rules applied 12629 place count 7 transition count 5
Ensure Unique test removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 12630 place count 6 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 12633 place count 4 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 12635 place count 3 transition count 3
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 12636 place count 3 transition count 2
Ensure Unique test removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 12637 place count 2 transition count 2
Applied a total of 12637 rules in 101 ms. Remains 2 /4441 variables (removed 4439) and now considering 2/8200 (removed 8198) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 101 ms. Remains : 2/4441 places, 2/8200 transitions.
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.
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
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) U p1))'
Support contains 3 out of 4441 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4441/4441 places, 8200/8200 transitions.
Drop transitions removed 3860 transitions
Trivial Post-agglo rules discarded 3860 transitions
Performed 3860 trivial Post agglomeration. Transition count delta: 3860
Iterating post reduction 0 with 3860 rules applied. Total rules applied 3860 place count 4441 transition count 4340
Reduce places removed 3860 places and 0 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Iterating post reduction 1 with 3899 rules applied. Total rules applied 7759 place count 581 transition count 4301
Reduce places removed 77 places and 0 transitions.
Ensure Unique test removed 3700 transitions
Reduce isomorphic transitions removed 3700 transitions.
Iterating post reduction 2 with 3777 rules applied. Total rules applied 11536 place count 504 transition count 601
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 3 with 99 rules applied. Total rules applied 11635 place count 504 transition count 502
Applied a total of 11635 rules in 135 ms. Remains 504 /4441 variables (removed 3937) and now considering 502/8200 (removed 7698) transitions.
// Phase 1: matrix 502 rows 504 cols
[2024-05-28 10:49:57] [INFO ] Computed 203 invariants in 7 ms
[2024-05-28 10:49:57] [INFO ] Implicit Places using invariants in 416 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, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 502]
Discarding 201 places :
Implicit Place search using SMT only with invariants took 420 ms to find 201 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 303/4441 places, 502/8200 transitions.
Graph (trivial) has 298 edges and 303 vertex of which 199 / 303 are part of one of the 1 SCC in 2 ms
Free SCC test removed 198 places
Ensure Unique test removed 296 transitions
Reduce isomorphic transitions removed 296 transitions.
Discarding 98 places :
Symmetric choice reduction at 0 with 98 rule applications. Total rules 99 place count 7 transition count 108
Iterating global reduction 0 with 98 rules applied. Total rules applied 197 place count 7 transition count 108
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 295 place count 7 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 297 place count 6 transition count 9
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 298 place count 5 transition count 8
Iterating global reduction 1 with 1 rules applied. Total rules applied 299 place count 5 transition count 8
Applied a total of 299 rules in 11 ms. Remains 5 /303 variables (removed 298) and now considering 8/502 (removed 494) transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-05-28 10:49:57] [INFO ] Computed 2 invariants in 0 ms
[2024-05-28 10:49:57] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-28 10:49:57] [INFO ] Invariant cache hit.
[2024-05-28 10:49:58] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 47 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/4441 places, 8/8200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 613 ms. Remains : 5/4441 places, 8/8200 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 188 ms :[(NOT p1), true, (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100040-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s0 1) (EQ s2 1)), p0:(NEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ServersAndClients-PT-100040-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100040-LTLFireability-00 finished in 868 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(G((X(p0) U p1)))))'
Support contains 2 out of 4441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4441/4441 places, 8200/8200 transitions.
Applied a total of 0 rules in 523 ms. Remains 4441 /4441 variables (removed 0) and now considering 8200/8200 (removed 0) transitions.
// Phase 1: matrix 8200 rows 4441 cols
[2024-05-28 10:49:58] [INFO ] Computed 241 invariants in 47 ms
[2024-05-28 10:49:59] [INFO ] Implicit Places using invariants in 1199 ms returned []
[2024-05-28 10:49:59] [INFO ] Invariant cache hit.
[2024-05-28 10:50:01] [INFO ] Implicit Places using invariants and state equation in 1094 ms returned []
Implicit Place search using SMT with State Equation took 2298 ms to find 0 implicit places.
[2024-05-28 10:50:01] [INFO ] Invariant cache hit.
[2024-05-28 10:50:05] [INFO ] Dead Transitions using invariants and state equation in 4897 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7722 ms. Remains : 4441/4441 places, 8200/8200 transitions.
Stuttering acceptance computed with spot in 77 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-100040-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={0} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s1728 1), p0:(EQ s459 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 0 reset in 2154 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 1 ms.
FORMULA ServersAndClients-PT-100040-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100040-LTLFireability-02 finished in 10004 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 1 out of 4441 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4441/4441 places, 8200/8200 transitions.
Drop transitions removed 3999 transitions
Trivial Post-agglo rules discarded 3999 transitions
Performed 3999 trivial Post agglomeration. Transition count delta: 3999
Iterating post reduction 0 with 3999 rules applied. Total rules applied 3999 place count 4441 transition count 4201
Reduce places removed 4038 places and 0 transitions.
Ensure Unique test removed 3800 transitions
Reduce isomorphic transitions removed 3800 transitions.
Iterating post reduction 1 with 7838 rules applied. Total rules applied 11837 place count 403 transition count 401
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 2 with 99 rules applied. Total rules applied 11936 place count 403 transition count 302
Discarding 99 places :
Implicit places reduction removed 99 places
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 2 with 297 rules applied. Total rules applied 12233 place count 304 transition count 104
Reduce places removed 297 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 3 with 395 rules applied. Total rules applied 12628 place count 7 transition count 6
Applied a total of 12628 rules in 59 ms. Remains 7 /4441 variables (removed 4434) and now considering 6/8200 (removed 8194) transitions.
// Phase 1: matrix 6 rows 7 cols
[2024-05-28 10:50:08] [INFO ] Computed 4 invariants in 0 ms
[2024-05-28 10:50:08] [INFO ] Implicit Places using invariants in 23 ms returned [0, 1, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 24 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/4441 places, 6/8200 transitions.
Graph (trivial) has 4 edges and 4 vertex of which 3 / 4 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 1 ms. Remains 2 /4 variables (removed 2) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-05-28 10:50:08] [INFO ] Computed 1 invariants in 1 ms
[2024-05-28 10:50:08] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-28 10:50:08] [INFO ] Invariant cache hit.
[2024-05-28 10:50:08] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 32 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/4441 places, 3/8200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 116 ms. Remains : 2/4441 places, 3/8200 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100040-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s1 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 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100040-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100040-LTLFireability-03 finished in 212 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(G((p0||G(p1)))))))'
Support contains 2 out of 4441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4441/4441 places, 8200/8200 transitions.
Applied a total of 0 rules in 537 ms. Remains 4441 /4441 variables (removed 0) and now considering 8200/8200 (removed 0) transitions.
// Phase 1: matrix 8200 rows 4441 cols
[2024-05-28 10:50:09] [INFO ] Computed 241 invariants in 55 ms
[2024-05-28 10:50:10] [INFO ] Implicit Places using invariants in 1263 ms returned []
[2024-05-28 10:50:10] [INFO ] Invariant cache hit.
[2024-05-28 10:50:10] [INFO ] Implicit Places using invariants and state equation in 716 ms returned []
Implicit Place search using SMT with State Equation took 1985 ms to find 0 implicit places.
[2024-05-28 10:50:10] [INFO ] Invariant cache hit.
[2024-05-28 10:50:15] [INFO ] Dead Transitions using invariants and state equation in 4839 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7367 ms. Remains : 4441/4441 places, 8200/8200 transitions.
Stuttering acceptance computed with spot in 216 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ServersAndClients-PT-100040-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={} source=5 dest: 3}]], initial=4, aps=[p1:(EQ s649 0), p0:(EQ s1331 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 22370 steps with 0 reset in 422 ms.
FORMULA ServersAndClients-PT-100040-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100040-LTLFireability-04 finished in 8045 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(G((p0&&F(G(p1))&&F(p2))))))'
Support contains 5 out of 4441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4441/4441 places, 8200/8200 transitions.
Applied a total of 0 rules in 542 ms. Remains 4441 /4441 variables (removed 0) and now considering 8200/8200 (removed 0) transitions.
[2024-05-28 10:50:17] [INFO ] Invariant cache hit.
[2024-05-28 10:50:17] [INFO ] Implicit Places using invariants in 637 ms returned []
[2024-05-28 10:50:17] [INFO ] Invariant cache hit.
[2024-05-28 10:50:18] [INFO ] Implicit Places using invariants and state equation in 698 ms returned []
Implicit Place search using SMT with State Equation took 1340 ms to find 0 implicit places.
[2024-05-28 10:50:18] [INFO ] Invariant cache hit.
[2024-05-28 10:50:18] [INFO ] Dead Transitions using invariants and state equation in 569 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2452 ms. Remains : 4441/4441 places, 8200/8200 transitions.
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : ServersAndClients-PT-100040-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p0, acceptance={} source=2 dest: 2}, { cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={0} source=5 dest: 5}]], initial=0, aps=[p0:(EQ s1073 1), p1:(OR (EQ s385 0) (EQ s3128 0)), p2:(AND (EQ s345 1) (EQ s3330 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100040-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100040-LTLFireability-05 finished in 2742 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(p0)))'
Support contains 1 out of 4441 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4441/4441 places, 8200/8200 transitions.
Drop transitions removed 3999 transitions
Trivial Post-agglo rules discarded 3999 transitions
Performed 3999 trivial Post agglomeration. Transition count delta: 3999
Iterating post reduction 0 with 3999 rules applied. Total rules applied 3999 place count 4441 transition count 4201
Reduce places removed 4038 places and 0 transitions.
Ensure Unique test removed 3800 transitions
Reduce isomorphic transitions removed 3800 transitions.
Iterating post reduction 1 with 7838 rules applied. Total rules applied 11837 place count 403 transition count 401
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 2 with 99 rules applied. Total rules applied 11936 place count 403 transition count 302
Discarding 99 places :
Implicit places reduction removed 99 places
Drop transitions removed 198 transitions
Trivial Post-agglo rules discarded 198 transitions
Performed 198 trivial Post agglomeration. Transition count delta: 198
Iterating post reduction 2 with 297 rules applied. Total rules applied 12233 place count 304 transition count 104
Reduce places removed 297 places and 0 transitions.
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 3 with 395 rules applied. Total rules applied 12628 place count 7 transition count 6
Applied a total of 12628 rules in 67 ms. Remains 7 /4441 variables (removed 4434) and now considering 6/8200 (removed 8194) transitions.
// Phase 1: matrix 6 rows 7 cols
[2024-05-28 10:50:19] [INFO ] Computed 4 invariants in 0 ms
[2024-05-28 10:50:19] [INFO ] Implicit Places using invariants in 119 ms returned [0, 1, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 121 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/4441 places, 6/8200 transitions.
Graph (trivial) has 4 edges and 4 vertex of which 3 / 4 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 1 ms. Remains 2 /4 variables (removed 2) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-05-28 10:50:19] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 10:50:19] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-28 10:50:19] [INFO ] Invariant cache hit.
[2024-05-28 10:50:19] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/4441 places, 3/8200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 238 ms. Remains : 2/4441 places, 3/8200 transitions.
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100040-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s1 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100040-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100040-LTLFireability-06 finished in 299 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(p1))))'
Support contains 6 out of 4441 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4441/4441 places, 8200/8200 transitions.
Drop transitions removed 3589 transitions
Trivial Post-agglo rules discarded 3589 transitions
Performed 3589 trivial Post agglomeration. Transition count delta: 3589
Iterating post reduction 0 with 3589 rules applied. Total rules applied 3589 place count 4441 transition count 4611
Reduce places removed 3589 places and 0 transitions.
Performed 111 Post agglomeration using F-continuation condition.Transition count delta: 111
Iterating post reduction 1 with 3700 rules applied. Total rules applied 7289 place count 852 transition count 4500
Reduce places removed 148 places and 0 transitions.
Ensure Unique test removed 3600 transitions
Reduce isomorphic transitions removed 3600 transitions.
Iterating post reduction 2 with 3748 rules applied. Total rules applied 11037 place count 704 transition count 900
Applied a total of 11037 rules in 88 ms. Remains 704 /4441 variables (removed 3737) and now considering 900/8200 (removed 7300) transitions.
// Phase 1: matrix 900 rows 704 cols
[2024-05-28 10:50:19] [INFO ] Computed 204 invariants in 7 ms
[2024-05-28 10:50:20] [INFO ] Implicit Places using invariants in 434 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, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199]
Discarding 200 places :
Implicit Place search using SMT only with invariants took 437 ms to find 200 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 504/4441 places, 900/8200 transitions.
Graph (trivial) has 294 edges and 504 vertex of which 195 / 504 are part of one of the 1 SCC in 0 ms
Free SCC test removed 194 places
Ensure Unique test removed 290 transitions
Reduce isomorphic transitions removed 290 transitions.
Discarding 290 places :
Symmetric choice reduction at 0 with 290 rule applications. Total rules 291 place count 20 transition count 320
Iterating global reduction 0 with 290 rules applied. Total rules applied 581 place count 20 transition count 320
Ensure Unique test removed 288 transitions
Reduce isomorphic transitions removed 288 transitions.
Iterating post reduction 0 with 288 rules applied. Total rules applied 869 place count 20 transition count 32
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 875 place count 14 transition count 26
Iterating global reduction 1 with 6 rules applied. Total rules applied 881 place count 14 transition count 26
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 883 place count 13 transition count 25
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 886 place count 10 transition count 22
Iterating global reduction 1 with 3 rules applied. Total rules applied 889 place count 10 transition count 22
Applied a total of 889 rules in 12 ms. Remains 10 /504 variables (removed 494) and now considering 22/900 (removed 878) transitions.
// Phase 1: matrix 22 rows 10 cols
[2024-05-28 10:50:20] [INFO ] Computed 4 invariants in 1 ms
[2024-05-28 10:50:20] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-05-28 10:50:20] [INFO ] Invariant cache hit.
[2024-05-28 10:50:20] [INFO ] Implicit Places using invariants and state equation in 26 ms returned []
Implicit Place search using SMT with State Equation took 53 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/4441 places, 22/8200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 593 ms. Remains : 10/4441 places, 22/8200 transitions.
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-100040-LTLFireability-07 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=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s2 1) (EQ s4 1)), p1:(AND (OR (EQ s1 0) (EQ s6 0)) (EQ s0 1) (EQ s8 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100040-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100040-LTLFireability-07 finished in 853 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))||G(p2))))'
Support contains 3 out of 4441 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 : 4441/4441 places, 8200/8200 transitions.
Drop transitions removed 3723 transitions
Trivial Post-agglo rules discarded 3723 transitions
Performed 3723 trivial Post agglomeration. Transition count delta: 3723
Iterating post reduction 0 with 3723 rules applied. Total rules applied 3723 place count 4441 transition count 4477
Reduce places removed 3723 places and 0 transitions.
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Iterating post reduction 1 with 3799 rules applied. Total rules applied 7522 place count 718 transition count 4401
Reduce places removed 113 places and 0 transitions.
Ensure Unique test removed 3600 transitions
Reduce isomorphic transitions removed 3600 transitions.
Iterating post reduction 2 with 3713 rules applied. Total rules applied 11235 place count 605 transition count 801
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 3 with 99 rules applied. Total rules applied 11334 place count 605 transition count 702
Applied a total of 11334 rules in 89 ms. Remains 605 /4441 variables (removed 3836) and now considering 702/8200 (removed 7498) transitions.
// Phase 1: matrix 702 rows 605 cols
[2024-05-28 10:50:20] [INFO ] Computed 204 invariants in 7 ms
[2024-05-28 10:50:20] [INFO ] Implicit Places using invariants in 359 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, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 502]
Discarding 201 places :
Implicit Place search using SMT only with invariants took 362 ms to find 201 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 404/4441 places, 702/8200 transitions.
Graph (trivial) has 296 edges and 404 vertex of which 197 / 404 are part of one of the 1 SCC in 0 ms
Free SCC test removed 196 places
Ensure Unique test removed 293 transitions
Reduce isomorphic transitions removed 293 transitions.
Discarding 195 places :
Symmetric choice reduction at 0 with 195 rule applications. Total rules 196 place count 13 transition count 214
Iterating global reduction 0 with 195 rules applied. Total rules applied 391 place count 13 transition count 214
Ensure Unique test removed 194 transitions
Reduce isomorphic transitions removed 194 transitions.
Iterating post reduction 0 with 194 rules applied. Total rules applied 585 place count 13 transition count 20
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 587 place count 11 transition count 18
Iterating global reduction 1 with 2 rules applied. Total rules applied 589 place count 11 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 591 place count 10 transition count 17
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 593 place count 8 transition count 15
Iterating global reduction 1 with 2 rules applied. Total rules applied 595 place count 8 transition count 15
Applied a total of 595 rules in 9 ms. Remains 8 /404 variables (removed 396) and now considering 15/702 (removed 687) transitions.
// Phase 1: matrix 15 rows 8 cols
[2024-05-28 10:50:20] [INFO ] Computed 3 invariants in 0 ms
[2024-05-28 10:50:20] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-05-28 10:50:20] [INFO ] Invariant cache hit.
[2024-05-28 10:50:20] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/4441 places, 15/8200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 504 ms. Remains : 8/4441 places, 15/8200 transitions.
Stuttering acceptance computed with spot in 32 ms :[(AND (NOT p1) (NOT p2))]
Running random walk in product with property : ServersAndClients-PT-100040-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND p1 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0, 1} source=0 dest: 0}]], initial=0, aps=[p1:(EQ s5 1), p2:(OR (NEQ s1 1) (NEQ s6 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 155 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 4 in 1 ms.
FORMULA ServersAndClients-PT-100040-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100040-LTLFireability-08 finished in 716 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(F(((X(p0) U ((p1&&X(p0))||X(G(p0)))) U (G((X(p0) U ((p1&&X(p0))||X(G(p0)))))||(!p2&&(X(p0) U ((p1&&X(p0))||X(G(p0)))))))))))'
Support contains 4 out of 4441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4441/4441 places, 8200/8200 transitions.
Applied a total of 0 rules in 694 ms. Remains 4441 /4441 variables (removed 0) and now considering 8200/8200 (removed 0) transitions.
// Phase 1: matrix 8200 rows 4441 cols
[2024-05-28 10:50:21] [INFO ] Computed 241 invariants in 47 ms
[2024-05-28 10:50:22] [INFO ] Implicit Places using invariants in 795 ms returned []
[2024-05-28 10:50:22] [INFO ] Invariant cache hit.
[2024-05-28 10:50:23] [INFO ] Implicit Places using invariants and state equation in 1324 ms returned []
Implicit Place search using SMT with State Equation took 2131 ms to find 0 implicit places.
[2024-05-28 10:50:23] [INFO ] Invariant cache hit.
[2024-05-28 10:50:29] [INFO ] Dead Transitions using invariants and state equation in 5317 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8142 ms. Remains : 4441/4441 places, 8200/8200 transitions.
Stuttering acceptance computed with spot in 202 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), false]
Running random walk in product with property : ServersAndClients-PT-100040-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={1} source=2 dest: 2}, { cond=true, acceptance={0, 1} source=2 dest: 3}, { cond=(NOT p1), acceptance={0, 1} source=2 dest: 4}], [{ cond=(AND p2 (NOT p0)), acceptance={1} source=3 dest: 2}, { cond=(NOT p0), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 4}], [{ cond=p0, acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s3322 1) (EQ s339 1) (EQ s401 1)), p1:(NEQ s3322 1), p0:(NEQ s2867 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 24999 reset in 2135 ms.
Product exploration explored 100000 steps with 25000 reset in 2143 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 p2) p1 p0), (X (X (NOT p2))), true]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 133 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 203 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 351 ms. (steps per millisecond=28 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-28 10:50:34] [INFO ] Invariant cache hit.
[2024-05-28 10:50:35] [INFO ] [Real]Absence check using 141 positive place invariants in 163 ms returned sat
[2024-05-28 10:50:35] [INFO ] [Real]Absence check using 141 positive and 100 generalized place invariants in 65 ms returned sat
[2024-05-28 10:50:35] [INFO ] After 986ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (X (NOT p2))), true, (G (NOT (AND (NOT p0) (NOT p1)))), (G (NOT p2)), (G (NOT (AND (NOT p0) p2)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p0)), (F (AND p0 (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 331 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 2 out of 4441 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 4441/4441 places, 8200/8200 transitions.
Applied a total of 0 rules in 704 ms. Remains 4441 /4441 variables (removed 0) and now considering 8200/8200 (removed 0) transitions.
[2024-05-28 10:50:37] [INFO ] Invariant cache hit.
[2024-05-28 10:50:37] [INFO ] Implicit Places using invariants in 650 ms returned []
[2024-05-28 10:50:37] [INFO ] Invariant cache hit.
[2024-05-28 10:50:38] [INFO ] Implicit Places using invariants and state equation in 1084 ms returned []
Implicit Place search using SMT with State Equation took 1736 ms to find 0 implicit places.
[2024-05-28 10:50:38] [INFO ] Invariant cache hit.
[2024-05-28 10:50:43] [INFO ] Dead Transitions using invariants and state equation in 4438 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6881 ms. Remains : 4441/4441 places, 8200/8200 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 p0 p1)]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 129 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 7597 steps, including 2 resets, run visited all 2 properties in 139 ms. (steps per millisecond=54 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 169 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 170 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 24998 reset in 2064 ms.
Product exploration explored 100000 steps with 24998 reset in 2134 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 2 out of 4441 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4441/4441 places, 8200/8200 transitions.
Performed 3998 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3998 rules applied. Total rules applied 3998 place count 4441 transition count 8200
Discarding 37 places :
Symmetric choice reduction at 1 with 37 rule applications. Total rules 4035 place count 4404 transition count 4500
Deduced a syphon composed of 3998 places in 1 ms
Iterating global reduction 1 with 37 rules applied. Total rules applied 4072 place count 4404 transition count 4500
Discarding 3700 places :
Symmetric choice reduction at 1 with 3700 rule applications. Total rules 7772 place count 704 transition count 800
Deduced a syphon composed of 298 places in 0 ms
Iterating global reduction 1 with 3700 rules applied. Total rules applied 11472 place count 704 transition count 800
Deduced a syphon composed of 298 places in 0 ms
Applied a total of 11472 rules in 1768 ms. Remains 704 /4441 variables (removed 3737) and now considering 800/8200 (removed 7400) transitions.
[2024-05-28 10:50:50] [INFO ] Redundant transitions in 41 ms returned []
[2024-05-28 10:50:50] [INFO ] Flow matrix only has 602 transitions (discarded 198 similar events)
// Phase 1: matrix 602 rows 704 cols
[2024-05-28 10:50:50] [INFO ] Computed 204 invariants in 4 ms
[2024-05-28 10:50:51] [INFO ] Dead Transitions using invariants and state equation in 439 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 704/4441 places, 800/8200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2258 ms. Remains : 704/4441 places, 800/8200 transitions.
Built C files in :
/tmp/ltsmin2155804188745460614
[2024-05-28 10:50:51] [INFO ] Built C files in 132ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2155804188745460614
Running compilation step : cd /tmp/ltsmin2155804188745460614;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2155804188745460614;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2155804188745460614;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 4441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4441/4441 places, 8200/8200 transitions.
Applied a total of 0 rules in 566 ms. Remains 4441 /4441 variables (removed 0) and now considering 8200/8200 (removed 0) transitions.
// Phase 1: matrix 8200 rows 4441 cols
[2024-05-28 10:50:55] [INFO ] Computed 241 invariants in 50 ms
[2024-05-28 10:50:55] [INFO ] Implicit Places using invariants in 709 ms returned []
[2024-05-28 10:50:55] [INFO ] Invariant cache hit.
[2024-05-28 10:50:56] [INFO ] Implicit Places using invariants and state equation in 1127 ms returned []
Implicit Place search using SMT with State Equation took 1840 ms to find 0 implicit places.
[2024-05-28 10:50:56] [INFO ] Invariant cache hit.
[2024-05-28 10:51:02] [INFO ] Dead Transitions using invariants and state equation in 5292 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7701 ms. Remains : 4441/4441 places, 8200/8200 transitions.
Built C files in :
/tmp/ltsmin4174692103589925999
[2024-05-28 10:51:02] [INFO ] Built C files in 104ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4174692103589925999
Running compilation step : cd /tmp/ltsmin4174692103589925999;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4174692103589925999;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4174692103589925999;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2024-05-28 10:51:05] [INFO ] Flatten gal took : 213 ms
[2024-05-28 10:51:06] [INFO ] Flatten gal took : 228 ms
[2024-05-28 10:51:06] [INFO ] Time to serialize gal into /tmp/LTL8499032630412306026.gal : 53 ms
[2024-05-28 10:51:06] [INFO ] Time to serialize properties into /tmp/LTL12386032118552877801.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8499032630412306026.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9299836999984819239.hoa' '-atoms' '/tmp/LTL12386032118552877801.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL12386032118552877801.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9299836999984819239.hoa
Detected timeout of ITS tools.
[2024-05-28 10:51:21] [INFO ] Flatten gal took : 200 ms
[2024-05-28 10:51:21] [INFO ] Flatten gal took : 198 ms
[2024-05-28 10:51:21] [INFO ] Time to serialize gal into /tmp/LTL13963065188892276242.gal : 30 ms
[2024-05-28 10:51:21] [INFO ] Time to serialize properties into /tmp/LTL8189292015880679527.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13963065188892276242.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8189292015880679527.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(F(((X("(sv24_c41==0)"))U((X(G("(sv24_c41==0)")))||(("(sv28_c92==0)")&&(X("(sv24_c41==0)")))))U((G((X("(sv24_c41==0)"))U((X(G("(...370
Formula 0 simplified : XXG("(((sv28_c92==1)&&(sys_req69==1))&&(sv0==1))" U (X!"(sv24_c41==0)" R (XF!"(sv24_c41==0)" & (!"(sv28_c92==0)" | X!"(sv24_c41==0)"...159
Detected timeout of ITS tools.
[2024-05-28 10:51:36] [INFO ] Flatten gal took : 200 ms
[2024-05-28 10:51:36] [INFO ] Applying decomposition
[2024-05-28 10:51:37] [INFO ] Flatten gal took : 178 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6367801008944190774.txt' '-o' '/tmp/graph6367801008944190774.bin' '-w' '/tmp/graph6367801008944190774.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6367801008944190774.bin' '-l' '-1' '-v' '-w' '/tmp/graph6367801008944190774.weights' '-q' '0' '-e' '0.001'
[2024-05-28 10:51:37] [INFO ] Decomposing Gal with order
[2024-05-28 10:51:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-28 10:51:38] [INFO ] Removed a total of 7907 redundant transitions.
[2024-05-28 10:51:39] [INFO ] Flatten gal took : 1100 ms
[2024-05-28 10:51:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 98 ms.
[2024-05-28 10:51:39] [INFO ] Time to serialize gal into /tmp/LTL1609564326115261990.gal : 56 ms
[2024-05-28 10:51:39] [INFO ] Time to serialize properties into /tmp/LTL15194701135122179129.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1609564326115261990.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15194701135122179129.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(F(((X("(i25.u41.sv24_c41==0)"))U((X(G("(i25.u41.sv24_c41==0)")))||(("(i65.u92.sv28_c92==0)")&&(X("(i25.u41.sv24_c41==0)")))))U(...491
Formula 0 simplified : XXG("(((i65.u92.sv28_c92==1)&&(i80.u69.sys_req69==1))&&(i25.u100.sv0==1))" U (X!"(i25.u41.sv24_c41==0)" R (XF!"(i25.u41.sv24_c41==0)...216
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11338975312120799675
[2024-05-28 10:51:54] [INFO ] Built C files in 74ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11338975312120799675
Running compilation step : cd /tmp/ltsmin11338975312120799675;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11338975312120799675;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin11338975312120799675;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ServersAndClients-PT-100040-LTLFireability-09 finished in 96486 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((X((p1||X(X(p2))))||p0))))'
Support contains 5 out of 4441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4441/4441 places, 8200/8200 transitions.
Applied a total of 0 rules in 595 ms. Remains 4441 /4441 variables (removed 0) and now considering 8200/8200 (removed 0) transitions.
[2024-05-28 10:51:58] [INFO ] Invariant cache hit.
[2024-05-28 10:51:59] [INFO ] Implicit Places using invariants in 1086 ms returned []
[2024-05-28 10:51:59] [INFO ] Invariant cache hit.
[2024-05-28 10:52:00] [INFO ] Implicit Places using invariants and state equation in 1108 ms returned []
Implicit Place search using SMT with State Equation took 2196 ms to find 0 implicit places.
[2024-05-28 10:52:00] [INFO ] Invariant cache hit.
[2024-05-28 10:52:05] [INFO ] Dead Transitions using invariants and state equation in 5061 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7853 ms. Remains : 4441/4441 places, 8200/8200 transitions.
Stuttering acceptance computed with spot in 186 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : ServersAndClients-PT-100040-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 3}]], initial=0, aps=[p0:(OR (EQ s343 0) (EQ s4239 0)), p1:(EQ s1284 1), p2:(AND (EQ s387 1) (EQ s1916 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 49742 reset in 2904 ms.
Product exploration explored 100000 steps with 49735 reset in 2895 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 p0 (NOT p1) (NOT p2)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (NOT p0)), (X p0)]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 17 ms. Reduced automaton from 5 states, 5 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ServersAndClients-PT-100040-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ServersAndClients-PT-100040-LTLFireability-12 finished in 13914 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&&(X(p2)||F(p3)||p1))))'
Support contains 4 out of 4441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4441/4441 places, 8200/8200 transitions.
Applied a total of 0 rules in 578 ms. Remains 4441 /4441 variables (removed 0) and now considering 8200/8200 (removed 0) transitions.
[2024-05-28 10:52:12] [INFO ] Invariant cache hit.
[2024-05-28 10:52:13] [INFO ] Implicit Places using invariants in 1079 ms returned []
[2024-05-28 10:52:13] [INFO ] Invariant cache hit.
[2024-05-28 10:52:13] [INFO ] Implicit Places using invariants and state equation in 638 ms returned []
Implicit Place search using SMT with State Equation took 1720 ms to find 0 implicit places.
[2024-05-28 10:52:13] [INFO ] Invariant cache hit.
[2024-05-28 10:52:14] [INFO ] Dead Transitions using invariants and state equation in 666 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2967 ms. Remains : 4441/4441 places, 8200/8200 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p3), (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (AND (NOT p3) (NOT p2)), true, (OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3)))]
Running random walk in product with property : ServersAndClients-PT-100040-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}]], initial=4, aps=[p3:(EQ s2668 1), p0:(EQ s2715 0), p1:(OR (EQ s255 0) (EQ s2623 0)), p2:(AND (EQ s255 1) (EQ s2623 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 484 reset in 1651 ms.
Stack based approach found an accepted trace after 187 steps with 90 reset with depth 8 and stack size 8 in 6 ms.
FORMULA ServersAndClients-PT-100040-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100040-LTLFireability-13 finished in 4816 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((G(p0)||(p0&&F((p1||(!p2&&X(p3)))))))))'
Support contains 5 out of 4441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4441/4441 places, 8200/8200 transitions.
Applied a total of 0 rules in 612 ms. Remains 4441 /4441 variables (removed 0) and now considering 8200/8200 (removed 0) transitions.
[2024-05-28 10:52:16] [INFO ] Invariant cache hit.
[2024-05-28 10:52:17] [INFO ] Implicit Places using invariants in 649 ms returned []
[2024-05-28 10:52:17] [INFO ] Invariant cache hit.
[2024-05-28 10:52:18] [INFO ] Implicit Places using invariants and state equation in 1113 ms returned []
Implicit Place search using SMT with State Equation took 1764 ms to find 0 implicit places.
[2024-05-28 10:52:18] [INFO ] Invariant cache hit.
[2024-05-28 10:52:19] [INFO ] Dead Transitions using invariants and state equation in 637 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3018 ms. Remains : 4441/4441 places, 8200/8200 transitions.
Stuttering acceptance computed with spot in 415 ms :[true, (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) p2)), (AND (NOT p1) (NOT p3)), (NOT p0), (AND (NOT p0) (NOT p1) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p0) (NOT p1) p2)), (NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100040-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p1) p2 (NOT p3)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) p2 (NOT p3)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=4 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=4 dest: 4}, { cond=(AND p0 (NOT p1) p2 (NOT p3)), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=5 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 4}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=5 dest: 5}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={} source=7 dest: 3}]], initial=6, aps=[p1:(NEQ s3118 1), p2:(AND (EQ s207 1) (EQ s3431 1)), p3:(NEQ s2768 1), p0:(EQ s2415 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][false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA ServersAndClients-PT-100040-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100040-LTLFireability-14 finished in 3474 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||G(p1)||X(p2))))'
Support contains 3 out of 4441 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 4441/4441 places, 8200/8200 transitions.
Applied a total of 0 rules in 549 ms. Remains 4441 /4441 variables (removed 0) and now considering 8200/8200 (removed 0) transitions.
[2024-05-28 10:52:20] [INFO ] Invariant cache hit.
[2024-05-28 10:52:21] [INFO ] Implicit Places using invariants in 1104 ms returned []
[2024-05-28 10:52:21] [INFO ] Invariant cache hit.
[2024-05-28 10:52:22] [INFO ] Implicit Places using invariants and state equation in 1094 ms returned []
Implicit Place search using SMT with State Equation took 2209 ms to find 0 implicit places.
[2024-05-28 10:52:22] [INFO ] Invariant cache hit.
[2024-05-28 10:52:27] [INFO ] Dead Transitions using invariants and state equation in 4662 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 7421 ms. Remains : 4441/4441 places, 8200/8200 transitions.
Stuttering acceptance computed with spot in 217 ms :[true, (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-100040-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=2, aps=[p2:(EQ s3537 1), p0:(EQ s3278 0), p1:(EQ s3674 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 2824 ms.
Product exploration explored 100000 steps with 50000 reset in 2883 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 p2) p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT p2))), (X (X p2)), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 18 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ServersAndClients-PT-100040-LTLFireability-15 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ServersAndClients-PT-100040-LTLFireability-15 finished in 13421 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(F(((X(p0) U ((p1&&X(p0))||X(G(p0)))) U (G((X(p0) U ((p1&&X(p0))||X(G(p0)))))||(!p2&&(X(p0) U ((p1&&X(p0))||X(G(p0)))))))))))'
Found a Shortening insensitive property : ServersAndClients-PT-100040-LTLFireability-09
Stuttering acceptance computed with spot in 205 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), false]
Support contains 4 out of 4441 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 4441/4441 places, 8200/8200 transitions.
Drop transitions removed 3859 transitions
Trivial Post-agglo rules discarded 3859 transitions
Performed 3859 trivial Post agglomeration. Transition count delta: 3859
Iterating post reduction 0 with 3859 rules applied. Total rules applied 3859 place count 4441 transition count 4341
Reduce places removed 3859 places and 0 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Iterating post reduction 1 with 3898 rules applied. Total rules applied 7757 place count 582 transition count 4302
Reduce places removed 76 places and 0 transitions.
Ensure Unique test removed 3600 transitions
Reduce isomorphic transitions removed 3600 transitions.
Iterating post reduction 2 with 3676 rules applied. Total rules applied 11433 place count 506 transition count 702
Drop transitions removed 198 transitions
Redundant transition composition rules discarded 198 transitions
Iterating global reduction 3 with 198 rules applied. Total rules applied 11631 place count 506 transition count 504
Applied a total of 11631 rules in 64 ms. Remains 506 /4441 variables (removed 3935) and now considering 504/8200 (removed 7696) transitions.
// Phase 1: matrix 504 rows 506 cols
[2024-05-28 10:52:33] [INFO ] Computed 204 invariants in 1 ms
[2024-05-28 10:52:33] [INFO ] Implicit Places using invariants in 317 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, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 502, 504]
Discarding 202 places :
Implicit Place search using SMT only with invariants took 318 ms to find 202 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 304/4441 places, 504/8200 transitions.
Graph (trivial) has 298 edges and 304 vertex of which 199 / 304 are part of one of the 1 SCC in 0 ms
Free SCC test removed 198 places
Ensure Unique test removed 296 transitions
Reduce isomorphic transitions removed 296 transitions.
Discarding 98 places :
Symmetric choice reduction at 0 with 98 rule applications. Total rules 99 place count 8 transition count 110
Iterating global reduction 0 with 98 rules applied. Total rules applied 197 place count 8 transition count 110
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 295 place count 8 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 297 place count 7 transition count 11
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 298 place count 6 transition count 10
Iterating global reduction 1 with 1 rules applied. Total rules applied 299 place count 6 transition count 10
Applied a total of 299 rules in 4 ms. Remains 6 /304 variables (removed 298) and now considering 10/504 (removed 494) transitions.
// Phase 1: matrix 10 rows 6 cols
[2024-05-28 10:52:33] [INFO ] Computed 2 invariants in 0 ms
[2024-05-28 10:52:33] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-28 10:52:33] [INFO ] Invariant cache hit.
[2024-05-28 10:52:33] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 6/4441 places, 10/8200 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 422 ms. Remains : 6/4441 places, 10/8200 transitions.
Running random walk in product with property : ServersAndClients-PT-100040-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=p2, acceptance={1} source=2 dest: 2}, { cond=true, acceptance={0, 1} source=2 dest: 3}, { cond=(NOT p1), acceptance={0, 1} source=2 dest: 4}], [{ cond=(AND p2 (NOT p0)), acceptance={1} source=3 dest: 2}, { cond=(NOT p0), acceptance={0, 1} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0, 1} source=3 dest: 4}], [{ cond=p0, acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(AND (EQ s5 1) (EQ s0 1) (EQ s2 1)), p1:(NEQ s5 1), p0:(NEQ s4 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 23980 reset in 58 ms.
Product exploration explored 100000 steps with 23981 reset in 64 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 p2) p1 p0), (X (X (NOT p2))), true]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 3 factoid took 148 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), false]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-28 10:52:34] [INFO ] Invariant cache hit.
[2024-05-28 10:52:34] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-28 10:52:34] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :0
Fused 3 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 3 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (X (NOT p2))), true, (G (NOT (AND (NOT p0) (NOT p1)))), (G (NOT p2)), (G (NOT (AND (NOT p0) p2)))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F (NOT p0)), (F (AND p0 (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 190 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 2 out of 6 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 6/6 places, 10/10 transitions.
Applied a total of 0 rules in 0 ms. Remains 6 /6 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2024-05-28 10:52:35] [INFO ] Invariant cache hit.
[2024-05-28 10:52:35] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-28 10:52:35] [INFO ] Invariant cache hit.
[2024-05-28 10:52:35] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 33 ms to find 0 implicit places.
[2024-05-28 10:52:35] [INFO ] Invariant cache hit.
[2024-05-28 10:52:35] [INFO ] Dead Transitions using invariants and state equation in 24 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 59 ms. Remains : 6/6 places, 10/10 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 p0 p1)]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 135 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Finished random walk after 23 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=11 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 162 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 23846 reset in 55 ms.
Product exploration explored 100000 steps with 23825 reset in 59 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 151 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 2 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 10/10 transitions.
Graph (trivial) has 3 edges and 6 vertex of which 2 / 6 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 5 transition count 7
Deduced a syphon composed of 1 places in 0 ms
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 5 transition count 6
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 4 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 4 rules in 4 ms. Remains 4 /6 variables (removed 2) and now considering 6/10 (removed 4) transitions.
[2024-05-28 10:52:36] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 6 rows 4 cols
[2024-05-28 10:52:36] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 10:52:36] [INFO ] Dead Transitions using invariants and state equation in 16 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/6 places, 6/10 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 43 ms. Remains : 4/6 places, 6/10 transitions.
Built C files in :
/tmp/ltsmin16549828638753056193
[2024-05-28 10:52:36] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16549828638753056193
Running compilation step : cd /tmp/ltsmin16549828638753056193;'/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/ltsmin16549828638753056193;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin16549828638753056193;'/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/stateBased177209731121396312.hoa' '--buchi-type=spotba'
LTSmin run took 243 ms.
Treatment of property ServersAndClients-PT-100040-LTLFireability-09 finished in 3716 ms.
FORMULA ServersAndClients-PT-100040-LTLFireability-09 TRUE TECHNIQUES SHORTENING_INSENSITIVE
[2024-05-28 10:52:37] [INFO ] Flatten gal took : 185 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 175795 ms.

BK_STOP 1716893558280

--------------------
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="ServersAndClients-PT-100040"
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-100040, 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-171679102300388"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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