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.r333-tall-171679078900627.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 greatspnxred
Input is ServersAndClients-PT-100080, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r333-tall-171679078900627
=====================================================================

--------------------
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-LTLCardinality-00
FORMULA_NAME ServersAndClients-PT-100080-LTLCardinality-01
FORMULA_NAME ServersAndClients-PT-100080-LTLCardinality-02
FORMULA_NAME ServersAndClients-PT-100080-LTLCardinality-03
FORMULA_NAME ServersAndClients-PT-100080-LTLCardinality-04
FORMULA_NAME ServersAndClients-PT-100080-LTLCardinality-05
FORMULA_NAME ServersAndClients-PT-100080-LTLCardinality-06
FORMULA_NAME ServersAndClients-PT-100080-LTLCardinality-07
FORMULA_NAME ServersAndClients-PT-100080-LTLCardinality-08
FORMULA_NAME ServersAndClients-PT-100080-LTLCardinality-09
FORMULA_NAME ServersAndClients-PT-100080-LTLCardinality-10
FORMULA_NAME ServersAndClients-PT-100080-LTLCardinality-11
FORMULA_NAME ServersAndClients-PT-100080-LTLCardinality-12
FORMULA_NAME ServersAndClients-PT-100080-LTLCardinality-13
FORMULA_NAME ServersAndClients-PT-100080-LTLCardinality-14
FORMULA_NAME ServersAndClients-PT-100080-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1716880134138

