Execution Chart

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

Trace from the execution

Formatting '/data/fko/mcc2022-input.r204-oct2-165281599300484.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fko/mcc2022-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-4028
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 r204-oct2-165281599300484
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 10M
-rw-r--r-- 1 mcc users 8.0K Apr 29 17:09 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Apr 29 17:09 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Apr 29 17:06 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 29 17:06 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.1K May 9 08:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 9 08:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 9 08:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 9 08:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 9 08:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K May 9 08:45 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 10 09:34 equiv_col
-rw-r--r-- 1 mcc users 7 May 10 09:34 instance
-rw-r--r-- 1 mcc users 6 May 10 09:34 iscolored
-rw-r--r-- 1 mcc users 9.8M May 10 09:34 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 1652974033100

Running Version 202205111006
[2022-05-19 15:27:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -spotpath, /home/mcc/BenchKit/bin//..//ltlfilt, -z3path, /home/mcc/BenchKit/bin//..//z3/bin/z3, -yices2path, /home/mcc/BenchKit/bin//..//yices/bin/yices, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2022-05-19 15:27:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2022-05-19 15:27:14] [INFO ] Load time of PNML (sax parser for PT used): 680 ms
[2022-05-19 15:27:15] [INFO ] Transformed 16561 places.
[2022-05-19 15:27:15] [INFO ] Transformed 32200 transitions.
[2022-05-19 15:27:15] [INFO ] Parsed PT model containing 16561 places and 32200 transitions in 883 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ServersAndClients-PT-100160-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100160-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100160-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 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 253 ms. Remains 16561 /16561 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
// Phase 1: matrix 32200 rows 16561 cols
[2022-05-19 15:27:16] [INFO ] Computed 361 place invariants in 409 ms
[2022-05-19 15:27:17] [INFO ] Implicit Places using invariants in 1879 ms returned []
Implicit Place search using SMT only with invariants took 1904 ms to find 0 implicit places.
// Phase 1: matrix 32200 rows 16561 cols
[2022-05-19 15:27:17] [INFO ] Computed 361 place invariants in 219 ms
[2022-05-19 15:27:19] [INFO ] Dead Transitions using invariants and state equation in 1721 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16561/16561 places, 32200/32200 transitions.
Support contains 39 out of 16561 places after structural reductions.
[2022-05-19 15:27:20] [INFO ] Flatten gal took : 1140 ms
[2022-05-19 15:27:21] [INFO ] Flatten gal took : 917 ms
[2022-05-19 15:27:24] [INFO ] Input system was already deterministic with 32200 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 1182 ms. (steps per millisecond=8 ) properties (out of 25) seen :14
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 11) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :0
Running SMT prover for 9 properties.
// Phase 1: matrix 32200 rows 16561 cols
[2022-05-19 15:27:26] [INFO ] Computed 361 place invariants in 211 ms
[2022-05-19 15:27:30] [INFO ] [Real]Absence check using 261 positive place invariants in 1179 ms returned sat
[2022-05-19 15:27:31] [INFO ] [Real]Absence check using 261 positive and 100 generalized place invariants in 378 ms returned sat
[2022-05-19 15:27:51] [INFO ] After 17526ms SMT Verify possible using state equation in real domain returned unsat :0 sat :8
[2022-05-19 15:27:51] [INFO ] After 17567ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 6 ms.
[2022-05-19 15:27:51] [INFO ] After 25073ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :8
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 11 out of 16561 places. Attempting structural reductions.
Starting structural reductions in SAFETY mode, iteration 0 : 16561/16561 places, 32200/32200 transitions.
Drop transitions removed 15989 transitions
Trivial Post-agglo rules discarded 15989 transitions
Performed 15989 trivial Post agglomeration. Transition count delta: 15989
Iterating post reduction 0 with 15989 rules applied. Total rules applied 15989 place count 16561 transition count 16211
Reduce places removed 16138 places and 0 transitions.
Ensure Unique test removed 14800 transitions
Reduce isomorphic transitions removed 14800 transitions.
Iterating post reduction 1 with 30938 rules applied. Total rules applied 46927 place count 423 transition count 1411
Drop transitions removed 1089 transitions
Redundant transition composition rules discarded 1089 transitions
Iterating global reduction 2 with 1089 rules applied. Total rules applied 48016 place count 423 transition count 322
Discarding 89 places :
Implicit places reduction removed 89 places
Drop transitions removed 178 transitions
Trivial Post-agglo rules discarded 178 transitions
Performed 178 trivial Post agglomeration. Transition count delta: 178
Iterating post reduction 2 with 267 rules applied. Total rules applied 48283 place count 334 transition count 144
Reduce places removed 267 places and 0 transitions.
Drop transitions removed 89 transitions
Reduce isomorphic transitions removed 89 transitions.
Iterating post reduction 3 with 356 rules applied. Total rules applied 48639 place count 67 transition count 55
Partial Free-agglomeration rule applied 11 times.
Drop transitions removed 11 transitions
Iterating global reduction 4 with 11 rules applied. Total rules applied 48650 place count 67 transition count 55
Applied a total of 48650 rules in 338 ms. Remains 67 /16561 variables (removed 16494) and now considering 55/32200 (removed 32145) transitions.
Finished structural reductions, in 1 iterations. Remains : 67/16561 places, 55/32200 transitions.
Finished random walk after 158 steps, including 0 resets, run visited all 9 properties in 3 ms. (steps per millisecond=52 )
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(F(X(p0))))'
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 148 ms. Remains 16561 /16561 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
// Phase 1: matrix 32200 rows 16561 cols
[2022-05-19 15:27:52] [INFO ] Computed 361 place invariants in 282 ms
[2022-05-19 15:27:53] [INFO ] Implicit Places using invariants in 1435 ms returned []
Implicit Place search using SMT only with invariants took 1449 ms to find 0 implicit places.
// Phase 1: matrix 32200 rows 16561 cols
[2022-05-19 15:27:53] [INFO ] Computed 361 place invariants in 243 ms
[2022-05-19 15:27:55] [INFO ] Dead Transitions using invariants and state equation in 1750 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16561/16561 places, 32200/32200 transitions.
Stuttering acceptance computed with spot in 221 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100160-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (GEQ s15986 1) (AND (GEQ s3904 1) (GEQ s11273 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 3 reset in 5091 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-00 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100160-LTLFireability-00 finished in 8809 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(X(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 94 ms. Remains 16561 /16561 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
// Phase 1: matrix 32200 rows 16561 cols
[2022-05-19 15:28:01] [INFO ] Computed 361 place invariants in 210 ms
[2022-05-19 15:28:03] [INFO ] Implicit Places using invariants in 3051 ms returned []
Implicit Place search using SMT only with invariants took 3053 ms to find 0 implicit places.
// Phase 1: matrix 32200 rows 16561 cols
[2022-05-19 15:28:04] [INFO ] Computed 361 place invariants in 273 ms
[2022-05-19 15:28:05] [INFO ] Dead Transitions using invariants and state equation in 1730 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16561/16561 places, 32200/32200 transitions.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100160-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(AND (GEQ s229 1) (GEQ s3128 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 249 reset in 4558 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 8 in 2 ms.
FORMULA ServersAndClients-PT-100160-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100160-LTLFireability-01 finished in 9620 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((G(X((G(p0) U p1)))||X(p2)))'
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 96 ms. Remains 16561 /16561 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
// Phase 1: matrix 32200 rows 16561 cols
[2022-05-19 15:28:10] [INFO ] Computed 361 place invariants in 178 ms
[2022-05-19 15:28:11] [INFO ] Implicit Places using invariants in 1307 ms returned []
Implicit Place search using SMT only with invariants took 1308 ms to find 0 implicit places.
// Phase 1: matrix 32200 rows 16561 cols
[2022-05-19 15:28:12] [INFO ] Computed 361 place invariants in 208 ms
[2022-05-19 15:28:13] [INFO ] Dead Transitions using invariants and state equation in 1354 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16561/16561 places, 32200/32200 transitions.
Stuttering acceptance computed with spot in 246 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-100160-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 4}, { cond=(OR (AND (NOT p2) p1) (AND (NOT p2) p0)), acceptance={} source=1 dest: 5}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=4 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={0} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) p0), acceptance={} source=5 dest: 4}, { cond=(OR p1 p0), acceptance={} source=5 dest: 5}]], initial=0, aps=[p2:(GEQ s12089 1), p1:(AND (GEQ s223 1) (GEQ s8885 1)), p0:(GEQ s1853 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ServersAndClients-PT-100160-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100160-LTLFireability-02 finished in 3090 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G(!p0))))'
Support contains 1 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 105 ms. Remains 16561 /16561 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
// Phase 1: matrix 32200 rows 16561 cols
[2022-05-19 15:28:13] [INFO ] Computed 361 place invariants in 227 ms
[2022-05-19 15:28:15] [INFO ] Implicit Places using invariants in 1382 ms returned []
Implicit Place search using SMT only with invariants took 1395 ms to find 0 implicit places.
// Phase 1: matrix 32200 rows 16561 cols
[2022-05-19 15:28:15] [INFO ] Computed 361 place invariants in 210 ms
[2022-05-19 15:28:16] [INFO ] Dead Transitions using invariants and state equation in 1848 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16561/16561 places, 32200/32200 transitions.
Stuttering acceptance computed with spot in 122 ms :[p0, p0, p0, true]
Running random walk in product with property : ServersAndClients-PT-100160-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(GEQ s14524 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 25454 steps with 0 reset in 1206 ms.
FORMULA ServersAndClients-PT-100160-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100160-LTLFireability-03 finished in 4842 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(F(((p0 U p1)||F(X(F(G(p2)))))))))'
Support contains 3 out of 16561 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 : 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 411 ms. Remains 605 /16561 variables (removed 15956) and now considering 702/32200 (removed 31498) transitions.
// Phase 1: matrix 702 rows 605 cols
[2022-05-19 15:28:18] [INFO ] Computed 204 place invariants in 5 ms
[2022-05-19 15:28:19] [INFO ] Implicit Places using invariants in 310 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, 401]
Discarding 201 places :
Implicit Place search using SMT only with invariants took 314 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 4 ms
Free SCC test removed 196 places
Ensure Unique test removed 293 transitions
Reduce isomorphic transitions removed 293 transitions.
Discarding 195 places :
Symmetric choice reduction at 0 with 195 rule applications. Total rules 196 place count 13 transition count 214
Iterating global reduction 0 with 195 rules applied. Total rules applied 391 place count 13 transition count 214
Ensure Unique test removed 194 transitions
Reduce isomorphic transitions removed 194 transitions.
Iterating post reduction 0 with 194 rules applied. Total rules applied 585 place count 13 transition count 20
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 587 place count 11 transition count 18
Iterating global reduction 1 with 2 rules applied. Total rules applied 589 place count 11 transition count 18
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 591 place count 10 transition count 17
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 593 place count 8 transition count 15
Iterating global reduction 1 with 2 rules applied. Total rules applied 595 place count 8 transition count 15
Applied a total of 595 rules in 14 ms. Remains 8 /404 variables (removed 396) and now considering 15/702 (removed 687) transitions.
// Phase 1: matrix 15 rows 8 cols
[2022-05-19 15:28:19] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 15:28:19] [INFO ] Implicit Places using invariants in 15 ms returned []
// Phase 1: matrix 15 rows 8 cols
[2022-05-19 15:28:19] [INFO ] Computed 3 place invariants in 0 ms
[2022-05-19 15:28:19] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 51 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 2 iterations. Remains : 8/16561 places, 15/32200 transitions.
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-100160-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p2 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p2:(GEQ s3 1), p1:(AND (GEQ s0 1) (GEQ s4 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100160-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100160-LTLFireability-06 finished in 901 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(X(F(p0)))&&X(G(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 112 ms. Remains 16561 /16561 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
// Phase 1: matrix 32200 rows 16561 cols
[2022-05-19 15:28:19] [INFO ] Computed 361 place invariants in 210 ms
[2022-05-19 15:28:20] [INFO ] Implicit Places using invariants in 1603 ms returned []
Implicit Place search using SMT only with invariants took 1616 ms to find 0 implicit places.
// Phase 1: matrix 32200 rows 16561 cols
[2022-05-19 15:28:21] [INFO ] Computed 361 place invariants in 180 ms
[2022-05-19 15:28:22] [INFO ] Dead Transitions using invariants and state equation in 1551 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16561/16561 places, 32200/32200 transitions.
Stuttering acceptance computed with spot in 138 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : ServersAndClients-PT-100160-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(OR (GEQ s9325 1) (AND (GEQ s239 1) (GEQ s2421 1))), p0:(GEQ s9325 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ServersAndClients-PT-100160-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100160-LTLFireability-07 finished in 3487 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&F((G(F(G(p1)))&&G(p2)))))'
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 15739 transitions
Trivial Post-agglo rules discarded 15739 transitions
Performed 15739 trivial Post agglomeration. Transition count delta: 15739
Iterating post reduction 0 with 15739 rules applied. Total rules applied 15739 place count 16561 transition count 16461
Reduce places removed 15739 places and 0 transitions.
Performed 159 Post agglomeration using F-continuation condition.Transition count delta: 159
Iterating post reduction 1 with 15898 rules applied. Total rules applied 31637 place count 822 transition count 16302
Reduce places removed 316 places and 0 transitions.
Ensure Unique test removed 15600 transitions
Reduce isomorphic transitions removed 15600 transitions.
Iterating post reduction 2 with 15916 rules applied. Total rules applied 47553 place count 506 transition count 702
Drop transitions removed 198 transitions
Redundant transition composition rules discarded 198 transitions
Iterating global reduction 3 with 198 rules applied. Total rules applied 47751 place count 506 transition count 504
Applied a total of 47751 rules in 251 ms. Remains 506 /16561 variables (removed 16055) and now considering 504/32200 (removed 31696) transitions.
// Phase 1: matrix 504 rows 506 cols
[2022-05-19 15:28:23] [INFO ] Computed 204 place invariants in 2 ms
[2022-05-19 15:28:23] [INFO ] Implicit Places using invariants in 429 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 502, 504]
Discarding 202 places :
Implicit Place search using SMT only with invariants took 431 ms to find 202 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 304/16561 places, 504/32200 transitions.
Graph (trivial) has 298 edges and 304 vertex of which 199 / 304 are part of one of the 1 SCC in 0 ms
Free SCC test removed 198 places
Ensure Unique test removed 296 transitions
Reduce isomorphic transitions removed 296 transitions.
Discarding 98 places :
Symmetric choice reduction at 0 with 98 rule applications. Total rules 99 place count 8 transition count 110
Iterating global reduction 0 with 98 rules applied. Total rules applied 197 place count 8 transition count 110
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 295 place count 8 transition count 12
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 297 place count 7 transition count 11
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 298 place count 6 transition count 10
Iterating global reduction 1 with 1 rules applied. Total rules applied 299 place count 6 transition count 10
Applied a total of 299 rules in 8 ms. Remains 6 /304 variables (removed 298) and now considering 10/504 (removed 494) transitions.
// Phase 1: matrix 10 rows 6 cols
[2022-05-19 15:28:23] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 15:28:23] [INFO ] Implicit Places using invariants in 17 ms returned []
// Phase 1: matrix 10 rows 6 cols
[2022-05-19 15:28:23] [INFO ] Computed 2 place invariants in 1 ms
[2022-05-19 15:28:23] [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 : 6/16561 places, 10/32200 transitions.
Finished structural reductions, in 2 iterations. Remains : 6/16561 places, 10/32200 transitions.
Stuttering acceptance computed with spot in 168 ms :[(OR (NOT p0) (NOT p2) (NOT p1)), (NOT p0), (OR (NOT p2) (NOT p1)), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-100160-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p2, acceptance={} source=2 dest: 2}, { cond=(NOT p2), acceptance={0} source=2 dest: 2}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 3}, { cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(GEQ s5 1), p2:(AND (GEQ s0 1) (GEQ s2 1)), p1:(GEQ s4 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ServersAndClients-PT-100160-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100160-LTLFireability-08 finished in 941 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(F(F(p0))))||G(X(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 129 ms. Remains 16561 /16561 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
// Phase 1: matrix 32200 rows 16561 cols
[2022-05-19 15:28:24] [INFO ] Computed 361 place invariants in 223 ms
[2022-05-19 15:28:25] [INFO ] Implicit Places using invariants in 1344 ms returned []
Implicit Place search using SMT only with invariants took 1380 ms to find 0 implicit places.
// Phase 1: matrix 32200 rows 16561 cols
[2022-05-19 15:28:25] [INFO ] Computed 361 place invariants in 220 ms
[2022-05-19 15:28:27] [INFO ] Dead Transitions using invariants and state equation in 1913 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16561/16561 places, 32200/32200 transitions.
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (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: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LT s14209 1), p0:(OR (LT s209 1) (LT s2724 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][false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 4279 ms.
Product exploration explored 100000 steps with 3 reset in 4458 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 p1 p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 6 factoid took 207 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 576 ms. (steps per millisecond=17 ) properties (out of 3) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 32200 rows 16561 cols
[2022-05-19 15:28:37] [INFO ] Computed 361 place invariants in 179 ms
[2022-05-19 15:28:40] [INFO ] [Real]Absence check using 261 positive place invariants in 695 ms returned sat
[2022-05-19 15:28:40] [INFO ] [Real]Absence check using 261 positive and 100 generalized place invariants in 256 ms returned sat
[2022-05-19 15:29:02] [INFO ] After 21802ms SMT Verify possible using state equation in real domain returned unsat :1 sat :0
[2022-05-19 15:29:02] [INFO ] After 21841ms SMT Verify possible using trap constraints in real domain returned unsat :1 sat :0
[2022-05-19 15:29:02] [INFO ] After 25060ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 16561 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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.
Drop transitions removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 3 with 396 rules applied. Total rules applied 48749 place count 7 transition count 5
Ensure Unique test removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 48750 place count 6 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 48753 place count 4 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 48755 place count 3 transition count 3
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 48756 place count 3 transition count 2
Ensure Unique test removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 48757 place count 2 transition count 2
Applied a total of 48757 rules in 189 ms. Remains 2 /16561 variables (removed 16559) and now considering 2/32200 (removed 32198) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/16561 places, 2/32200 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 7 factoid took 454 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 157 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
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 149 ms. Remains 16561 /16561 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
// Phase 1: matrix 32200 rows 16561 cols
[2022-05-19 15:29:03] [INFO ] Computed 361 place invariants in 208 ms
[2022-05-19 15:29:05] [INFO ] Implicit Places using invariants in 1977 ms returned []
Implicit Place search using SMT only with invariants took 2005 ms to find 0 implicit places.
// Phase 1: matrix 32200 rows 16561 cols
[2022-05-19 15:29:05] [INFO ] Computed 361 place invariants in 185 ms
[2022-05-19 15:29:08] [INFO ] Dead Transitions using invariants and state equation in 2804 ms found 0 transitions.
Finished structural reductions, in 1 iterations. 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 p1 p0), (X p1), true, (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 178 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 483 ms. (steps per millisecond=20 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 32200 rows 16561 cols
[2022-05-19 15:29:09] [INFO ] Computed 361 place invariants in 174 ms
[2022-05-19 15:29:12] [INFO ] [Real]Absence check using 261 positive place invariants in 582 ms returned sat
[2022-05-19 15:29:13] [INFO ] [Real]Absence check using 261 positive and 100 generalized place invariants in 225 ms returned sat
[2022-05-19 15:29:34] [INFO ] After 25049ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 16561 places. Attempting structural reductions.
Starting structural reductions in SAFETY 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.
Drop transitions removed 99 transitions
Reduce isomorphic transitions removed 99 transitions.
Iterating post reduction 3 with 396 rules applied. Total rules applied 48749 place count 7 transition count 5
Ensure Unique test removed 1 places
Iterating post reduction 4 with 1 rules applied. Total rules applied 48750 place count 6 transition count 5
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 3 rules applied. Total rules applied 48753 place count 4 transition count 4
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 48755 place count 3 transition count 3
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 48756 place count 3 transition count 2
Ensure Unique test removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 48757 place count 2 transition count 2
Applied a total of 48757 rules in 209 ms. Remains 2 /16561 variables (removed 16559) and now considering 2/32200 (removed 32198) transitions.
Finished structural reductions, in 1 iterations. Remains : 2/16561 places, 2/32200 transitions.
Finished random walk after 1 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=1 )
Knowledge obtained : [(AND p1 p0), (X p1), true, (X (X p0))]
False Knowledge obtained : [(X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 4 factoid took 326 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 190 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 4547 ms.
Product exploration explored 100000 steps with 0 reset in 4861 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 180 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
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.
Performed 15899 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 15899 rules applied. Total rules applied 15899 place count 16561 transition count 32200
Discarding 157 places :
Symmetric choice reduction at 1 with 157 rule applications. Total rules 16056 place count 16404 transition count 16500
Deduced a syphon composed of 15899 places in 4 ms
Iterating global reduction 1 with 157 rules applied. Total rules applied 16213 place count 16404 transition count 16500
Deduced a syphon composed of 15899 places in 5 ms
Applied a total of 16213 rules in 7785 ms. Remains 16404 /16561 variables (removed 157) and now considering 16500/32200 (removed 15700) transitions.
[2022-05-19 15:29:53] [INFO ] Flow matrix only has 16401 transitions (discarded 99 similar events)
// Phase 1: matrix 16401 rows 16404 cols
[2022-05-19 15:29:56] [INFO ] Computed 204 place invariants in 3348 ms
[2022-05-19 15:29:59] [INFO ] Dead Transitions using invariants and state equation in 6121 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 16404/16561 places, 16500/32200 transitions.
Finished structural reductions, in 1 iterations. Remains : 16404/16561 places, 16500/32200 transitions.
Product exploration explored 100000 steps with 67 reset in 1714 ms.
Product exploration explored 100000 steps with 56 reset in 1663 ms.
Built C files in :
/tmp/ltsmin17357275633124682286
[2022-05-19 15:30:03] [INFO ] Built C files in 294ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17357275633124682286
Running compilation step : cd /tmp/ltsmin17357275633124682286;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin17357275633124682286;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin17357275633124682286;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
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 129 ms. Remains 16561 /16561 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
// Phase 1: matrix 32200 rows 16561 cols
[2022-05-19 15:30:06] [INFO ] Computed 361 place invariants in 199 ms
[2022-05-19 15:30:08] [INFO ] Implicit Places using invariants in 1650 ms returned []
Implicit Place search using SMT only with invariants took 1660 ms to find 0 implicit places.
// Phase 1: matrix 32200 rows 16561 cols
[2022-05-19 15:30:08] [INFO ] Computed 361 place invariants in 256 ms
[2022-05-19 15:30:09] [INFO ] Dead Transitions using invariants and state equation in 1685 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16561/16561 places, 32200/32200 transitions.
Built C files in :
/tmp/ltsmin17273648808628181983
[2022-05-19 15:30:10] [INFO ] Built C files in 350ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17273648808628181983
Running compilation step : cd /tmp/ltsmin17273648808628181983;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin17273648808628181983;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin17273648808628181983;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
[2022-05-19 15:30:15] [INFO ] Flatten gal took : 957 ms
[2022-05-19 15:30:16] [INFO ] Flatten gal took : 1184 ms
[2022-05-19 15:30:17] [INFO ] Time to serialize gal into /tmp/LTL3575417774574840278.gal : 281 ms
[2022-05-19 15:30:17] [INFO ] Time to serialize properties into /tmp/LTL12184689644836309676.ltl : 28 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3575417774574840278.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12184689644836309676.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL3575417...267
Read 1 LTL properties
Checking formula 0 : !(((X(G(F(F("((sys_req4<1)||(sv23<1))")))))||(G(X("(sv136_c71<1)")))))
Formula 0 simplified : !(XGF"((sys_req4<1)||(sv23<1))" | GX"(sv136_c71<1)")
Detected timeout of ITS tools.
[2022-05-19 15:30:33] [INFO ] Flatten gal took : 1036 ms
[2022-05-19 15:30:33] [INFO ] Applying decomposition
[2022-05-19 15:30:34] [INFO ] Flatten gal took : 914 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph7376104987623102895.txt' '-o' '/tmp/graph7376104987623102895.bin' '-w' '/tmp/graph7376104987623102895.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph7376104987623102895.bin' '-l' '-1' '-v' '-w' '/tmp/graph7376104987623102895.weights' '-q' '0' '-e' '0.001'
[2022-05-19 15:30:37] [INFO ] Decomposing Gal with order
[2022-05-19 15:30:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 15:30:48] [INFO ] Removed a total of 31625 redundant transitions.
[2022-05-19 15:30:49] [INFO ] Flatten gal took : 8914 ms
[2022-05-19 15:30:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 294 ms.
[2022-05-19 15:30:50] [INFO ] Time to serialize gal into /tmp/LTL14478895697371151388.gal : 365 ms
[2022-05-19 15:30:50] [INFO ] Time to serialize properties into /tmp/LTL6570124766340832911.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14478895697371151388.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6570124766340832911.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTL1447889...246
Read 1 LTL properties
Checking formula 0 : !(((X(G(F(F("((i102.u122.sys_req4<1)||(i103.u123.sv23<1))")))))||(G(X("(i172.u236.sv136_c71<1)")))))
Formula 0 simplified : !(XGF"((i102.u122.sys_req4<1)||(i103.u123.sv23<1))" | GX"(i172.u236.sv136_c71<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin757542339080177055
[2022-05-19 15:31:05] [INFO ] Built C files in 215ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin757542339080177055
Running compilation step : cd /tmp/ltsmin757542339080177055;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin757542339080177055;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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/ltsmin757542339080177055;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/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:94)
at java.base/java.lang.Thread.run(Thread.java:829)
Treatment of property ServersAndClients-PT-100160-LTLFireability-09 finished in 165312 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(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 394 ms. Remains 502 /16561 variables (removed 16059) and now considering 500/32200 (removed 31700) transitions.
// Phase 1: matrix 500 rows 502 cols
[2022-05-19 15:31:09] [INFO ] Computed 202 place invariants in 2 ms
[2022-05-19 15:31:09] [INFO ] Implicit Places using invariants in 412 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 413 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 3 ms. Remains 4 /302 variables (removed 298) and now considering 6/500 (removed 494) transitions.
// Phase 1: matrix 6 rows 4 cols
[2022-05-19 15:31:09] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 15:31:09] [INFO ] Implicit Places using invariants in 82 ms returned []
// Phase 1: matrix 6 rows 4 cols
[2022-05-19 15:31:09] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 15:31:09] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 147 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 2 iterations. Remains : 4/16561 places, 6/32200 transitions.
Stuttering acceptance computed with spot in 84 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100160-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s2 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 291 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 3 in 1 ms.
FORMULA ServersAndClients-PT-100160-LTLFireability-10 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100160-LTLFireability-10 finished in 1370 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(X(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 172 ms. Remains 16561 /16561 variables (removed 0) and now considering 32200/32200 (removed 0) transitions.
// Phase 1: matrix 32200 rows 16561 cols
[2022-05-19 15:31:10] [INFO ] Computed 361 place invariants in 178 ms
[2022-05-19 15:31:12] [INFO ] Implicit Places using invariants in 2211 ms returned []
Implicit Place search using SMT only with invariants took 2212 ms to find 0 implicit places.
// Phase 1: matrix 32200 rows 16561 cols
[2022-05-19 15:31:13] [INFO ] Computed 361 place invariants in 347 ms
[2022-05-19 15:31:14] [INFO ] Dead Transitions using invariants and state equation in 1943 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 16561/16561 places, 32200/32200 transitions.
Stuttering acceptance computed with spot in 113 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100160-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p0:(AND (GEQ s241 1) (GEQ s5249 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA ServersAndClients-PT-100160-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100160-LTLFireability-11 finished in 4536 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(F(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 214 ms. Remains 7 /16561 variables (removed 16554) and now considering 6/32200 (removed 32194) transitions.
// Phase 1: matrix 6 rows 7 cols
[2022-05-19 15:31:15] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 15:31:15] [INFO ] Implicit Places using invariants in 80 ms returned [0, 1, 5]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 81 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 0 ms. Remains 2 /4 variables (removed 2) and now considering 3/6 (removed 3) transitions.
// Phase 1: matrix 3 rows 2 cols
[2022-05-19 15:31:15] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:31:15] [INFO ] Implicit Places using invariants in 109 ms returned []
// Phase 1: matrix 3 rows 2 cols
[2022-05-19 15:31:15] [INFO ] Computed 1 place invariants in 0 ms
[2022-05-19 15:31:15] [INFO ] Implicit Places using invariants and state equation in 169 ms returned []
Implicit Place search using SMT with State Equation took 278 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 2 iterations. Remains : 2/16561 places, 3/32200 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100160-LTLFireability-13 automaton TGBA Formula[mat=[[{ 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, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100160-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100160-LTLFireability-13 finished in 807 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!(G(X(G(F(X((F(G(p0))&&p1)))))))'
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 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
Performed 99 Post agglomeration using F-continuation condition.Transition count delta: 99
Iterating post reduction 2 with 198 rules applied. Total rules applied 48254 place count 304 transition count 203
Reduce places removed 99 places and 0 transitions.
Iterating post reduction 3 with 99 rules applied. Total rules applied 48353 place count 205 transition count 203
Applied a total of 48353 rules in 267 ms. Remains 205 /16561 variables (removed 16356) and now considering 203/32200 (removed 31997) transitions.
// Phase 1: matrix 203 rows 205 cols
[2022-05-19 15:31:16] [INFO ] Computed 103 place invariants in 1 ms
[2022-05-19 15:31:16] [INFO ] Implicit Places using invariants in 208 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, 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, 203]
Discarding 101 places :
Implicit Place search using SMT only with invariants took 209 ms to find 101 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/16561 places, 203/32200 transitions.
Discarding 98 places :
Symmetric choice reduction at 0 with 98 rule applications. Total rules 98 place count 6 transition count 105
Iterating global reduction 0 with 98 rules applied. Total rules applied 196 place count 6 transition count 105
Ensure Unique test removed 97 transitions
Reduce isomorphic transitions removed 97 transitions.
Iterating post reduction 0 with 97 rules applied. Total rules applied 293 place count 6 transition count 8
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 294 place count 6 transition count 7
Partial Post-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 295 place count 6 transition count 7
Applied a total of 295 rules in 1 ms. Remains 6 /104 variables (removed 98) and now considering 7/203 (removed 196) transitions.
// Phase 1: matrix 7 rows 6 cols
[2022-05-19 15:31:16] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 15:31:16] [INFO ] Implicit Places using invariants in 43 ms returned []
// Phase 1: matrix 7 rows 6 cols
[2022-05-19 15:31:16] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 15:31:16] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 65 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/16561 places, 7/32200 transitions.
Finished structural reductions, in 2 iterations. Remains : 6/16561 places, 7/32200 transitions.
Stuttering acceptance computed with spot in 88 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-100160-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s1 1)), p1:(GEQ s5 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 62 ms.
Stack based approach found an accepted trace after 3 steps with 0 reset with depth 4 and stack size 4 in 0 ms.
FORMULA ServersAndClients-PT-100160-LTLFireability-14 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100160-LTLFireability-14 finished in 747 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((F((X((!(F(!p0)||p1)||G(p1)))||p2)) U p3))'
Support contains 7 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 15228 transitions
Trivial Post-agglo rules discarded 15228 transitions
Performed 15228 trivial Post agglomeration. Transition count delta: 15228
Iterating post reduction 0 with 15228 rules applied. Total rules applied 15228 place count 16561 transition count 16972
Reduce places removed 15228 places and 0 transitions.
Performed 471 Post agglomeration using F-continuation condition.Transition count delta: 471
Iterating post reduction 1 with 15699 rules applied. Total rules applied 30927 place count 1333 transition count 16501
Reduce places removed 627 places and 0 transitions.
Ensure Unique test removed 15500 transitions
Reduce isomorphic transitions removed 15500 transitions.
Iterating post reduction 2 with 16127 rules applied. Total rules applied 47054 place count 706 transition count 1001
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 3 with 99 rules applied. Total rules applied 47153 place count 706 transition count 902
Applied a total of 47153 rules in 638 ms. Remains 706 /16561 variables (removed 15855) and now considering 902/32200 (removed 31298) transitions.
// Phase 1: matrix 902 rows 706 cols
[2022-05-19 15:31:17] [INFO ] Computed 205 place invariants in 4 ms
[2022-05-19 15:31:17] [INFO ] Implicit Places using invariants in 488 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, 401]
Discarding 201 places :
Implicit Place search using SMT only with invariants took 490 ms to find 201 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 505/16561 places, 902/32200 transitions.
Graph (trivial) has 294 edges and 505 vertex of which 195 / 505 are part of one of the 1 SCC in 0 ms
Free SCC test removed 194 places
Ensure Unique test removed 290 transitions
Reduce isomorphic transitions removed 290 transitions.
Discarding 290 places :
Symmetric choice reduction at 0 with 290 rule applications. Total rules 291 place count 21 transition count 322
Iterating global reduction 0 with 290 rules applied. Total rules applied 581 place count 21 transition count 322
Ensure Unique test removed 288 transitions
Reduce isomorphic transitions removed 288 transitions.
Iterating post reduction 0 with 288 rules applied. Total rules applied 869 place count 21 transition count 34
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 875 place count 15 transition count 28
Iterating global reduction 1 with 6 rules applied. Total rules applied 881 place count 15 transition count 28
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 883 place count 14 transition count 27
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 886 place count 11 transition count 24
Iterating global reduction 1 with 3 rules applied. Total rules applied 889 place count 11 transition count 24
Applied a total of 889 rules in 5 ms. Remains 11 /505 variables (removed 494) and now considering 24/902 (removed 878) transitions.
// Phase 1: matrix 24 rows 11 cols
[2022-05-19 15:31:17] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 15:31:17] [INFO ] Implicit Places using invariants in 49 ms returned []
// Phase 1: matrix 24 rows 11 cols
[2022-05-19 15:31:17] [INFO ] Computed 4 place invariants in 0 ms
[2022-05-19 15:31:17] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/16561 places, 24/32200 transitions.
Finished structural reductions, in 2 iterations. Remains : 11/16561 places, 24/32200 transitions.
Stuttering acceptance computed with spot in 92 ms :[(NOT p3), (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
Running random walk in product with property : ServersAndClients-PT-100160-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p3), acceptance={0, 1} source=0 dest: 0}, { cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={1} source=1 dest: 2}], [{ cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0, 1} source=2 dest: 1}, { cond=(AND (NOT p2) p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={1} source=2 dest: 2}]], initial=0, aps=[p3:(AND (GEQ s0 1) (GEQ s9 1)), p2:(AND (GEQ s1 1) (GEQ s7 1)), p1:(GEQ s4 1), p0:(AND (GEQ s2 1) (GEQ s5 1))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100160-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100160-LTLFireability-15 finished in 1367 ms.
Running Spot : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//..//ltl2tgba' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(F(F(p0))))||G(X(p1))))'
Found a SL insensitive property : ServersAndClients-PT-100160-LTLFireability-09
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 3 out of 16561 places. Attempting structural reductions.
Starting structural reductions in SLCL_LTL mode, iteration 0 : 16561/16561 places, 32200/32200 transitions.
Drop transitions removed 15740 transitions
Trivial Post-agglo rules discarded 15740 transitions
Performed 15740 trivial Post agglomeration. Transition count delta: 15740
Iterating post reduction 0 with 15740 rules applied. Total rules applied 15740 place count 16561 transition count 16460
Reduce places removed 15740 places and 0 transitions.
Performed 159 Post agglomeration using F-continuation condition.Transition count delta: 159
Iterating post reduction 1 with 15899 rules applied. Total rules applied 31639 place count 821 transition count 16301
Reduce places removed 317 places and 0 transitions.
Ensure Unique test removed 15700 transitions
Reduce isomorphic transitions removed 15700 transitions.
Iterating post reduction 2 with 16017 rules applied. Total rules applied 47656 place count 504 transition count 601
Drop transitions removed 99 transitions
Redundant transition composition rules discarded 99 transitions
Iterating global reduction 3 with 99 rules applied. Total rules applied 47755 place count 504 transition count 502
Applied a total of 47755 rules in 264 ms. Remains 504 /16561 variables (removed 16057) and now considering 502/32200 (removed 31698) transitions.
// Phase 1: matrix 502 rows 504 cols
[2022-05-19 15:31:18] [INFO ] Computed 203 place invariants in 2 ms
[2022-05-19 15:31:18] [INFO ] Implicit Places using invariants in 468 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 502]
Discarding 201 places :
Implicit Place search using SMT only with invariants took 469 ms to find 201 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 1 : 303/16561 places, 502/32200 transitions.
Graph (trivial) has 298 edges and 303 vertex of which 199 / 303 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 7 transition count 108
Iterating global reduction 0 with 98 rules applied. Total rules applied 197 place count 7 transition count 108
Ensure Unique test removed 98 transitions
Reduce isomorphic transitions removed 98 transitions.
Iterating post reduction 0 with 98 rules applied. Total rules applied 295 place count 7 transition count 10
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 297 place count 6 transition count 9
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 298 place count 5 transition count 8
Iterating global reduction 1 with 1 rules applied. Total rules applied 299 place count 5 transition count 8
Applied a total of 299 rules in 2 ms. Remains 5 /303 variables (removed 298) and now considering 8/502 (removed 494) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-19 15:31:18] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 15:31:18] [INFO ] Implicit Places using invariants in 20 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-19 15:31:18] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 15:31:18] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 59 ms to find 0 implicit places.
Starting structural reductions in SLCL_LTL mode, iteration 2 : 5/16561 places, 8/32200 transitions.
Finished structural reductions, in 2 iterations. Remains : 5/16561 places, 8/32200 transitions.
Running random walk in product with property : ServersAndClients-PT-100160-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={} source=3 dest: 2}, { cond=true, acceptance={} source=3 dest: 3}]], initial=0, aps=[p1:(LT s4 1), p0:(OR (LT s0 1) (LT s2 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 4337 reset in 158 ms.
Product exploration explored 100000 steps with 4340 reset in 98 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 p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 193 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 7 edges and 2 AP.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 8 rows 5 cols
[2022-05-19 15:31:19] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 15:31:19] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2022-05-19 15:31:19] [INFO ] After 52ms 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 p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 782 ms. Reduced automaton from 4 states, 7 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 363 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 386 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 3 out of 5 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
// Phase 1: matrix 8 rows 5 cols
[2022-05-19 15:31:21] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 15:31:21] [INFO ] Implicit Places using invariants in 65 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-19 15:31:21] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 15:31:21] [INFO ] Implicit Places using invariants and state equation in 53 ms returned []
Implicit Place search using SMT with State Equation took 122 ms to find 0 implicit places.
// Phase 1: matrix 8 rows 5 cols
[2022-05-19 15:31:21] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 15:31:21] [INFO ] Dead Transitions using invariants and state equation in 29 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 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 p1 p0), true]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 287 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 181 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Finished random walk after 5 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND p1 p0), true]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 199 ms. Reduced automaton from 4 states, 6 edges and 2 AP to 4 states, 6 edges and 2 AP.
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4324 reset in 81 ms.
Product exploration explored 100000 steps with 4316 reset in 78 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 492 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0)]
Support contains 3 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 5 /5 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2022-05-19 15:31:22] [INFO ] Redundant transitions in 0 ms returned []
// Phase 1: matrix 8 rows 5 cols
[2022-05-19 15:31:22] [INFO ] Computed 2 place invariants in 0 ms
[2022-05-19 15:31:23] [INFO ] Dead Transitions using invariants and state equation in 111 ms found 0 transitions.
Finished structural reductions, in 1 iterations. Remains : 5/5 places, 8/8 transitions.
Product exploration explored 100000 steps with 4335 reset in 234 ms.
Product exploration explored 100000 steps with 4372 reset in 249 ms.
Built C files in :
/tmp/ltsmin2115822565760281241
[2022-05-19 15:31:23] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2115822565760281241
Running compilation step : cd /tmp/ltsmin2115822565760281241;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 116 ms.
Running link step : cd /tmp/ltsmin2115822565760281241;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin2115822565760281241;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10616902087812154048.hoa' '--buchi-type=spotba'
LTSmin run took 472 ms.
Treatment of property ServersAndClients-PT-100160-LTLFireability-09 finished in 6386 ms.
CL/SL decision was in the wrong direction : SL + true
[2022-05-19 15:31:25] [INFO ] Flatten gal took : 871 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10986223155804517244
[2022-05-19 15:31:26] [INFO ] Too many transitions (32200) to apply POR reductions. Disabling POR matrices.
[2022-05-19 15:31:27] [INFO ] Built C files in 998ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10986223155804517244
Running compilation step : cd /tmp/ltsmin10986223155804517244;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202205111006/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2022-05-19 15:31:27] [INFO ] Applying decomposition
[2022-05-19 15:31:29] [INFO ] Flatten gal took : 1820 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/convert-linux64' '-i' '/tmp/graph10927573702915580232.txt' '-o' '/tmp/graph10927573702915580232.bin' '-w' '/tmp/graph10927573702915580232.weights'
Built communities with : '/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202205111006/bin/louvain-linux64' '/tmp/graph10927573702915580232.bin' '-l' '-1' '-v' '-w' '/tmp/graph10927573702915580232.weights' '-q' '0' '-e' '0.001'
[2022-05-19 15:31:32] [INFO ] Decomposing Gal with order
[2022-05-19 15:31:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2022-05-19 15:31:43] [INFO ] Removed a total of 31635 redundant transitions.
[2022-05-19 15:31:44] [INFO ] Flatten gal took : 7698 ms
[2022-05-19 15:31:44] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 214 ms.
[2022-05-19 15:31:45] [INFO ] Time to serialize gal into /tmp/LTLFireability2585386225639662701.gal : 202 ms
[2022-05-19 15:31:45] [INFO ] Time to serialize properties into /tmp/LTLFireability12536699206245804345.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2585386225639662701.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12536699206245804345.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202205111006/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/LTLFireabi...268
Read 1 LTL properties
Checking formula 0 : !(((X(G(F(F("((i28.u4.sys_req4<1)||(i11.u123.sv23<1))")))))||(G(X("(i167.u236.sv136_c71<1)")))))
Formula 0 simplified : !(XGF"((i28.u4.sys_req4<1)||(i11.u123.sv23<1))" | GX"(i167.u236.sv136_c71<1)")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.

BK_STOP 1652974862183

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

+ export LANG=C
+ LANG=C
+ export BINDIR=/home/mcc/BenchKit/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ export PYTHONPATH=/usr/lib/python3.9/site-packages/
+ PYTHONPATH=/usr/lib/python3.9/site-packages/
+ export LD_LIBRARY_PATH=/usr/local/lib:
+ LD_LIBRARY_PATH=/usr/local/lib:
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202205111006.jar
+ VERSION=202205111006
+ echo 'Running Version 202205111006'
+ /home/mcc/BenchKit/bin//..//itstools/its-tools -data @none -pnfolder /home/mcc/execution -examination LTLFireability -spotpath /home/mcc/BenchKit/bin//..//ltlfilt -z3path /home/mcc/BenchKit/bin//..//z3/bin/z3 -yices2path /home/mcc/BenchKit/bin//..//yices/bin/yices -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600 -vmargs -Dosgi.locking=none -Declipse.stateSaveDelayInterval=-1 -Dosgi.configuration.area=@none -Xss128m -Xms40m -Xmx8192m

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-4028"
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 r204-oct2-165281599300484"
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 ;