Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r357-smll-167891806500484.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ServersAndClients-PT-100160, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r357-smll-167891806500484
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 11M
-rw-r--r-- 1 mcc users 6.7K Feb 26 03:46 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 03:46 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 26 03:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Feb 26 03:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K Feb 25 16:52 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Feb 25 16:52 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K Feb 25 16:52 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 16:52 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Feb 26 03:56 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 139K Feb 26 03:56 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.5K Feb 26 03:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 72K Feb 26 03:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.9K Feb 25 16:52 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Feb 25 16:52 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 9.8M Mar 5 18:23 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-100160-LTLFireability-00
FORMULA_NAME ServersAndClients-PT-100160-LTLFireability-01
FORMULA_NAME ServersAndClients-PT-100160-LTLFireability-02
FORMULA_NAME ServersAndClients-PT-100160-LTLFireability-03
FORMULA_NAME ServersAndClients-PT-100160-LTLFireability-04
FORMULA_NAME ServersAndClients-PT-100160-LTLFireability-05
FORMULA_NAME ServersAndClients-PT-100160-LTLFireability-06
FORMULA_NAME ServersAndClients-PT-100160-LTLFireability-07
FORMULA_NAME ServersAndClients-PT-100160-LTLFireability-08
FORMULA_NAME ServersAndClients-PT-100160-LTLFireability-09
FORMULA_NAME ServersAndClients-PT-100160-LTLFireability-10
FORMULA_NAME ServersAndClients-PT-100160-LTLFireability-11
FORMULA_NAME ServersAndClients-PT-100160-LTLFireability-12
FORMULA_NAME ServersAndClients-PT-100160-LTLFireability-13
FORMULA_NAME ServersAndClients-PT-100160-LTLFireability-14
FORMULA_NAME ServersAndClients-PT-100160-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679269012545

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ServersAndClients-PT-100160
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-19 23:36:55] [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]
[2023-03-19 23:36:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-19 23:36:57] [INFO ] Load time of PNML (sax parser for PT used): 1336 ms
[2023-03-19 23:36:57] [INFO ] Transformed 16561 places.
[2023-03-19 23:36:57] [INFO ] Transformed 32200 transitions.
[2023-03-19 23:36:57] [INFO ] Parsed PT model containing 16561 places and 32200 transitions and 96800 arcs in 1642 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 21 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA ServersAndClients-PT-100160-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100160-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100160-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100160-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 16561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16561/16561 places, 32200/32200 transitions.
Applied a total of 0 rules in 329 ms. Remains 16561 /16561 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
// Phase 1: matrix 32200 rows 16561 cols
[2023-03-19 23:36:59] [INFO ] Computed 361 place invariants in 848 ms
[2023-03-19 23:37:02] [INFO ] Implicit Places using invariants in 3999 ms returned []
Implicit Place search using SMT only with invariants took 4059 ms to find 0 implicit places.
[2023-03-19 23:37:02] [INFO ] Invariant cache hit.
[2023-03-19 23:37:04] [INFO ] Dead Transitions using invariants and state equation in 2496 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 6896 ms. Remains : 16561/16561 places, 32200/32200 transitions.
Support contains 41 out of 16561 places after structural reductions.
[2023-03-19 23:37:07] [INFO ] Flatten gal took : 1660 ms
[2023-03-19 23:37:08] [INFO ] Flatten gal took : 1232 ms
[2023-03-19 23:37:10] [INFO ] Input system was already deterministic with 32200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1586 ms. (steps per millisecond=6 ) properties (out of 25) seen :15
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 10) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 80 ms. (steps per millisecond=125 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2023-03-19 23:37:13] [INFO ] Invariant cache hit.
[2023-03-19 23:37:20] [INFO ] [Real]Absence check using 261 positive place invariants in 1471 ms returned sat
[2023-03-19 23:37:21] [INFO ] [Real]Absence check using 261 positive and 100 generalized place invariants in 322 ms returned sat
[2023-03-19 23:37:38] [INFO ] After 15310ms SMT Verify possible using state equation in real domain returned unsat :3 sat :3
[2023-03-19 23:37:38] [INFO ] After 15378ms SMT Verify possible using trap constraints in real domain returned unsat :3 sat :3
Attempting to minimize the solution found.
Minimization took 10 ms.
[2023-03-19 23:37:38] [INFO ] After 25107ms SMT Verify possible using all constraints in real domain returned unsat :3 sat :3
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 16561 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 16561/16561 places, 32200/32200 transitions.
Drop transitions removed 15996 transitions
Trivial Post-agglo rules discarded 15996 transitions
Performed 15996 trivial Post agglomeration. Transition count delta: 15996
Iterating post reduction 0 with 15996 rules applied. Total rules applied 15996 place count 16561 transition count 16204
Reduce places removed 16152 places and 0 transitions.
Ensure Unique test removed 15500 transitions
Reduce isomorphic transitions removed 15500 transitions.
Iterating post reduction 1 with 31652 rules applied. Total rules applied 47648 place count 409 transition count 704
Drop transitions removed 396 transitions
Redundant transition composition rules discarded 396 transitions
Iterating global reduction 2 with 396 rules applied. Total rules applied 48044 place count 409 transition count 308
Discarding 96 places :
Implicit places reduction removed 96 places
Drop transitions removed 192 transitions
Trivial Post-agglo rules discarded 192 transitions
Performed 192 trivial Post agglomeration. Transition count delta: 192
Iterating post reduction 2 with 288 rules applied. Total rules applied 48332 place count 313 transition count 116
Reduce places removed 288 places and 0 transitions.
Drop transitions removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 3 with 384 rules applied. Total rules applied 48716 place count 25 transition count 20
Partial Free-agglomeration rule applied 4 times.
Drop transitions removed 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 48720 place count 25 transition count 20
Applied a total of 48720 rules in 521 ms. Remains 25 /16561 variables (removed 16536) and now considering 20/32200 (removed 32180) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 523 ms. Remains : 25/16561 places, 20/32200 transitions.
Finished random walk after 46 steps, including 0 resets, run visited all 4 properties in 1 ms. (steps per millisecond=46 )
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
FORMULA ServersAndClients-PT-100160-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||F(G((p1 U p2)))))'
Support contains 3 out of 16561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16561/16561 places, 32200/32200 transitions.
Drop transitions removed 15997 transitions
Trivial Post-agglo rules discarded 15997 transitions
Performed 15997 trivial Post agglomeration. Transition count delta: 15997
Iterating post reduction 0 with 15997 rules applied. Total rules applied 15997 place count 16561 transition count 16203
Reduce places removed 16154 places and 0 transitions.
Ensure Unique test removed 15600 transitions
Reduce isomorphic transitions removed 15600 transitions.
Iterating post reduction 1 with 31754 rules applied. Total rules applied 47751 place count 407 transition count 603
Drop transitions removed 297 transitions
Redundant transition composition rules discarded 297 transitions
Iterating global reduction 2 with 297 rules applied. Total rules applied 48048 place count 407 transition count 306
Discarding 97 places :
Implicit places reduction removed 97 places
Drop transitions removed 194 transitions
Trivial Post-agglo rules discarded 194 transitions
Performed 194 trivial Post agglomeration. Transition count delta: 194
Iterating post reduction 2 with 291 rules applied. Total rules applied 48339 place count 310 transition count 112
Reduce places removed 291 places and 0 transitions.
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 96 transitions.
Iterating post reduction 3 with 387 rules applied. Total rules applied 48726 place count 19 transition count 16
Applied a total of 48726 rules in 406 ms. Remains 19 /16561 variables (removed 16542) and now considering 16/32200 (removed 32184) transitions.
// Phase 1: matrix 16 rows 19 cols
[2023-03-19 23:37:39] [INFO ] Computed 10 place invariants in 4 ms
[2023-03-19 23:37:40] [INFO ] Implicit Places using invariants in 55 ms returned [0, 1, 2, 3, 4, 5, 13, 15, 17]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 57 ms to find 9 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/16561 places, 16/32200 transitions.
Graph (trivial) has 10 edges and 10 vertex of which 7 / 10 are part of one of the 1 SCC in 3 ms
Free SCC test removed 6 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Applied a total of 1 rules in 7 ms. Remains 4 /10 variables (removed 6) and now considering 7/16 (removed 9) transitions.
// Phase 1: matrix 7 rows 4 cols
[2023-03-19 23:37:40] [INFO ] Computed 1 place invariants in 1 ms
[2023-03-19 23:37:40] [INFO ] Implicit Places using invariants in 20 ms returned []
[2023-03-19 23:37:40] [INFO ] Invariant cache hit.
[2023-03-19 23:37:40] [INFO ] Implicit Places using invariants and state equation in 28 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/16561 places, 7/32200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 521 ms. Remains : 4/16561 places, 7/32200 transitions.
Stuttering acceptance computed with spot in 352 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (NOT p2)]
Running random walk in product with property : ServersAndClients-PT-100160-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=0 dest: 2}], [{ cond=(OR p2 p1), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (GEQ s2 1) (LT s1 1) (GEQ s3 1)), p2:(GEQ s1 1), p1:(GEQ s3 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 11 steps with 0 reset in 3 ms.
FORMULA ServersAndClients-PT-100160-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100160-LTLFireability-00 finished in 1027 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G(p0)||F((G(p2)||p1)))))'
Support contains 5 out of 16561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16561/16561 places, 32200/32200 transitions.
Drop transitions removed 15483 transitions
Trivial Post-agglo rules discarded 15483 transitions
Performed 15483 trivial Post agglomeration. Transition count delta: 15483
Iterating post reduction 0 with 15483 rules applied. Total rules applied 15483 place count 16561 transition count 16717
Reduce places removed 15483 places and 0 transitions.
Performed 316 Post agglomeration using F-continuation condition.Transition count delta: 316
Iterating post reduction 1 with 15799 rules applied. Total rules applied 31282 place count 1078 transition count 16401
Reduce places removed 473 places and 0 transitions.
Ensure Unique test removed 15600 transitions
Reduce isomorphic transitions removed 15600 transitions.
Iterating post reduction 2 with 16073 rules applied. Total rules applied 47355 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 47454 place count 605 transition count 702
Applied a total of 47454 rules in 758 ms. Remains 605 /16561 variables (removed 15956) and now considering 702/32200 (removed 31498) transitions.
// Phase 1: matrix 702 rows 605 cols
[2023-03-19 23:37:41] [INFO ] Computed 204 place invariants in 5 ms
[2023-03-19 23:37:41] [INFO ] Implicit Places using invariants in 589 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, 603]
Discarding 201 places :
Implicit Place search using SMT only with invariants took 596 ms to find 201 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 404/16561 places, 702/32200 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 1 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 18 ms. Remains 8 /404 variables (removed 396) and now considering 15/702 (removed 687) transitions.
// Phase 1: matrix 15 rows 8 cols
[2023-03-19 23:37:41] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-19 23:37:41] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-19 23:37:41] [INFO ] Invariant cache hit.
[2023-03-19 23:37:41] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/16561 places, 15/32200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1427 ms. Remains : 8/16561 places, 15/32200 transitions.
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ServersAndClients-PT-100160-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(GEQ s7 1), p1:(OR (LT s0 1) (LT s3 1)), p2:(AND (GEQ s1 1) (GEQ s5 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 3950 reset in 311 ms.
Product exploration explored 100000 steps with 3932 reset in 190 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
Knowledge based reduction with 3 factoid took 238 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 23:37:42] [INFO ] Invariant cache hit.
[2023-03-19 23:37:42] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2023-03-19 23:37:42] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (G (NOT (AND (NOT p1) p2)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (F (AND (NOT p0) (NOT p1))), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 4 factoid took 405 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 99 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 8 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 : 8/8 places, 15/15 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 15/15 (removed 0) transitions.
[2023-03-19 23:37:43] [INFO ] Invariant cache hit.
[2023-03-19 23:37:43] [INFO ] Implicit Places using invariants in 21 ms returned []
[2023-03-19 23:37:43] [INFO ] Invariant cache hit.
[2023-03-19 23:37:43] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2023-03-19 23:37:43] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 23:37:43] [INFO ] Invariant cache hit.
[2023-03-19 23:37:43] [INFO ] Dead Transitions using invariants and state equation in 39 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 98 ms. Remains : 8/8 places, 15/15 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 156 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Finished random walk after 1 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND (NOT p0) p1)]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F (AND (NOT p0) (NOT p1))), (F (NOT p1))]
Knowledge based reduction with 1 factoid took 205 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 4036 reset in 293 ms.
Product exploration explored 100000 steps with 3983 reset in 192 ms.
Built C files in :
/tmp/ltsmin2170177067457602379
[2023-03-19 23:37:44] [INFO ] Computing symmetric may disable matrix : 15 transitions.
[2023-03-19 23:37:44] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 23:37:44] [INFO ] Computing symmetric may enable matrix : 15 transitions.
[2023-03-19 23:37:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 23:37:44] [INFO ] Computing Do-Not-Accords matrix : 15 transitions.
[2023-03-19 23:37:44] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 23:37:44] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2170177067457602379
Running compilation step : cd /tmp/ltsmin2170177067457602379;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 380 ms.
Running link step : cd /tmp/ltsmin2170177067457602379;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 61 ms.
Running LTSmin : cd /tmp/ltsmin2170177067457602379;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16976748109282430824.hoa' '--buchi-type=spotba'
LTSmin run took 178 ms.
FORMULA ServersAndClients-PT-100160-LTLFireability-03 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ServersAndClients-PT-100160-LTLFireability-03 finished in 5142 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(!p0)))'
Support contains 4 out of 16561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16561/16561 places, 32200/32200 transitions.
Drop transitions removed 15484 transitions
Trivial Post-agglo rules discarded 15484 transitions
Performed 15484 trivial Post agglomeration. Transition count delta: 15484
Iterating post reduction 0 with 15484 rules applied. Total rules applied 15484 place count 16561 transition count 16716
Reduce places removed 15484 places and 0 transitions.
Performed 316 Post agglomeration using F-continuation condition.Transition count delta: 316
Iterating post reduction 1 with 15800 rules applied. Total rules applied 31284 place count 1077 transition count 16400
Reduce places removed 474 places and 0 transitions.
Ensure Unique test removed 15700 transitions
Reduce isomorphic transitions removed 15700 transitions.
Iterating post reduction 2 with 16174 rules applied. Total rules applied 47458 place count 603 transition count 700
Applied a total of 47458 rules in 589 ms. Remains 603 /16561 variables (removed 15958) and now considering 700/32200 (removed 31500) transitions.
// Phase 1: matrix 700 rows 603 cols
[2023-03-19 23:37:46] [INFO ] Computed 203 place invariants in 19 ms
[2023-03-19 23:37:46] [INFO ] Implicit Places using invariants in 545 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 547 ms to find 200 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 403/16561 places, 700/32200 transitions.
Graph (trivial) has 296 edges and 403 vertex of which 197 / 403 are part of one of the 1 SCC in 1 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 12 transition count 212
Iterating global reduction 0 with 195 rules applied. Total rules applied 391 place count 12 transition count 212
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 12 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 587 place count 10 transition count 16
Iterating global reduction 1 with 2 rules applied. Total rules applied 589 place count 10 transition count 16
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 9 transition count 15
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 593 place count 7 transition count 13
Iterating global reduction 1 with 2 rules applied. Total rules applied 595 place count 7 transition count 13
Applied a total of 595 rules in 12 ms. Remains 7 /403 variables (removed 396) and now considering 13/700 (removed 687) transitions.
// Phase 1: matrix 13 rows 7 cols
[2023-03-19 23:37:46] [INFO ] Computed 3 place invariants in 1 ms
[2023-03-19 23:37:46] [INFO ] Implicit Places using invariants in 25 ms returned []
[2023-03-19 23:37:46] [INFO ] Invariant cache hit.
[2023-03-19 23:37:46] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/16561 places, 13/32200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1207 ms. Remains : 7/16561 places, 13/32200 transitions.
Stuttering acceptance computed with spot in 52 ms :[p0]
Running random walk in product with property : ServersAndClients-PT-100160-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (AND (GEQ s1 1) (GEQ s5 1)) (AND (GEQ s0 1) (GEQ s3 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 0 reset in 490 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 3 in 0 ms.
FORMULA ServersAndClients-PT-100160-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100160-LTLFireability-04 finished in 1793 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 16561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16561/16561 places, 32200/32200 transitions.
Drop transitions removed 15999 transitions
Trivial Post-agglo rules discarded 15999 transitions
Performed 15999 trivial Post agglomeration. Transition count delta: 15999
Iterating post reduction 0 with 15999 rules applied. Total rules applied 15999 place count 16561 transition count 16201
Reduce places removed 16158 places and 0 transitions.
Ensure Unique test removed 15800 transitions
Reduce isomorphic transitions removed 15800 transitions.
Iterating post reduction 1 with 31958 rules applied. Total rules applied 47957 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 48056 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 48353 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 48748 place count 7 transition count 6
Applied a total of 48748 rules in 462 ms. Remains 7 /16561 variables (removed 16554) and now considering 6/32200 (removed 32194) transitions.
// Phase 1: matrix 6 rows 7 cols
[2023-03-19 23:37:47] [INFO ] Computed 4 place invariants in 2 ms
[2023-03-19 23:37:47] [INFO ] Implicit Places using invariants in 24 ms returned [0, 1, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 25 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 4/16561 places, 6/32200 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
[2023-03-19 23:37:47] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-19 23:37:47] [INFO ] Implicit Places using invariants in 15 ms returned []
[2023-03-19 23:37:47] [INFO ] Invariant cache hit.
[2023-03-19 23:37:47] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 2/16561 places, 3/32200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 526 ms. Remains : 2/16561 places, 3/32200 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100160-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(GEQ 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-100160-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100160-LTLFireability-05 finished in 598 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0)) U ((G(p2)||G(p0))&&p1)))'
Support contains 5 out of 16561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16561/16561 places, 32200/32200 transitions.
Applied a total of 0 rules in 130 ms. Remains 16561 /16561 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
// Phase 1: matrix 32200 rows 16561 cols
[2023-03-19 23:37:48] [INFO ] Computed 361 place invariants in 270 ms
[2023-03-19 23:37:51] [INFO ] Implicit Places using invariants in 2865 ms returned []
Implicit Place search using SMT only with invariants took 2865 ms to find 0 implicit places.
[2023-03-19 23:37:51] [INFO ] Invariant cache hit.
[2023-03-19 23:37:53] [INFO ] Dead Transitions using invariants and state equation in 2428 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5428 ms. Remains : 16561/16561 places, 32200/32200 transitions.
Stuttering acceptance computed with spot in 500 ms :[(OR (NOT p1) (AND (NOT p0) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (NOT p0), true, (AND (NOT p2) (NOT p0)), (NOT p2)]
Running random walk in product with property : ServersAndClients-PT-100160-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(OR (NOT p1) (AND (NOT p2) (NOT p0))), acceptance={0, 1} source=0 dest: 0}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=0 dest: 2}, { cond=(AND p1 p2), acceptance={} source=0 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={1} source=0 dest: 4}, { cond=(AND p1 p2 p0), acceptance={} source=0 dest: 5}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=(OR (AND (NOT p1) (NOT p0)) (AND (NOT p2) (NOT p0))), acceptance={0, 1} source=2 dest: 0}, { cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(OR (AND (NOT p1) p0) (AND (NOT p2) p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p2), acceptance={} source=2 dest: 3}, { cond=(AND p1 p2 (NOT p0)), acceptance={1} source=2 dest: 4}, { cond=(AND p1 p2 p0), acceptance={} source=2 dest: 5}], [{ cond=(NOT p2), acceptance={} source=3 dest: 6}, { cond=p2, acceptance={} source=3 dest: 8}], [{ cond=(OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p0))), acceptance={0, 1} source=4 dest: 0}, { cond=(NOT p2), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p2) p0), acceptance={0} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 3}, { cond=(OR (AND (NOT p1) p2) (AND p2 (NOT p0))), acceptance={1} source=4 dest: 4}, { cond=(AND p1 p2 p0), acceptance={} source=4 dest: 5}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={0, 1} source=5 dest: 0}, { cond=(NOT p2), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) p0), acceptance={0} source=5 dest: 2}, { cond=p2, acceptance={} source=5 dest: 3}, { cond=(AND p2 (NOT p0)), acceptance={1} source=5 dest: 4}, { cond=(AND p2 p0), acceptance={} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 7}], [{ cond=true, acceptance={0, 1} source=7 dest: 7}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=8 dest: 7}, { cond=(AND p2 (NOT p0)), acceptance={} source=8 dest: 9}], [{ cond=(NOT p2), acceptance={} source=9 dest: 7}, { cond=p2, acceptance={} source=9 dest: 9}]], initial=0, aps=[p1:(AND (GEQ s371 1) (GEQ s11915 1)), p2:(AND (GEQ s321 1) (GEQ s6865 1)), p0:(GEQ s8413 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 6 ms.
FORMULA ServersAndClients-PT-100160-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100160-LTLFireability-07 finished in 6016 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((F(p0)&&(X(p0)||p1)))))'
Support contains 4 out of 16561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16561/16561 places, 32200/32200 transitions.
Applied a total of 0 rules in 118 ms. Remains 16561 /16561 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
[2023-03-19 23:37:54] [INFO ] Invariant cache hit.
[2023-03-19 23:37:56] [INFO ] Implicit Places using invariants in 2450 ms returned []
Implicit Place search using SMT only with invariants took 2452 ms to find 0 implicit places.
[2023-03-19 23:37:56] [INFO ] Invariant cache hit.
[2023-03-19 23:37:59] [INFO ] Dead Transitions using invariants and state equation in 2578 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5154 ms. Remains : 16561/16561 places, 32200/32200 transitions.
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100160-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s213 1) (LT s9491 1)), p1:(OR (LT s363 1) (LT s13733 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration timeout after 53290 steps with 26376 reset in 10031 ms.
Product exploration timeout after 53300 steps with 26384 reset in 10006 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 p1), (X (X p0))]
False Knowledge obtained : [(X (OR (NOT p0) (NOT p1))), (X (NOT (OR (NOT p0) (NOT p1))))]
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 140 ms. Reduced automaton from 3 states, 3 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ServersAndClients-PT-100160-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ServersAndClients-PT-100160-LTLFireability-08 finished in 25748 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 16561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16561/16561 places, 32200/32200 transitions.
Drop transitions removed 15741 transitions
Trivial Post-agglo rules discarded 15741 transitions
Performed 15741 trivial Post agglomeration. Transition count delta: 15741
Iterating post reduction 0 with 15741 rules applied. Total rules applied 15741 place count 16561 transition count 16459
Reduce places removed 15741 places and 0 transitions.
Performed 159 Post agglomeration using F-continuation condition.Transition count delta: 159
Iterating post reduction 1 with 15900 rules applied. Total rules applied 31641 place count 820 transition count 16300
Reduce places removed 318 places and 0 transitions.
Ensure Unique test removed 15800 transitions
Reduce isomorphic transitions removed 15800 transitions.
Iterating post reduction 2 with 16118 rules applied. Total rules applied 47759 place count 502 transition count 500
Applied a total of 47759 rules in 521 ms. Remains 502 /16561 variables (removed 16059) and now considering 500/32200 (removed 31700) transitions.
// Phase 1: matrix 500 rows 502 cols
[2023-03-19 23:38:20] [INFO ] Computed 202 place invariants in 3 ms
[2023-03-19 23:38:20] [INFO ] Implicit Places using invariants in 470 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 474 ms to find 200 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 302/16561 places, 500/32200 transitions.
Graph (trivial) has 298 edges and 302 vertex of which 199 / 302 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 6 transition count 106
Iterating global reduction 0 with 98 rules applied. Total rules applied 197 place count 6 transition count 106
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 295 place count 6 transition count 8
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 5 transition count 7
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 298 place count 4 transition count 6
Iterating global reduction 1 with 1 rules applied. Total rules applied 299 place count 4 transition count 6
Applied a total of 299 rules in 8 ms. Remains 4 /302 variables (removed 298) and now considering 6/500 (removed 494) transitions.
// Phase 1: matrix 6 rows 4 cols
[2023-03-19 23:38:20] [INFO ] Computed 2 place invariants in 0 ms
[2023-03-19 23:38:20] [INFO ] Implicit Places using invariants in 19 ms returned []
[2023-03-19 23:38:20] [INFO ] Invariant cache hit.
[2023-03-19 23:38:20] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/16561 places, 6/32200 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1047 ms. Remains : 4/16561 places, 6/32200 transitions.
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100160-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 8705 reset in 112 ms.
Product exploration explored 100000 steps with 8743 reset in 130 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 153 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 177 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 4 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 4/4 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 4 /4 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2023-03-19 23:38:21] [INFO ] Invariant cache hit.
[2023-03-19 23:38:21] [INFO ] Implicit Places using invariants in 17 ms returned []
[2023-03-19 23:38:21] [INFO ] Invariant cache hit.
[2023-03-19 23:38:21] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2023-03-19 23:38:21] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-19 23:38:21] [INFO ] Invariant cache hit.
[2023-03-19 23:38:21] [INFO ] Dead Transitions using invariants and state equation in 21 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 71 ms. Remains : 4/4 places, 6/6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 128 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 151 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 8572 reset in 109 ms.
Product exploration explored 100000 steps with 8725 reset in 120 ms.
Built C files in :
/tmp/ltsmin17964058101147019580
[2023-03-19 23:38:22] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2023-03-19 23:38:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 23:38:22] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2023-03-19 23:38:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 23:38:22] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2023-03-19 23:38:22] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-19 23:38:22] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17964058101147019580
Running compilation step : cd /tmp/ltsmin17964058101147019580;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 140 ms.
Running link step : cd /tmp/ltsmin17964058101147019580;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin17964058101147019580;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13066753702429053015.hoa' '--buchi-type=spotba'
LTSmin run took 62 ms.
FORMULA ServersAndClients-PT-100160-LTLFireability-09 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ServersAndClients-PT-100160-LTLFireability-09 finished in 3231 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G((p1 U X(p2)))))'
Support contains 5 out of 16561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16561/16561 places, 32200/32200 transitions.
Applied a total of 0 rules in 180 ms. Remains 16561 /16561 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
// Phase 1: matrix 32200 rows 16561 cols
[2023-03-19 23:38:23] [INFO ] Computed 361 place invariants in 271 ms
[2023-03-19 23:38:25] [INFO ] Implicit Places using invariants in 2671 ms returned []
Implicit Place search using SMT only with invariants took 2673 ms to find 0 implicit places.
[2023-03-19 23:38:25] [INFO ] Invariant cache hit.
[2023-03-19 23:38:28] [INFO ] Dead Transitions using invariants and state equation in 2457 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5315 ms. Remains : 16561/16561 places, 32200/32200 transitions.
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100160-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p1, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p2) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(AND (GEQ s273 1) (GEQ s1714 1)), p2:(LT s3152 1), p0:(AND (GEQ s365 1) (GEQ s12723 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration timeout after 72670 steps with 24226 reset in 10001 ms.
Product exploration timeout after 72280 steps with 24131 reset in 10006 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 p1) p2 (NOT p0)), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p0), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))))]
Knowledge based reduction with 8 factoid took 660 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 8 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 734 ms. (steps per millisecond=13 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-19 23:38:50] [INFO ] Invariant cache hit.
[2023-03-19 23:38:55] [INFO ] [Real]Absence check using 261 positive place invariants in 1304 ms returned sat
[2023-03-19 23:38:55] [INFO ] [Real]Absence check using 261 positive and 100 generalized place invariants in 302 ms returned sat
[2023-03-19 23:38:55] [INFO ] After 4656ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 (NOT p0)), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X (NOT (AND p1 (NOT p0))))), (G (NOT (AND (NOT p2) (NOT p0) p1)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT p0)), (X p0), (X (AND p1 (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (AND (NOT p1) (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (F (AND (NOT p2) (NOT p0) (NOT p1))), (F (AND (NOT p0) p1)), (F (AND (NOT p2) (NOT p0))), (F p0), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 9 factoid took 828 ms. Reduced automaton from 5 states, 8 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 5 out of 16561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16561/16561 places, 32200/32200 transitions.
Applied a total of 0 rules in 195 ms. Remains 16561 /16561 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
[2023-03-19 23:38:56] [INFO ] Invariant cache hit.
[2023-03-19 23:38:59] [INFO ] Implicit Places using invariants in 2427 ms returned []
Implicit Place search using SMT only with invariants took 2431 ms to find 0 implicit places.
[2023-03-19 23:38:59] [INFO ] Invariant cache hit.
[2023-03-19 23:39:01] [INFO ] Dead Transitions using invariants and state equation in 2365 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4996 ms. Remains : 16561/16561 places, 32200/32200 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2))))]
Knowledge based reduction with 4 factoid took 359 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 479 ms. (steps per millisecond=20 ) properties (out of 6) seen :5
Finished Best-First random walk after 4221 steps, including 1 resets, run visited all 1 properties in 27 ms. (steps per millisecond=156 )
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (F (AND p2 (NOT p0) p1)), (F (AND (NOT p2) (NOT p0))), (F (NOT (AND p2 (NOT p0) (NOT p1)))), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 4 factoid took 576 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 220 reset in 4642 ms.
Product exploration explored 100000 steps with 269 reset in 4601 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 5 out of 16561 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 16561/16561 places, 32200/32200 transitions.
Performed 15799 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 15799 rules applied. Total rules applied 15799 place count 16561 transition count 32200
Discarding 156 places :
Symmetric choice reduction at 1 with 156 rule applications. Total rules 15955 place count 16405 transition count 16600
Deduced a syphon composed of 15799 places in 4 ms
Iterating global reduction 1 with 156 rules applied. Total rules applied 16111 place count 16405 transition count 16600
Deduced a syphon composed of 15799 places in 3 ms
Applied a total of 16111 rules in 7568 ms. Remains 16405 /16561 variables (removed 156) and now considering 16600/32200 (removed 15600) transitions.
[2023-03-19 23:39:21] [INFO ] Flow matrix only has 16501 transitions (discarded 99 similar events)
// Phase 1: matrix 16501 rows 16405 cols
[2023-03-19 23:39:26] [INFO ] Computed 205 place invariants in 5522 ms
[2023-03-19 23:39:29] [INFO ] Dead Transitions using invariants and state equation in 7994 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16405/16561 places, 16600/32200 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 15566 ms. Remains : 16405/16561 places, 16600/32200 transitions.
Built C files in :
/tmp/ltsmin11290284079807967435
[2023-03-19 23:39:29] [INFO ] Built C files in 444ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11290284079807967435
Running compilation step : cd /tmp/ltsmin11290284079807967435;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin11290284079807967435;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin11290284079807967435;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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 5 out of 16561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16561/16561 places, 32200/32200 transitions.
Applied a total of 0 rules in 131 ms. Remains 16561 /16561 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
// Phase 1: matrix 32200 rows 16561 cols
[2023-03-19 23:39:33] [INFO ] Computed 361 place invariants in 380 ms
[2023-03-19 23:39:35] [INFO ] Implicit Places using invariants in 2469 ms returned []
Implicit Place search using SMT only with invariants took 2475 ms to find 0 implicit places.
[2023-03-19 23:39:35] [INFO ] Invariant cache hit.
[2023-03-19 23:39:37] [INFO ] Dead Transitions using invariants and state equation in 2417 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5027 ms. Remains : 16561/16561 places, 32200/32200 transitions.
Built C files in :
/tmp/ltsmin715217388450595926
[2023-03-19 23:39:38] [INFO ] Built C files in 483ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin715217388450595926
Running compilation step : cd /tmp/ltsmin715217388450595926;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin715217388450595926;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin715217388450595926;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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)
[2023-03-19 23:39:43] [INFO ] Flatten gal took : 891 ms
[2023-03-19 23:39:44] [INFO ] Flatten gal took : 971 ms
[2023-03-19 23:39:44] [INFO ] Time to serialize gal into /tmp/LTL15734763751399266150.gal : 364 ms
[2023-03-19 23:39:44] [INFO ] Time to serialize properties into /tmp/LTL3597185726225018296.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15734763751399266150.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16682123577234595490.hoa' '-atoms' '/tmp/LTL3597185726225018296.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL3597185726225018296.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16682123577234595490.hoa
Detected timeout of ITS tools.
[2023-03-19 23:40:01] [INFO ] Flatten gal took : 1050 ms
[2023-03-19 23:40:02] [INFO ] Flatten gal took : 954 ms
[2023-03-19 23:40:02] [INFO ] Time to serialize gal into /tmp/LTL17177664290180680472.gal : 180 ms
[2023-03-19 23:40:02] [INFO ] Time to serialize properties into /tmp/LTL48580831605524611.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17177664290180680472.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL48580831605524611.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !(((X(F("((sys_req82>=1)&&(sv122>=1))")))||(G(("((sys_req36>=1)&&(sv13>=1))")U(X("(sv27_c23<1)"))))))
Formula 0 simplified : XG!"((sys_req82>=1)&&(sv122>=1))" & F(!"((sys_req36>=1)&&(sv13>=1))" R X!"(sv27_c23<1)")
Detected timeout of ITS tools.
[2023-03-19 23:40:18] [INFO ] Flatten gal took : 949 ms
[2023-03-19 23:40:18] [INFO ] Applying decomposition
[2023-03-19 23:40:19] [INFO ] Flatten gal took : 933 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph6539033259003894196.txt' '-o' '/tmp/graph6539033259003894196.bin' '-w' '/tmp/graph6539033259003894196.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph6539033259003894196.bin' '-l' '-1' '-v' '-w' '/tmp/graph6539033259003894196.weights' '-q' '0' '-e' '0.001'
[2023-03-19 23:40:22] [INFO ] Decomposing Gal with order
[2023-03-19 23:40:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 23:40:32] [INFO ] Removed a total of 31550 redundant transitions.
[2023-03-19 23:40:33] [INFO ] Flatten gal took : 6698 ms
[2023-03-19 23:40:34] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 221 ms.
[2023-03-19 23:40:35] [INFO ] Time to serialize gal into /tmp/LTL5435240194714105398.gal : 318 ms
[2023-03-19 23:40:35] [INFO ] Time to serialize properties into /tmp/LTL1260918847113335253.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5435240194714105398.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1260918847113335253.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((X(F("((i76.u170.sys_req82>=1)&&(u223.sv122>=1))")))||(G(("((i33.u37.sys_req36>=1)&&(i34.u114.sv13>=1))")U(X("(u128.sv27_c23<1)")))...158
Formula 0 simplified : XG!"((i76.u170.sys_req82>=1)&&(u223.sv122>=1))" & F(!"((i33.u37.sys_req36>=1)&&(i34.u114.sv13>=1))" R X!"(u128.sv27_c23<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7545801428787440128
[2023-03-19 23:40:50] [INFO ] Built C files in 382ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7545801428787440128
Running compilation step : cd /tmp/ltsmin7545801428787440128;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin7545801428787440128;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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/ltsmin7545801428787440128;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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-100160-LTLFireability-10 finished in 150630 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 16561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16561/16561 places, 32200/32200 transitions.
Applied a total of 0 rules in 206 ms. Remains 16561 /16561 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
[2023-03-19 23:40:53] [INFO ] Invariant cache hit.
[2023-03-19 23:40:56] [INFO ] Implicit Places using invariants in 2335 ms returned []
Implicit Place search using SMT only with invariants took 2336 ms to find 0 implicit places.
[2023-03-19 23:40:56] [INFO ] Invariant cache hit.
[2023-03-19 23:40:58] [INFO ] Dead Transitions using invariants and state equation in 2318 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4874 ms. Remains : 16561/16561 places, 32200/32200 transitions.
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100160-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (GEQ s367 1) (GEQ s2825 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Product exploration explored 100000 steps with 257 reset in 4760 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 3 ms.
FORMULA ServersAndClients-PT-100160-LTLFireability-11 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100160-LTLFireability-11 finished in 9764 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(X(G((X(p0)&&p1)))))))'
Support contains 4 out of 16561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16561/16561 places, 32200/32200 transitions.
Applied a total of 0 rules in 136 ms. Remains 16561 /16561 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
[2023-03-19 23:41:03] [INFO ] Invariant cache hit.
[2023-03-19 23:41:05] [INFO ] Implicit Places using invariants in 2437 ms returned []
Implicit Place search using SMT only with invariants took 2438 ms to find 0 implicit places.
[2023-03-19 23:41:05] [INFO ] Invariant cache hit.
[2023-03-19 23:41:08] [INFO ] Dead Transitions using invariants and state equation in 2564 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5147 ms. Remains : 16561/16561 places, 32200/32200 transitions.
Stuttering acceptance computed with spot in 205 ms :[true, (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-100160-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 5}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 3}], [{ cond=(OR (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 p1), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 1}], [{ cond=true, acceptance={} source=5 dest: 2}]], initial=4, aps=[p0:(OR (LT s369 1) (LT s11309 1)), p1:(AND (OR (LT s367 1) (LT s15753 1)) (OR (LT s369 1) (LT s11309 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 341 steps with 0 reset in 30 ms.
FORMULA ServersAndClients-PT-100160-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100160-LTLFireability-12 finished in 5458 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1)&&X(F(((!p1&&X(F(p1)))||G(F(p1)))))))'
Support contains 3 out of 16561 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 16561/16561 places, 32200/32200 transitions.
Applied a total of 0 rules in 218 ms. Remains 16561 /16561 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
[2023-03-19 23:41:09] [INFO ] Invariant cache hit.
[2023-03-19 23:41:11] [INFO ] Implicit Places using invariants in 2444 ms returned []
Implicit Place search using SMT only with invariants took 2446 ms to find 0 implicit places.
[2023-03-19 23:41:11] [INFO ] Invariant cache hit.
[2023-03-19 23:41:13] [INFO ] Dead Transitions using invariants and state equation in 2435 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 5107 ms. Remains : 16561/16561 places, 32200/32200 transitions.
Stuttering acceptance computed with spot in 267 ms :[(NOT p1), (NOT p0), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-100160-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(GEQ s6698 1), p0:(AND (GEQ s283 1) (GEQ s10905 1))], nbAcceptance=1, 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 10 reset in 5534 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 3 ms.
FORMULA ServersAndClients-PT-100160-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100160-LTLFireability-15 finished in 11021 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G((p1 U X(p2)))))'
[2023-03-19 23:41:21] [INFO ] Flatten gal took : 1116 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin5528918383066676541
[2023-03-19 23:41:21] [INFO ] Too many transitions (32200) to apply POR reductions. Disabling POR matrices.
[2023-03-19 23:41:22] [INFO ] Built C files in 398ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5528918383066676541
Running compilation step : cd /tmp/ltsmin5528918383066676541;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-19 23:41:22] [INFO ] Applying decomposition
[2023-03-19 23:41:23] [INFO ] Flatten gal took : 990 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph11938726376701720834.txt' '-o' '/tmp/graph11938726376701720834.bin' '-w' '/tmp/graph11938726376701720834.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph11938726376701720834.bin' '-l' '-1' '-v' '-w' '/tmp/graph11938726376701720834.weights' '-q' '0' '-e' '0.001'
[2023-03-19 23:41:25] [INFO ] Decomposing Gal with order
[2023-03-19 23:41:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-19 23:41:34] [INFO ] Removed a total of 31603 redundant transitions.
[2023-03-19 23:41:35] [INFO ] Flatten gal took : 5540 ms
[2023-03-19 23:41:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 181 ms.
[2023-03-19 23:41:36] [INFO ] Time to serialize gal into /tmp/LTLFireability10704687644102484406.gal : 265 ms
[2023-03-19 23:41:36] [INFO ] Time to serialize properties into /tmp/LTLFireability16968216077060327332.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10704687644102484406.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16968216077060327332.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !(((X(F("((u82.sys_req82>=1)&&(i166.u222.sv122>=1))")))||(G(("((i66.u101.sys_req36>=1)&&(i95.u113.sv13>=1))")U(X("(u23.sv27_c23<1)")))...158
Formula 0 simplified : XG!"((u82.sys_req82>=1)&&(i166.u222.sv122>=1))" & F(!"((i66.u101.sys_req36>=1)&&(i95.u113.sv13>=1))" R X!"(u23.sv27_c23<1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
7 unique states visited
5 strongly connected components in search stack
7 transitions explored
5 items max in DFS search stack
61562 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,630.18,4157948,1,0,2.93093e+06,1.03645e+06,200908,1.49245e+06,4583,3.51924e+06,26957038
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA ServersAndClients-PT-100160-LTLFireability-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 917703 ms.

BK_STOP 1679269934533

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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-100160"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is ServersAndClients-PT-100160, 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 r357-smll-167891806500484"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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