Invoking MCC driver with
BK_TOOL=greatspnxred
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ServersAndClients-PT-100080
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool greatspn
Invoking reducer
Running Version 202405141337
[2024-05-28 07:08:55] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -timeout, 360, -rebuildPNML]
[2024-05-28 07:08:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-28 07:08:55] [INFO ] Load time of PNML (sax parser for PT used): 469 ms
[2024-05-28 07:08:55] [INFO ] Transformed 8481 places.
[2024-05-28 07:08:55] [INFO ] Transformed 16200 transitions.
[2024-05-28 07:08:55] [INFO ] Found NUPN structural information;
[2024-05-28 07:08:56] [INFO ] Parsed PT model containing 8481 places and 16200 transitions and 48800 arcs in 654 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Initial state reduction rules removed 1 formulas.
FORMULA ServersAndClients-PT-100080-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100080-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100080-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100080-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100080-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100080-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100080-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100080-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ServersAndClients-PT-100080-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 19 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 2076 ms. Remains 8481 /8481 variables (removed 0) and now considering 16200/16200 (removed 0) transitions.
// Phase 1: matrix 16200 rows 8481 cols
[2024-05-28 07:08:58] [INFO ] Computed 281 invariants in 260 ms
[2024-05-28 07:09:20] [INFO ] Implicit Places using invariants in 22360 ms returned [0, 1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15, 16, 17, 18, 19, 20, 21, 22, 23, 24, 25, 26, 27, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49, 50, 51, 52, 53, 54, 55, 56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66, 67, 68, 69, 70, 71, 72, 73, 74, 75, 76, 77, 78, 79, 80, 81, 82, 83, 84, 85, 86, 87, 88, 89, 90, 91, 92, 93, 94, 95, 96, 97, 98, 99, 100, 101, 102, 103, 104, 105, 106, 107, 108, 109, 110, 111, 112, 113, 114, 115, 116, 117, 118, 119, 120, 121, 122, 123, 124, 125, 126, 127, 128, 129, 130, 131, 132, 133, 134, 135, 136, 137, 138, 139, 140, 141, 142, 143, 144, 145, 146, 147, 148, 149, 150, 151, 152, 153, 154, 155, 156, 157, 158, 159, 160, 161, 162, 163, 164, 165, 166, 167, 168, 169, 170, 171, 172, 173, 174, 175, 176, 177, 178, 179, 180, 181, 182, 183, 184, 185, 186, 187, 188, 189, 190, 191, 192, 193, 194, 195, 196, 197, 198, 199, 401, 502, 603, 704, 805, 906, 1007, 1108, 1209, 1310, 1411, 1512, 1613, 1714, 1815, 1916, 2017, 2118, 2219, 2320, 2421, 2522, 2623, 2724, 2825, 2926, 3027, 3128, 3229, 3330, 3431, 3532, 3633, 3734, 3835, 3936, 4037, 4138, 4239, 4340, 4441, 4542, 4643, 4744, 4845, 4946, 5047, 5148, 5249, 5350, 5451, 5552, 5653, 5754, 5855, 5956, 6057, 6158, 6259, 6360, 6461, 6562, 6663, 6764, 6865, 6966, 7067, 7168, 7269, 7370, 7471, 7572, 7673, 7774, 7875, 7976, 8077, 8178, 8279, 8380]
Discarding 280 places :
Implicit Place search using SMT only with invariants took 22433 ms to find 280 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 8201/8481 places, 16200/16200 transitions.
Discarding 7981 places :
Symmetric choice reduction at 0 with 7981 rule applications. Total rules 7981 place count 220 transition count 8219
Iterating global reduction 0 with 7981 rules applied. Total rules applied 15962 place count 220 transition count 8219
Ensure Unique test removed 7883 transitions
Reduce isomorphic transitions removed 7883 transitions.
Iterating post reduction 0 with 7883 rules applied. Total rules applied 23845 place count 220 transition count 336
Discarding 98 places :
Symmetric choice reduction at 1 with 98 rule applications. Total rules 23943 place count 122 transition count 238
Iterating global reduction 1 with 98 rules applied. Total rules applied 24041 place count 122 transition count 238
Discarding 82 places :
Symmetric choice reduction at 1 with 82 rule applications. Total rules 24123 place count 40 transition count 156
Iterating global reduction 1 with 82 rules applied. Total rules applied 24205 place count 40 transition count 156
Ensure Unique test removed 82 transitions
Reduce isomorphic transitions removed 82 transitions.
Iterating post reduction 1 with 82 rules applied. Total rules applied 24287 place count 40 transition count 74
Applied a total of 24287 rules in 460 ms. Remains 40 /8201 variables (removed 8161) and now considering 74/16200 (removed 16126) transitions.
// Phase 1: matrix 74 rows 40 cols
[2024-05-28 07:09:21] [INFO ] Computed 1 invariants in 1 ms
[2024-05-28 07:09:21] [INFO ] Implicit Places using invariants in 60 ms returned []
[2024-05-28 07:09:21] [INFO ] Invariant cache hit.
[2024-05-28 07:09:21] [INFO ] Implicit Places using invariants and state equation in 86 ms returned []
Implicit Place search using SMT with State Equation took 150 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 40/8481 places, 74/16200 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 25141 ms. Remains : 40/8481 places, 74/16200 transitions.
Support contains 19 out of 40 places after structural reductions.
[2024-05-28 07:09:21] [INFO ] Flatten gal took : 20 ms
[2024-05-28 07:09:21] [INFO ] Flatten gal took : 8 ms
[2024-05-28 07:09:21] [INFO ] Input system was already deterministic with 74 transitions.
RANDOM walk for 1392 steps (0 resets) in 96 ms. (14 steps per ms) remains 0/12 properties
FORMULA ServersAndClients-PT-100080-LTLCardinality-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(F(p1))))'
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 74/74 transitions.
Graph (trivial) has 72 edges and 40 vertex of which 39 / 40 are part of one of the 1 SCC in 2 ms
Free SCC test removed 38 places
Ensure Unique test removed 71 transitions
Reduce isomorphic transitions removed 71 transitions.
Applied a total of 1 rules in 13 ms. Remains 2 /40 variables (removed 38) and now considering 3/74 (removed 71) transitions.
// Phase 1: matrix 3 rows 2 cols
[2024-05-28 07:09:21] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 07:09:21] [INFO ] Implicit Places using invariants in 25 ms returned []
[2024-05-28 07:09:21] [INFO ] Invariant cache hit.
[2024-05-28 07:09:22] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
[2024-05-28 07:09:22] [INFO ] Redundant transitions in 0 ms returned []
Running 1 sub problems to find dead transitions.
[2024-05-28 07:09: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 62 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 48 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 132ms problems are : Problem set: 0 solved, 1 unsolved
Search for dead transitions found 0 dead transitions in 147ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2/40 places, 3/74 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 216 ms. Remains : 2/40 places, 3/74 transitions.
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-100080-LTLCardinality-00
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 2 ms.
FORMULA ServersAndClients-PT-100080-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100080-LTLCardinality-00 finished in 491 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(F(p0))||G(p1))))'
Support contains 4 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 74/74 transitions.
Graph (trivial) has 66 edges and 40 vertex of which 34 / 40 are part of one of the 1 SCC in 0 ms
Free SCC test removed 33 places
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 7 transition count 10
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 6 transition count 10
Applied a total of 3 rules in 11 ms. Remains 6 /40 variables (removed 34) and now considering 10/74 (removed 64) transitions.
// Phase 1: matrix 10 rows 6 cols
[2024-05-28 07:09:22] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 07:09:22] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-28 07:09:22] [INFO ] Invariant cache hit.
[2024-05-28 07:09:22] [INFO ] Implicit Places using invariants and state equation in 22 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-28 07:09:22] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2024-05-28 07:09:22] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/16 variables, and 7 constraints, problems are : Problem set: 0 solved, 5 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/16 variables, and 12 constraints, problems are : Problem set: 0 solved, 5 unsolved in 140 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 203ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 204ms
Starting structural reductions in SI_LTL mode, iteration 1 : 6/40 places, 10/74 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 264 ms. Remains : 6/40 places, 10/74 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ServersAndClients-PT-100080-LTLCardinality-02
Product exploration explored 100000 steps with 4757 reset in 237 ms.
Product exploration explored 100000 steps with 4827 reset in 202 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 298 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (8 resets) in 538 ms. (74 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 171 ms. (232 steps per ms) remains 1/1 properties
[2024-05-28 07:09:23] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem apf0 is UNSAT
After SMT solving in domain Real declared 6/16 variables, and 1 constraints, problems are : Problem set: 1 solved, 0 unsolved in 32 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 0/6 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints]
After SMT, in 34ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (G (OR (NOT p1) p0))]
False Knowledge obtained : [(X p1), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT p0)), (F (NOT (OR p1 p0)))]
Knowledge based reduction with 6 factoid took 390 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 6 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 10/10 transitions.
Applied a total of 0 rules in 3 ms. Remains 6 /6 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2024-05-28 07:09:24] [INFO ] Invariant cache hit.
[2024-05-28 07:09:24] [INFO ] Implicit Places using invariants in 18 ms returned []
[2024-05-28 07:09:24] [INFO ] Invariant cache hit.
[2024-05-28 07:09:24] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
[2024-05-28 07:09:24] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2024-05-28 07:09:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/15 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 15/16 variables, and 7 constraints, problems are : Problem set: 0 solved, 5 unsolved in 55 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 1/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 9/15 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/15 variables, 5/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/15 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 0/15 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 15/16 variables, and 12 constraints, problems are : Problem set: 0 solved, 5 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
After SMT, in 97ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 98ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 153 ms. Remains : 6/6 places, 10/10 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 125 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 60 steps (0 resets) in 4 ms. (12 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 171 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4733 reset in 97 ms.
Product exploration explored 100000 steps with 4697 reset in 96 ms.
Support contains 2 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 10/10 transitions.
Graph (trivial) has 6 edges and 6 vertex of which 3 / 6 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Applied a total of 1 rules in 1 ms. Remains 4 /6 variables (removed 2) and now considering 6/10 (removed 4) transitions.
// Phase 1: matrix 6 rows 4 cols
[2024-05-28 07:09:25] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 07:09:25] [INFO ] Implicit Places using invariants in 20 ms returned []
[2024-05-28 07:09:25] [INFO ] Invariant cache hit.
[2024-05-28 07:09:25] [INFO ] Implicit Places using invariants and state equation in 17 ms returned []
Implicit Place search using SMT with State Equation took 50 ms to find 0 implicit places.
[2024-05-28 07:09:25] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-28 07:09:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 5/9 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/9 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 9/10 variables, and 5 constraints, problems are : Problem set: 0 solved, 3 unsolved in 36 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 5/9 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/9 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/9 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/9 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 9/10 variables, and 8 constraints, problems are : Problem set: 0 solved, 3 unsolved in 34 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 73ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 74ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/6 places, 6/10 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 129 ms. Remains : 4/6 places, 6/10 transitions.
Treatment of property ServersAndClients-PT-100080-LTLCardinality-02 finished in 3133 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 3 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 74/74 transitions.
Graph (trivial) has 68 edges and 40 vertex of which 37 / 40 are part of one of the 1 SCC in 0 ms
Free SCC test removed 36 places
Ensure Unique test removed 67 transitions
Reduce isomorphic transitions removed 67 transitions.
Applied a total of 1 rules in 2 ms. Remains 4 /40 variables (removed 36) and now considering 7/74 (removed 67) transitions.
// Phase 1: matrix 7 rows 4 cols
[2024-05-28 07:09:25] [INFO ] Computed 1 invariants in 1 ms
[2024-05-28 07:09:25] [INFO ] Implicit Places using invariants in 19 ms returned []
[2024-05-28 07:09:25] [INFO ] Invariant cache hit.
[2024-05-28 07:09:25] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2024-05-28 07:09:25] [INFO ] Redundant transitions in 0 ms returned []
Running 3 sub problems to find dead transitions.
[2024-05-28 07:09:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/10 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 0/10 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 10/11 variables, and 5 constraints, problems are : Problem set: 0 solved, 3 unsolved in 28 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 1/4 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/4 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 6/10 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/10 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/10 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/10 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 10/11 variables, and 8 constraints, problems are : Problem set: 0 solved, 3 unsolved in 30 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
After SMT, in 61ms problems are : Problem set: 0 solved, 3 unsolved
Search for dead transitions found 0 dead transitions in 61ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/40 places, 7/74 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 111 ms. Remains : 4/40 places, 7/74 transitions.
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100080-LTLCardinality-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100080-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100080-LTLCardinality-04 finished in 203 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(p0)))'
Support contains 1 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 74/74 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 22 transition count 56
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 22 transition count 56
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 22 transition count 39
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 68 place count 7 transition count 24
Iterating global reduction 1 with 15 rules applied. Total rules applied 83 place count 7 transition count 24
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 97 place count 7 transition count 10
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 98 place count 6 transition count 9
Iterating global reduction 2 with 1 rules applied. Total rules applied 99 place count 6 transition count 9
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 100 place count 6 transition count 8
Applied a total of 100 rules in 3 ms. Remains 6 /40 variables (removed 34) and now considering 8/74 (removed 66) transitions.
// Phase 1: matrix 8 rows 6 cols
[2024-05-28 07:09:25] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 07:09:25] [INFO ] Implicit Places using invariants in 15 ms returned []
[2024-05-28 07:09:25] [INFO ] Invariant cache hit.
[2024-05-28 07:09:25] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 40 ms to find 0 implicit places.
Running 6 sub problems to find dead transitions.
[2024-05-28 07:09:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/14 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 0/14 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 7 constraints, problems are : Problem set: 0 solved, 6 unsolved in 40 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 1/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 8/14 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/14 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 13 constraints, problems are : Problem set: 0 solved, 6 unsolved in 48 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
After SMT, in 91ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 91ms
Starting structural reductions in LTL mode, iteration 1 : 6/40 places, 8/74 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 134 ms. Remains : 6/40 places, 8/74 transitions.
Stuttering acceptance computed with spot in 74 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ServersAndClients-PT-100080-LTLCardinality-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ServersAndClients-PT-100080-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ServersAndClients-PT-100080-LTLCardinality-10 finished in 219 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((F((F(p0)&&p0))&&p1))&&(X(X(p2)) U X(p1))))'
Support contains 6 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 74/74 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 27 transition count 61
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 27 transition count 61
Ensure Unique test removed 12 transitions
Reduce isomorphic transitions removed 12 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 38 place count 27 transition count 49
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 49 place count 16 transition count 38
Iterating global reduction 1 with 11 rules applied. Total rules applied 60 place count 16 transition count 38
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 70 place count 16 transition count 28
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 71 place count 15 transition count 27
Iterating global reduction 2 with 1 rules applied. Total rules applied 72 place count 15 transition count 27
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 73 place count 15 transition count 26
Applied a total of 73 rules in 2 ms. Remains 15 /40 variables (removed 25) and now considering 26/74 (removed 48) transitions.
// Phase 1: matrix 26 rows 15 cols
[2024-05-28 07:09:25] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 07:09:25] [INFO ] Implicit Places using invariants in 16 ms returned []
[2024-05-28 07:09:25] [INFO ] Invariant cache hit.
[2024-05-28 07:09:26] [INFO ] Implicit Places using invariants and state equation in 25 ms returned []
Implicit Place search using SMT with State Equation took 43 ms to find 0 implicit places.
Running 19 sub problems to find dead transitions.
[2024-05-28 07:09:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 1/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 26/41 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (OVERLAPS) 0/41 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Real declared 41/41 variables, and 16 constraints, problems are : Problem set: 0 solved, 19 unsolved in 246 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 19 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/14 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 1 (OVERLAPS) 1/15 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 3 (OVERLAPS) 26/41 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 19/35 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 19 unsolved
At refinement iteration 6 (OVERLAPS) 0/41 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 19 unsolved
No progress, stopping.
After SMT solving in domain Int declared 41/41 variables, and 35 constraints, problems are : Problem set: 0 solved, 19 unsolved in 137 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 15/15 constraints, PredecessorRefiner: 19/19 constraints, Known Traps: 0/0 constraints]
After SMT, in 390ms problems are : Problem set: 0 solved, 19 unsolved
Search for dead transitions found 0 dead transitions in 391ms
Starting structural reductions in LTL mode, iteration 1 : 15/40 places, 26/74 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 437 ms. Remains : 15/40 places, 26/74 transitions.
Stuttering acceptance computed with spot in 241 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p1), (NOT p0), (OR (NOT p2) (NOT p1)), true]
Running random walk in product with property : ServersAndClients-PT-100080-LTLCardinality-12
Product exploration explored 100000 steps with 50000 reset in 114 ms.
Product exploration explored 100000 steps with 50000 reset in 94 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0 p2), (X p1), (X (NOT (AND p1 (NOT p0)))), (X p0)]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 16 ms. Reduced automaton from 6 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ServersAndClients-PT-100080-LTLCardinality-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ServersAndClients-PT-100080-LTLCardinality-12 finished in 918 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(X(F((G(p0)&&X(p1))))))'
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 74/74 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 23 transition count 57
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 23 transition count 57
Ensure Unique test removed 16 transitions
Reduce isomorphic transitions removed 16 transitions.
Iterating post reduction 0 with 16 rules applied. Total rules applied 50 place count 23 transition count 41
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 64 place count 9 transition count 27
Iterating global reduction 1 with 14 rules applied. Total rules applied 78 place count 9 transition count 27
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 91 place count 9 transition count 14
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 92 place count 8 transition count 13
Iterating global reduction 2 with 1 rules applied. Total rules applied 93 place count 8 transition count 13
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 94 place count 8 transition count 12
Applied a total of 94 rules in 2 ms. Remains 8 /40 variables (removed 32) and now considering 12/74 (removed 62) transitions.
// Phase 1: matrix 12 rows 8 cols
[2024-05-28 07:09:26] [INFO ] Computed 1 invariants in 0 ms
[2024-05-28 07:09:26] [INFO ] Implicit Places using invariants in 14 ms returned []
[2024-05-28 07:09:26] [INFO ] Invariant cache hit.
[2024-05-28 07:09:26] [INFO ] Implicit Places using invariants and state equation in 19 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2024-05-28 07:09:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/20 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 0/20 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 9 constraints, problems are : Problem set: 0 solved, 9 unsolved in 51 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1/8 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 12/20 variables, 8/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/20 variables, 9/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 0/20 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 18 constraints, problems are : Problem set: 0 solved, 9 unsolved in 65 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints]
After SMT, in 134ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 134ms
Starting structural reductions in LTL mode, iteration 1 : 8/40 places, 12/74 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 182 ms. Remains : 8/40 places, 12/74 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ServersAndClients-PT-100080-LTLCardinality-15
Product exploration explored 100000 steps with 1994 reset in 65 ms.
Stack based approach found an accepted trace after 6 steps with 0 reset with depth 7 and stack size 7 in 0 ms.
FORMULA ServersAndClients-PT-100080-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property ServersAndClients-PT-100080-LTLCardinality-15 finished in 465 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(F(p0))||G(p1))))'
[2024-05-28 07:09:27] [INFO ] Flatten gal took : 12 ms
[2024-05-28 07:09:27] [INFO ] Export to MCC of 1 properties in file /home/mcc/execution/LTLCardinality.sr.xml took 2 ms.
[2024-05-28 07:09:27] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 40 places, 74 transitions and 148 arcs took 2 ms.
Total runtime 32253 ms.
There are residual formulas that ITS could not solve within timeout
----------------------------------------------------------------------
GreatSPN-meddly tool, MCC 2023
----------------------------------------------------------------------

