Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 5.3M
-rw-r--r-- 1 mcc users 8.9K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.3K Apr 23 07:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Apr 23 07:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K Apr 23 07:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Apr 23 07:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Apr 13 15:57 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 92K Apr 13 15:57 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Apr 13 15:54 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Apr 13 15:54 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Apr 23 07:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.9K Apr 23 07:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:43 equiv_col
-rw-r--r-- 1 mcc users 7 May 18 16:43 instance
-rw-r--r-- 1 mcc users 6 May 18 16:43 iscolored
-rw-r--r-- 1 mcc users 4.9M May 18 16:43 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717230161144

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ServersAndClients-PT-100080
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-01 08:22:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-01 08:22:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-01 08:22:42] [INFO ] Load time of PNML (sax parser for PT used): 444 ms
[2024-06-01 08:22:42] [INFO ] Transformed 8481 places.
[2024-06-01 08:22:42] [INFO ] Transformed 16200 transitions.
[2024-06-01 08:22:42] [INFO ] Found NUPN structural information;
[2024-06-01 08:22:42] [INFO ] Parsed PT model containing 8481 places and 16200 transitions and 48800 arcs in 617 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ServersAndClients-PT-100080-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100080-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100080-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA ServersAndClients-PT-100080-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 8481 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 8481/8481 places, 16200/16200 transitions.
Applied a total of 0 rules in 2141 ms. Remains 8481 /8481 variables (removed 0) and now considering 16200/16200 (removed 0) transitions.
// Phase 1: matrix 16200 rows 8481 cols
[2024-06-01 08:22:45] [INFO ] Computed 281 invariants in 254 ms
[2024-06-01 08:23:04] [INFO ] Implicit Places using invariants in 18855 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, 193, 194, 195, 196, 197, 198, 199, 401, 502, 704, 1007, 1108, 1209, 1411, 1512, 1613, 1714, 1815, 1916, 2017, 2118, 2219, 2320, 2421, 2522, 2623, 2724, 2825, 2926, 3027, 3128, 3229, 3330, 3431, 3532, 3633, 3734, 3936, 4037, 4138, 4239, 4340, 4542, 4643, 4744, 4845, 4946, 5148, 5249, 5451, 5552, 5653, 5754, 5855, 5956, 6057, 6158, 6259, 6360, 6461, 6562, 6663, 6764, 6865, 6966, 7067, 7168, 7269, 7370, 7471, 7572, 7673, 7875, 8077, 8178, 8380]
Discarding 268 places :
Implicit Place search using SMT only with invariants took 18924 ms to find 268 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 8213/8481 places, 16200/16200 transitions.
Discarding 6887 places :
Symmetric choice reduction at 0 with 6887 rule applications. Total rules 6887 place count 1326 transition count 9313
Iterating global reduction 0 with 6887 rules applied. Total rules applied 13774 place count 1326 transition count 9313
Ensure Unique test removed 6789 transitions
Reduce isomorphic transitions removed 6789 transitions.
Iterating post reduction 0 with 6789 rules applied. Total rules applied 20563 place count 1326 transition count 2524
Discarding 1174 places :
Symmetric choice reduction at 1 with 1174 rule applications. Total rules 21737 place count 152 transition count 1350
Iterating global reduction 1 with 1174 rules applied. Total rules applied 22911 place count 152 transition count 1350
Discarding 79 places :
Symmetric choice reduction at 1 with 79 rule applications. Total rules 22990 place count 73 transition count 402
Iterating global reduction 1 with 79 rules applied. Total rules applied 23069 place count 73 transition count 402
Ensure Unique test removed 79 transitions
Reduce isomorphic transitions removed 79 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 23148 place count 73 transition count 323
Applied a total of 23148 rules in 627 ms. Remains 73 /8213 variables (removed 8140) and now considering 323/16200 (removed 15877) transitions.
// Phase 1: matrix 323 rows 73 cols
[2024-06-01 08:23:04] [INFO ] Computed 13 invariants in 2 ms
[2024-06-01 08:23:04] [INFO ] Implicit Places using invariants in 33 ms returned []
[2024-06-01 08:23:04] [INFO ] Invariant cache hit.
[2024-06-01 08:23:05] [INFO ] Implicit Places using invariants and state equation in 78 ms returned []
Implicit Place search using SMT with State Equation took 114 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 73/8481 places, 323/16200 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 21826 ms. Remains : 73/8481 places, 323/16200 transitions.
Support contains 37 out of 73 places after structural reductions.
[2024-06-01 08:23:05] [INFO ] Flatten gal took : 49 ms
[2024-06-01 08:23:05] [INFO ] Flatten gal took : 22 ms
[2024-06-01 08:23:05] [INFO ] Input system was already deterministic with 323 transitions.
Support contains 32 out of 73 places (down from 37) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 23 to 22
RANDOM walk for 40000 steps (8 resets) in 1343 ms. (29 steps per ms) remains 2/22 properties
BEST_FIRST walk for 40003 steps (8 resets) in 146 ms. (272 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 2/2 properties
[2024-06-01 08:23:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp19 is UNSAT
After SMT solving in domain Real declared 62/396 variables, and 2 constraints, problems are : Problem set: 2 solved, 0 unsolved in 57 ms.
Refiners :[Positive P Invariants (semi-flows): 2/13 constraints, State Equation: 0/73 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
After SMT, in 79ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 2 atomic propositions for a total of 12 simplifications.
FORMULA ServersAndClients-PT-100080-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 323/323 transitions.
Graph (trivial) has 64 edges and 73 vertex of which 33 / 73 are part of one of the 1 SCC in 2 ms
Free SCC test removed 32 places
Ensure Unique test removed 268 transitions
Reduce isomorphic transitions removed 268 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 41 transition count 30
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 62 rules applied. Total rules applied 88 place count 5 transition count 4
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 92 place count 2 transition count 3
Applied a total of 92 rules in 18 ms. Remains 2 /73 variables (removed 71) and now considering 3/323 (removed 320) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-06-01 08:23:06] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 08:23:06] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-06-01 08:23:06] [INFO ] Invariant cache hit.
[2024-06-01 08:23:06] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
[2024-06-01 08:23:06] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-06-01 08:23:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 58ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 58ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/73 places, 3/323 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 124 ms. Remains : 2/73 places, 3/323 transitions.
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-00
Product exploration explored 100000 steps with 14304 reset in 126 ms.
Product exploration explored 100000 steps with 14431 reset in 158 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 163 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 173 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 120 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 3/3 transitions.
Applied a total of 0 rules in 1 ms. Remains 2 /2 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2024-06-01 08:23:07] [INFO ] Invariant cache hit.
[2024-06-01 08:23:07] [INFO ] Implicit Places using invariants in 23 ms returned []
[2024-06-01 08:23:07] [INFO ] Invariant cache hit.
[2024-06-01 08:23:07] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 49 ms to find 0 implicit places.
[2024-06-01 08:23:07] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-06-01 08:23:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 20 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 50ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 50ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 107 ms. Remains : 2/2 places, 3/3 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 175 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 5 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 190 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14254 reset in 65 ms.
Product exploration explored 100000 steps with 14242 reset in 53 ms.
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 3/3 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2024-06-01 08:23:08] [INFO ] Invariant cache hit.
[2024-06-01 08:23:08] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-06-01 08:23:08] [INFO ] Invariant cache hit.
[2024-06-01 08:23:08] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-06-01 08:23:08] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-06-01 08:23:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 22 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 58ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 58ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 118 ms. Remains : 2/2 places, 3/3 transitions.
Treatment of property ServersAndClients-PT-100080-LTLFireability-00 finished in 2452 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U (!p0 U p1))||X(F(p2))))'
Support contains 2 out of 73 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 323/323 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 55 transition count 217
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 55 transition count 217
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 53 place count 55 transition count 200
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 61 place count 47 transition count 104
Iterating global reduction 1 with 8 rules applied. Total rules applied 69 place count 47 transition count 104
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 77 place count 47 transition count 96
Applied a total of 77 rules in 4 ms. Remains 47 /73 variables (removed 26) and now considering 96/323 (removed 227) transitions.
// Phase 1: matrix 96 rows 47 cols
[2024-06-01 08:23:08] [INFO ] Computed 13 invariants in 0 ms
[2024-06-01 08:23:08] [INFO ] Implicit Places using invariants in 44 ms returned [0, 11, 14, 17, 20, 24, 27, 30, 33, 38, 41, 44]
Discarding 12 places :
Implicit Place search using SMT only with invariants took 44 ms to find 12 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 35/73 places, 96/323 transitions.
Discarding 23 places :
Symmetric choice reduction at 0 with 23 rule applications. Total rules 23 place count 12 transition count 73
Iterating global reduction 0 with 23 rules applied. Total rules applied 46 place count 12 transition count 73
Ensure Unique test removed 54 transitions
Reduce isomorphic transitions removed 54 transitions.
Iterating post reduction 0 with 54 rules applied. Total rules applied 100 place count 12 transition count 19
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 101 place count 11 transition count 18
Iterating global reduction 1 with 1 rules applied. Total rules applied 102 place count 11 transition count 18
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 103 place count 10 transition count 17
Iterating global reduction 1 with 1 rules applied. Total rules applied 104 place count 10 transition count 17
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 105 place count 10 transition count 16
Applied a total of 105 rules in 1 ms. Remains 10 /35 variables (removed 25) and now considering 16/96 (removed 80) transitions.
// Phase 1: matrix 16 rows 10 cols
[2024-06-01 08:23:08] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 08:23:08] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-06-01 08:23:08] [INFO ] Invariant cache hit.
[2024-06-01 08:23:08] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 35 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 10/73 places, 16/323 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 85 ms. Remains : 10/73 places, 16/323 transitions.
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-01
Product exploration explored 100000 steps with 6631 reset in 145 ms.
Stack based approach found an accepted trace after 18 steps with 3 reset with depth 6 and stack size 6 in 0 ms.
FORMULA ServersAndClients-PT-100080-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100080-LTLFireability-01 finished in 316 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p1)&&p0))||G(!p1)||(!p1&&F(p2))))'
Support contains 3 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 323/323 transitions.
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 20 place count 53 transition count 215
Iterating global reduction 0 with 20 rules applied. Total rules applied 40 place count 53 transition count 215
Ensure Unique test removed 19 transitions
Reduce isomorphic transitions removed 19 transitions.
Iterating post reduction 0 with 19 rules applied. Total rules applied 59 place count 53 transition count 196
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 69 place count 43 transition count 76
Iterating global reduction 1 with 10 rules applied. Total rules applied 79 place count 43 transition count 76
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 89 place count 43 transition count 66
Applied a total of 89 rules in 5 ms. Remains 43 /73 variables (removed 30) and now considering 66/323 (removed 257) transitions.
// Phase 1: matrix 66 rows 43 cols
[2024-06-01 08:23:08] [INFO ] Computed 13 invariants in 1 ms
[2024-06-01 08:23:09] [INFO ] Implicit Places using invariants in 60 ms returned [0, 9, 12, 15, 18, 21, 24, 27, 34, 37, 40]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 61 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 32/73 places, 66/323 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 11 transition count 45
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 11 transition count 45
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 0 with 30 rules applied. Total rules applied 72 place count 11 transition count 15
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 74 place count 9 transition count 13
Iterating global reduction 1 with 2 rules applied. Total rules applied 76 place count 9 transition count 13
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 8 transition count 11
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 8 transition count 11
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 79 place count 8 transition count 10
Applied a total of 79 rules in 2 ms. Remains 8 /32 variables (removed 24) and now considering 10/66 (removed 56) transitions.
// Phase 1: matrix 10 rows 8 cols
[2024-06-01 08:23:09] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 08:23:09] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-06-01 08:23:09] [INFO ] Invariant cache hit.
[2024-06-01 08:23:09] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 8/73 places, 10/323 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 111 ms. Remains : 8/73 places, 10/323 transitions.
Stuttering acceptance computed with spot in 319 ms :[true, (NOT p2), (AND (NOT p0) p1), (OR (NOT p0) (NOT p1)), (AND (NOT p2) p1 (NOT p0)), (NOT p1), (AND (NOT p2) p1), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-02
Product exploration explored 100000 steps with 16588 reset in 89 ms.
Product exploration explored 100000 steps with 16822 reset in 65 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X (OR (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT p2)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (NOT p0)), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 7 factoid took 494 ms. Reduced automaton from 8 states, 15 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 508 ms :[(AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), (NOT p2)]
RANDOM walk for 40000 steps (8 resets) in 152 ms. (261 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
[2024-06-01 08:23:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf5 is UNSAT
After SMT solving in domain Real declared 8/18 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 35 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/8 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 38ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X (NOT (AND p1 p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X (OR (NOT p1) (NOT p0))), (X (NOT p1)), (X (X (NOT p2))), (G (OR (NOT p1) (NOT p2)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p0), (X (NOT p0)), (X (X (NOT p1))), (X (X p1)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (F p1), (F (NOT (OR p1 (NOT p2)))), (F p2), (F (NOT (OR (NOT p1) p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 8 factoid took 875 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 414 ms :[(NOT p2), (AND (NOT p2) p1), (AND (NOT p2) p1), false, (AND (NOT p2) p1), false, false]
Stuttering acceptance computed with spot in 323 ms :[(NOT p2), (AND (NOT p2) p1), (AND (NOT p2) p1), false, (AND (NOT p2) p1), false, false]
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 10/10 transitions.
Graph (trivial) has 4 edges and 8 vertex of which 4 / 8 are part of one of the 1 SCC in 0 ms
Free SCC test removed 3 places
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Applied a total of 1 rules in 2 ms. Remains 5 /8 variables (removed 3) and now considering 7/10 (removed 3) transitions.
// Phase 1: matrix 7 rows 5 cols
[2024-06-01 08:23:12] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 08:23:12] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 08:23:12] [INFO ] Invariant cache hit.
[2024-06-01 08:23:12] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 44 ms to find 0 implicit places.
[2024-06-01 08:23:12] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-06-01 08:23:12] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 6/11 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/11 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/12 variables, and 7 constraints, problems are : Problem set: 0 solved, 4 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 6/11 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/12 variables, and 11 constraints, problems are : Problem set: 0 solved, 4 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 105ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 105ms
Starting structural reductions in SI_LTL mode, iteration 1 : 5/8 places, 7/10 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 160 ms. Remains : 5/8 places, 7/10 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (NOT (AND p1 p2))), (X (X (NOT (AND p1 p2))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2))))]
Knowledge based reduction with 5 factoid took 453 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter insensitive) to 7 states, 18 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 387 ms :[(NOT p2), (AND (NOT p2) p1), (AND (NOT p2) p1), (NOT p2), (AND (NOT p2) p1), false, false]
RANDOM walk for 40000 steps (8 resets) in 460 ms. (86 steps per ms) remains 1/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
[2024-06-01 08:23:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf4 is UNSAT
After SMT solving in domain Real declared 5/12 variables, and 2 constraints, problems are : Problem set: 1 solved, 0 unsolved in 18 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 0/5 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 21ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1)), (X (NOT (AND p1 (NOT p2)))), (X (NOT p1)), (X (NOT (AND p1 p2))), (X (X (NOT (AND p1 p2)))), (G (OR (NOT p2) (NOT p1)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (AND (NOT p1) p2)), (X (NOT (AND (NOT p1) p2))), (X (X (NOT p2))), (X (X p2)), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (F (NOT (OR (NOT p2) p1))), (F p1), (F p2), (F (NOT (OR p2 (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p1))))]
Knowledge based reduction with 6 factoid took 766 ms. Reduced automaton from 7 states, 18 edges and 2 AP (stutter insensitive) to 7 states, 17 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 365 ms :[(NOT p2), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), false, false, false]
Stuttering acceptance computed with spot in 363 ms :[(NOT p2), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), false, false, false]
Stuttering acceptance computed with spot in 534 ms :[(NOT p2), (AND (NOT p2) p1), (AND (NOT p2) p1), (AND (NOT p2) p1), false, false, false]
Product exploration explored 100000 steps with 19994 reset in 156 ms.
Product exploration explored 100000 steps with 19969 reset in 164 ms.
Support contains 3 out of 5 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 5/5 places, 7/7 transitions.
Applied a total of 0 rules in 2 ms. Remains 5 /5 variables (removed 0) and now considering 7/7 (removed 0) transitions.
[2024-06-01 08:23:15] [INFO ] Invariant cache hit.
[2024-06-01 08:23:15] [INFO ] Implicit Places using invariants in 22 ms returned []
[2024-06-01 08:23:15] [INFO ] Invariant cache hit.
[2024-06-01 08:23:15] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 51 ms to find 0 implicit places.
[2024-06-01 08:23:15] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2024-06-01 08:23:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 6/11 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 0/11 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/12 variables, and 7 constraints, problems are : Problem set: 0 solved, 4 unsolved in 63 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1/5 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/5 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 6/11 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/11 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/11 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/12 variables, and 11 constraints, problems are : Problem set: 0 solved, 4 unsolved in 53 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 5/5 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 121ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 121ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 182 ms. Remains : 5/5 places, 7/7 transitions.
Treatment of property ServersAndClients-PT-100080-LTLFireability-02 finished in 7166 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 323/323 transitions.
Graph (trivial) has 64 edges and 73 vertex of which 33 / 73 are part of one of the 1 SCC in 0 ms
Free SCC test removed 32 places
Ensure Unique test removed 257 transitions
Reduce isomorphic transitions removed 257 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 41 transition count 53
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 28 transition count 52
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 60 place count 7 transition count 41
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 91 place count 7 transition count 10
Applied a total of 91 rules in 6 ms. Remains 7 /73 variables (removed 66) and now considering 10/323 (removed 313) transitions.
// Phase 1: matrix 10 rows 7 cols
[2024-06-01 08:23:16] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 08:23:16] [INFO ] Implicit Places using invariants in 32 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 32 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 6/73 places, 10/323 transitions.
Graph (trivial) has 3 edges and 6 vertex of which 2 / 6 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 4 transition count 7
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 4 transition count 7
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 4 transition count 6
Applied a total of 4 rules in 1 ms. Remains 4 /6 variables (removed 2) and now considering 6/10 (removed 4) transitions.
// Phase 1: matrix 6 rows 4 cols
[2024-06-01 08:23:16] [INFO ] Computed 2 invariants in 1 ms
[2024-06-01 08:23:16] [INFO ] Implicit Places using invariants in 13 ms returned []
[2024-06-01 08:23:16] [INFO ] Invariant cache hit.
[2024-06-01 08:23:16] [INFO ] Implicit Places using invariants and state equation in 16 ms returned []
Implicit Place search using SMT with State Equation took 30 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 4/73 places, 6/323 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 69 ms. Remains : 4/73 places, 6/323 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-03
Product exploration explored 100000 steps with 0 reset in 86 ms.
Stack based approach found an accepted trace after 8 steps with 0 reset with depth 9 and stack size 3 in 0 ms.
FORMULA ServersAndClients-PT-100080-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100080-LTLFireability-03 finished in 194 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U (p1 U X(p2))))))'
Support contains 6 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 323/323 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 54 transition count 238
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 54 transition count 238
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 55 place count 54 transition count 221
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 65 place count 44 transition count 101
Iterating global reduction 1 with 10 rules applied. Total rules applied 75 place count 44 transition count 101
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 85 place count 44 transition count 91
Applied a total of 85 rules in 2 ms. Remains 44 /73 variables (removed 29) and now considering 91/323 (removed 232) transitions.
// Phase 1: matrix 91 rows 44 cols
[2024-06-01 08:23:16] [INFO ] Computed 13 invariants in 0 ms
[2024-06-01 08:23:16] [INFO ] Implicit Places using invariants in 51 ms returned [0, 11, 14, 17, 23, 32, 35, 38, 41]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 53 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 35/73 places, 91/323 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 18 transition count 74
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 18 transition count 74
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 74 place count 18 transition count 34
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 78 place count 14 transition count 30
Iterating global reduction 1 with 4 rules applied. Total rules applied 82 place count 14 transition count 30
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 83 place count 13 transition count 26
Iterating global reduction 1 with 1 rules applied. Total rules applied 84 place count 13 transition count 26
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 85 place count 13 transition count 25
Applied a total of 85 rules in 1 ms. Remains 13 /35 variables (removed 22) and now considering 25/91 (removed 66) transitions.
// Phase 1: matrix 25 rows 13 cols
[2024-06-01 08:23:16] [INFO ] Computed 4 invariants in 0 ms
[2024-06-01 08:23:16] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-06-01 08:23:16] [INFO ] Invariant cache hit.
[2024-06-01 08:23:16] [INFO ] Implicit Places using invariants and state equation in 38 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 13/73 places, 25/323 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 111 ms. Remains : 13/73 places, 25/323 transitions.
Stuttering acceptance computed with spot in 160 ms :[(NOT p2), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-06
Product exploration explored 100000 steps with 3170 reset in 96 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-100080-LTLFireability-06 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100080-LTLFireability-06 finished in 385 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&(!p1 U (p2||G(!p1)))))))'
Support contains 6 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 323/323 transitions.
Graph (trivial) has 60 edges and 73 vertex of which 31 / 73 are part of one of the 1 SCC in 1 ms
Free SCC test removed 30 places
Ensure Unique test removed 231 transitions
Reduce isomorphic transitions removed 231 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 43 transition count 81
Reduce places removed 11 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 32 transition count 80
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 2 with 26 rules applied. Total rules applied 50 place count 15 transition count 71
Ensure Unique test removed 41 transitions
Reduce isomorphic transitions removed 41 transitions.
Iterating post reduction 2 with 41 rules applied. Total rules applied 91 place count 15 transition count 30
Applied a total of 91 rules in 9 ms. Remains 15 /73 variables (removed 58) and now considering 30/323 (removed 293) transitions.
// Phase 1: matrix 30 rows 15 cols
[2024-06-01 08:23:16] [INFO ] Computed 5 invariants in 0 ms
[2024-06-01 08:23:16] [INFO ] Implicit Places using invariants in 23 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 24 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 14/73 places, 30/323 transitions.
Graph (trivial) has 3 edges and 14 vertex of which 2 / 14 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 10 transition count 25
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 10 transition count 25
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 10 place count 10 transition count 22
Applied a total of 10 rules in 3 ms. Remains 10 /14 variables (removed 4) and now considering 22/30 (removed 8) transitions.
// Phase 1: matrix 22 rows 10 cols
[2024-06-01 08:23:16] [INFO ] Computed 4 invariants in 1 ms
[2024-06-01 08:23:16] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-06-01 08:23:16] [INFO ] Invariant cache hit.
[2024-06-01 08:23:16] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 41 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/73 places, 22/323 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 77 ms. Remains : 10/73 places, 22/323 transitions.
Stuttering acceptance computed with spot in 113 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-07
Product exploration explored 100000 steps with 6474 reset in 102 ms.
Product exploration explored 100000 steps with 6442 reset in 102 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p1))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (OR (NOT p0) (AND (NOT p2) p1))), (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (OR (NOT p0) (AND (NOT p2) p1)))), (X (X (NOT (OR (NOT p0) (AND (NOT p2) p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 719 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 125 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
RANDOM walk for 76 steps (0 resets) in 4 ms. (15 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p0 p2 (NOT p1))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (OR (NOT p0) (AND (NOT p2) p1))), (X (NOT (OR (NOT p0) (AND (NOT p2) p1)))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (OR (NOT p0) (AND (NOT p2) p1)))), (X (X (NOT (OR (NOT p0) (AND (NOT p2) p1))))), (X (X (AND (NOT p2) p1))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p0 (OR (NOT p1) p2)))), (F (NOT (OR (NOT p1) p2))), (F p1), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 1 factoid took 957 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Support contains 6 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 22/22 transitions.
Applied a total of 0 rules in 2 ms. Remains 10 /10 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-06-01 08:23:19] [INFO ] Invariant cache hit.
[2024-06-01 08:23:19] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-06-01 08:23:19] [INFO ] Invariant cache hit.
[2024-06-01 08:23:19] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2024-06-01 08:23:19] [INFO ] Redundant transitions in 0 ms returned []
Running 15 sub problems to find dead transitions.
[2024-06-01 08:23:19] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/10 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 21/31 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/32 variables, and 14 constraints, problems are : Problem set: 0 solved, 15 unsolved in 128 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/10 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 21/31 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 15/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/31 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/32 variables, and 29 constraints, problems are : Problem set: 0 solved, 15 unsolved in 99 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 234ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 234ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 290 ms. Remains : 10/10 places, 22/22 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (OR (NOT p0) (AND p1 (NOT p2)))), (X (NOT (OR (NOT p0) (AND p1 (NOT p2))))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (NOT p0) (AND p1 (NOT p2))))), (X (X (NOT (OR (NOT p0) (AND p1 (NOT p2)))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 868 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
RANDOM walk for 173 steps (0 resets) in 5 ms. (28 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p0 (NOT p1) p2)]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p0 (NOT p1) (NOT p2))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (OR (NOT p0) (AND p1 (NOT p2)))), (X (NOT (OR (NOT p0) (AND p1 (NOT p2))))), (X p0), (X (NOT p0)), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (OR (NOT p0) (AND p1 (NOT p2))))), (X (X (NOT (OR (NOT p0) (AND p1 (NOT p2)))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND p0 (OR (NOT p1) p2)))), (F (NOT (OR (NOT p1) p2))), (F p1), (F (NOT p0)), (F (NOT p2)), (F (NOT (OR (NOT p0) p1 p2))), (F (NOT (OR p1 p2)))]
Knowledge based reduction with 1 factoid took 855 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 145 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Stuttering acceptance computed with spot in 135 ms :[(OR (NOT p0) (AND p1 (NOT p2))), (OR (NOT p0) (AND p1 (NOT p2))), (AND p1 (NOT p2))]
Product exploration explored 100000 steps with 6340 reset in 95 ms.
Product exploration explored 100000 steps with 6424 reset in 98 ms.
Support contains 6 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 22/22 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 22/22 (removed 0) transitions.
[2024-06-01 08:23:22] [INFO ] Invariant cache hit.
[2024-06-01 08:23:22] [INFO ] Implicit Places using invariants in 24 ms returned []
[2024-06-01 08:23:22] [INFO ] Invariant cache hit.
[2024-06-01 08:23:22] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-06-01 08:23:22] [INFO ] Redundant transitions in 1 ms returned []
Running 15 sub problems to find dead transitions.
[2024-06-01 08:23:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/10 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 21/31 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (OVERLAPS) 0/31 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/32 variables, and 14 constraints, problems are : Problem set: 0 solved, 15 unsolved in 106 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (OVERLAPS) 1/10 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (OVERLAPS) 21/31 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 15/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 7 (OVERLAPS) 0/31 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 15 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/32 variables, and 29 constraints, problems are : Problem set: 0 solved, 15 unsolved in 116 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 0/0 constraints]
After SMT, in 229ms problems are : Problem set: 0 solved, 15 unsolved
Search for dead transitions found 0 dead transitions in 230ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 285 ms. Remains : 10/10 places, 22/22 transitions.
Treatment of property ServersAndClients-PT-100080-LTLFireability-07 finished in 5642 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 3 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 323/323 transitions.
Graph (trivial) has 62 edges and 73 vertex of which 32 / 73 are part of one of the 1 SCC in 1 ms
Free SCC test removed 31 places
Ensure Unique test removed 255 transitions
Reduce isomorphic transitions removed 255 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 42 transition count 55
Reduce places removed 13 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 29 transition count 54
Performed 11 Post agglomeration using F-continuation condition.Transition count delta: 11
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 21 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 60 place count 8 transition count 43
Ensure Unique test removed 31 transitions
Reduce isomorphic transitions removed 31 transitions.
Iterating post reduction 2 with 31 rules applied. Total rules applied 91 place count 8 transition count 12
Applied a total of 91 rules in 5 ms. Remains 8 /73 variables (removed 65) and now considering 12/323 (removed 311) transitions.
// Phase 1: matrix 12 rows 8 cols
[2024-06-01 08:23:22] [INFO ] Computed 3 invariants in 0 ms
[2024-06-01 08:23:22] [INFO ] Implicit Places using invariants in 18 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 19 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 7/73 places, 12/323 transitions.
Graph (trivial) has 3 edges and 7 vertex of which 2 / 7 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 2 place count 5 transition count 9
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 5 transition count 9
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 5 transition count 8
Applied a total of 4 rules in 1 ms. Remains 5 /7 variables (removed 2) and now considering 8/12 (removed 4) transitions.
// Phase 1: matrix 8 rows 5 cols
[2024-06-01 08:23:22] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 08:23:22] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-06-01 08:23:22] [INFO ] Invariant cache hit.
[2024-06-01 08:23:22] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 38 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/73 places, 8/323 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 63 ms. Remains : 5/73 places, 8/323 transitions.
Stuttering acceptance computed with spot in 45 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-09
Product exploration explored 100000 steps with 0 reset in 87 ms.
Stack based approach found an accepted trace after 7 steps with 0 reset with depth 8 and stack size 4 in 0 ms.
FORMULA ServersAndClients-PT-100080-LTLFireability-09 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100080-LTLFireability-09 finished in 212 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 323/323 transitions.
Graph (trivial) has 64 edges and 73 vertex of which 33 / 73 are part of one of the 1 SCC in 0 ms
Free SCC test removed 32 places
Ensure Unique test removed 268 transitions
Reduce isomorphic transitions removed 268 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 41 transition count 30
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 62 rules applied. Total rules applied 88 place count 5 transition count 4
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 92 place count 2 transition count 3
Applied a total of 92 rules in 2 ms. Remains 2 /73 variables (removed 71) and now considering 3/323 (removed 320) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-06-01 08:23:22] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 08:23:22] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 08:23:22] [INFO ] Invariant cache hit.
[2024-06-01 08:23:22] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
[2024-06-01 08:23:22] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-06-01 08:23:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 23 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 54ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 54ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/73 places, 3/323 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 107 ms. Remains : 2/73 places, 3/323 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100080-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100080-LTLFireability-11 finished in 159 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((X(p0)&&(p0||F(p1)))))'
Support contains 3 out of 73 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 73/73 places, 323/323 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 54 transition count 227
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 54 transition count 227
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 55 place count 54 transition count 210
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 65 place count 44 transition count 90
Iterating global reduction 1 with 10 rules applied. Total rules applied 75 place count 44 transition count 90
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 85 place count 44 transition count 80
Applied a total of 85 rules in 1 ms. Remains 44 /73 variables (removed 29) and now considering 80/323 (removed 243) transitions.
// Phase 1: matrix 80 rows 44 cols
[2024-06-01 08:23:22] [INFO ] Computed 13 invariants in 1 ms
[2024-06-01 08:23:22] [INFO ] Implicit Places using invariants in 44 ms returned [0, 10, 13, 16, 20, 23, 26, 29, 32, 35, 41]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 45 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 33/73 places, 80/323 transitions.
Discarding 21 places :
Symmetric choice reduction at 0 with 21 rule applications. Total rules 21 place count 12 transition count 59
Iterating global reduction 0 with 21 rules applied. Total rules applied 42 place count 12 transition count 59
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 0 with 40 rules applied. Total rules applied 82 place count 12 transition count 19
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 84 place count 10 transition count 17
Iterating global reduction 1 with 2 rules applied. Total rules applied 86 place count 10 transition count 17
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 87 place count 9 transition count 15
Iterating global reduction 1 with 1 rules applied. Total rules applied 88 place count 9 transition count 15
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 89 place count 9 transition count 14
Applied a total of 89 rules in 1 ms. Remains 9 /33 variables (removed 24) and now considering 14/80 (removed 66) transitions.
// Phase 1: matrix 14 rows 9 cols
[2024-06-01 08:23:22] [INFO ] Computed 2 invariants in 0 ms
[2024-06-01 08:23:22] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-06-01 08:23:22] [INFO ] Invariant cache hit.
[2024-06-01 08:23:22] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 39 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 9/73 places, 14/323 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 86 ms. Remains : 9/73 places, 14/323 transitions.
Stuttering acceptance computed with spot in 235 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-13
Product exploration explored 100000 steps with 3540 reset in 61 ms.
Stack based approach found an accepted trace after 7 steps with 1 reset with depth 5 and stack size 5 in 0 ms.
FORMULA ServersAndClients-PT-100080-LTLFireability-13 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100080-LTLFireability-13 finished in 402 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 323/323 transitions.
Graph (trivial) has 64 edges and 73 vertex of which 33 / 73 are part of one of the 1 SCC in 0 ms
Free SCC test removed 32 places
Ensure Unique test removed 268 transitions
Reduce isomorphic transitions removed 268 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 41 transition count 30
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 62 rules applied. Total rules applied 88 place count 5 transition count 4
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 92 place count 2 transition count 3
Applied a total of 92 rules in 3 ms. Remains 2 /73 variables (removed 71) and now considering 3/323 (removed 320) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-06-01 08:23:23] [INFO ] Computed 1 invariants in 0 ms
[2024-06-01 08:23:23] [INFO ] Implicit Places using invariants in 31 ms returned []
[2024-06-01 08:23:23] [INFO ] Invariant cache hit.
[2024-06-01 08:23:23] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 57 ms to find 0 implicit places.
[2024-06-01 08:23:23] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-06-01 08:23:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 22 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 49ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 49ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/73 places, 3/323 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 128 ms. Remains : 2/73 places, 3/323 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ServersAndClients-PT-100080-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100080-LTLFireability-14 finished in 184 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 73 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 73/73 places, 323/323 transitions.
Graph (trivial) has 64 edges and 73 vertex of which 33 / 73 are part of one of the 1 SCC in 0 ms
Free SCC test removed 32 places
Ensure Unique test removed 268 transitions
Reduce isomorphic transitions removed 268 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 26 place count 41 transition count 30
Reduce places removed 36 places and 0 transitions.
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 62 rules applied. Total rules applied 88 place count 5 transition count 4
Reduce places removed 3 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 92 place count 2 transition count 3
Applied a total of 92 rules in 1 ms. Remains 2 /73 variables (removed 71) and now considering 3/323 (removed 320) transitions.
[2024-06-01 08:23:23] [INFO ] Invariant cache hit.
[2024-06-01 08:23:23] [INFO ] Implicit Places using invariants in 17 ms returned []
[2024-06-01 08:23:23] [INFO ] Invariant cache hit.
[2024-06-01 08:23:23] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
[2024-06-01 08:23:23] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-06-01 08:23:23] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 25 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 53ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 53ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/73 places, 3/323 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 99 ms. Remains : 2/73 places, 3/323 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100080-LTLFireability-15
Product exploration explored 100000 steps with 14373 reset in 42 ms.
Product exploration explored 100000 steps with 14316 reset in 63 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 187 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 194 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 3/3 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2024-06-01 08:23:24] [INFO ] Invariant cache hit.
[2024-06-01 08:23:24] [INFO ] Implicit Places using invariants in 21 ms returned []
[2024-06-01 08:23:24] [INFO ] Invariant cache hit.
[2024-06-01 08:23:24] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-06-01 08:23:24] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-06-01 08:23:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 23 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 52ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 52ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 101 ms. Remains : 2/2 places, 3/3 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 191 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 4 steps (0 resets) in 4 ms. (0 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 214 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 198 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 14169 reset in 38 ms.
Product exploration explored 100000 steps with 14356 reset in 38 ms.
Support contains 1 out of 2 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2/2 places, 3/3 transitions.
Applied a total of 0 rules in 0 ms. Remains 2 /2 variables (removed 0) and now considering 3/3 (removed 0) transitions.
[2024-06-01 08:23:25] [INFO ] Invariant cache hit.
[2024-06-01 08:23:25] [INFO ] Implicit Places using invariants in 27 ms returned []
[2024-06-01 08:23:25] [INFO ] Invariant cache hit.
[2024-06-01 08:23:25] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 54 ms to find 0 implicit places.
[2024-06-01 08:23:25] [INFO ] Redundant transitions in 1 ms returned []
Running 1 sub problems to find dead transitions.
[2024-06-01 08:23:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 0/4 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 4/5 variables, and 3 constraints, problems are : Problem set: 0 solved, 1 unsolved in 18 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 1/2 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/2 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 2/4 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 0/4 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 4/5 variables, and 4 constraints, problems are : Problem set: 0 solved, 1 unsolved in 26 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 2/2 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 47ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 47ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 105 ms. Remains : 2/2 places, 3/3 transitions.
Treatment of property ServersAndClients-PT-100080-LTLFireability-15 finished in 2141 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((G(p1)&&p0))||G(!p1)||(!p1&&F(p2))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0&&(!p1 U (p2||G(!p1)))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-06-01 08:23:26] [INFO ] Flatten gal took : 20 ms
[2024-06-01 08:23:26] [INFO ] Export to MCC of 4 properties in file /home/mcc/execution/LTLFireability.sr.xml took 2 ms.
[2024-06-01 08:23:26] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 73 places, 323 transitions and 903 arcs took 4 ms.
Total runtime 43708 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA ServersAndClients-PT-100080-LTLFireability-00 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ServersAndClients-PT-100080-LTLFireability-02 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ServersAndClients-PT-100080-LTLFireability-07 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA ServersAndClients-PT-100080-LTLFireability-15 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717230206610

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name ServersAndClients-PT-100080-LTLFireability-00
ltl formula formula --ltl=/tmp/1900/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 73 places, 323 transitions and 903 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.030 real 0.000 user 0.020 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1900/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1900/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1900/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1900/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 75 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 74, there are 326 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2
pnml2lts-mc( 0/ 4): unique states count: 62
pnml2lts-mc( 0/ 4): unique transitions count: 324
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 307
pnml2lts-mc( 0/ 4): - claim success count: 86
pnml2lts-mc( 0/ 4): - cum. max stack depth: 21
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 91 states 559 transitions, fanout: 6.143
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 33.9 B/state, compr.: 11.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 326 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name ServersAndClients-PT-100080-LTLFireability-02
ltl formula formula --ltl=/tmp/1900/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 73 places, 323 transitions and 903 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.050 real 0.020 user 0.010 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1900/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1900/ltl_1_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1900/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1900/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 6 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 75 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 74, there are 359 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 3
pnml2lts-mc( 0/ 4): unique states count: 61
pnml2lts-mc( 0/ 4): unique transitions count: 334
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 20
pnml2lts-mc( 0/ 4): - claim found count: 342
pnml2lts-mc( 0/ 4): - claim success count: 94
pnml2lts-mc( 0/ 4): - cum. max stack depth: 33
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 101 states 682 transitions, fanout: 6.752
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 34.8 B/state, compr.: 11.7%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 326 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name ServersAndClients-PT-100080-LTLFireability-07
ltl formula formula --ltl=/tmp/1900/ltl_2_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 73 places, 323 transitions and 903 arcs
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.020 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1900/ltl_2_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1900/ltl_2_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1900/ltl_2_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1900/ltl_2_
pnml2lts-mc( 0/ 4): buchi has 3 states
pnml2lts-mc( 0/ 4): There are 74 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 74, there are 347 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 13
pnml2lts-mc( 0/ 4): unique states count: 73
pnml2lts-mc( 0/ 4): unique transitions count: 347
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 12
pnml2lts-mc( 0/ 4): - claim found count: 318
pnml2lts-mc( 0/ 4): - claim success count: 99
pnml2lts-mc( 0/ 4): - cum. max stack depth: 24
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 106 states 689 transitions, fanout: 6.500
pnml2lts-mc( 0/ 4): Total exploration time 0.000 sec (0.000 sec minimum, 0.000 sec on average)
pnml2lts-mc( 0/ 4): States per second: inf, Transitions per second: inf
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 31.3 B/state, compr.: 10.5%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 326 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)
ltl formula name ServersAndClients-PT-100080-LTLFireability-15
ltl formula formula --ltl=/tmp/1900/ltl_3_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 73 places, 323 transitions and 903 arcs
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1900/ltl_3_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1900/ltl_3_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1900/ltl_3_
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.010 user 0.010 sys
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1900/ltl_3_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 75 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 74, there are 328 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Empty product with LTL!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 2
pnml2lts-mc( 0/ 4): unique states count: 62
pnml2lts-mc( 0/ 4): unique transitions count: 324
pnml2lts-mc( 0/ 4): - self-loop count: 0
pnml2lts-mc( 0/ 4): - claim dead count: 0
pnml2lts-mc( 0/ 4): - claim found count: 306
pnml2lts-mc( 0/ 4): - claim success count: 84
pnml2lts-mc( 0/ 4): - cum. max stack depth: 21
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 89 states 536 transitions, fanout: 6.022
pnml2lts-mc( 0/ 4): Total exploration time 0.010 sec (0.010 sec minimum, 0.010 sec on average)
pnml2lts-mc( 0/ 4): States per second: 8900, Transitions per second: 53600
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 0.0MB, 33.9 B/state, compr.: 11.4%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 0.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 326 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 0.0MB (~256.0MB paged-in)

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-100080"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="ltsminxred"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool ltsminxred"
echo " Input is ServersAndClients-PT-100080, 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 r524-tall-171679080700628"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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