Running ServersAndClients-PT-100080

IS_COLORED=
IS_NUPN=

LOADING PETRI NET FILE /home/mcc/execution/410/model.pnml (PNML) ...
PNML VERSION 2009, P/T NET.
COLOR CLASSES: 0
CONSTANTS: 0
PLACES: 40
TRANSITIONS: 74
COLOR VARS: 0
MEASURES: 0
LOADING TIME: [User 0.001s, Sys 0.000s]


SAVING FILE /home/mcc/execution/410/model (.net / .def) ...
EXPORT TIME: [User 0.000s, Sys 0.000s]


----------------------------------------------------------------------
GreatSPN/Meddly.
Copyright (C) 1987-2022, University of Torino, Italy.
website: https://github.com/greatspn/SOURCES

Based on MEDDLY version 0.16.0
Copyright (C) 2009, Iowa State University Research Foundation, Inc.
website: http://meddly.sourceforge.net

Process ID: 914
MODEL NAME: /home/mcc/execution/410/model
40 places, 74 transitions.

Creating all event NSFs..
Creating all event NSFs..
Creating all event NSFs..
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Split: SplitSubtract
Start RS construction.
Building monolithic NSF...
FORMULA ServersAndClients-PT-100080-LTLCardinality-02 TRUE TECHNIQUES DECISION_DIAGRAMS PARALLEL_PROCESSING UNFOLDING_TO_PT USE_NUPN TOPOLOGICAL
Ok.
EXITCODE: 0
----------------------------------------------------------------------

BK_STOP 1716880168105

--------------------
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 LTLCardinality -timeout 360 -rebuildPNML

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="LTLCardinality"
export BK_TOOL="greatspnxred"
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 greatspnxred"
echo " Input is ServersAndClients-PT-100080, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r333-tall-171679078900627"
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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;